IP Library Granted Patent US 12,333,380
Granted Patent B1
US 12,333,380 · App. 18/545,772 · Granted Jun 17, 2025

Constructing quantum processes for quantum processors

Inventors: William J. Zeng (Berkeley, CA); Chad Tyler Rigetti (Walnut Creek, CA)
Assignee: Rigetti & Co, LLC
G06N10/00G01R31/3177G06N3/08G06N20/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,333,380
App. No.
18/545,772
Granted
Jun 17, 2025
Kind
B1
Abstract

In a general aspect, a quantum process for execution by a quantum processor is generated. In some instances, test data representing a test output of a quantum process are obtained. The test data are obtained based on a value assigned to a variable parameter of the quantum process. An objective function is evaluated based on the test data, and an updated value is assigned to the variable parameter based on the evaluation of the objective function. The quantum process is provided for execution by a quantum processor, and the quantum process provided for execution has the updated value assigned to the variable parameter.

Claims (33)

1. A method comprising:

obtaining an initial value of a variable parameter of an ansatz preparation circuit, wherein the ansatz preparation circuit is a quantum logic circuit comprising quantum logic gates;

by operation of a quantum processor, generating an initial ansatz by executing the ansatz preparation circuit having the initial value assigned to the variable parameter;

by operation of the quantum processor, computing an expectation value based on the initial ansatz; and

by operation of a classical processor, computing an updated value of the variable parameter based on the expectation value.

2. The method of claim 1 , wherein computing the expectation value comprises projectively measuring a Hermitian matrix.

3. The method of claim 1 , wherein the expectation value is computed by a quantum expectation estimator, and wherein the ansatz preparation circuit and quantum expectation estimator are configured to operate as a quantum variational eigensolver.

4. The method of claim 1 , wherein the ansatz preparation circuit is configured to generate a unitary coupled cluster ansatz.

5. The method of claim 1 , comprising:

by operation of the quantum processor, generating an updated ansatz by executing the ansatz preparation circuit having the updated value assigned to the variable parameter;

by operation of the quantum processor, computing an updated expectation value based on the updated ansatz, wherein the updated expectation value is less than the expectation value that was computed based on the initial ansatz.

6. The method of claim 5 , wherein the updated expectation value represents an estimated ground state of an electronic structure Hamiltonian.

7. The method of claim 1 , wherein the variable parameter comprises a parameter of at least one of the quantum logic gates in the quantum logic circuit.

8. The method of claim 1 , wherein the variable parameter comprises a parameter of a control sequence that causes the quantum processor to execute at least one of the quantum logic gates.

9. The method of claim 1 , wherein the quantum processor comprises a superconducting quantum circuit, and the variable parameter corresponds to a parameter of a control signal that causes the superconducting quantum circuit to execute at least one of the quantum logic gates.

10. The method of claim 1 , wherein the updated value of the variable parameter is determined by executing a classical optimization process.

11. A computer system comprising:

a quantum processor configured to execute:

an ansatz preparation circuit comprising a variable parameter, wherein the ansatz preparation circuit is a quantum logic circuit comprising quantum logic gates;

a quantum expectation estimator configured to compute expectation values based on ansatzes prepared by the ansatz preparation circuit; and

a classical processor comprising a construction engine configured to iteratively improve a value of the variable parameter based on the expectation values computed by the quantum expectation estimator.

12. The computer system of claim 11 , wherein the quantum expectation estimator is configured to compute the expectation values by projectively measuring a Hermitian matrix.

13. The computer system of claim 11 , wherein the ansatz preparation circuit and quantum expectation estimator are configured to operate as a quantum variational eigensolver.

14. The computer system of claim 11 , wherein the ansatz preparation circuit is configured to generate a unitary coupled cluster ansatz.

15. The computer system of claim 11 , wherein the quantum processor is configured to:

generate an initial ansatz by executing the ansatz preparation circuit having an initial value assisted to the variable parameter;

generated an updated ansatz by executing the ansatz preparation circuit having an updated value assigned to the variable parameter, the updated value being computed by the classical processor; and

compute an updated expectation value based on the updated ansatz, wherein the updated expectation value is less than the expectation value that was computed based on the initial ansatz.

16. The computer system of claim 15 , wherein the updated expectation value represents an estimated ground state of an electronic structure Hamiltonian.

17. The computer system of claim 11 , wherein the variable parameter comprises a parameter of at least one of the quantum logic gates in the quantum logic circuit.

18. The computer system of claim 11 , wherein the variable parameter comprises a parameter of a control sequence that causes the quantum processor to execute at least one of the quantum logic gates.

19. The computer system of claim 11 , wherein the quantum processor comprises a superconducting quantum circuit, and the variable parameter corresponds to a parameter of a control signal that causes the superconducting quantum circuit to execute at least one of the quantum logic gates.

20. The computer system of claim 11 , wherein the updated value of the variable parameter is determined by executing a classical optimization process.

Assignments (5)
RELEASE OF SECURITY INTEREST Recorded Dec 12, 2024
From: TRINITY CAPITAL INC.
To: RIGETTI & CO, LLC
Reel/Frame 069603/0771 →
RELEASE OF SECURITY INTEREST Recorded Dec 12, 2024
From: TRINITY CAPITAL INC.
To: RIGETTI & CO, LLC; RIGETTI INTERMEDIATE LLC; RIGETTI COMPUTING, INC.
Reel/Frame 069603/0831 →
AMENDED AND RESTATED INTELLECTUAL PROPERTY SECURITY AGREEMENT Recorded Jul 8, 2024
From: RIGETTI & CO, LLC; RIGETTI INTERMEDIATE LLC; RIGETTI COMPUTING, INC.
To: TRINITY CAPITAL INC.
Reel/Frame 068146/0416 →
CHANGE OF NAME Recorded Dec 22, 2023
From: RIGETTI & CO, INC.
To: RIGETTI & CO, LLC
Reel/Frame 066125/0529 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 20, 2023
From: ZENG, WILLIAM J.; RIGETTI, CHAD TYLER
To: RIGETTI & CO., INC.
Reel/Frame 065918/0031 →
Continuity (4)
Continuation 17185675 · Feb 25, 2021
Continuation 16401848 · May 2, 2019
Continuation 15419682 · Jan 30, 2017
Provisional Application 62306149 · Mar 10, 2016
References Cited (23)
US 10325218B1 · Zeng · 2019 [cited by examiner]
US 10949768B1 · Zeng · 2021 [cited by examiner]
US 11900212B1 · Zeng · 2024 [cited by examiner]
US 20080140749A1 · Amato · 2008 [cited by examiner]
US 20140187427A1 · Macready · 2014 [cited by examiner]
US 20160283857A1 · Babbush · 2016 [cited by examiner]
US 20170177534A1 · Mohseni · 2017 [cited by examiner]
WO 2015178990A2 · 2015 [cited by applicant]
USPTO, Non-Final Office Action issued in U.S. Appl. No. 17/185,675 on Jun. 23, 2023, 12 pages. [cited by applicant]
USPTO, Non-Final Office Action mailed Oct. 12, 2018, in U.S. Appl. No. 15/419,682, 13 pgs. [cited by applicant]
USPTO, Non-Final Office Action mailed Mar. 12, 2020, in U.S. Appl. No. 16/401,848, 15 pgs. [cited by applicant]
USPTO, Final Office Action mailed Dec. 11, 2020, in U.S. Appl. No. 16/401,848, 5 pgs. [cited by applicant]
USPTO, Notice of Allowance issued in U.S. Appl. No. 17/185,675 on Oct. 3, 2023, 7 pages. [cited by applicant]
USPTO, Notice of Allowance mailed Dec. 24, 2020, in U.S. Appl. No. 16/401,848, 8 pgs. [cited by applicant]
USPTO, Notice of Allowance mailed Feb. 12, 2019, in U.S. Appl. No. 15/419,682, 8 pgs. [cited by applicant]
Bishop, Christopher M., “Pattern Recognition and Machine Learning”, Springer, 2006, 758 pages. [cited by applicant]
Boyd, Stephen , et al., “Convex Optimization”, Cambridge University Press, 2004, 730 pages. [cited by applicant]
Geller, Michael R., et al., “Universal quantum simulation with prethreshold superconducting qubits: Single-excitation subspace method”, arXiv:1505.04990v2 [quant-ph], Sep. 15, 2015, 25 pages. [cited by applicant]
McClean, Jarrod R., et al., “The theory of variational hybrid quantum-classical algorithms”, arXiv:1509.04279v1 [quant-ph], Sep. 14, 2015, 20 pages. [cited by applicant]
O'Malley, P. J., et al., “Scalable Quantum Simulation of Molecular Energies”, arXiv:1512.06860v1 [quant-ph], Dec. 21, 2015, 12 pages. [cited by applicant]
Peruzzo, Alberto , et al., “A variational eigenvalue solver on a quantum processor”, arXiv:1304.3061v1 [quant-ph], Apr. 10, 2013, 10 pages. [cited by applicant]
Ryan, Conor , et al., “Grammatical Evolution: Evolving Programs for an Arbitrary Language”, Springer Science & Business Media, 2012, 13 pages. [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]