David Hayes
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
David Hayes has a total of 66 co-authors. Here are the top co-authors by number of shared publications:
B. Neyenhuis
Quantinuum, Broomfield, CO 80021, USA
3 shared publications- Charles H. Baldwin
Quantinuum
3 shared publications Brian Neyenhuis
Quantinuum
2 shared publicationsC. Figgatt
Honeywell Quantum Solutions 303 S. Technology Ct. 80021 Broomfield Colorado USA
2 shared publicationsC. Ryan-Anderson
2 shared publications- Cameron Foltz
Quantinuum, Broomfield, USA
2 shared publications
Latest Publications
- Open Access
- 9 June 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (2)
End-to-End Quantum Algorithms for the Jones Polynomial
We present an end-to-end algorithmic pipeline where a noisy digital quantum computer is used to approximate the value of the Jones polynomial at the fifth root of unity for any input link, i.e., a closed braid. This problem is DQC1-complete for Markov-closed braids and BQP-complete for Plat-closed braids, and we accommodate both versions of the problem. Even though it is widely believed that DQC1 is strictly contained in BQP, and so is “less quantum,” the resource requirements of classical algorithms for the DQC1 version are at least as high as for the BQP version, and so we potentially gain “more advantage” by focusing on Markov-closed braids in our exposition. We demonstrate our quantum algorithm on Quantinuum’s H2-2 quantum computer and show the effect of problem-tailored error-mitigation techniques. Further, leveraging that the Jones polynomial is a link invariant, we construct an efficiently verifiable benchmark to characterize the effect of noise present in a given quantum processor. In parallel, we develop and benchmark the state-of-the-art tensor-network-based classical algorithms for computing the Jones polynomial. The reconfigurable tools provided in this work allow for precise resource estimation to identify minimum link sizes for near-term quantum advantage in practice for a meaningful quantum-native problem in knot theory, if a candidate set of links are provided.
- 9 June 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (2)
Open AccessEnd-to-End Quantum Algorithms for the Jones Polynomial
We present an end-to-end algorithmic pipeline where a noisy digital quantum computer is used to approximate the value of the Jones polynomial at the fifth root of unity for any input link, i.e., a closed braid. This problem is DQC1-complete for Markov-closed braids and BQP-complete for Plat-closed braids, and we accommodate both versions of the problem. Even though it is widely believed that DQC1 is strictly contained in BQP, and so is “less quantum,” the resource requirements of classical algorithms for the DQC1 version are at least as high as for the BQP version, and so we potentially gain “more advantage” by focusing on Markov-closed braids in our exposition. We demonstrate our quantum algorithm on Quantinuum’s H2-2 quantum computer and show the effect of problem-tailored error-mitigation techniques. Further, leveraging that the Jones polynomial is a link invariant, we construct an efficiently verifiable benchmark to characterize the effect of noise present in a given quantum processor. In parallel, we develop and benchmark the state-of-the-art tensor-network-based classical algorithms for computing the Jones polynomial. The reconfigurable tools provided in this work allow for precise resource estimation to identify minimum link sizes for near-term quantum advantage in practice for a meaningful quantum-native problem in knot theory, if a candidate set of links are provided.
- Open Access
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 1007-1021
iSwitch: QEC on Demand via In-Situ Encoding of Bare Qubits for Ion Trap Architectures
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 1007-1021
Open AccessiSwitch: QEC on Demand via In-Situ Encoding of Bare Qubits for Ion Trap Architectures
- Open Access
Efficient quantum state preparation of multivariate functions using tensor networks
For the preparation of high-dimensional functions on quantum computers, we introduce tensor network algorithms that are efficient with regard to dimensionality, optimize circuits composed of hardware-native gates and take gate errors into account during the optimization. To avoid the notorious barren plateau problem of vanishing gradients in the circuit optimization, we smoothly transform the circuit from an easy-to-prepare initial function into the desired target function. We show that paradigmatic multivariate functions can be accurately prepared such as, by numerical simulations, a 17-dimensional Gaussian encoded in the state of 102 qubits and, through experiments, a 9-dimensional Gaussian realized using 54 qubits on Quantinuum's H2 quantum processor.
Open AccessEfficient quantum state preparation of multivariate functions using tensor networks
For the preparation of high-dimensional functions on quantum computers, we introduce tensor network algorithms that are efficient with regard to dimensionality, optimize circuits composed of hardware-native gates and take gate errors into account during the optimization. To avoid the notorious barren plateau problem of vanishing gradients in the circuit optimization, we smoothly transform the circuit from an easy-to-prepare initial function into the desired target function. We show that paradigmatic multivariate functions can be accurately prepared such as, by numerical simulations, a 17-dimensional Gaussian encoded in the state of 102 qubits and, through experiments, a 9-dimensional Gaussian realized using 54 qubits on Quantinuum's H2 quantum processor.
- Open Access
- 23 July 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (3)
Filter-enhanced adiabatic quantum computing on a digital quantum processor
Eigenstate filters underpin near-optimal quantum algorithms for ground-state preparation. Their realization on current quantum computers, however, poses a challenge as the filters are typically represented by deep quantum circuits. Additionally, since the filters are created probabilistically, their circuits need to be rerun many times when the associated success probability is small. Here, we describe a strategy to implement a ground-state filter on quantum hardware in the presence of noise by prepending the filter with digitized adiabatic quantum computing. The adiabatically prepared input state increases the success probability of the filter and also reduces its circuit depth requirements. At the same time, the filter enhances the accuracy of the adiabatically prepared ground state. We compare the approach to the purely adiabatic protocol through numerical simulations and experiments on the Quantinuum H1-1 quantum computer. We demonstrate a significant improvement in ground-state accuracies for paradigmatic quantum spin models.
- 23 July 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (3)
Open AccessFilter-enhanced adiabatic quantum computing on a digital quantum processor
Eigenstate filters underpin near-optimal quantum algorithms for ground-state preparation. Their realization on current quantum computers, however, poses a challenge as the filters are typically represented by deep quantum circuits. Additionally, since the filters are created probabilistically, their circuits need to be rerun many times when the associated success probability is small. Here, we describe a strategy to implement a ground-state filter on quantum hardware in the presence of noise by prepending the filter with digitized adiabatic quantum computing. The adiabatically prepared input state increases the success probability of the filter and also reduces its circuit depth requirements. At the same time, the filter enhances the accuracy of the adiabatically prepared ground state. We compare the approach to the purely adiabatic protocol through numerical simulations and experiments on the Quantinuum H1-1 quantum computer. We demonstrate a significant improvement in ground-state accuracies for paradigmatic quantum spin models.
- 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
- Top Cited Papers
- 20 September 2024
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 385 (6715) , 1327-1331
High-fidelity teleportation of a logical qubit using transversal gates and lattice surgery
Quantum state teleportation is commonly used in designs for large-scale quantum computers. Using Quantinuum’s H2 trapped-ion quantum processor, we demonstrate fault-tolerant state teleportation circuits for a quantum error correction code—specifically the Steane code. The circuits use up to 30 qubits at the physical level and employ real-time quantum error correction. We conducted experiments on several variations of logical teleportation circuits using both transversal gates and lattice surgery. We measured the logical process fidelity to be 0.975 ± 0.002 for the transversal teleportation implementation and 0.851 ± 0.009 for the lattice surgery teleportation implementation as well as 0.989 ± 0.002 for an implementation of Knill-style quantum error correction.
- 20 September 2024
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 385 (6715) , 1327-1331
Top Cited PapersHigh-fidelity teleportation of a logical qubit using transversal gates and lattice surgery
Quantum state teleportation is commonly used in designs for large-scale quantum computers. Using Quantinuum’s H2 trapped-ion quantum processor, we demonstrate fault-tolerant state teleportation circuits for a quantum error correction code—specifically the Steane code. The circuits use up to 30 qubits at the physical level and employ real-time quantum error correction. We conducted experiments on several variations of logical teleportation circuits using both transversal gates and lattice surgery. We measured the logical process fidelity to be 0.975 ± 0.002 for the transversal teleportation implementation and 0.851 ± 0.009 for the lattice surgery teleportation implementation as well as 0.989 ± 0.002 for an implementation of Knill-style quantum error correction.
- Open Access
Demonstration of the trapped-ion quantum-CCD computer architecture
The trapped-ion QCCD (quantum charge-coupled device) architecture proposal lays out a blueprint for a universal quantum computer. The design begins with electrodes patterned on a two-dimensional surface configured to trap multiple arrays of ions (or ion crystals). Communication within the ion crystal network allows for the machine to be scaled while keeping the number of ions in each crystal to a small number, thereby preserving the low error rates demonstrated in trapped-ion experiments. By proposing to communicate quantum information by moving the ions through space to interact with other distant ions, the architecture creates a quantum computer endowed with full-connectivity. However, engineering this fully-connected computer introduces a host of difficulties that have precluded the architecture from being fully realized in the twenty years since its proposal. Using a Honeywell cryogenic surface trap, we report on the integration of all necessary ingredients of the QCCD architecture into a programmable trapped-ion quantum computer. Using four and six qubit circuits, the system level performance of the processor is quantified by the fidelity of a teleported CNOT gate utilizing mid-circuit measurement and a quantum volume measurement of $2^6=64$. By demonstrating that the low error rates achievable in small ion crystals can be successfully integrated with a scalable trap design, parallel optical delivery, and fast ion transport, the QCCD architecture is shown to be a viable path toward large quantum computers. Atomic ions provide perfectly identical, high-fidelity qubits. Our work shows that the QCCD architecture built around these qubits will provide high performance quantum computers, likely enabling important near-term demonstrations such as quantum error correction and quantum advantage.Open AccessDemonstration of the trapped-ion quantum-CCD computer architecture
The trapped-ion QCCD (quantum charge-coupled device) architecture proposal lays out a blueprint for a universal quantum computer. The design begins with electrodes patterned on a two-dimensional surface configured to trap multiple arrays of ions (or ion crystals). Communication within the ion crystal network allows for the machine to be scaled while keeping the number of ions in each crystal to a small number, thereby preserving the low error rates demonstrated in trapped-ion experiments. By proposing to communicate quantum information by moving the ions through space to interact with other distant ions, the architecture creates a quantum computer endowed with full-connectivity. However, engineering this fully-connected computer introduces a host of difficulties that have precluded the architecture from being fully realized in the twenty years since its proposal. Using a Honeywell cryogenic surface trap, we report on the integration of all necessary ingredients of the QCCD architecture into a programmable trapped-ion quantum computer. Using four and six qubit circuits, the system level performance of the processor is quantified by the fidelity of a teleported CNOT gate utilizing mid-circuit measurement and a quantum volume measurement of $2^6=64$. By demonstrating that the low error rates achievable in small ion crystals can be successfully integrated with a scalable trap design, parallel optical delivery, and fast ion transport, the QCCD architecture is shown to be a viable path toward large quantum computers. Atomic ions provide perfectly identical, high-fidelity qubits. Our work shows that the QCCD architecture built around these qubits will provide high performance quantum computers, likely enabling important near-term demonstrations such as quantum error correction and quantum advantage. - Top Cited Papers
- 7 April 2021
- Published by Springer Nature in Nature
- Vol. 592 (7853) , 209-213
Demonstration of the trapped-ion quantum CCD computer architecture
The trapped-ion quantum charge-coupled device (QCCD) proposal1,2 lays out a blueprint for a universal quantum computer that uses mobile ions as qubits. Analogous to a charge-coupled device (CCD) camera, which stores and processes imaging information as movable electrical charges in coupled pixels, a QCCD computer stores quantum information in the internal state of electrically charged ions that are transported between different processing zones using dynamic electric fields. The promise of the QCCD architecture is to maintain the low error rates demonstrated in small trapped-ion experiments3,4,5 by limiting the quantum interactions to multiple small ion crystals, then physically splitting and rearranging the constituent ions of these crystals into new crystals, where further interactions occur. This approach leverages transport timescales that are fast relative to the coherence times of the qubits, the insensitivity of the qubit states of the ion to the electric fields used for transport, and the low crosstalk afforded by spatially separated crystals. However, engineering a machine capable of executing these operations across multiple interaction zones with low error introduces many difficulties, which have slowed progress in scaling this architecture to larger qubit numbers. Here we use a cryogenic surface trap to integrate all necessary elements of the QCCD architecture—a scalable trap design, parallel interaction zones and fast ion transport—into a programmable trapped-ion quantum computer that has a system performance consistent with the low error rates achieved in the individual ion crystals. We apply this approach to realize a teleported CNOT gate using mid-circuit measurement6, negligible crosstalk error and a quantum volume7 of 26 = 64. These results demonstrate that the QCCD architecture provides a viable path towards high-performance quantum computers.
- 7 April 2021
- Published by Springer Nature in Nature
- Vol. 592 (7853) , 209-213
Top Cited PapersDemonstration of the trapped-ion quantum CCD computer architecture
The trapped-ion quantum charge-coupled device (QCCD) proposal1,2 lays out a blueprint for a universal quantum computer that uses mobile ions as qubits. Analogous to a charge-coupled device (CCD) camera, which stores and processes imaging information as movable electrical charges in coupled pixels, a QCCD computer stores quantum information in the internal state of electrically charged ions that are transported between different processing zones using dynamic electric fields. The promise of the QCCD architecture is to maintain the low error rates demonstrated in small trapped-ion experiments3,4,5 by limiting the quantum interactions to multiple small ion crystals, then physically splitting and rearranging the constituent ions of these crystals into new crystals, where further interactions occur. This approach leverages transport timescales that are fast relative to the coherence times of the qubits, the insensitivity of the qubit states of the ion to the electric fields used for transport, and the low crosstalk afforded by spatially separated crystals. However, engineering a machine capable of executing these operations across multiple interaction zones with low error introduces many difficulties, which have slowed progress in scaling this architecture to larger qubit numbers. Here we use a cryogenic surface trap to integrate all necessary elements of the QCCD architecture—a scalable trap design, parallel interaction zones and fast ion transport—into a programmable trapped-ion quantum computer that has a system performance consistent with the low error rates achieved in the individual ion crystals. We apply this approach to realize a teleported CNOT gate using mid-circuit measurement6, negligible crosstalk error and a quantum volume7 of 26 = 64. These results demonstrate that the QCCD architecture provides a viable path towards high-performance quantum computers.
- 27 April 2020
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 124 (17) , 170501
Eliminating Leakage Errors in Hyperfine Qubits
Population leakage outside the qubit subspace presents a particularly harmful source of error that cannot be handled by standard error correction methods. Using a trapped ion, we demonstrate an optical pumping scheme to suppress leakage errors in atomic hyperfine qubits. The selection rules and narrow linewidth of a quadrupole transition are used to selectively pump population out of leakage states and back into the qubit subspace. Each pumping cycle reduces the leakage population by a factor of , allowing for an exponential suppression in the number of cycles. We use interleaved randomized benchmarking on the qubit subspace to show that this pumping procedure has negligible side effects on the qubit subspace, bounding the induced qubit memory error by cycle, and qubit population decay to cycle. These results clear a major obstacle for implementations of quantum error correction and error mitigation protocols.- 27 April 2020
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 124 (17) , 170501
Eliminating Leakage Errors in Hyperfine Qubits
Population leakage outside the qubit subspace presents a particularly harmful source of error that cannot be handled by standard error correction methods. Using a trapped ion, we demonstrate an optical pumping scheme to suppress leakage errors in atomic hyperfine qubits. The selection rules and narrow linewidth of a quadrupole transition are used to selectively pump population out of leakage states and back into the qubit subspace. Each pumping cycle reduces the leakage population by a factor of , allowing for an exponential suppression in the number of cycles. We use interleaved randomized benchmarking on the qubit subspace to show that this pumping procedure has negligible side effects on the qubit subspace, bounding the induced qubit memory error by cycle, and qubit population decay to cycle. These results clear a major obstacle for implementations of quantum error correction and error mitigation protocols.