IP Library Granted Patent US 12,699,913
Granted Patent B2
US 12,699,913 · App. 18/953,748 · Granted Aug 4, 2026

Computing platform with heterogenous quantum processors

Inventors: Chad Tyler Rigetti (Walnut Creek, CA); William J. Zeng (Berkeley, CA); Blake Robert Johnson (El Cerrito, CA); Nikolas Anton Tezak (Oakland, CA)
Assignee: Rigetti & Co, LLC
G06N10/40G06F13/1663G06F15/16G06N10/00G06N10/20G06N10/70G06F9/544
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,699,913
App. No.
18/953,748
Filed
Nov 20, 2024
Granted
Aug 4, 2026
Kind
B2
Art Unit
2112
USPC
714/746
Abstract

A hybrid quantum-classical platform comprises: a first quantum processor unit (QPU); a second QPU; and a shared classical memory, the shared classical memory being connected to both the first QPU and the second QPU, wherein the shared classical memory is configured to share data between the first QPU and the second QPU. In some embodiments, the first QPU operates at a higher repetition rate and/or clock rate than the second QPU and the second QPU operates with a higher fidelity than the first QPU.

Claims (70)

1 . A method of using a first quantum processor unit (QPU) to calibrate a second QPU in a hybrid quantum-classical computing platform, the method comprising:

obtaining control parameters for the second QPU as an initial calibration;

generating sampled data based on operating the second QPU with the control parameters;

storing the sampled data in shared classical memory;

using the sampled data in a quantum Hamiltonian learning process, wherein the quantum Hamiltonian learning process produces a learned Hamiltonian of the second QPU based on operating the first QPU as a trusted simulator; and

updating the control parameters for the second QPU based on evaluating the learned Hamiltonian against a calibration objective function.

2 . The method of claim 1 , wherein the quantum Hamiltonian learning process uses the first QPU to simulate subsystems of qubits of the second QPU.

3 . The method of claim 1 , further comprising performing an iterative process until a termination criterion is reached, each iteration of the iterative process comprising:

generating sampled data for the iteration based on operating the second QPU with the updated control parameters;

storing the sampled data for the iteration in the shared classical memory;

using the sampled data for the iteration in the quantum Hamiltonian learning process, wherein the quantum Hamiltonian learning process produces a learned Hamiltonian for the iteration; and

updating the control parameters based on evaluating the learned Hamiltonian for the iteration against the calibration objective function.

4 . The method of claim 3 , wherein the termination criterion is a target calibration accuracy.

5 . The method of claim 1 , wherein the calibration objective function is the average distance from a set of random sequences to the identity.

6 . The method of claim 1 , wherein the first QPU operates at a higher clock rate than the second QPU.

7 . The method of claim 1 , wherein the first QPU operates at a higher logical clock rate than the second QPU.

8 . The method of claim 1 , wherein the first QPU operates at a higher repetition rate than the second QPU.

9 . The method of claim 1 , wherein the second QPU has higher fidelity than the first QPU.

10 . The method of claim 1 , wherein the shared classical memory is connected to both the first QPU and the second QPU, and the shared classical memory is configured to share data between the first QPU and the second QPU.

11 . The method of claim 1 , wherein the first QPU comprises a first classical local memory, the second QPU comprises a second classical local memory, and the first classical local memory and the second classical local memory are connected to the shared classical memory for transferring data between the first QPU and the second QPU.

12 . The method of claim 1 , wherein the hybrid quantum-classical computing platform comprises a quantum communication link between the first QPU and the second QPU for teleportation of quantum states.

13 . The method of claim 1 , wherein generating the sampled data comprises sampling Pr(D|H), wherein a likelihood of the data D being from a given Hamiltonian H is given by

Pr

(

H

|

D

)

=

Pr

(

D

|

H

)

Pr

(

H

)

Pr

(

D

)

.

14 . A hybrid quantum-classical computing platform comprising:

a first quantum processor unit (QPU);

a second QPU;

shared classical memory; and

a classical computing resource configured to:

obtain control parameters for the second QPU as an initial calibration;

generate sampled data based on operating the second QPU with the control parameters;

store the sampled data in the shared classical memory;

use the sampled data in a quantum Hamiltonian learning process, wherein the quantum Hamiltonian learning process produces a learned Hamiltonian of the second QPU based on operating the first QPU as a trusted simulator; and

update the control parameters for the second QPU based on evaluating the learned Hamiltonian against a calibration objective function.

15 . The platform of claim 14 , wherein the quantum Hamiltonian learning process uses the first QPU to simulate subsystems of qubits of the second QPU.

16 . The platform of claim 14 , wherein the classical computing resource is configured to perform an iterative process until a termination criterion is reached, each iteration of the iterative process comprising:

generating sampled data for the iteration based on operating the second QPU with the updated control parameters;

storing the sampled data for the iteration in the shared classical memory;

using the sampled data for the iteration in the quantum Hamiltonian learning process, wherein the quantum Hamiltonian learning process produces a learned Hamiltonian for the iteration; and

updating the control parameters based on evaluating the learned Hamiltonian for the iteration against the calibration objective function.

17 . The platform of claim 14 , wherein the termination criterion is a target calibration accuracy.

18 . The platform of claim 14 , wherein the calibration objective function is the average distance from a set of random sequences to the identity.

19 . The platform of claim 14 , wherein the shared classical memory is connected to both the first QPU and the second QPU, and the shared classical memory is configured to share data between the first QPU and the second QPU.

20 . The platform of claim 14 , comprising:

a quantum communication link between the first QPU and the second QPU for teleportation of quantum states.

Assignments (2)
CHANGE OF NAME Recorded Nov 21, 2024
From: RIGETTI & CO., INC.
To: RIGETTI & CO, LLC
Reel/Frame 069431/0041 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 20, 2024
From: RIGETTI, CHAD TYLER; ZENG, WILLIAM J.; JOHNSON, BLAKE ROBERT; TEZAK, NIKOLAS ANTON
To: RIGETTI & CO., INC.
Reel/Frame 069344/0742 →
Continuity (4)
Continuation 17097955 · Nov 13, 2020
Continuation PCTUS2019033145 · May 20, 2019
Provisional Application 62673658 · May 18, 2018
Related Publication 20260127473A1 · May 7, 2026
References Cited (144)
US 5428761A · Herlihy et al. · 1995 [cited by applicant]
US 5940193A · Hotaling et al. · 1999 [cited by applicant]
US 6418460B1 · Bitar et al. · 2002 [cited by applicant]
US 7875876B1 · Wandzura et al. · 2011 [cited by applicant]
US 8175995B2 · Amin · 2012 [cited by applicant]
US 8832164B2 · Allen et al. · 2014 [cited by applicant]
US 8832165B2 · Allen et al. · 2014 [cited by applicant]
US 9286154B2 · Ashikhmin · 2016 [cited by applicant]
US 9819347B2 · Hastings et al. · 2017 [cited by applicant]
US 10127499B1 · Rigetti et al. · 2018 [cited by applicant]
US 10402743B1 · Rigetti et al. · 2019 [cited by applicant]
US 10633248B2 · Ashikhmin · 2020 [cited by applicant]
US 10650324B1 · Rigetti et al. · 2020 [cited by applicant]
US 10671559B2 · Mohseni et al. · 2020 [cited by applicant]
US 10698789B1 · Liu et al. · 2020 [cited by applicant]
US 10956830B1 · Rigetti et al. · 2021 [cited by applicant]
US 10984152B2 · Rubin et al. · 2021 [cited by applicant]
US 11941482B1 · Rigetti et al. · 2024 [cited by applicant]
US 20050005266A1 · Datig · 2005 [cited by applicant]
US 20050182614A1 · Meredith · 2005 [cited by applicant]
US 20050188373A1 · Inoue et al. · 2005 [cited by applicant]
US 20050273306A1 · Hilton et al. · 2005 [cited by applicant]
US 20060101236A1 · Han · 2006 [cited by applicant]
US 20060179255A1 · Yamazaki · 2006 [cited by applicant]
US 20060224547A1 · Ulyanov et al. · 2006 [cited by applicant]
US 20070239366A1 · Hilton et al. · 2007 [cited by applicant]
US 20080209156A1 · Inoue et al. · 2008 [cited by applicant]
US 20090070402A1 · Rose et al. · 2009 [cited by applicant]
US 20090075825A1 · Rose et al. · 2009 [cited by applicant]
US 20090157778A1 · Allen et al. · 2009 [cited by applicant]
US 20090164435A1 · Routt · 2009 [cited by applicant]
US 20110137632A1 · Paxson et al. · 2011 [cited by applicant]
US 20110238378A1 · Allen et al. · 2011 [cited by applicant]
US 20110313741A1 · Langhoff · 2011 [cited by applicant]
US 20120079177A1 · Brewer et al. · 2012 [cited by applicant]
US 20120192200A1 · Rao et al. · 2012 [cited by applicant]
US 20120254586A1 · Amin et al. · 2012 [cited by applicant]
US 20130160016A1 · Gummaraju et al. · 2013 [cited by applicant]
US 20130222399A1 · Bourd et al. · 2013 [cited by applicant]
US 20130332702A1 · Boudier · 2013 [cited by applicant]
US 20140164313A1 · Alboszta et al. · 2014 [cited by applicant]
US 20140187427A1 · Macready et al. · 2014 [cited by applicant]
US 20140229722A1 · Harris · 2014 [cited by applicant]
US 20140297247A1 · Troyer et al. · 2014 [cited by applicant]
US 20140354326A1 · Bonderson et al. · 2014 [cited by applicant]
US 20150006443A1 · Rose et al. · 2015 [cited by applicant]
US 20150142398A1 · Miller et al. · 2015 [cited by applicant]
US 20170017894A1 · Lanting et al. · 2017 [cited by applicant]
US 20170161632A1 · Freedman et al. · 2017 [cited by applicant]
US 20170179960A1 · Hastings et al. · 2017 [cited by applicant]
US 20170223143A1 · Johnson et al. · 2017 [cited by applicant]
US 20170270245A1 · van Rooyen · 2017 [cited by examiner]
US 20170293556A1 · Rozario · 2017 [cited by applicant]
US 20180096085A1 · Rubin · 2018 [cited by applicant]
US 20180114138A1 · Monroe et al. · 2018 [cited by applicant]
US 20180121601A1 · Hahm · 2018 [cited by examiner]
US 20210272003A1 · Rigetti et al. · 2021 [cited by applicant]
US 20210406421A1 · Rubin · 2021 [cited by applicant]
US 20220390496A1 · Aksyuk et al. · 2022 [cited by applicant]
US 20230289643A1 · Jain · 2023 [cited by examiner]
US 20250218542A1 · Van Rooyen · 2025 [cited by examiner]
CN 105787292 · 2016 [cited by applicant]
WO 2005122052 · 2005 [cited by applicant]
WO 2013006836 · 2013 [cited by applicant]
WO 2018064535 · 2018 [cited by applicant]
WO 2019222748 · 2019 [cited by applicant]
Travis Humble, Systems and Software for Quantum Computing, Presented to North Carolina State University and Google Hangouts, Feb. 27, 2018 (Year: 2018). [cited by examiner]
Reiher , et al., “Elucidating Reaction Mechanisms on Quantum Computers”, arXiv:1605.03590v2 [quant-ph], May 25, 2016, 28 pgs. [cited by applicant]
Rubin , “A Hybrid Classical/Quantum Approach for Large-Scale Studies of quantum Systems with Density Matrix Embedding Theory”, arXiv:1610.06910v1, Oct. 21, 2016, 12 pgs. [cited by applicant]
Rubin , “A Hybrid Classical/Quantum Approach for Large-Scale Studies of Quantum Systems with Density Matrix Embedding Theory”, arXiv:1610.06910v2, Oct. 24, 2016, 10 pgs. [cited by applicant]
Sawaya , et al., “Error Sensitivity to Environmental Noise in Quantum Circuits for Chemical State Preparation”, Journal of Chemical Theory and Computation, ACS Publications, Jun. 2, 2016, 13 pgs. [cited by applicant]
Scuseria , et al., “An efficient reformulation of the closed-shell coupled cluster single and double excitation (CCSD) equations”, J. Chem. Phys. 89(12), Dec. 15, 1988, 7 pgs. [cited by applicant]
Seeley , et al., “The Bravyi-Kitaev transformation for quantum computation of electronic structure”, The Journal of Chemical Physics 137, 224109, Dec. 12, 2012, 17 pgs. [cited by applicant]
Selinger , et al., “A lambda calculus for quantum computation with classical control”, arXiv:cs/0404056v2 [cs.LO], Nov. 2004, 15 pgs. [cited by applicant]
Shiba , “Magnetic Susceptibility at Zero Temperature for the One-Dimensional Hubbard Model”, Physical Review B, vol. 6, No. 3, Aug. 1, 1972, 10 pgs. [cited by applicant]
Smith, R. S., et al., “A Practical Quantum Instruction Set Architecture”, arXiv:1608.03355v2 [quant-ph], Feb. 17, 2017, 15 pages. [cited by applicant]
Suzuki , “Convergence of General Decompositions of Exponential Operators”, Commun. Math. Phys. 163, 491-508, 1994, 19 pgs. [cited by applicant]
Szabo , et al., “Modern Quantum Chemistry: Introduction to Advanced Electronic Structure Theory”, Macmillan Publishing Co., Inc., 1982, 48 pgs. [cited by applicant]
Tranter , et al., “The Bravyi-Kitaev Transformation: Properties and Applications”, Int'l Journal of Quantum Chemistry 115, 1431-1441, 2015, 12 pgs. [cited by applicant]
Trotter , “On the Product of Semi-Groups of Operators”, Proceedings of the American Mathematical Society 10, 545, 1959, 7 pgs. [cited by applicant]
Tsuchimochi , et al., “Density matrix embedding in an antisymmetrized geminal power bath”, The Journal of Chemical Physics 143, 024107, 2015, 12 pgs. [cited by applicant]
Van Meter, Rodney , et al., “Local and Distributed Quantum Computation”, arXiv:1605.06951v1, May 2016. [cited by applicant]
Verdon , et al., “A quantum algorithm to train neural networks using low-depth circuits”, arXiv:1712.05304v1, Dec. 14, 2017, 8 pgs. [cited by applicant]
Wang , et al., “Quantum Simulation of Helium Hydride Cation in a Solid-State Spin Register”, ACS Nano, vol. 9, No. 8, 7769-7774, www.acsnano.org, Apr. 23, 2015, 14 pgs. [cited by applicant]
Wecker, Dave , et al., “Towards Practical Quantum Variational Algorithms”, arXiv:1507.08969v2 [quant-ph], Sep. 8, 2015, 11 pages. [cited by applicant]
Werner , et al., “A second order multiconfiguration SCF procedure with optimum convergence”, J. Chem. Phys. 82 (11), Jun. 1, 1985, 12 pgs. [cited by applicant]
Whitfield, James D., et al., “Simulation of Electronic Structure Hamiltonians Using Quantum Computers”, arXiv:1001.3855v3 [quant-ph], Dec. 19, 2010, 22 pages. [cited by applicant]
Wiebe , et al., “Quantum Deep Learning”, arXiv:1412.3489v2 [quant-ph], May 2015, 34 pgs. [cited by applicant]
Wiebe , et al., “Quantum Hamiltonian Learning Using Imperfect Quantum Resources”, arxiv:1311.5269v2, Apr. 1, 2014, 18 pgs. [cited by applicant]
Wouters , et al., “A Practical Guide to Density Matrix Embedding Theory in Quantum Chemistry”, J.Chem. Theory Comput., May 9, 2016, 15 pgs. [cited by applicant]
Wouters, Sebastian , et al., “Five years of density matrix embedding theory”, arXiv:1605.05547v1, Mar. 2016. [cited by applicant]
Zheng, Bo-Xiao , et al., “Cluster size convergence of the density matrix embedding theory and its dynamical cluster formulation: a study with an auxiliary-field quantum Monte Carlo solver”, arXiv:1608.03316v1 [cond-mat.… [cited by applicant]
Zheng , et al., “Ground-state phase diagram of the square lattice Hubbard model from density matrix embedding theory”, arXiv:1504.01784v3 [cond-mat.str-el], May 21, 2015, 17 pgs. [cited by applicant]
EPO, Communication pursuant to Article 94(3) issued in Application No. 19803895.2 on Oct. 14, 2025, 10 pages. [cited by applicant]
EPO, Extended European Search Report mailed Feb. 18, 2022, in EP 19803895.2, 10 pgs. [cited by applicant]
KIPO, International Search Report and Written Opinion mailed Sep. 11, 2019, in PCT/US2019/033145, 14 pgs. [cited by applicant]
USPTO, Restriction Requirement issued in U.S. Appl. No. 17/097,955 on Feb. 23, 2024, 16 pages. [cited by applicant]
USPTO, Non-Final Office Action issued in U.S. Appl. No. 17/097,955 on May 16, 2024, 26 pages. [cited by applicant]
USPTO, Notice of Allowance issued in U.S. Appl. No. 17/097,955 on Aug. 23, 2024, 6 pages. [cited by applicant]
“Parallel computing—Wikipedia”, https://en.wikipedia.org/w/index.php?title=Parallel_computing&oldid=741532971 (retrieved on Mar. 31, 2021), Sep. 28, 2016, 20 pgs. [cited by applicant]
“Python-based Simulations of Chemistry Framework”, available at https://github.com/sunqm/pyscf at least as early as Feb. 8, 2021, 4 pgs. [cited by applicant]
Advanced Micro Devices, Inc. , “What is Heterogeneous Computing”, AMD Developer Central; http://developer.amd.com/resources/heterogenous-computing/what-is-heterogeneous-computing/; copyright 2014; accessed Aug. 9, 2015,… [cited by applicant]
Amin , et al., “Quantum Boltzmann Machine”, Phys. Rev. X 8, 021050, May 23, 2018, 11 pgs. [cited by applicant]
Bauer, Bela , et al., “Hybrid quantum-classical approach to correlated materials”, 1510.03859v2 [quant-ph], Aug. 29, 2016, 11 pgs. [cited by applicant]
Booth , et al., “Spectral functions of strongly correlated extended systems via an exact quantum embedding”, Physical Review B91, 155107, 2015, 7 pgs. [cited by applicant]
Bravyi , et al., “Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates”, arXiv:1601.07601v2 [quant-ph], Jan. 27, 2017, 20 pgs. [cited by applicant]
Bravyi , et al., “Trading classical and quantum computational resources”, arXiv:1506.01396v1 [quant-ph], Jun. 3, 2015, 14 pgs. [cited by applicant]
Bravyi , et al., “Universal quantum computation with ideal Clifford gates and noisy ancillas”, Phys. Rev. A 71, 022316, Feb. 22, 2005, 14 pgs. [cited by applicant]
Britt, Keith A., et al., “High-Performance Computing with Quantum Processing Units”, ACM Journal on Emerging Technologies in Computing Systems, vol. 1 No. 1 Art. 1, Feb. 2017, 13 pages. [cited by applicant]
Britt, Keith A., et al., “High-Performance Computing with Quantum Processing Units”, arXiv:1511.04386v1, 2015. [cited by applicant]
Brown , et al., “Fault-tolerant error correction with the gauge color code”, Nature Communications, Jul. 29, 2016, 8 pgs. [cited by applicant]
Bulik , et al., “Can single-reference coupled cluster theory describe static correlation?”, arXiv:1505.01894v1 [physics.chem-ph] May 8, 2015, May 11, 2015, 10 pgs. [cited by applicant]
Bulik , et al., “Density matrix embedding from broken symmetry lattice mean fields”, Physical Review B89, 035140, 2014, 13 pgs. [cited by applicant]
Bulik , “Electron correlation in extended systems via quantum embedding”, Doctoral thesis, Rice University, May 2015, 118. [cited by applicant]
Bulik , et al., “Electron correlation in solids via density embedding theory”, The Journal of Chemical Physics 141, 054113, 2014, 11 pgs. [cited by applicant]
Corcoles , et al., “Process verification of two-qubit quantum gates by randomized benchmarking”, Physical Review A 87, 030301(R)(2013), Mar. 19, 2013, 4 pgs. [cited by applicant]
Crawford , et al., “An Introduction to Coupled Cluster Theory for Computational Chemists”, Reviews in Computational Chemistry, vol. 14, 2000, 105. [cited by applicant]
Dallaire-Demers, Pierre-Luc , et al., “Quantum gates and architecture for the quantum simulation of the Fermi-Hubbard model”, arXiv:1606.00208v1 [quant-ph], Jun. 2, 2016, 13 pgs. [cited by applicant]
Gidofalvi , et al., “Multireference self-consistent-field energies without the many-electron wave function through a variational low-rank two-electron reduced-density-matrix method”, The Journal of Chemical Physics 127,… [cited by applicant]
Gottesman , et al., “Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations”, Nature 402(6760), Nov. 25, 1999, 7 pgs. [cited by applicant]
Helgaker , et al., “Molecular Electronic-Structure Theory”, John Wiley & Sons Ltd., West Sussex, England, 2000, 8 pgs. [cited by applicant]
Hosteny , et al., “Ab initio study of the pi-electron states of trans-butadiene”, The Journal of Chemical Physics, vol. 62, No. 12, Jun. 15, 1975, 17 pgs. [cited by applicant]
Humble, Travis , “Systems and Software for Quantum Computing”, Presented to North Carolina State University and Google Hangouts, Feb. 27, 2018, 42 pages. [cited by applicant]
Hutter , et al., “Efficient Markov chain Monte Carlo algorithm for the surface code”, Phys. Rev. A 89, 022326, Feb. 18, 2014, 28 pgs. [cited by applicant]
Johnson , et al., “QVECTOR: an algorithm for device-tailored quantum error correction”, arXiv:1711.02249v1 [quant-ph], Nov. 7, 2017, 16 pgs. [cited by applicant]
Kimmel , et al., “Robust Extraction of Tomographic Information via Randomized Benchmarking”, Phys. Rev. X 4, 011050, Mar. 25, 2014, 15 pgs. [cited by applicant]
Knizia , et al., “Density Matrix Embedding: A Simple Alternative to Dynamical Mean-Field Theory”, Physical Review Letters PRL 109, 186404, Nov. 2, 2012, 6 pgs. [cited by applicant]
Knizia , et al., “Density Matrix Embedding: A Strong-Coupling Quantum Embedding Theory”, Journal of Chemical Theory and Computation, Feb. 21, 2013, 6 pgs. [cited by applicant]
Kretchmer , et al., “A real-time extension of density matrix embedding theory for non-equilibrium electron dynamics”, arXiv:1609.07678v2, Nov. 1, 2017, 15 pgs. [cited by applicant]
Kreula , et al., “Few-qubit quantum-classical simulation of strongly correlated lattice fermions”, EPJ Quantum Technology 3:11, 2016, 19 pgs. [cited by applicant]
Lanyon , et al., “Experimental quantum computing without entanglement”, arXiv:0807.0668v1, Jul. 4, 2008, 5 pgs. [cited by applicant]
Li , et al., “Hybrid parallel tempering and simulated annealing method”, Applied Mathematics and Computation, vol. 212, Issue 1, pp. 216-228, Jun. 1, 2009. [cited by applicant]
Lieb , et al., “The one-dimensional Hubbard model: a reminiscence”, Physica A 321; www.elsevier.com/locate/physa, 2003, 27 pgs. [cited by applicant]
Magesan , et al., “Scalable and Robust Randomized Benchmarking of Quantum Processes”, Physical Review Letters 106, 180504, May 6, 2011, 4 pgs. [cited by applicant]
Mccaskey , et al., “Extreme-Scale Programming Model for Quantum Acceleration within High Performance Computing”, arxiv.org, Cornell University Library, Oct. 4, 2017, 20 pgs. [cited by applicant]
Mcclean, Jarrod Ryan, “Algorithms Bridging Quantum Computation and Chemistry”, Doctoral dissertation, Harvard University, Graduate School of Arts & Sciences; http://nrs.harvard.edu/urn-3:HUL.InstRepos:17467376, May 1, 2… [cited by applicant]
Mcclean, J. R., et al., “Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States”, arXiv:1603.05681v1 [quant-ph], Mar. 17, 2016, 10 pgs. [cited by applicant]
Mcclean , et al., “The theory of variational hybrid quantum-classical algorithms”, New J. Phys. 18 (2016)023023, Feb. 5, 2016, 23 pgs. [cited by applicant]
Neilsen , et al., “Quantum Computation and Quantum Information”, Cambridge University Press; Cambridge, UK, 2010, 13 pgs. [cited by applicant]
O'Malley , et al., “Scalable Quantum Simulation of Molecular Energies”, Phys. Rev. X 6, 031007, 2016, 13 pgs. [cited by applicant]
O'Malley , et al., “Scalable Quantum Simulation of Molecular Energies”, arXiv:1512.06860v2 [quant-ph], Feb. 4, 2017, 13 pgs. [cited by applicant]
Peruzzo, Alberto , et al., “A Variational Eigenvalue Solver on a Photonic Quantum Processor”, Nature Communications, DOI: 10.1038/ncomms5213, Jul. 23, 2014, 7 pgs. [cited by applicant]
Peruzzo , et al., “A variational eigenvalue solver on a quantum processor”, ArXiv:1304.3061v1 [quant-ph], Apr. 10, 2013, 10 pgs. [cited by applicant]
Peschel , et al., “Entanglement in Solvable Many-Particle Models”, arXiv:1109.0159v1 [cond-mat.stat-mech], Sep. 1, 2011, 44 pgs. [cited by applicant]