1
|
Bravyi S, Cross AW, Gambetta JM, Maslov D, Rall P, Yoder TJ. High-threshold and low-overhead fault-tolerant quantum memory. Nature 2024; 627:778-782. [PMID: 38538939 PMCID: PMC10972743 DOI: 10.1038/s41586-024-07107-7] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Key Words] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/25/2023] [Accepted: 01/23/2024] [Indexed: 04/01/2024]
Abstract
The accumulation of physical errors1-3 prevents the execution of large-scale algorithms in current quantum computers. Quantum error correction4 promises a solution by encoding k logical qubits onto a larger number n of physical qubits, such that the physical errors are suppressed enough to allow running a desired computation with tolerable fidelity. Quantum error correction becomes practically realizable once the physical error rate is below a threshold value that depends on the choice of quantum code, syndrome measurement circuit and decoding algorithm5. We present an end-to-end quantum error correction protocol that implements fault-tolerant memory on the basis of a family of low-density parity-check codes6. Our approach achieves an error threshold of 0.7% for the standard circuit-based noise model, on par with the surface code7-10 that for 20 years was the leading code in terms of error threshold. The syndrome measurement cycle for a length-n code in our family requires n ancillary qubits and a depth-8 circuit with CNOT gates, qubit initializations and measurements. The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs. In particular, we show that 12 logical qubits can be preserved for nearly 1 million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of 0.1%, whereas the surface code would require nearly 3,000 physical qubits to achieve said performance. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.
Collapse
Affiliation(s)
- Sergey Bravyi
- IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, NY, USA
| | - Andrew W Cross
- IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, NY, USA
| | - Jay M Gambetta
- IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, NY, USA
| | - Dmitri Maslov
- IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, NY, USA.
| | - Patrick Rall
- IBM Quantum, MIT-IBM Watson AI Laboratory, Cambridge, MA, USA
| | - Theodore J Yoder
- IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, NY, USA
| |
Collapse
|
2
|
Bravyi S, Maslov D, Nam Y. Constant-Cost Implementations of Clifford Operations and Multiply-Controlled Gates Using Global Interactions. Phys Rev Lett 2022; 129:230501. [PMID: 36563200 DOI: 10.1103/physrevlett.129.230501] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 08/19/2022] [Accepted: 11/07/2022] [Indexed: 06/17/2023]
Abstract
We consider quantum circuits composed of single-qubit operations and global entangling gates generated by Ising-type Hamiltonians. It is shown that such circuits can implement a large class of unitary operators commonly used in quantum algorithms at a very low cost-using a constant or effectively constant number of global entangling gates. Specifically, we report constant-cost implementations of Clifford operations with and without ancillae, constant-cost implementation of the multiply-controlled gates with linearly many ancillae, and an O(log^{*}(n)) cost implementation of the n-controlled single-target gates using logarithmically many ancillae. This shows a significant asymptotic advantage of circuits enabled by the global entangling gates.
Collapse
Affiliation(s)
- Sergey Bravyi
- IBM Quantum, IBM T. J. Watson Research Center, Yorktown Heights, New York 10598, USA
| | - Dmitri Maslov
- IBM Quantum, IBM T. J. Watson Research Center, Yorktown Heights, New York 10598, USA
| | - Yunseong Nam
- Department of Physics, University of Maryland, College Park, Maryland 20742, USA
| |
Collapse
|
3
|
Bravyi S, Gosset D, Liu Y. How to Simulate Quantum Measurement without Computing Marginals. Phys Rev Lett 2022; 128:220503. [PMID: 35714245 DOI: 10.1103/physrevlett.128.220503] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 01/08/2022] [Accepted: 05/09/2022] [Indexed: 06/15/2023]
Abstract
We describe and analyze algorithms for classically simulating measurement of an n-qubit quantum state in the standard basis, that is, sampling a bit string from the probability distribution determined by the Born rule. Our algorithms reduce the sampling task to computing poly(n) amplitudes of n-qubit states; unlike previously known techniques they do not require computation of marginal probabilities. Two classes of quantum states are considered: output states of polynomial-size quantum circuits, and ground states of local Hamiltonians with an inverse polynomial spectral gap. We show that our algorithms can significantly accelerate quantum circuit simulations based on tensor network contraction or low-rank stabilizer decompositions. As another striking consequence we obtain the first efficient classical simulation algorithm for measurement-based quantum computation with the surface code resource state on any planar graph and any schedule of measurements.
Collapse
Affiliation(s)
- Sergey Bravyi
- IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, New York 10598, USA
| | - David Gosset
- Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON N2L 3G1, Canada
- Institute for Quantum Computing, University of Waterloo, Waterloo, ON N2L 3G1, Canada
- Perimeter Institute for Theoretical Physics, Waterloo, ON N2L 2Y5, Canada
| | - Yinchen Liu
- Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON N2L 3G1, Canada
- Institute for Quantum Computing, University of Waterloo, Waterloo, ON N2L 3G1, Canada
| |
Collapse
|
4
|
Piveteau C, Sutter D, Bravyi S, Gambetta JM, Temme K. Error Mitigation for Universal Gates on Encoded Qubits. Phys Rev Lett 2021; 127:200505. [PMID: 34860063 DOI: 10.1103/physrevlett.127.200505] [Citation(s) in RCA: 9] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 03/17/2021] [Accepted: 09/21/2021] [Indexed: 06/13/2023]
Abstract
The Eastin-Knill theorem states that no quantum error-correcting code can have a universal set of transversal gates. For Calderbank-Shor-Steane codes that can implement Clifford gates transversally, it suffices to provide one additional non-Clifford gate, such as the T gate, to achieve universality. Common methods to implement fault-tolerant T gates, e.g., magic state distillation, generate a significant hardware overhead that will likely prevent their practical usage in the near-term future. Recently, methods have been developed to mitigate the effect of noise in shallow quantum circuits that are not protected by error correction. Error mitigation methods require no additional hardware resources but suffer from a bad asymptotic scaling and apply only to a restricted class of quantum algorithms. In this Letter, we combine both approaches and show how to implement encoded Clifford+T circuits where Clifford gates are protected from noise by error correction while errors introduced by noisy encoded T gates are mitigated using the quasiprobability method. As a result, Clifford+T circuits with a number of T gates inversely proportional to the physical noise rate can be implemented on small error-corrected devices without magic state distillation. We argue that such circuits can be out of reach for state-of-the-art classical simulation algorithms.
Collapse
Affiliation(s)
- Christophe Piveteau
- IBM Quantum, IBM Research-Zurich, 8803 Rüschlikon, Switzerland and Institute for Theoretical Physics, ETH Zurich, 8093 Zürich, Switzerland
| | - David Sutter
- IBM Quantum, IBM Research-Zurich, 8803 Rüschlikon, Switzerland
| | - Sergey Bravyi
- IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, New York 10562, USA
| | - Jay M Gambetta
- IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, New York 10562, USA
| | - Kristan Temme
- IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, New York 10562, USA
| |
Collapse
|
5
|
Bravyi S, Kliesch A, Koenig R, Tang E. Obstacles to Variational Quantum Optimization from Symmetry Protection. Phys Rev Lett 2020; 125:260505. [PMID: 33449785 DOI: 10.1103/physrevlett.125.260505] [Citation(s) in RCA: 13] [Impact Index Per Article: 3.3] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 10/22/2019] [Revised: 09/16/2020] [Accepted: 12/03/2020] [Indexed: 06/12/2023]
Abstract
The quantum approximate optimization algorithm (QAOA) employs variational states generated by a parameterized quantum circuit to maximize the expected value of a Hamiltonian encoding a classical cost function. Whether or not the QAOA can outperform classical algorithms in some tasks is an actively debated question. Our work exposes fundamental limitations of the QAOA resulting from the symmetry and the locality of variational states. A surprising consequence of our results is that the classical Goemans-Williamson algorithm outperforms the QAOA for certain instances of MaxCut, at any constant level. To overcome these limitations, we propose a nonlocal version of the QAOA and give numerical evidence that it significantly outperforms the standard QAOA for frustrated Ising models.
Collapse
Affiliation(s)
- Sergey Bravyi
- IBM Quantum, IBM T. J. Watson Research Center, Yorktown Heights, New York 10598, USA
| | - Alexander Kliesch
- Zentrum Mathematik, Technical University of Munich, 85748 Garching, Germany
| | - Robert Koenig
- Institute for Advanced Study and Zentrum Mathematik, Technical University of Munich, 85748 Garching, Germany
| | - Eugene Tang
- Institute for Quantum Information and Matter, Caltech, Pasadena, California 91125, USA
| |
Collapse
|
6
|
Affiliation(s)
- Bela Bauer
- Microsoft Quantum, Station Q, University of California
, Santa Barbara, California 93106, United States
| | - Sergey Bravyi
- IBM Quantum, IBM T. J. Watson Research Center
, Yorktown Heights, New York 10598, United States
| | - Mario Motta
- IBM Quantum, IBM Research Almaden
, San Jose, California 95120, United States
| | - Garnet Kin-Lic Chan
- Division of Chemistry and Chemical Engineering, California Institute of Technology
, Pasadena, California 91125, United States
| |
Collapse
|
7
|
Abstract
Quantum effects can enhance information-processing capabilities and speed up the solution of certain computational problems. Whether a quantum advantage can be rigorously proven in some setting or demonstrated experimentally using near-term devices is the subject of active debate. We show that parallel quantum algorithms running in a constant time period are strictly more powerful than their classical counterparts; they are provably better at solving certain linear algebra problems associated with binary quadratic forms. Our work gives an unconditional proof of a computational quantum advantage and simultaneously pinpoints its origin: It is a consequence of quantum nonlocality. The proposed quantum algorithm is a suitable candidate for near-future experimental realizations, as it requires only constant-depth quantum circuits with nearest-neighbor gates on a two-dimensional grid of qubits (quantum bits).
Collapse
|
8
|
Abstract
Two schemes are presented that mitigate the effect of errors and decoherence in short-depth quantum circuits. The size of the circuits for which these techniques can be applied is limited by the rate at which the errors in the computation are introduced. Near-term applications of early quantum devices, such as quantum simulations, rely on accurate estimates of expectation values to become relevant. Decoherence and gate errors lead to wrong estimates of the expectation values of observables used to evaluate the noisy circuit. The two schemes we discuss are deliberately simple and do not require additional qubit resources, so to be as practically relevant in current experiments as possible. The first method, extrapolation to the zero noise limit, subsequently cancels powers of the noise perturbations by an application of Richardson's deferred approach to the limit. The second method cancels errors by resampling randomized circuits according to a quasiprobability distribution.
Collapse
Affiliation(s)
- Kristan Temme
- IBM T. J. Watson Research Center, Yorktown Heights, New York 10598, USA
| | - Sergey Bravyi
- IBM T. J. Watson Research Center, Yorktown Heights, New York 10598, USA
| | - Jay M Gambetta
- IBM T. J. Watson Research Center, Yorktown Heights, New York 10598, USA
| |
Collapse
|
9
|
Bravyi S, Gosset D. Polynomial-Time Classical Simulation of Quantum Ferromagnets. Phys Rev Lett 2017; 119:100503. [PMID: 28949162 DOI: 10.1103/physrevlett.119.100503] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 12/20/2016] [Indexed: 06/07/2023]
Abstract
We consider a family of quantum spin systems which includes, as special cases, the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any model in this family can be efficiently approximated to a given relative error ε using a classical randomized algorithm with runtime polynomial in ε^{-1}, system size, and inverse temperature. As a consequence, we obtain a polynomial time algorithm which approximates the free energy or ground energy to a given additive error. We first show how to approximate the partition function by the perfect matching sum of a finite graph with positive edge weights. Although the perfect matching sum is not known to be efficiently approximable in general, the graphs obtained by our method have a special structure which facilitates efficient approximation via a randomized algorithm due to Jerrum and Sinclair.
Collapse
Affiliation(s)
- Sergey Bravyi
- IBM T.J. Watson Research Center, Yorktown Heights, New York 10598, USA
| | - David Gosset
- IBM T.J. Watson Research Center, Yorktown Heights, New York 10598, USA
| |
Collapse
|
10
|
Abstract
We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set. The runtime of the algorithm is polynomial in the number of qubits and the number of Clifford gates in the circuit but exponential in the number of T gates. The exponential scaling is sufficiently mild that the algorithm can be used in practice to simulate medium-sized quantum circuits dominated by Clifford gates. The first demonstrations of fault-tolerant quantum circuits based on 2D topological codes are likely to be dominated by Clifford gates due to a high implementation cost associated with logical T gates. Thus our algorithm may serve as a verification tool for near-term quantum computers which cannot in practice be simulated by other means. To demonstrate the power of the new method, we performed a classical simulation of a hidden shift quantum algorithm with 40 qubits, a few hundred Clifford gates, and nearly 50 T gates.
Collapse
Affiliation(s)
- Sergey Bravyi
- IBM T.J. Watson Research Center, Yorktown Heights, New York 10598, USA
| | - David Gosset
- Walter Burke Institute for Theoretical Physics and Institute for Quantum Information and Matter, California Institute of Technology, Pasadena, California 91125, USA
| |
Collapse
|
11
|
Abstract
A big open question in the quantum information theory concerns the feasibility of a self-correcting quantum memory. A quantum state recorded in such memory can be stored reliably for a macroscopic time without need for active error correction, if the memory is in contact with a cold enough thermal bath. Here we report analytic and numerical evidence for self-correcting behavior in the quantum spin lattice model known as the 3D cubic code. We prove that its memory time is at least L(cβ), where L is the lattice size, β is the inverse temperature of the bath, and c>0 is a constant coefficient. However, this bound applies only if the lattice size L does not exceed a critical value which grows exponentially with β. In that sense, the model can be called a partially self-correcting memory. We also report a Monte Carlo simulation indicating that our analytic bounds on the memory time are tight up to constant coefficients. To model the readout step we introduce a new decoding algorithm, which can be implemented efficiently for any topological stabilizer code. A longer version of this work can be found in Bravyi and Haah, arXiv:1112.3252.
Collapse
Affiliation(s)
- Sergey Bravyi
- IBM Watson Research Center, Yorktown Heights, New York 10598, USA
| | | |
Collapse
|
12
|
Abstract
Given a quantum error correcting code, an important task is to find encoded operations that can be implemented efficiently and fault tolerantly. In this Letter we focus on topological stabilizer codes and encoded unitary gates that can be implemented by a constant-depth quantum circuit. Such gates have a certain degree of protection since propagation of errors in a constant-depth circuit is limited by a constant size light cone. For the 2D geometry we show that constant-depth circuits can only implement a finite group of encoded gates known as the Clifford group. This implies that topological protection must be "turned off" for at least some steps in the computation in order to achieve universality. For the 3D geometry we show that an encoded gate U is implementable by a constant-depth circuit only if UPU(†) is in the Clifford group for any Pauli operator P. This class of gates includes some non-Clifford gates such as the π/8 rotation. Our classification applies to any stabilizer code with geometrically local stabilizers and sufficiently large code distance.
Collapse
Affiliation(s)
- Sergey Bravyi
- IBM Watson Research Center, Yorktown Heights, New York 10598, USA
| | | |
Collapse
|
13
|
Bravyi S, Caha L, Movassagh R, Nagaj D, Shor PW. Criticality without frustration for quantum spin-1 chains. Phys Rev Lett 2012; 109:207202. [PMID: 23215521 DOI: 10.1103/physrevlett.109.207202] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 08/24/2012] [Indexed: 06/01/2023]
Abstract
Frustration-free (FF) spin chains have a property that their ground state minimizes all individual terms in the chain Hamiltonian. We ask how entangled the ground state of a FF quantum spin-s chain with nearest-neighbor interactions can be for small values of s. While FF spin-1/2 chains are known to have unentangled ground states, the case s=1 remains less explored. We propose the first example of a FF translation-invariant spin-1 chain that has a unique highly entangled ground state and exhibits some signatures of a critical behavior. The ground state can be viewed as the uniform superposition of balanced strings of left and right brackets separated by empty spaces. Entanglement entropy of one half of the chain scales as 1/2 log n+O(1), where n is the number of spins. We prove that the energy gap above the ground state is polynomial in 1/n. The proof relies on a new result concerning statistics of Dyck paths which might be of independent interest.
Collapse
Affiliation(s)
- Sergey Bravyi
- IBM Watson Research Center, Yorktown Heights, New York 10598, USA
| | | | | | | | | |
Collapse
|
14
|
Bravyi S, Haah J. Energy landscape of 3D spin Hamiltonians with topological order. Phys Rev Lett 2011; 107:150504. [PMID: 22107277 DOI: 10.1103/physrevlett.107.150504] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 06/06/2011] [Indexed: 05/31/2023]
Abstract
We explore the feasibility of a quantum self-correcting memory based on 3D spin Hamiltonians with topological quantum order in which thermal diffusion of topological defects is suppressed by macroscopic energy barriers. To this end we characterize the energy landscape of stabilizer code Hamiltonians with local bounded-strength interactions which have a topologically ordered ground state but do not have stringlike logical operators. We prove that any sequence of local errors mapping a ground state of such a Hamiltonian to an orthogonal ground state must cross an energy barrier growing at least as a logarithm of the lattice size. Our bound on the energy barrier is tight up to a constant factor for one particular 3D spin Hamiltonian.
Collapse
Affiliation(s)
- Sergey Bravyi
- IBM Watson Research Center, Yorktown Heights, New York 10598, USA
| | | |
Collapse
|
15
|
Abstract
We ask whether there are fundamental limits on storing quantum information reliably in a bounded volume of space. To investigate this question, we study quantum error correcting codes specified by geometrically local commuting constraints on a 2D lattice of finite-dimensional quantum particles. For these 2D systems, we derive a tradeoff between the number of encoded qubits k, the distance of the code d, and the number of particles n. It is shown that kd{2}=O(n) where the coefficient in O(n) depends only on the locality of the constraints and dimension of the Hilbert spaces describing individual particles. The analogous tradeoff for the classical information storage is k sqrt[d]=O(n).
Collapse
Affiliation(s)
- Sergey Bravyi
- IBM Watson Research Center, Yorktown Heights New York 10598, USA
| | | | | |
Collapse
|
16
|
|
17
|
Bravyi S, DiVincenzo DP, Loss D, Terhal BM. Quantum simulation of many-body Hamiltonians using perturbation theory with bounded-strength interactions. Phys Rev Lett 2008; 101:070503. [PMID: 18764519 DOI: 10.1103/physrevlett.101.070503] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 04/02/2008] [Indexed: 05/26/2023]
Abstract
We show how to map a given n-qubit target Hamiltonian with bounded-strength k-body interactions onto a simulator Hamiltonian with two-body interactions, such that the ground-state energy of the target and the simulator Hamiltonians are the same up to an extensive error O(epsilon n) for arbitrary small epsilon. The strength of the interactions in the simulator Hamiltonian depends on epsilon and k but does not depend on n. We accomplish this reduction using a new way of deriving an effective low-energy Hamiltonian which relies on the Schrieffer-Wolff transformation of many-body physics.
Collapse
Affiliation(s)
- Sergey Bravyi
- IBM Watson Research Center, P.O. Box 218, Yorktown Heights, New York 10598 , USA
| | | | | | | |
Collapse
|
18
|
Bravyi S, Hastings MB, Verstraete F. Lieb-Robinson bounds and the generation of correlations and topological quantum order. Phys Rev Lett 2006; 97:050401. [PMID: 17026080 DOI: 10.1103/physrevlett.97.050401] [Citation(s) in RCA: 16] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [What about the content of this article? (0)] [Affiliation(s)] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 04/10/2006] [Indexed: 05/12/2023]
Abstract
The Lieb-Robinson bound states that local Hamiltonian evolution in nonrelativistic quantum mechanical theories gives rise to the notion of an effective light cone with exponentially decaying tails. We discuss several consequences of this result in the context of quantum information theory. First, we show that the information that leaks out to spacelike separated regions is negligible and that there is a finite speed at which correlations and entanglement can be distributed. Second, we discuss how these ideas can be used to prove lower bounds on the time it takes to convert states without topological quantum order to states with that property. Finally, we show that the rate at which entropy can be created in a block of spins scales like the boundary of that block.
Collapse
Affiliation(s)
- S Bravyi
- IBM Watson Research Center, Yorktown Heights, NY 10598, USA
| | | | | |
Collapse
|