Journal Article10.1103/physrevlett.131.120603
High-Threshold Quantum Computing by Fusing One-Dimensional Cluster States
Stefano Paesani,Benjamin J. Brown +1 more
TL;DR: High-threshold quantum computing by fusing one-dimensional cluster states achieves high thresholds with basic resources.
read more
Abstract: We propose a measurement-based model for fault-tolerant quantum computation that can be realized with one-dimensional cluster states and fusion measurements only; basic resources that are readily available with scalable photonic hardware. Our simulations demonstrate high thresholds compared with other measurement-based models realized with basic entangled resources and 2-qubit fusion measurements. Its high tolerance to noise indicates that our practical construction offers a promising route to scalable quantum computing with quantum emitters and linear-optical elements.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
FIG. 2. Correlation surfaces in the foliated Floquet color code. (a) Shows the orientation of correlation surfaces that lie orthogonal to a canonical spatial direction and the temporal direction in green and blue, respectively. We show the microscopic details of these operators in (b) and (c), respectively, with timelike axes t marked with arrows. 
FIG. 1. Realizing the foliated Floquet color code with linear cluster states and fusion measurements. (a) The resource state R we construct is illustrated by the graph. Detectors S ∈ S ¼ R ∩ M are the product of Pauli-X terms at the boundaries of local cells. The vertical timelike axis is labeled t, which indexes layers of the three-dimensional structure. (b) The resource state can be composed of one-dimensional cluster states, or “chains”, as in (c), shown by thick solid lines, and fusion measurements, marked by wavy red lines. The qubits of each chain are indexed with label τ. We can make variations of our construction with different input resources. We identify the qubits of the chain in (c) with those in (d)–(f) with their numerical indices. We obtain branched chains (d), up to local Clifford operations, by measuring white qubits of (c) in the Pauli-X basis. We can also produce long chains from small resource states by fusing the first and last qubit of linear chains of length l ¼ 4, for example, (e). We can also fuse the end points of short branched chains (f), where we show a short branch of l ¼ 8 qubits. ![FIG. 3. Fault-tolerant regions for fusion-based constructions. Solid lines show thresholds when constructing the FFCC lattice by fusing branched chains with length l ∈ f4; 8; 14g and for the limit l → ∞ where the length is much longer than the lattice unit cell size. For comparison, we also show the performance of the constructions from Ref. [12] using hexagonal and 4-qubit starshaped resource states by the dashed and dotted black lines, respectively.](/figures/figure3-1-7o8t6wfryzuz.png)
FIG. 3. Fault-tolerant regions for fusion-based constructions. Solid lines show thresholds when constructing the FFCC lattice by fusing branched chains with length l ∈ f4; 8; 14g and for the limit l → ∞ where the length is much longer than the lattice unit cell size. For comparison, we also show the performance of the constructions from Ref. [12] using hexagonal and 4-qubit starshaped resource states by the dashed and dotted black lines, respectively.
![FIG. 3. Fault-tolerant regions for fusion-based constructions. Solid lines show thresholds when constructing the FFCC lattice by fusing branched chains with length l ∈ f4; 8; 14g and for the limit l → ∞ where the length is much longer than the lattice unit cell size. For comparison, we also show the performance of the constructions from Ref. [12] using hexagonal and 4-qubit starshaped resource states by the dashed and dotted black lines, respectively.](/figures/figure3-1-7o8t6wfryzuz.webp)
Citations
A versatile single-photon-based quantum computing platform
Nicolas Maring,Andreas Fyrillas,M. Pont,Edouard Ivanov,Petr Stepanov,Nico Margaria,W. Hease,Anton Pishchagin,Aristide Lemaître,Isabelle Sagnes,Thi Huong Au,S. Boissier,Eric Bertasi,Aur'elien Baert,Mario Valdivia,Marie Billard,Ozan Acar,Alexandre Brieussel,Rawad Mezher,S. C. Wein,Alexia Salavrakos,Patrick Sinnott,D. Fioretto,Pierre-Emmanuel Emeriau,N. Belabas,Shane Mansfield,Pascale Senellart,J Senellart,N. Somaschi +28 more
TL;DR: Researchers develop a cloud-accessible, versatile quantum computing platform using single photons, achieving high-fidelity gate-based computations and demonstrating photon-native computation, entanglement generation, and a variational quantum eigensolver with chemical accuracy.
43
High-Photon-Loss Threshold Quantum Computing Using GHZ-State Measurements
Brendan Pankovich,Angus Kan,Kwok Ho Wan,Maike Ostmann,Alex Neville,S. Omkar,Adel Sohbi,Kamil Brádler +7 more
TL;DR: Researchers propose fault-tolerant quantum computing architectures using GHZ-state measurements, encoded to suppress photon loss and probabilistic errors in linear optics, achieving high single-photon-loss thresholds and a resource-efficient path to photonic fault-tolerant computing.
Quantum computation from dynamic automorphism codes
Margarita Davydova,Nathanan Tantivasadakarn,Shankar Balasubramanian,David Aasen +3 more
TL;DR: Researchers propose dynamic automorphism codes for quantum computation, enabling error correction and logical gate application through low-weight measurement sequences, and demonstrate the DA color code's ability to encode and implement the logical Clifford group.
8
Topological error correcting processes from fixed-point path integrals
TL;DR: Topological error correcting codes can be analyzed and constructed using fixed-point path integrals, which describe the underlying topological order.
Loss-tolerant architecture for quantum computing with quantum emitters
TL;DR: Loss-tolerant architecture for quantum computing with quantum emitters improves photon loss tolerance by exploring various geometrical constructions for fusing entangled photons.
References
A one-way quantum computer.
TL;DR: A scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states, which are thus one-way quantum computers and the measurements form the program.
4.6K
Surface codes: Towards practical large-scale quantum computation
TL;DR: The concept of the stabilizer, using two qubits, is introduced, and the single-qubit Hadamard, S and T operators are described, completing the set of required gates for a universal quantum computer.
Measurement-based quantum computation on cluster states
TL;DR: This work gives a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states, and proves its universality.
1.9K
Topological quantum memory
TL;DR: In this article, the authors studied the topological quantum error-correcting surface codes (surface codes) introduced by Kitaev, where qubits are arranged in a two-dimensional array on a surface of nontrivial topology.
Topological quantum distillation.
TL;DR: These codes implement the whole Clifford group of unitary operations in a fully topological manner and without selective addressing of qubits, which allows them to extend their application also to quantum teleportation, dense coding, and computation with magic states.