Andrew W. Cross
Research Subjects
Andrew W. Cross has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Ali Javadi-Abhari
IBM Quantum IBM T.J. Watson Research Center 10598 Yorktown Heights NY USA
2 shared publications - Benjamin J. Brown
IBM Quantum, T. J. Watson Research Center, Yorktown Heights, USA
2 shared publications Jay M. Gambetta
IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, USA
2 shared publications- Maika Takita
IBM Quantum, T. J. Watson Research Center, Yorktown Heights, USA
2 shared publications Neereja Sundaresan
IBM Quantum, T. J. Watson Research Center, Yorktown Heights, USA
2 shared publicationsTheodore J. Yoder
IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, USA
2 shared publications
Latest Publications
- Top Cited PapersOpen Access
- 11 December 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (4)
Non-Clifford and Parallelizable Fault-Tolerant Logical Gates on Constant and Almost-Constant Rate Homological Quantum Low-Density Parity-Check Codes via Higher Symmetries
We study parallel fault-tolerant quantum computing for families of homological quantum low-density parity-check (LDPC) codes defined on 3-manifolds with constant or almost-constant encoding rate. We derive a generic formula for a transversal T gate on color codes defined on general 3-manifolds, which acts as collective non-Clifford logical gates on any triplet of logical qubits with their logical- X membranes having a Z 2 triple intersection at a single point. The triple-intersection number is a topological invariant, which also arises in the path integral of the emergent higher symmetry operator in a topological quantum field theory (TQFT): the Z 2 3 gauge theory. Moreover, the transversal S gate of the color code corresponds to a higher-form symmetry in TQFT supported on a codimension-1 submanifold, giving rise to exponentially many addressable and parallelizable logical gates. A construction of constant-depth circuits of the above logical gates via cup-product cohomology operation is also presented for three copies of identical toric codes on arbitrary 3-manifolds. We have developed a generic formalism to compute the triple-intersection invariants for 3-manifolds, with the structure encoded into an interaction hypergraph which determines the logical gate property and also corresponds to the hypergraph magic state that can be injected into the code without distillation (“”). We also study the scaling of the Betti number and systoles with volume for various 3-manifolds, which translates to the encoding rate and distance. We further develop three types of LDPC codes supporting such logical gates: (1) A quasi-hyperbolic code from the product of 2D hyperbolic surface and a circle, with almost-constant rate k / n = O ( 1 / log ( n ) ) and O ( log ( n ) ) distance; (2) A homological fiber-bundle code from twisting the product by an isometry of the surface based on the construction by Freedman-Meyer-Luo, with O ( 1 / log 1 2 ( n ) ) rate and O ( log 1 2 ( n ) ) distance; (3) A specific family of 3D hyperbolic codes: the Torelli mapping-torus code, constructed from mapping tori of a pseudo-Anosov element in the Torelli subgroup, which has constant rate while the distance scaling is currently unknown. We then show a generic constant-overhead scheme for applying a parallelizable universal gate set with the aid of logical- X measurements.
- 11 December 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (4)
Top Cited PapersOpen AccessNon-Clifford and Parallelizable Fault-Tolerant Logical Gates on Constant and Almost-Constant Rate Homological Quantum Low-Density Parity-Check Codes via Higher Symmetries
We study parallel fault-tolerant quantum computing for families of homological quantum low-density parity-check (LDPC) codes defined on 3-manifolds with constant or almost-constant encoding rate. We derive a generic formula for a transversal T gate on color codes defined on general 3-manifolds, which acts as collective non-Clifford logical gates on any triplet of logical qubits with their logical- X membranes having a Z 2 triple intersection at a single point. The triple-intersection number is a topological invariant, which also arises in the path integral of the emergent higher symmetry operator in a topological quantum field theory (TQFT): the Z 2 3 gauge theory. Moreover, the transversal S gate of the color code corresponds to a higher-form symmetry in TQFT supported on a codimension-1 submanifold, giving rise to exponentially many addressable and parallelizable logical gates. A construction of constant-depth circuits of the above logical gates via cup-product cohomology operation is also presented for three copies of identical toric codes on arbitrary 3-manifolds. We have developed a generic formalism to compute the triple-intersection invariants for 3-manifolds, with the structure encoded into an interaction hypergraph which determines the logical gate property and also corresponds to the hypergraph magic state that can be injected into the code without distillation (“”). We also study the scaling of the Betti number and systoles with volume for various 3-manifolds, which translates to the encoding rate and distance. We further develop three types of LDPC codes supporting such logical gates: (1) A quasi-hyperbolic code from the product of 2D hyperbolic surface and a circle, with almost-constant rate k / n = O ( 1 / log ( n ) ) and O ( log ( n ) ) distance; (2) A homological fiber-bundle code from twisting the product by an isometry of the surface based on the construction by Freedman-Meyer-Luo, with O ( 1 / log 1 2 ( n ) ) rate and O ( log 1 2 ( n ) ) distance; (3) A specific family of 3D hyperbolic codes: the Torelli mapping-torus code, constructed from mapping tori of a pseudo-Anosov element in the Torelli subgroup, which has constant rate while the distance scaling is currently unknown. We then show a generic constant-overhead scheme for applying a parallelizable universal gate set with the aid of logical- X measurements.
- Open Access
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 515-528
HetEC: Architectures for Heterogeneous Quantum Error Correction Codes
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 515-528
Open AccessHetEC: Architectures for Heterogeneous Quantum Error Correction Codes
- Top Cited PapersOpen Access
- 27 March 2024
- Published by Springer Nature in Nature
- Vol. 627 (8005) , 778-782
High-threshold and low-overhead fault-tolerant quantum memory
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.
- 27 March 2024
- Published by Springer Nature in Nature
- Vol. 627 (8005) , 778-782
Top Cited PapersOpen AccessHigh-threshold and low-overhead fault-tolerant quantum memory
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.
- Top Cited PapersOpen Access
- 10 January 2024
- Published by Springer Nature in Nature
- Vol. 625 (7994) , 259-263
Encoding a magic state with beyond break-even fidelity
To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from noise1–8. We can complete a universal set of logic gates by producing special resources called magic states9–11. It is therefore important to produce high-fidelity magic states to conduct algorithms while introducing a minimal amount of noise to the computation. Here we propose and implement a scheme to prepare a magic state on a superconducting qubit array using error correction. We find that our scheme produces better magic states than those that can be prepared using the individual qubits of the device. This demonstrates a fundamental principle of fault-tolerant quantum computing12, namely, that we can use error correction to improve the quality of logic gates with noisy qubits. Moreover, we show that the yield of magic states can be increased using adaptive circuits, in which the circuit elements are changed depending on the outcome of mid-circuit measurements. This demonstrates an essential capability needed for many error-correction subroutines. We believe that our prototype will be invaluable in the future as it can reduce the number of physical qubits needed to produce high-fidelity magic states in large-scale quantum-computing architectures.
- 10 January 2024
- Published by Springer Nature in Nature
- Vol. 625 (7994) , 259-263
Top Cited PapersOpen AccessEncoding a magic state with beyond break-even fidelity
To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from noise1–8. We can complete a universal set of logic gates by producing special resources called magic states9–11. It is therefore important to produce high-fidelity magic states to conduct algorithms while introducing a minimal amount of noise to the computation. Here we propose and implement a scheme to prepare a magic state on a superconducting qubit array using error correction. We find that our scheme produces better magic states than those that can be prepared using the individual qubits of the device. This demonstrates a fundamental principle of fault-tolerant quantum computing12, namely, that we can use error correction to improve the quality of logic gates with noisy qubits. Moreover, we show that the yield of magic states can be increased using adaptive circuits, in which the circuit elements are changed depending on the outcome of mid-circuit measurements. This demonstrates an essential capability needed for many error-correction subroutines. We believe that our prototype will be invaluable in the future as it can reduce the number of physical qubits needed to produce high-fidelity magic states in large-scale quantum-computing architectures.
- Top Cited PapersOpen Access
- 6 September 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 3 (3) , 1-50
OpenQASM 3: A Broader and Deeper Quantum Assembly Language
Quantum assembly languages are machine-independent languages that traditionally describe quantum computation in the circuit model. Open quantum assembly language (OpenQASM 2) was proposed as an imperative programming language for quantum circuits based on earlier QASM dialects. In principle, any quantum computation could be described using OpenQASM 2, but there is a need to describe a broader set of circuits beyond the language of qubits and gates. By examining interactive use cases, we recognize two different timescales of quantum-classical interactions: real-time classical computations that must be performed within the coherence times of the qubits, and near-time computations with less stringent timing. Since the near-time domain is adequately described by existing programming frameworks, we choose in OpenQASM 3 to focus on the real-time domain, which must be more tightly coupled to the execution of quantum operations. We add support for arbitrary control flow as well as calling external classical functions. In addition, we recognize the need to describe circuits at multiple levels of specificity, and therefore we extend the language to include timing, pulse control, and gate modifiers. These new language features create a multi-level intermediate representation for circuit development and optimization, as well as control sequence implementation for calibration, characterization, and error mitigation.
- 6 September 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 3 (3) , 1-50
Top Cited PapersOpen AccessOpenQASM 3: A Broader and Deeper Quantum Assembly Language
Quantum assembly languages are machine-independent languages that traditionally describe quantum computation in the circuit model. Open quantum assembly language (OpenQASM 2) was proposed as an imperative programming language for quantum circuits based on earlier QASM dialects. In principle, any quantum computation could be described using OpenQASM 2, but there is a need to describe a broader set of circuits beyond the language of qubits and gates. By examining interactive use cases, we recognize two different timescales of quantum-classical interactions: real-time classical computations that must be performed within the coherence times of the qubits, and near-time computations with less stringent timing. Since the near-time domain is adequately described by existing programming frameworks, we choose in OpenQASM 3 to focus on the real-time domain, which must be more tightly coupled to the execution of quantum operations. We add support for arbitrary control flow as well as calling external classical functions. In addition, we recognize the need to describe circuits at multiple levels of specificity, and therefore we extend the language to include timing, pulse control, and gate modifiers. These new language features create a multi-level intermediate representation for circuit development and optimization, as well as control sequence implementation for calibration, characterization, and error mitigation.
- 17 March 2022
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 128 (11) , 110504
Calibrated Decoders for Experimental Quantum Error Correction
Arbitrarily long quantum computations require quantum memories that can be repeatedly measured without being corrupted. Here, we preserve the state of a quantum memory, notably with the additional use of flagged error events. All error events were extracted using fast, midcircuit measurements and resets of the physical qubits. Among the error decoders we considered, we introduce a perfect matching decoder that was calibrated from measurements containing up to size-four correlated events. To compare the decoders, we used a partial postselection scheme shown to retain ten times more data than full postselection. We observed logical errors per round of (decoded without postselection) and (full postselection), which was less than the physical measurement error of and therefore surpasses a pseudothreshold for repeated logical measurements.- 17 March 2022
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 128 (11) , 110504
Calibrated Decoders for Experimental Quantum Error Correction
Arbitrarily long quantum computations require quantum memories that can be repeatedly measured without being corrupted. Here, we preserve the state of a quantum memory, notably with the additional use of flagged error events. All error events were extracted using fast, midcircuit measurements and resets of the physical qubits. Among the error decoders we considered, we introduce a perfect matching decoder that was calibrated from measurements containing up to size-four correlated events. To compare the decoders, we used a partial postselection scheme shown to retain ten times more data than full postselection. We observed logical errors per round of (decoded without postselection) and (full postselection), which was less than the physical measurement error of and therefore surpasses a pseudothreshold for repeated logical measurements.