IP Library Granted Patent US 12,373,723
Granted Patent B2
US 12,373,723 · App. 17/027,146 · Granted Jul 29, 2025

Systems and methods for accelerated quantum optimization

Inventor: Eliot Kapit (Golden, CO)
Assignee: Colorado School of Mines
G06N10/60G06N10/40G06N20/00
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,373,723
App. No.
17/027,146
Granted
Jul 29, 2025
Kind
B2
Abstract

Example methods for quantum optimization include applying an optimization algorithm to a problem Hamiltonian (defined by qubit interaction constraint coefficients based on a binary optimization problem to find a local minimum state with initial total energy). The method further includes selecting a target energy that is less than the initial energy based on the binary optimization problem, modifying a subset of the qubit interaction constraint coefficient of the interaction constraint coefficients by a selected amount to reduce a total energy of the local minimum state to approximate the target total energy to provide an updated problem Hamiltonian, evolving a many-body quantum system (MBQS) based on the updated problem Hamiltonian by applying oscillating fields to single qubit transverse field terms and/or to transverse inter-qubit couplings of the MBQS for a time period, determining the total energy relative to the problem Hamiltonian based on the MBQS after expiration of the time period.

Claims (28)

1. A method, comprising:

applying an optimization algorithm to a problem Hamiltonian, wherein the problem Hamiltonian is defined by a plurality of qubit interaction constraint coefficients based on a binary optimization problem to find a local minimum state with initial total energy;

selecting a target total energy that is less than the initial total energy based on the binary optimization problem;

modifying a subset of the qubit interaction constraint coefficient of the plurality of qubit interaction constraint coefficients by a selected amount to reduce a total energy of the local minimum state to approximate the target total energy to provide an updated problem Hamiltonian;

evolving a many-body quantum system (MBQS) based on the updated problem Hamiltonian by applying oscillating fields to single qubit transverse field terms and/or to transverse inter-qubit couplings of the MBQS for a set time period;

determining the total energy relative to the problem Hamiltonian based on a quantum state of the MBQS in response to expiration of the set time period; and

providing the quantum state of the MBQS as a solution in response to the total energy relative to the problem Hamiltonian being within a defined range of the target total energy.

2. The method of claim 1 , further comprising disabling the oscillating fields applied to the single qubit transverse field terms and/or to the transverse inter-qubit couplings in response to expiration of the set time period prior to determining the total energy relative to the problem Hamiltonian based on the quantum state of the MBQS.

3. The method of claim 2 , further comprising measuring the quantum state of the MBQS after disabling the oscillating fields.

4. The method of claim 2 , wherein disabling the oscillating fields applied to the single qubit transverse field terms and/or to the transverse inter-qubit couplings in response to expiration of the set time period include ramping the disabling the oscillating fields applied to the transverse inter-qubit couplings down to zero strength.

5. The method of claim 1 , further comprising, prior to evolving the MBQS based on the updated problem Hamiltonian, initializing the MBQS by coupling the plurality of qubits to oscillators to provide the oscillating fields applied to the single qubit transverse field terms and/or to the transverse inter-qubit couplings.

6. The method of claim 1 , further comprising, in response to the total energy relative to the problem Hamiltonian being outside of the defined range of the target total energy:

evolving the MBQS based on the updated problem Hamiltonian by applying the oscillating fields to the single qubit transverse field terms and/or to the transverse inter-qubit couplings of the MBQS for a second set time period;

determining a second total energy relative to the problem Hamiltonian based on a second quantum state of the MBQS in response to expiration of the second set time period; and

providing the second quantum state of the MBQS as a solution in response to the second total energy relative to the problem Hamiltonian being within the defined range of the target total energy.

7. The method of claim 1 , wherein applying oscillations to the single qubit transverse field terms and/or to the transverse inter-qubit couplings of the MBQS for a set time period includes driving the qubits with the oscillating fields according to the driver Hamiltonian so that each of the oscillating fields drives one of the qubits.

8. The method of claim 1 , further comprising determining the plurality of qubit interaction constraint coefficients based on the binary optimization problem.

9. The method of claim 1 , further comprising assigning each of the oscillating fields a common amplitude and a selected frequency and sign.

10. The method of claim 9 , further comprising assigning a randomly-chosen frequency selected from a range of frequencies to the oscillating fields.

11. The method of claim 10 , wherein the range of frequencies is determined based on the problem Hamiltonian.

12. The method of claim 9 , further comprising assigning a first frequency to a first oscillating field of the oscillating fields and assigning a second frequency for a second oscillating field of the oscillating fields.

13. The method of claim 9 , further comprising assigning a first frequency to a first group of the oscillating fields and assigning a second frequency to a second group of the oscillating fields.

14. The method of claim 1 , wherein qubits of the MBQS each include a flux qubit having a loop of superconducting wire interrupted by a superconducting quantum interference device (SQUID).

15. The method of claim 14 , wherein applying oscillating fields to the single qubit transverse field terms and/or to the transverse inter-qubit couplings of the MBQS for a set time period includes driving the qubits transversely to a quantization axis, and includes threading an oscillating magnetic flux of each of the oscillating fields through the SQUID of a corresponding flux qubit.

16. The method of claim 1 , wherein qubits of the MBQS each include a flux qubit having a loop of superconducting wire interrupted by a superconducting quantum interference device (SQUID).

17. The method of claim 16 , wherein applying oscillating fields to the single qubit transverse field terms and/or to the transverse inter-qubit couplings of the MBQS for a set time period includes driving the qubits transversely to a quantization axis by coupling an oscillating voltage across the SQUID of a corresponding flux qubit.

18. The method of claim 1 , wherein evolving the MBQS further includes cooling the MBQS using lossy elements of the MBQS coupled to a subset of the qubits.

19. The method of claim 1 , further comprising causing the single qubit transverse field terms and coupling terms of the problem Hamiltonian to experience oscillatory rotations around a common set of axes.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 4, 2025
From: KAPIT, ELIOT
To: COLORADO SCHOOL OF MINES
Reel/Frame 071313/0827 →
Continuity (2)
Provisional Application 62903426 · Sep 20, 2019
Related Publication 20210089954A1 · Mar 25, 2021
References Cited (213)
US 20080313114A1 · Rose · 2008 [cited by examiner]
US 20120023053A1 · Harris · 2012 [cited by examiner]
US 20180218279A1 · Lechner · 2018 [cited by examiner]
US 20190266508A1 · Bunyk · 2019 [cited by examiner]
US 20210166148A1 · Matsuura · 2021 [cited by examiner]
US 20220292235A1 · Susa · 2022 [cited by examiner]
US 20240013088A1 · Kapit et al. · 2024 [cited by applicant]
WO 2019084286A1 · 2019 [cited by applicant]
Hen et al., “Quantum Annealing for Constrained Optimization,” Physical Review Applied 5, 034007 (2016) (Year: 2016). [cited by examiner]
Kapit, Eliot, “Improved quantum annealer performance from oscillating transverse fields,” arXiv: 1710.11056v1 [quant-ph] Oct. 30, 2017 (Year: 2017). [cited by examiner]
Lucas, Andrew, “Hard combinatorial problems and minor embeddings on lattice graphs,” arXiv: 1812.01789v1 [quant-ph] Dec. 5, 2018 (Year: 2018). [cited by examiner]
Pastorello et al., “Learning adiabatic quantum algorithms for solving optimization problems,” arXiv:1909.06870v1 [quant-ph] Sep. 15, 2019 (Year: 2019). [cited by examiner]
Leghtas et al., “Hardware-Efficient Autonomous Quantum Memory Protection”, Phys. Rev. Lett. 111, 120501 (2013), 120501-1-120501-5. [cited by applicant]
Leghtas et al. “Confining the State of Light to a Quantum Manifold by Engineered Two-Photon Loss”, Science 347, 6224, arZiv:1412.4633v1 (2014), 32 pgs. [cited by applicant]
Lescanne et al., “Exponential Suppression of Bit-Flips in a Qubit Encoded in a Oscillator”, Nature Physics 16, 509, arXiv:1907.11729v1 (2019), 18 pgs. [cited by applicant]
Malekakhlagh et al., “First-Principles Analysis of Cross-Resonance Gate Operation”, Physical Review A 102, 042605 (2020), 30 pgs. [cited by applicant]
Marwaha et al., “Bounds on Approximating Max kXOR with Quantum and Classical Local Algorithms”, Quantum 6, 757 (2022), 25 pgs. [cited by applicant]
McClean et al. “The Theory of Variational Hybrid Quantum-Classical Algorithms”, New Journal of Physics 18, 023023, arXiv:1509.04279v1 (2015), 20 pgs. [cited by applicant]
McKay et al., “A Universal Gate for Fixed-Frequency Qubits via a Tunable Bus”, arXiv:1604.03076 (2016), 10 pgs. [cited by applicant]
Mézard et al., “Analytic and Algorithmic Solution of Random Satisfiability Problems”, Science 297, 812 (2002), pp. 812-815. [cited by applicant]
Mézard et al., “Clustering of Solutions in the Random Satisfiability Problem”, Physical Review Letters 94, 197205 (2005), 4 pgs. [cited by applicant]
Michael et al., “New Class of Quantum Error-Correcting Codes for a Bosonic Mode”, Phys. Rev. X 6, 031006 (2016), 25 pgs. [cited by applicant]
Mirrahimi et al., “Dynamically Protected Cat-Qubits: A New Paradigm for Universal Quantum Computation”, New J. Phys. 16, 045014, arXiv:1312.2017v1 (2013), 28 pgs. [cited by applicant]
Montanari, “Optimization of the Sherrington-Kirkpatrick Hamiltonian”, SIAM Journal on Computing pp. FOCS19-1 (2021), 38 pgs. [cited by applicant]
Amin et al., “Quantum Error Mitigation in Quantum Annealing”, arXiv:2311.01306v1 [quant-ph] (2023), 10 pgs. [cited by applicant]
Mossi et al., “Embedding Quantum Optimization Problems using AC Driven Quantum Ferromagnets”, arXiv preprint arXiv:2306.10632 (2023), 22 pgs. [cited by applicant]
Motzoi et al., “Simple Pulses for Elimination of Leakage in Weakly Nonlinear Qubits”, Phys. Rev. Lett. 103, 110501 (2009), 10.1103/Phys-RevLett. 103.110501, pp. 110501-1-110501-4. [cited by applicant]
Mourik et al., “Signatures of Majorana Fermions in Hybrid Superconductor-Semiconductor Nanowire Devices”, Science 336, 1003 (2012), 28 pgs. [cited by applicant]
Neill et al., “A Blueprint for Demonstrating Quantum Supremacy with Superconducting Qubits”, arXiv preprint arXiv:1709.06678 (2017), 22 pgs. [cited by applicant]
Nguyen et al., “Quantum Optimization with Arbitrary Connectivity using Rydberg Atom Arrays”, PRX Quantum 4, 010316 (2023), 19 pgs. [cited by applicant]
Ofek et al., “Demonstrating Quantum Error Correction that Extends the Lifetime of Quantum Information”, Nature 536, 441 (2016), 10.1038/nature18949, 44 pgs. [cited by applicant]
Pal et al., “The Many-Body Localization Phase Transition”, Physical review b 82, 174411 (2010), 5 pgs. [cited by applicant]
Parisi, Infinite Number of Order Parameters for Spin-Glasses, Physical Review Letters 43, 1754 (1979), 3 pgs. [cited by applicant]
Perez et al., “Error-Divisible Two-Qubit Gates”, arXiv preprint arXiv:2110.11537 (2021), 11 pgs. [cited by applicant]
Peruzzo et al., “A Variational Eigenvalue Solver on a Quantum Processor”, Nature communications 5, 4213, arXiv:1304.3061v1 (2013), 10 pgs. [cited by applicant]
Pietracaprina et al., “Forward Approximation as a mean-field approximation for the Anderson and Many-Body Localization Transitions”, Physical Review B 93, 054201 (2016), pp. 054201-1-054201-15. [cited by applicant]
Prada et al., “From Andreev to Majorana Bound States in Hybrid Superconductor-Semiconductor Nanowires”, Nature Reviews Physics 2, 575 (2020), 23 pgs. [cited by applicant]
Reagor et al., “Quantum Memory with Millisecond Coherence in Circuit QED”, Phys. Rev. B 94, 014506 (2016), pp. 014506-1-014506-8. [cited by applicant]
Roland et al., “Quantum Search by Local Adiabatic Evolution”, Phys. Rev. A 65, 042308 (2002), pp. 042308-1-042308-6. [cited by applicant]
Santagati et al., “Witnessing Eigenstates for Quantum Simulation of Hamiltonian Spectra”, Science advances 4, eaap9646 (2018), 27 pgs. [cited by applicant]
Scardicchio et al., “Perturbation Theory Approaches to Anderson and Many-Body Localization: Some Lecture Notes”, arXiv preprint arXiv:1710.01234 (2017), 41 pgs. [cited by applicant]
Sels et al., “Minimizing Irreversible Losses in Quantum Systems by Local Counterdiabatic Driving”, Proceedings of the National Academy of Sciences 114, E3909 (2017), 8 pgs. [cited by applicant]
Serbyn et al., “Thouless Energy and Multifractality Across the Many-Body Localization Transition”, Physical Review B 96, 104201 (2017), 104201-1-104201-12. [cited by applicant]
Shaydulin et al., “Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem”, arXiv preprint arXiv:2308.02342, arXiv:2308.02342v2 (2024), 33 pgs. [cited by applicant]
Smelyanskiy et al., “Intermittency of Dynamical Phases in a Quantum Spin Glass”, arXiv preprint arXiv:1907.01609 (2019), 16 pgs. [cited by applicant]
Smelyanskiy et al., “Non-Ergodic Delocalized States for Efficient Population Transfer within a Narrow Band of the Energy Landscape”, arXiv preprint arXiv: 1802.09542 (2018), 48 pgs. [cited by applicant]
Somoroff et al., “Millisecond Coherence in a Superconducting Qubit”, arXiv preprint arXiv:2103.08578 (2021), 14 pgs. [cited by applicant]
Srinivasan et al., “Tunable Coupling in Circuit Quantum Electrodynamics Using a Superconducting Charge Qubit with a V-Shaped Energy Level Diagram”, Phys. Rev. Lett. 106, 083601 (2011), pp. 083601-1-083601-4. [cited by applicant]
Stanescu et al., “Majorana Fermions in Semiconductor Nanowires: Fundamentals, Modeling, and Experiment”, Journal of Physics: Condensed Matter 25, 233201 (2013), 32 pgs. [cited by applicant]
Sung et al., “Realization of High-Fidelity CZ and ZZ-free iSWAP Gates with a Tunable Coupler”, arXiv:2011.01261 quant-ph] (2021), 34 pgs. [cited by applicant]
Susa et al., “Quantum Annealing of the p. spin Model under Inhomogeneous Transverse Field Driving”, Phys. Rev. A 98, 042326 (2018), URL https://link.aps.org/doi/10.1103/PhysRevA.98.042326, pp. 042326-1-042326-13. [cited by applicant]
Suzuki et al., “Qulacs: A Fast and Versatile Quantum Circuit Simulator for Research Purpose”, Quantum 5, 559 (2021), 34 pgs. [cited by applicant]
Tang et al., “Unconventional Quantum Annealing Methods for Difficult Trial Problems”, Physical Review A 103, 032612 (2021), 032612-1-032612-12. [cited by applicant]
Tazi et al., “Folded Spectrum VQE: A Quantum Computing Method for the Calculation of Molecular Excited States”, arXiv preprint arXiv:2305.04783v2 (2024), 17 pgs. [cited by applicant]
Terhal, “Quantum Error Correction for Quantum Memories”, Rev. Mod. Phys. 87, 307 (2015), 10.1103/RevModPhys.87.307, pp. 307-346. [cited by applicant]
Tilly et al., “The Variational Quantum Eigensolver: A Review of Methods and Best Practices”, Physics Reports 986, 1 (2022), 156 pgs. [cited by applicant]
Touzard et al., “Coherent Oscillations Inside a Quantum Manifold Stabilized by Dissipation”, Physical Review X 8, 021005 (2018), pp. 021005-1-021005-7. [cited by applicant]
Venturelli et al., “Quantum Optimization of Fully Connected Spin Glasses”, Physical Review X 5, 031040 (2015), pp. 031040-1-031040-8. [cited by applicant]
Vy et al., “Error-Transparent Evolution: The Ability of Multi-Body Interactions to Bypass Decoherence”, New Journal of Physics 15, 053002 (2013), 14 pgs. [cited by applicant]
Weiss et al., “Spectrum and Coherence Properties of the Current-Mirror Qubit”, Physical Review B 100, 224507 (2019), pp. 224507-1-224507-17. [cited by applicant]
Xiong et al., “Arbitrary Controlled-Phase Gate on Fluxonium Qubits Using Differential ac Stark Shifts”, Physical Review Research 4, 023040 (2022), pp. 023040-1-023040-16. [cited by applicant]
Yan et al., “Rotating-Frame Relaxation as a Noise Spectrum Analyzer of a Superconducting Qubit Undergoing Driven Evolution”, Nature Communications 4, 2337, arXiv:1508.06436v1 (2015), 31 pgs. [cited by applicant]
Farhi et al., “Unstructured Randomness, Small Gaps and Localization”, arXiv preprint arXiv:1010.0009 (2010), 17 pgs. [cited by applicant]
Farhi et al. “The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size”, Quantum 6, 759 (2022), 32 pgs. [cited by applicant]
Farhi et al “Quantum Computation by Adiabatic Evolution”, arXiv:quant-ph/0001106 (2000), 24 pgs. [cited by applicant]
Finnila et al., “Quantum Annealing: A New Method for Minimizing Multidimensional Functions”, Chemical physics letters 219, 343 (1994), 9 pgs. [cited by applicant]
Flensberg et al., “Engineered Platforms for Topological Superconductivity and Majorana Zero Modes”, Nature Reviews Materials 6, 944 (2021), 17 pgs. [cited by applicant]
Foxen et al., “Demonstrating a Continuous Set of Two-Qubit Gates for Near-Term Quantum Algorithms”, arXiv preprint arXiv:2001.08343 (2020), 20 pgs. [cited by applicant]
Fowler et al. “Surface Codes: Towards Practical Large-Scale Quantum Computation”, Phys. Rev. A 86, 032324 (2012), 10.1103/Phys-RevA.86.032324, pp. 032324-1-032324-48. [cited by applicant]
Garey et al., “Some Simplified NP-Complete Problems”, Proceedings of the sixth annual ACM symposium on Theory of computing (1974), pp. 47-63. [cited by applicant]
Geller et al., “Tunable Coupler for Superconducting Xmon Qubits: Perturbative Nonlinear Modeal”, arXiv: 1405.1915 (2014), 10 pgs. [cited by applicant]
Gilyén et al, “(Sub) Exponential Advantage of Adiabatic Quantum Computation with No Sign Problem”, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (2021), pp. 1357-1369. [cited by applicant]
Granet et al., “Benchmarking a Heuristic Floquet Adiabatic Algorithm for the Max-Cut Problem”, arXiv preprint arXiv:2404.16001 (2024), 6 pgs. [cited by applicant]
Graß, “Quantum Annealing with Longitudinal Bias Fields”, Phys. Rev. Lett. 123, 120501 (2019), URL https://link.aps.org/doi/10.1103/PhysRevLett.123.120501, 120501-1-120501-6. [cited by applicant]
Grattan et al., “Exponential Acceleration of Macroscopic Quantum Tunneling in a Floquet Ising Model”, arXiv:2311.17814v3 (2024), 2311.17814, 13 pgs. [cited by applicant]
Grest et al, “Cooling-Rate Dependence for the Spin-Glass Ground-State Energy: Implications for Optimization by Simulated Annealing”, Physical Review Letters 56, 1148 (1986), 4 pgs. [cited by applicant]
Groszkowski et al., Coherence properties of the 0-π qubit, New Journal of Physics 20, 043053 (2018), 21 pgs. [cited by applicant]
Grover et al. “Fast, Lifetime-Preserving Readout for High-Coherence Quantum Annealers”, PRX Quantum 1, 020314 (2020), 020314-1-020314-13. [cited by applicant]
Gul et al, “Ballistic Majorana Nanowire Devices”, Nature nanotechnology 13, 192, zrZiv:1603.04069v3 (2021), 19 pgs. [cited by applicant]
Gyenis et al, “Moving Beyond the Transmon: Noise-Protected Superconducting Quantum Circuits”, PRX Quantum 2, 030101 (2021), 16 pgs. [cited by applicant]
Gyenis et al., “Experimental Realization of an Intrinsically Error-Protected Superconducting Qubit”, arXiv preprint arXiv:1910.07542 (2019), 31 pgs. [cited by applicant]
Harris et al. “Sign- and Magnitude-Tunable Coupler for Superconducting Flux Qubits”, Phys. Rev. Lett. 98, 177001 (2007), 177001-1-177001-4. [cited by applicant]
Hartmann et al., Phase Transitions in Combinatorial Optimization Problems: Basics, Algorithms and Statistical Mechanics (John Wiley & Sons, 2006), 45 pgs. [cited by applicant]
Hastad et al., On the Advantage over a Random Assignment, Proceedings of the thirty-fourth annual ACM symposium on Theory of computing (2002), pp. 43-52. [cited by applicant]
Håstad, “Some Optimal Inapproximability Results”, Journal of the ACM (JACM) 48, 798 (2001), pp. 798-859. [cited by applicant]
Hastings “A Short Path Quantum Algorithm for Exact Optimization”, Quantum 2, 78 (2018), 22 pgs. [cited by applicant]
Hastings “The Power of Adiabatic Quantum Computation with No Sign Problem”, Quantum 5, 597 (2021), 24 pgs. [cited by applicant]
Hauke et al. “Perspectives of Quantum Annealing: Methods and Implementations”, arXiv preprint arXiv:1903.06559 (2019), 37 pgs. [cited by applicant]
Heeres et al., “Implementing a Universal Gate Set on a Logical Qubit Encoded in an Oscillator”,arXiv:1608.02430 (2016), 16 pgs. [cited by applicant]
Heim et al., “Quantum versus Classical Annealing of Ising Spin Glasses”, Science 348, 215, arXiv:1411.5693v1 (2014), 5 pgs. [cited by applicant]
Hillar et al., “Most Tensor Problems are NP-Hard”, Journal of the ACM (JACM) 60, 1 (2013), 38 pgs. [cited by applicant]
Hochbaum, “Approrimation Algorithms for NP-Hard Problems”, ACM Sigact News 28, 40 (1997), 13 pgs. [cited by applicant]
Ibrahimi et al. “The Set of Solutions of Random XORSAT Formulae”, Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms (SIAM, 2012), pp. 760-779. [cited by applicant]
Isakov et al. “Understanding Quantum Tunneling through Quantum Monte Carlo Simulations”, Physical review letters 117, 180402 (2016), 180402-1-180402-6. [cited by applicant]
Jiang et al, “Path-Integral Quantum Monte Carlo Simulation with Open-Boundary Conditions”, Physical Review A 96, 042330 (2017), 11 pgs. [cited by applicant]
Jiang et al., “Scaling Analysis and Instantons for Thermally-Assisted Tunneling and Quantum Monte Carlo Simulations”, Physical Review A 95, 012322 (2017), 15 pgs. [cited by applicant]
Jones et al., “Random Max-CSPs Inherit Algorithmic Hardness from Spin Glasses”,arXiv preprint arXiv:2210.03006v2 (2023), 41 pgs. [cited by applicant]
Kadowaki et al., “Quantum Annealing in the Transverse Ising Model”, Physical Review E 58, 5355 (1998), 23 pgs. [cited by applicant]
Kapit et al., “Noise-Tolerant Quantum Speedups without Fine Tuning”, Quantum Science and Technology 6, 025013 (2021), 31 pgs. [cited by applicant]
Kapit, “Error-Transparent Quantum Gates for Small Logical Qubit Architectures”, arXiv:1703.09762 (2017), 8 pgs. [cited by applicant]
Kapit, “Hardware-Efficient and Fully Autonomous Quantum Error Correction in Superconducting Circuits”, Phys. Rev. Lett. 116, 150501 (2016), 10.1103/PhysRevLett.116.150501, 150501-1-150501-5. [cited by applicant]
Kapit, “Error-Transparent Quantum Gates for Small Logical Qubit Architectures”, Physical review letters 120, 050503 (2018), 050503-1-050503-5. [cited by applicant]
Kapit, “The Upside of Noise: Engineered Dissipation as a Resource in Superconducting Circuits”, Quantum Science and Technology 2, 033002 (2017), 24 pgs. [cited by applicant]
Kechedzhi et al., “Efficient Population Transfer via Non-Ergodic Extended States in Quantum Spin Glass”, arXiv preprint arXiv: 1807.04792 (2018), 16 pgs. [cited by applicant]
Kim et al., “Rydberg Quantum Wires for Maximum Independent Set Problems with Nonplanar and High-Degree Graphs”, arXiv preprint arXiv:2109.03517 (2021), 8 pgs. [cited by applicant]
King et al., “Scaling Advantage in Quantum Simulation of Geometrically Frustrated Magnets”, et al., arXiv preprint arXiv:1911.03446 (2019), 29 pgs. [cited by applicant]
Knysh, “Zero-Temperature Quantum Annealing Bottlenecks in the Spin-Glass Phase”, Nature communications 7 (2016), 9 pgs. [cited by applicant]
Könz et al., “Embedding Overhead Scaling of Optimization Problems in Quantum Annealing”, PRX Quantum 2, 040322 (2021), 040322-1-040322-11. [cited by applicant]
Korte et al., “Combinatorial Optimization”, Fifth Edition, vol. 11 (Springer, 2011), 664 pgs. [cited by applicant]
Kowalsky et al. “3-Regular 3-XORSAT Planted Solutions Benchmark of Classical and Quantum Heuristic Optimizers”, arXiv preprint arXiv:2103.08464v2, (2022), 17 pgs. [cited by applicant]
Krzakala et al., “Landscape Analysis of Constraint Satisfaction Problems”, Physical Review E 76, 021122 (2007), 021122-1-021122-13. [cited by applicant]
Kuwahara et al. “Floquet-Magnus Theory and Generic Transient Dynamics in Periodically Driven Many-Body Quantum Systems”, Annals of Physics 367, 96 (2016), 19 pgs. [cited by applicant]
S. Adachi, “III-V Ternary and Quaternary Compounds,” in Springer Handbook of Electronic and Photonic Materials, edited by S. Kasap and P. Capper (Springer International Publishing, Cham, 2017) pp. 725-741. [cited by applicant]
M. P. C. M. Krijn, “Heterojunction band offsets and effective masses in III-V quaternary alloys,” Semiconductor Science and Technology 6, 27-31 (1991 ). [cited by applicant]
B. Streetman and S. Banerjee, “Energy bands and charge carriers in semiconductors,” in Solid State Electronic Devices (Pearson, 2015) Chap. 5, pp. 238-243. [cited by applicant]
“AC/DC Module User's Guide”, https://doc.comsol.com/5.5/docserver/#!/com.comsol.help.acdc/html_ACDCModuleManual.html, (2020), pp. 1-366. [cited by applicant]
“Semiconductor Module User's Guide”, https://doc.comsol.com/5.5/docserver/#!/com.comsol.help.semicond/html_SemiconductorModuleManual.html, (2020), pp. 1-309. [cited by applicant]
Ancona, M. G., “Density-Gradient Theory: A Macroscopic Approach to Quantum Confinement and Tunneling in Semiconductor Devices”, Journal of Computational Electronics 10:65-97, (2011), pp. 1-34. [cited by applicant]
Arute, et al., “Quantum Supremacy using a Programmable Superconducting Processor”, Article, Nature 574, (2019), pp. 505-510. [cited by applicant]
Barends, et al., “Diabatic Gates for Frequency-Tunable Superconducting Qubits”, Phys. Rev. Lett. 123, 210501, (2019), pp. 210501-1-210501-6. [cited by applicant]
Bialczak, et al., “Fast Tunable Coupler for Superconducting Qubits”, Phys. Rev. Lett. 106, 060501, (2011), pp. 060501-1-060501-4. [cited by applicant]
Casparis, et al., “Voltage-Controlled Superconducting Quantum Bus”, Phys. Rev. B 99, 085434, (2019), pp. 085434-1-085434-7. [cited by applicant]
Hirabayashi, et al., “Dielectric Theory of the Barrier Height at Metal-Semiconductor and Metal-Insulator Interfaces”, Phys. Rev. B, vol. 3, (1971), pp. 4023-4025. [cited by applicant]
Huang, et al., “Universal Stabilization of Single-Qubit States using a Tunable Coupler”, Phys. Rev. A97, 062345, (2018), pp. 062345-1-062345-11. [cited by applicant]
Kim, et al., “Notes on Fermi-Dirac Integrals 4th Edition”, arXiv:0811.0116 [cond-mat.mes-hall], (2019), pp. 1-15. [cited by applicant]
Koch, et al., “Charge-Insensitive Qubit Design Derived from the Cooper Pair Box”, Phys. Rev. A 76, 042319, (2007), pp. 042319-1-042319-19. [cited by applicant]
Larsen, et al., “Semiconductor-Nanowire-Based Superconducting Qubit”, Phys. Rev. Lett. 115, 127001, (2015), pp. 127001-1-127001-5. [cited by applicant]
Li, et al., “Improvements in Silicon Oxide Dielectric Loss for Superconducting Microwave Detector Circuits”, IEEE Transactions on Applied Superconductivity, 1501204. vol. 23, No. 3, (2013), pp. 1-4. [cited by applicant]
Lu, et al., “Universal Stabilization of a Parametrically Coupled Qubit”, Phys. Rev. Lett. 119, 150502, (2017), pp. 150502-1-150502-5. [cited by applicant]
Mayer, W., “Superconducting Proximity Effect in Epitaxial Al-InAs Heterostructures”, Appl. Phys. Lett. 114, 103104, (2019), pp. 103104-1-103104-5. [cited by applicant]
McRae, et al., “Cryogenic Microwave Loss in Epitaxial Al/GaAs/Al Trilayers for Superconducting Circuits”, arXiv:2009.10101, (2020), pp. 1-5. [cited by applicant]
Minev, Z. K., “Catching and Reversing a Quantum Jump Mid-Flight”, arXiv:1902.10355 [quant-ph], (2019), pp. 1-209. [cited by applicant]
Minev, et al., “Energy-Participation Quantization of Josephson Circuits”, arXiv:2010.00620 [quant-ph], (2020), pp. 1-42. [cited by applicant]
Nigg, et al., “Black-Box Superconducting Circuit Quantization”, Phys. Rev. Lett. 108, 240502, (2012), pp. 240502-1-240502-5. [cited by applicant]
Oliver, W. D., “Materials in Superconducting Quantum Bits”, MRS Bulletin, vol. 38, (2013), pp. 816-825. [cited by applicant]
Orlando, et al., “Superconducting Persistent-Current Qubit”, Phys. Rev. B 60, 15398, (1999), pp. 15398-15413. [cited by applicant]
Sardashti, et al., “Voltage-Tunable Superconducting Resonators: A Platform for Random Access Quantum Memory”, IEEE Transactions on Quantum Engineering, 5502107, vol. 1, (2020), pp. 1-7. [cited by applicant]
Schuster, D. I., “Circuit Quantum Electrodynamics, Ph.D. Thesis”, Yale University, (2007), pp. 1-255. [cited by applicant]
Scigliuzzo, et al., “Phononic Loss in Superconducting Resonators on Piezoelectric Substrates”, New Journal of Physics 22, 053027, (2020), pp. 1-9. [cited by applicant]
Solgun, et al., “Blackbox Quantization of Superconducting Circuits using Exact Impedance Synthesis”, Phys. Rev. B 90, 134504, (2014), pp. 134504-1-134504-12. [cited by applicant]
Wang, C., “Surface Participation and Dielectric Loss in Superconducting Qubits”, Appl. Phys. Lett. 107, 162601, (2015), pp. 2-11. [cited by applicant]
Wenner, et al., “Surface Loss Simulations of Superconducting Coplanar Waveguide Resonators”, Appl. Phys. Lett. 99, 113513, (2011), pp. 1-4-S1-S4. [cited by applicant]
Wickramasinghe, et al., “Transport Properties of Near Surface InAs Two-Dimensional Heterostructures”, Appl. Phys. Lett. 113, 262104, (2018), pp. 1-5. [cited by applicant]
Yang et al., “Optimizing Variational Quantum Algorithms Using Pontryagin's Minimum Principle”, Physical Review X 7, 021027 (2017), pp. 021027-1-021027-10. [cited by applicant]
Zhang et al., “Adaptive variational Quantum Eigensolvers for Highly Excited States”, Physical Review B 104, 075159 (2021), pp. 075159-1-075159-9. [cited by applicant]
Zhu et al., “Adaptive Quantum Approximate Optimization Algorithm for Solving Combinatorial Problems on a Quantum Computer”, Physical Review Research 4, 033029 (2022), pp. 033029-1-033029-9. [cited by applicant]
Abanin, et al. “Exponentially Slow Heating in Periodically Driven Many-Body Systems”, Physical Review Letters 115, 256803 (2015), pp. 1-5. [cited by applicant]
Abdelhafez et al., “Universal Gates for Protected Superconducting Qubits using Optimal Control”, Physical Review A 101, 022321 (2020), pp. 022321-1-022321-13. [cited by applicant]
Abrams et al, “Implementation of the XY Interaction Family with Calibration of a Single Pulse”, arXiv preprint arXiv:1912.04424 (2019), pp. 1-13. [cited by applicant]
Albash et al., “Adiabatic Quantum Computing”, arXiv:1611.04471v2 (2018). [cited by applicant]
Albash et al., “Demonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing”, Physical Review X 8, 031016 (2018), pp. 031016-1-031016-26. [cited by applicant]
Albert et al. “Holonomic Quantum Control with Continuous Variable Systems”, Phys. Rev. Lett. 116, 140502 (2016) pp. 1-6. [cited by applicant]
Albert et al, “Pair-Cat Codes: Autonomous Error-Correction with Low-Order Nonlinearity”, Quantum Science and Technology 4, 035007 (2019), pp. 1-29. [cited by applicant]
Alekhnovich, “More on Average Case vs Approximation Complexity”, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. (IEEE, 2003), pp. 1-10. [cited by applicant]
Allen et al., “How to Refute a Random CSP”, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (IEEE, 2015), pp. 689-708. [cited by applicant]
Altarelli et al. “Relationship between Clustering and Algorithmic Phase Transitions in the Random k-XORSAT Model and its NP-Complete Extensions”, Journal of Physics: Conference Series (IOP Publishing, 2008), vol. 95, p.… [cited by applicant]
Altshuler et al. Anderson Localization makes Adiabatic Quantum Optimization Fail, Proceedings of the National Academy of Sciences 107, 12446 (2010), 5 pgs. [cited by applicant]
Andriyash et al., “Can Quantum Monte Carlo Simulate Quantum Annealing?”, arXiv preprint arXiv:1703.09277 (2017), pp. 1-12. [cited by applicant]
Anshu et al, “Concentration Bounds for Quantum States and Limitations on the QAOA from Polynomial Approximations”, Quantum 7, 999 (2023), pp. 1-28. [cited by applicant]
Anshu et al, “Improved Approximation Algorithms for Bounded-Degree Local Hamiltonians”, Physical Review Letters 127, 250502 (2021), pp. 250502-1-250502-6. [cited by applicant]
Arora et al., “Computational Complexity: a Modern Approach”, Draft of Book: Dated Jan. 2007, Cambridge University Press, 2009), 489 pgs. [cited by applicant]
Atia et al., “How the High-Energy Part of the Spectrum Affects the Adiabatic Computation Gab”, arXiv preprint arXiv:1906.02581 (2019) pp. 1-14. [cited by applicant]
Babbush et al. “Focus Beyond Quadratic Speedups for Error-Corrected Quantum Advantage”, PRX Quantum 2, 010103 (2021) pp. 010103-1-010103-11. [cited by applicant]
Baldwin et al., “Quantum Algorithm for Energy Matching in Hard Optimization Problems”, Physical Review B 97, 224201 (2018), pp. 224201-1-002201-19. [cited by applicant]
Baldwin et al., “The Many-Body Localized Phase of the Quantum Random Energy Model” Physical Review B 93, 024202 (2016), pp. 024202-1-024202-15. [cited by applicant]
Baldwin, “Clustering of Nonergodic Eigenstates in Quantum Spin Glasses ”, Physical Review Letters 118, 127201 (2017), pp. 127201-1-127201-6. [cited by applicant]
Bao et al., “Optimal Control of Superconducting Gmon Qubits using Pontryagin's Minimum Principle: Preparing a Maximally Entangled State with Singular Bang-Bang Protocols”, Physical Review A 97, 062343 (2018), pp. 062343… [cited by applicant]
Bapst et al., The Quantum Adiabatic Algorithm Applied to Random Optimization Problems: The Quantum Spin Glass Perspective, Physics Reports 523, 127, arXiv: 1210.0811v2, (2012), 154 pgs. [cited by applicant]
Barak et al., “Beating the Random Assignment on Contraint Satisfaction Problems of Bounded Degree”, arXiv preprint arXiv:1505.03424 (2015). [cited by applicant]
Barends et al., “Logic Gates at the Surface Code threshold: Superconducting Qubits Poised for Fault-Tolerant Quantum Computing”, Nature 508, 500, 10.1038/nature13171 (2014), 16 pgs. [cited by applicant]
Basso et al. “Performance and Limitations of the QAOA at Constant Levels on Large Sparse Hypergraphs and Spin Glass Models”, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2022), pp. 33… [cited by applicant]
Basso et al. “The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model”, arXiv preprint arXiv:2110.14206v3 (2022), 39 pgs. [cited by applicant]
Bauza et al., “Scaling Advantage in Approximate Optimization with Quantum Annealing”, arZiv:2401.07184v1 (2024), 11 pgs. [cited by applicant]
Bellitti et al., “Entropic Barriers as a Reason for Hardness in Both Classical and Quantum Algorithms”, zrXiv:2102.000182v2 (2021). [cited by applicant]
Benchasattabuse et al., “Lower Bounds on No. of QAOA Rounds Required for Guaranteed Approximation Rations”, arXiv preprint arXiv:2308.15442 (2023), 16 pgs. [cited by applicant]
Blais et al. “Tunable Coupling of Superconducting Qubits”, Phys. Rev. Lett. 90, 127901 (2003), 127901-1-127901-4. [cited by applicant]
Boixo et al. “Quantum Annealing with More than One Hundred Qubits”, Nature Physics 10, 218, arXiv:1304.4595v2 (2013), 26 pgs. [cited by applicant]
Boulebnane et al., “Predicting Parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the Infinite-Size Limit”, arXiv preprint arXiv:2110.10685 (2021), 59 pgs. [cited by applicant]
Bravyi et al. “Hybrid Quantum-Classical Algorithms for Approximate Graph Coloring”, Quantum 6, 678 (2022), 27 pgs. [cited by applicant]
Bravyi et al “Schrieffer-Wolff Transformation for Quantum Many-Body Systems”, Annals of physics 326, 2793 (2011), 50 pgs. [cited by applicant]
Bylander et al., “Dynamical Decoupling and Noise Spectroscopy with a Superconducting Flux Qubit”, Nature Physics 7, 565 (2011), 24 pgs. [cited by applicant]
Čepaité et al, “Counterdiabatic Optimized Local Driving”, PRX Quantum 4, 010312 (2023), URL https://link.aps. org/doi/10.1103/PRXQuantum.4.010312, pp. 010312-1-010312-21. [cited by applicant]
Chen et al., “Qubit Architecture with High Coherence and Fast Tunable Coupling”, Phys. Rev. Lett. 113, 220502 (2014), pp. 220502-1-220502-5. [cited by applicant]
Choi, “Minor-Embedding in Adiabatic Quantum Computation: II. Minor-Universal Graph Design”, Quantum Information Processing 10, 343, zrXiv:1001.3116v2 (2010), 13 pgs. [cited by applicant]
Choi “Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem”, Quantum Information Processing 7, 193 (2008), 20 pgs. [cited by applicant]
Cohen et al., “Dissipation-Induced Continuous Quantum Error Correction for Superconducting Circuits”, Phys. Rev. A. 90, 062344 (2014), 062344-1-062344-9. [cited by applicant]
Crescenzi et al, “A Compendium of NP Optimization Problems”, (1995), 118 pgs. [cited by applicant]
D'Orsi et al, “A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs”, arXiv preprint arXiv:2204.10881v2 (2023), 67 pgs. [cited by applicant]
Dalzell et al, “Mind the Gab: Achieving a Super-Grover Quantum Speedup by Jumping to the End”, in Proceedings of the 55th Annual ACM SymposiumonTheory of Computing (2023), pp. 1131-1144. [cited by applicant]
Das et al., “Colloquium: Quantum Annealing and Analog Quantum Computation”, Reviews of Modern Physics 80, 1061 (2008), 21 pgs. [cited by applicant]
Dempster et al.,“Understanding Degenerate Ground States of a Protected Quantum Circuit in the Presence of Disorder”, Physical Review B 90, 094518 (2014), 094518-1-094518-12. [cited by applicant]
Deng et al, “Majorana Bound States in a Coupled Quantum-Dot Hybrid-Nanowire System”, Science 354, 1557, arXiv: 1612.07989v2 (2017), 24 pgs. [cited by applicant]
Derrida, “Random-Energy Model: Limit of a Family of Disordered Models”, Physical Review Letters 45, 79 (1980), 5 pgs. [cited by applicant]
Dubois et al., “The 3-XORSAT Threshold”, Comptes Rendus Mathematique 335, 963 (2002), pp. 963-966. [cited by applicant]
Ebadi et al, “Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays”, Science 376, 1209 (2022), 42 pgs. [cited by applicant]
Farhi et al. “A Quantum Approximate Optimization Algorithm”, arXiv preprint arXiv:1411.4028v1 (2014), 16 pgs. [cited by applicant]
Wang et al., “Electronic Structure Pseudopotential Calculations of Large (˜1000 Atoms) Si Quantum Dots”, J. Phys. Chem. 1994, 98, 8, 2158-2165. [cited by applicant]
Devoret et al., “Superconducting Circuits for Quantum Information: An Outlook”, Science, Mar. 8, 2013, vol. 339, Issue 6124, pp. 1169-1174. [cited by applicant]
Earl et al., “Parallel Tempering: Theory, Applications, and New Perspectives”, arXiv: physics/0508111v2 [physics.comp-ph], Aug. 19, 2005. [cited by applicant]
Johnson et al., “Quantum Annealing with Manufactured spins”, Nature 473, 194-198 (2011). [cited by applicant]
Jörg et al., “Energy Gaps in Quantum First-Order Mean-Field-Like Transitions: The problems that Quantum Annealing Cannot Solve”, arXiv:0912.4865v2 [quant-ph] Jan. 28, 2010. [cited by applicant]
Khot et al., “Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies”, in 2007 48th Annual IEEE Symposium on Foundations of Computer Science, Providence, RI, 2007, pp. 318-328. [cited by applicant]
King, Andrew D., et al. “Observation of Topological Phenomena in a Programmable Lattice of 1,800 Qubits.” Nature, vol. 560, No. 7719, Aug. 2018, p. 456. Gale OneFile: Health and Medicine. [cited by applicant]
Monasson, Rémi, Optimization Problems and Replica SOymmetry Breaking in Finite Connectivity Spin Glasses. Journal of Physics A: Mathematical and General, vol. 31, Issue 2, pp. 513-529 (1998). [cited by applicant]
Sahni et al, “P-Complete Approximation Problems”, Journal of the ACM (JACM), vol. 23, Issue 3, pp. 555-565. [cited by applicant]
J. D. Ullman, “NP-Complete Scheduling Problems,” Journal of Computer System Sciences, vol. 10, No. 3, 1975, pp. 384-393. [cited by applicant]
Wang et al., “Solving Schrodinger's Equation Around a Desired Energy: Application to Silicon Quantum Dots”, J. Chem. Phys. Feb. 1, 1994; 100 (3): 2394-2397. [cited by applicant]
Woeginger, G.J., “Exact Algorithms for NP-Hard Problems: A Survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds) Combinatorial Optimization—Eureka, You Shrink!”, Lecture Notes in Computer Science, vol. 2570. pp 185-207… [cited by applicant]
Wei Xu et al., “Clustering Phase of a General Constraint Satisfaction Problem Model d-k-CSP, Physica A: Statistical Mechanics and its Applications”, vol. 537, 2020, 122708. [cited by applicant]
Kapit, et al., “On the approximability of random-hypergraph MAX-3-XORSAT problems with quantum algorithms”, May 20, 2024, 43 pgs. [cited by applicant]
Campbell, Earl, “Random compiler for fast Hamiltonian simulation”, Physical review letters 123, No. 7 (2019): 070503. (Year: 2019). [cited by applicant]
Nichol, et al., “High-fidelity entangling gate for double-quantum-dot spin qubits”, npj Quantum Information 3, No. 1 (2017): 3. (Year: 2017). [cited by applicant]
Venturelli, et al., “Compiling quantum circuits to realistic hardware architectures using temporal planners”, Quantum Science and Technology 3, No. 2 (2018): 025004. (Year: 2018). [cited by applicant]