IP Library › Granted Patent US 12,505,375
Granted Patent B2
US 12,505,375 · App. 17/746,871 · Granted Dec 23, 2025

Debugging of quantum circuits

Inventors: Andrii Maksymov (Hyattsville, MD); Jason Hieu Van Nguyen (Hyattsville, MD); Igor Leonidovich Markov (Mountain View, CA); Yunseong Nam (North Bethesda, MD)
Assignee: IONQ, INC.
G06N10/60G06F7/57G06N10/20G06N10/70
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,505,375
App. No.
17/746,871
Granted
Dec 23, 2025
Kind
B2
Abstract

A method of performing computation using a hybrid quantum-classical computing system including a classical computer, a system controller, and a quantum processor includes identifying a computational problem to be solved and a quantum algorithm to be used to solve the computational problem, detecting one or more faulty two-qubit gates among a plurality of two-qubit gates that can be applied to pairs of qubits in the quantum processor, compiling a computational task to solve the computational problem based on the quantum algorithm into a series of logic gates, including single-qubit gates and two-qubit gates that exclude the detected one or more faulty two-qubit gates, executing the series of logic gates on the quantum processor, measuring one or more of the qubits in the quantum processor, and outputting a solution to the identified computational problem derived from the measured results of the one or more of the qubits in the quantum processor.

Claims (76)

1 . A method of performing computation using a hybrid quantum-classical computing system comprising a classical computer, a system controller, and a quantum processor comprising a plurality of qubits, comprising:

detecting, by use of the classical computer and the system controller, one or more faulty two-qubit gates among a plurality of two-qubit gates that can be applied to pairs of qubits in the quantum processor, the detecting of the one or more faulty two-qubit gates comprising:

executing, by the system controller, two-qubit gates between all pairs of qubits in each class of a plurality of classes of qubits in the quantum processor;

measuring, by the system controller, an error syndrome of the two-qubit gates between all pairs of qubits in each class of the plurality of classes of qubits in the quantum processor;

selecting, by the classical computer, a group of candidate faulty two-qubit gates among two-qubit gates between all pairs of the qubits in the quantum processor based on the measured error syndromes; and

performing, by the system controller, a binary search in the selected group of candidate faulty two-qubit gates, to identify one or more faulty two-qubit gates in the selected group of candidate faulty two-qubit gates;

compiling, by use of the classical computer, a computational task to solve a computational problem based on a quantum algorithm into a series of logic gates, comprising a plurality of single-qubit gates and two-qubit gates of the plurality of two-qubit gates that exclude the detected one or more faulty two-qubit gates;

executing, by the use of the system controller, the series of logic gates on the quantum processor;

measuring, by the use of the system controller, one or more of the qubits in the quantum processor; and

outputting, by use of the classical computer, a solution to the computational problem derived from the measured results of the one or more of the qubits in the quantum processor.

2 . The method according to claim 1 , wherein

each class of the plurality of classes of qubit comprises a half of the qubits in the quantum processor, and

the plurality of classes comprises 2n classes, where 2 n is the number of qubits in the quantum processor.

3 . The method according to claim 2 , wherein:

the group of candidate faulty two-qubit gates comprises at most 2 n-1 two-qubit gates.

4 . The method according to claim 2 , wherein:

the group of candidate faulty two-qubit gates comprises 2 n-1-m two-qubit gates, where m is the number of the measured error syndromes that are faulty.

5 . The method according to claim 1 , wherein

the binary search comprises

dividing the selected group of candidate faulty two-qubit gates into two sub groups; and

measuring an error syndrome of one of the two sub groups.

6 . The method according to claim 1 , further comprising:

correcting, by the system controller, the detected one or more faulty two-qubit gates.

7 . The method according to claim 1 , further comprising:

repeating the detecting of one or more faulty two-qubit gates, the executing the series of logic gates, the measuring of one or more of the qubits in the quantum processor.

8 . A hybrid quantum-classical computing system, comprising:

a quantum processor comprising a group of trapped ions, each trapped ion of the group of trapped ions having two hyperfine states defining a qubit;

one or more lasers configured to emit a laser beam, which is provided to trapped ions in the quantum processor;

a classical computer; and

a system controller configured to control the emission of the laser beam from the one or more lasers to be applied to the trapped ions in the quantum processor, wherein

the classical computer and the system controller are configured to perform operations comprising:

detecting, by use of the classical computer and the system controller, one or more faulty two-qubit gates among a plurality of two-qubit gates that can be applied to pairs of qubits in the quantum processor, the detecting of the one or more faulty two-qubit gates comprising:

executing, by the system controller, two-qubit gates between all pairs of qubits in each class of a plurality of classes of qubits in the quantum processor;

measuring, by the system controller, an error syndrome of the two-qubit gates between all pairs of qubits in each class of the plurality of classes of qubits in the quantum processor;

selecting, by the classical computer, a group of candidate faulty two-qubit gates among two-qubit gates between all pairs of the qubits in the quantum processor based on the measured error syndromes; and

performing, by the system controller, a binary search in the selected group of candidate faulty two-qubit gates, to identify one or more faulty two-qubit gates in the selected group of candidate faulty two-qubit gates;

compiling, by use of the classical computer, a computational task to solve a computational problem based on the quantum algorithm into a series of logic gates, comprising a plurality of single-qubit gates and two-qubit gates of the plurality of two-qubit gates that exclude the detected one or more faulty two-qubit gates;

executing, by the use of the system controller, the series of logic gates on the quantum processor;

measuring, by the use of the system controller, one or more of the qubits in the quantum processor; and

outputting, by use of the classical computer, a solution to the computational problem derived from the measured results of the one or more of the qubits in the quantum processor.

9 . The hybrid quantum-classical computing system according to claim 8 , wherein

each class of the plurality of classes of qubit comprises a half of the qubits in the quantum processor, and

the plurality of classes comprises 2 log N classes, where N is the number of qubits in the quantum processor.

10 . The hybrid quantum-classical computing system according to claim 9 , wherein:

the group of candidate faulty two-qubit gates comprises at most N/2 two-qubit gates.

11 . The hybrid quantum-classical computing system according to claim 9 , wherein:

the group of candidate faulty two-qubit gates comprises 2 n-1-m two-qubit gates, where m is the number of the measured error syndromes that are faulty.

12 . The hybrid quantum-classical computing system according to claim 8 , wherein

the binary search comprises

dividing the selected group of candidate faulty two-qubit gates into two sub groups; and

measuring an error syndrome of one of the two sub groups.

13 . The hybrid quantum-classical computing system according to claim 8 , wherein the operations further comprises:

correcting, by the system controller, the detected one or more faulty two-qubit gates.

14 . The hybrid quantum-classical computing system according to claim 8 , wherein the operations further comprise:

repeating the detecting of one or more faulty two-qubit gates, the executing the series of logic gates, the measuring of one or more of the qubits in the quantum processor.

15 . A hybrid quantum-classical computing system comprising:

a classical computer;

a quantum processor comprising a plurality of qubits;

a system controller; and

non-volatile memory having a number of instructions stored therein which, when executed by one or more processors, causes the hybrid quantum-classical computing system to perform operations comprising:

detecting, by use of the classical computer and the system controller, one or more faulty two-qubit gates among a plurality of two-qubit gates that can be applied to pairs of qubits in the quantum processor, the detecting of the one or more faulty two-qubit gates comprising:

executing, by the system controller, two-qubit gates between all pairs of qubits in each class of a plurality of classes of qubits in the quantum processor;

measuring, by the system controller, an error syndrome of the two-qubit gates between all pairs of qubits in each class of the plurality of classes of qubits in the quantum processor;

selecting, by the classical computer, a group of candidate faulty two-qubit gates among two-qubit gates between all pairs of the qubits in the quantum processor based on the measured error syndromes; and

performing, by the system controller, a binary search in the selected group of candidate faulty two-qubit gates, to identify one or more faulty two-qubit gates in the selected group of candidate faulty two-qubit gates;

compiling, by use of the classical computer, a computational task to solve a computational problem based on the quantum algorithm into a series of logic gates, comprising a plurality of single-qubit gates and two-qubit gates of the plurality of two-qubit gates that exclude the detected one or more faulty two-qubit gates;

executing, by the use of the system controller, the series of logic gates on the quantum processor;

measuring, by the use of the system controller, one or more of the qubits in the quantum processor; and

outputting, by use of the classical computer, a solution to the computational problem derived from the measured results of the one or more of the qubits in the quantum processor.

16 . The hybrid quantum-classical computing system according to claim 15 , wherein

each class of the plurality of classes of qubit comprises a half of the qubits in the quantum processor, and

the plurality of classes comprises 2n classes, where 2 n is the number of qubits in the quantum processor.

17 . The hybrid quantum-classical computing system according to claim 15 , wherein

the binary search comprises

dividing the selected group of candidate faulty two-qubit gates into two sub groups; and

measuring an error syndrome of one of the two sub groups.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 1, 2022
From: MAKSYMOV, ANDRII; NGUYEN, JASON HIEU VAN; MARKOV, IGOR LEONIDOVICH; NAM, YUNSEONG
To: IONQ, INC.
Reel/Frame 060071/0287 →
Continuity (2)
Provisional Application 63191218 · May 20, 2021
Related Publication 20220383179A1 · Dec 1, 2022
References Cited (55)
US 10423887B2 · Roetteler et al. · 2019 [cited by applicant]
US 20180114138A1 · Monroe · 2018 [cited by examiner]
US 20180144262A1 · Roetteler · 2018 [cited by examiner]
US 20180260732A1 · Bloom · 2018 [cited by examiner]
US 20210142202A1 · Murali · 2021 [cited by examiner]
US 20210294680A1 · Palmer Da Silva · 2021 [cited by examiner]
WO 2020236231A1 · 2020 [cited by applicant]
Laborde Margarite et al. Finding Broken Gates in Quantum Circuits: Exploitng Hybrid Machine Learning, Quantum Information Processing, Springer US, New York. vol.l 19 No. 8 Jul. 3, 2020. [cited by applicant]
International Search Report dated Mar. 7, 2023 for Application No. PCT/US2022/029756. [cited by applicant]
F. Arute et al., “Quantum supremacy using a programmable superconducting processor,” Nature, vol. 574, No. 7779, pp. 505-510, Oct. 2019. [cited by applicant]
C. J. Ballance et al., “High-fidelity quantum logic gates using trapped-ion hyperfine qubits,” Phys. Rev. Lett., vol. 117, p. 060504, Aug. 2016. [cited by applicant]
R. Blümel et al., “Power-optimal, stabilized entangling gate between trapped-ion qubits,” npj Quantum Inf 7, 147, 2021. [cited by applicant]
R. Blu{umlaut over ( )}mel et al., “Efficient stabilized two-qubit gates on a trapped-ion quantum computer,” Phys. Rev. Lett., vol. 126, p. 220503, Jun. 2021. [cited by applicant]
J.-S. Chen et al., “Efficient- sideband-cooling protocol for long trapped-ion chains,” Phys. Rev. A, vol. 102, p. 043110, Oct. 2020. [cited by applicant]
S. Crain et al., “High-speed, low-crosstalk detection of a trapped 171Yb+ ion ancilla qubit using superconducting hanowire single photon detectors,” Communications Physics, 2, 97, 2019. [cited by applicant]
J. Emerson et al., “Scalable noise estimation with random unitary operators,” Journal of Optics B: Quantum and Semiclassical Optics, vol. 7, No. 10, pp. S347-S352, Sep. 2005. [cited by applicant]
A. Erhard et al., “Characterizing large-scale quantum computers via cycle benchmarking,” Nature Communications, vol. 10, No. 1, p. 1-7, Nov. 2019. [cited by applicant]
E. Farhi et al., “A quantum approximate optimization algorithm,” arXiv:1411.4028, 2014. [cited by applicant]
J. P. Gaebler et al., “High-fidelity universal gate set for 9Be+ ion qubits,” Phys. Rev. Lett., vol. 117, p. 060505, Aug. 2016. [cited by applicant]
T. J. Green et al., “Phase-modulated decoupling and error suppression in qubit-oscillator systems,” Phys. Rev. Lett., vol. 114, p. 120502, Mar. 2015. [cited by applicant]
N. Grzesiak et al., “Efficient arbitrary simultaneously entangling gates on a trapped-ion quantum computer,” Nature Communications, vol. 11, No. 1, pp. 1-6, Jun. 2020. [cited by applicant]
T. P. Harty et al., “High-fidelity preparation, gates, memory, and readout of a trapped-ion quantum bit,” Phys. Rev. Lett., vol. 113, p. 220501, Nov. 2014. [cited by applicant]
Honeywell, 2021, https://www.honeywell.com/en-us/company/quantum (Accessed May 20, 2021). [cited by applicant]
IBM, 2021, https://www.ibm.com/quantum-computing/ (Accessed May 20, 2021). [cited by applicant]
IonQ, “lonq announces third quarter 2021 financial results,” 2021, https://www.businesswire.com/news/home/20211115006227/en/ (Accessed Nov. 15, 2021). [cited by applicant]
A. Kan and Y. Nam, “Lattice Quantum Chromodynamics and Electrodynamics on a Universal Quantum Computer,” arXiv:2107.12769. [cited by applicant]
L. Lao et al., “Designing calibration and expressivity-efficient instruction sets for quantum computing,” 2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (ISCA), Jun. 2021. [cited by applicant]
A. C. Lee et al., “Engineering large stark shifts for control of individual clock state qubits,” Phys. Rev. A, vol. 94, p. 042308, Oct. 2016. [cited by applicant]
J. Lee et al., “Even more efficient quantum computations of chemistry through tensor hypercontraction,” PRX Quantum, vol. 2, p. 030305, Jul. 2021. [cited by applicant]
P. H. Leung et al., “Robust 2-qubit gates in a linear ion crystal using a frequency-modulated driving force,” Physical Review Letters, vol. 120, No. 2, p. 020501, Jan. 2018. [cited by applicant]
M. Li et al., “Generalized Hamiltonian to describe imperfections in ion-light interaction,” Physical Review A, vol. 102, No. 6, p. 062616, Dec. 2020. [cited by applicant]
N. M. Linke et al., “Experimental comparison of two quantum computing architectures,” Proceedings of the National Academy of Sciences, vol. 114, No. 13, p. 3305-3310, Mar. 2017. [cited by applicant]
T. Lubinski et al., “Application-oriented performance benchmarks for quantum computing,” times2021. [cited by applicant]
A. Maksymov et al., “Optimal calibration of gates in trapped-ion quantum computers,” Quantum Science and Technology, vol. 6, No. 3, p. 034009, Jun. 2021. [cited by applicant]
D. Maslov, “Basic circuit compilation techniques for an ion-trap quantum machine,” New Journal of Physics, vol. 19, No. 2, p. 023035, Feb. 2017. [cited by applicant]
D. Maslov et al., “An outlook for quantum computing [point of view],” Proc. IEEE, vol. 107, No. 1, pp. 5-10, 2019. [cited by applicant]
J. T. Merrill and K. R. Brown, “Progress in compensating pulse sequences for quantum computation,” arXive: 1203.6392, 2012. [cited by applicant]
J. T. Merrill et al., “Transformed composite sequences for improved qubit addressing,” Phys. Rev. A, vol. 90, p. 040301, Oct. 2014. [cited by applicant]
Y. S. Nam and R. Blu{umlaut over ( )}mel, “Analytical formulas for the performance scaling of quantum processors with a large number of defective gates,” Phys. Rev. A, vol. 92, p. 042301, Oct. 2015. [cited by applicant]
Y. Nam and D. Maslov, “Low-cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem,” npj Quantum Information, vol. 5, No. 1, pp. 1-8, May 2019. [cited by applicant]
Y. Nam et al., “Automated optimization of large quantum circuits with continuous parameters,” npj Quantum Information, vol. 4, No. 1, pp. 1-12, May 2018. [cited by applicant]
W. Paul, “Electromagnetic traps for charged and neutral particles,” Rev. Mod. Phys., vol. 62, pp. 531-540, Jul. 1990. [cited by applicant]
A. Peruzzo et al., “A variational eigenvalue solver on a photonic quantum processor,” Nature Communications, vol. 5, No. 1, pp. 1-7, Jul. 2014. [cited by applicant]
J. M. Pino et al., “Demonstration of the trapped-ion quantum CCD computer architecture,” Nature, vol. 592, No. 7853, pp. 209-213, Apr. 2021. [cited by applicant]
Rigetti, 2021, https://www.rigetti.com (Accessed May 20, 2021). [cited by applicant]
C. Shen and L.-M. Duan, “Correcting detection errors in quantum state engineering through data processing,” New J. Phys., vol. 14, No. 5, p. 053053, May 2012. [cited by applicant]
Y. Shi, “Both toffoli and controlled-not need little help to do universal quantum computing,” Quantum Info. Comput., vol. 3, No. 1, p. 84-92, Jan. 2003. [cited by applicant]
P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing, vol. 26, No. 5, p. 1484-1509, Oct. 1997. [cited by applicant]
A. Sørensen and K. Mølmer, “Quantum computation with ions in thermal motion,” Phys. Rev. Lett., vol. 82, pp. 1971-1974, Mar. 1999. [cited by applicant]
A. Sørensen and K. Mølmer, “Entanglement and quantum computation with ions in thermal motion,” Phys. Rev. A, vol. 62, p. 022311, Jul. 2000. [cited by applicant]
P. Wang et al., “Single ion qubit with estimated coherence time exceeding one hour,” Nature Communications, vol. 12, No. 1, Jan. 2021. [cited by applicant]
K. Wright et al., “Benchmarking an 11-qubit quantum computer,” Nature Communications, vol. 10, No. 1, pp. 1-6, Nov. 2019. [cited by applicant]
Y. Wu et al., “Noise analysis for high-fidelity quantum entangling gates in an anharmonic linear paul trap,” Phys. Rev. A, vol. 97, p. 062325, Jun. 2018. [cited by applicant]
E. Y. Zhu et al., “Generative quantum learning of joint probability distribution functions,” arXiv:2109.06315, 2021. [cited by applicant]
S.-L. Zhu et al., “Trapped ion quantum computation with transverse phonon modes,” Physical Review Letters, vol. 97, No. 5, p. 050505, Aug. 2006. [cited by applicant]