Noah Berthusen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Noah Berthusen has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Gottesman
Joint Center for Quantum Information and Computer Science
2 shared publications - Alexey V. Gorshkov
Joint Center for Quantum Information and Computer Science
1 shared publication - Andrew M. Childs
Joint Center for Quantum Information and Computer Science
1 shared publication Brian Neyenhuis
Quantinuum
1 shared publicationCai-Zhuang Wang
Ames Laboratory, U.S. Department of Energy, Ames, Iowa 50011, USA and Department of Physics and Astronomy, Iowa State University, Ames, Iowa 50011, USA
1 shared publication- Cameron Foltz
Quantinuum, Broomfield, USA
1 shared publication
Latest Publications
- Open Access
- 28 May 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (3)
Adaptive syndrome extraction
Device error rates on current quantum computers have improved enough to where demonstrations of error correction below break even are now possible. Still, the circuits required for quantum error correction introduce significant overhead and sometimes inject more errors than they correct. In this work, we introduce adaptive syndrome extraction as a scheme to improve code performance and reduce the quantum error-correction cycle time by measuring only the stabilizer generators that are likely to provide useful syndrome information. We provide a concrete example of the scheme through the [[4,2,2]] code concatenated with a hypergraph product code and a syndrome-extraction cycle that uses quantum error detection to modify the syndrome-extraction circuits in real time. Compared to nonconcatenated codes and nonadaptive syndrome extraction, we find that the adaptive scheme achieves over an order of magnitude lower logical error rates while requiring fewer gates and physical qubits. Furthermore, we show how to achieve fault-tolerant universal logical computation with [[4,2,2]]-concatenated hypergraph product codes.
- 28 May 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (3)
Open AccessAdaptive syndrome extraction
Device error rates on current quantum computers have improved enough to where demonstrations of error correction below break even are now possible. Still, the circuits required for quantum error correction introduce significant overhead and sometimes inject more errors than they correct. In this work, we introduce adaptive syndrome extraction as a scheme to improve code performance and reduce the quantum error-correction cycle time by measuring only the stabilizer generators that are likely to provide useful syndrome information. We provide a concrete example of the scheme through the [[4,2,2]] code concatenated with a hypergraph product code and a syndrome-extraction cycle that uses quantum error detection to modify the syndrome-extraction circuits in real time. Compared to nonconcatenated codes and nonadaptive syndrome extraction, we find that the adaptive scheme achieves over an order of magnitude lower logical error rates while requiring fewer gates and physical qubits. Furthermore, we show how to achieve fault-tolerant universal logical computation with [[4,2,2]]-concatenated hypergraph product codes.
- Top Cited PapersOpen Access
- 9 January 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (1)
Toward a 2D Local Implementation of Quantum Low-Density Parity-Check Codes
Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes that affects code performance and ease of physical realization. For device architectures restricted to two-dimensional (2D) local gates, naively implementing the high-rate codes suitable for low-overhead fault-tolerant quantum computing incurs prohibitive overhead. In this work, we present an error-correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates by measuring some generators less frequently than others. We investigate the family of bivariate-bicycle qLDPC codes and show that they are well suited for a parallel syndrome-measurement scheme using fast routing with local operations and classical communication (LOCC). Through circuit-level simulations, we find that in some parameter regimes, bivariate-bicycle codes implemented with this protocol have logical error rates comparable to the surface code while using fewer physical qubits.
- 9 January 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (1)
Top Cited PapersOpen AccessToward a 2D Local Implementation of Quantum Low-Density Parity-Check Codes
Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes that affects code performance and ease of physical realization. For device architectures restricted to two-dimensional (2D) local gates, naively implementing the high-rate codes suitable for low-overhead fault-tolerant quantum computing incurs prohibitive overhead. In this work, we present an error-correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates by measuring some generators less frequently than others. We investigate the family of bivariate-bicycle qLDPC codes and show that they are well suited for a parallel syndrome-measurement scheme using fast routing with local operations and classical communication (LOCC). Through circuit-level simulations, we find that in some parameter regimes, bivariate-bicycle codes implemented with this protocol have logical error rates comparable to the surface code while using fewer physical qubits.
- 9 December 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (6)
Experiments with the four-dimensional surface code on a quantum charge-coupled device quantum computer
- 9 December 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (6)
Experiments with the four-dimensional surface code on a quantum charge-coupled device quantum computer
- Open Access
- 13 January 2021
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 3 (1) , 013039
Shallow-circuit variational quantum eigensolver based on symmetry-inspired Hilbert space partitioning for quantum chemical calculations
Development of resource-friendly quantum algorithms remains highly desirable for noisy intermediate-scale quantum computing. Based on the variational quantum eigensolver (VQE) with unitary coupled-cluster Ansatz, we demonstrate that partitioning of the Hilbert space made possible by the point-group symmetry of the molecular systems greatly reduces the number of variational operators by confining the variational search within a subspace. In addition, we found that instead of including all subterms for each excitation operator, a single-term representation suffices to reach required accuracy for various molecules tested, resulting in an additional shortening of the quantum circuit by a factor of 4–8. With these strategies, VQE calculations on a noise-free quantum simulator achieve energies within a few meVs of those obtained with the full unitary coupled-cluster Ansatz with single and double excitations for the -square, -chain, and -hexagon molecules, while the number of cnot gates, a measure of the quantum-circuit depth, is reduced by a factor of as large as 35. Furthermore, we introduced an efficient “score” parameter to rank the excitation operators, so that the operators causing larger energy reduction can be applied first. Using the square and chain as examples, We demonstrated on noisy quantum simulators that the first few variational operators can bring the energy within the chemical accuracy, while additional operators do not improve the energy since the accumulative noise outweighs the gain from the expansion of the variational Ansatz.- 13 January 2021
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 3 (1) , 013039
Open AccessShallow-circuit variational quantum eigensolver based on symmetry-inspired Hilbert space partitioning for quantum chemical calculations
Development of resource-friendly quantum algorithms remains highly desirable for noisy intermediate-scale quantum computing. Based on the variational quantum eigensolver (VQE) with unitary coupled-cluster Ansatz, we demonstrate that partitioning of the Hilbert space made possible by the point-group symmetry of the molecular systems greatly reduces the number of variational operators by confining the variational search within a subspace. In addition, we found that instead of including all subterms for each excitation operator, a single-term representation suffices to reach required accuracy for various molecules tested, resulting in an additional shortening of the quantum circuit by a factor of 4–8. With these strategies, VQE calculations on a noise-free quantum simulator achieve energies within a few meVs of those obtained with the full unitary coupled-cluster Ansatz with single and double excitations for the -square, -chain, and -hexagon molecules, while the number of cnot gates, a measure of the quantum-circuit depth, is reduced by a factor of as large as 35. Furthermore, we introduced an efficient “score” parameter to rank the excitation operators, so that the operators causing larger energy reduction can be applied first. Using the square and chain as examples, We demonstrated on noisy quantum simulators that the first few variational operators can bring the energy within the chemical accuracy, while additional operators do not improve the energy since the accumulative noise outweighs the gain from the expansion of the variational Ansatz.