IP Library › Granted Patent US 12,190,201
Granted Patent B2
US 12,190,201 · App. 17/110,900 · Granted Jan 7, 2025

Quantum resource estimation using a re-parameterization method

Inventors: Guglielmo Mazzola (Zurich, CH); Stefan Woerner (Zurich, CH); Rajiv Krishnakumar (Geneva, CH); William Joseph Zeng (New York, NY); Nikitas Stamatopoulos (New York, NY); Shouvanik Chakrabarti (Hyattsville, MD)
Assignees: INTERNATIONAL BUSINESS MACHINES CORPORATION; Goldman Sachs & Co. LLC
G06N10/00G06F17/18G06N7/08
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,190,201
App. No.
17/110,900
Granted
Jan 7, 2025
Kind
B2
Abstract

Systems, computer-implemented methods, and computer program products to facilitate estimation of quantum resources to calculate an expectation value of a stochastic process using a re-parameterization method are provided. According to an embodiment, a system can comprise a processor that executes computer executable components stored in memory. The computer executable components can comprise a re-parameterization component that applies a quantum fault-tolerant operation to a variationally prepared quantum state corresponding to a probability distribution to produce a quantum state corresponding to a target probability distribution. The computer executable components can further comprise an estimation component that estimates at least one defined criterion of a quantum computer to be used to compute an expectation value of a stochastic process associated with the target probability distribution.

Claims (44)

1. A system, comprising:

a processor that executes computer executable components stored in memory, the computer executable components comprising:

a re-parameterization component that applies a quantum fault-tolerant operation to a variationally prepared quantum state corresponding to a probability distribution to produce a quantum state corresponding to a target probability distribution, wherein the applying the quantum fault-tolerant operation comprises:

applying a first defined number of Gaussian operators to a second defined number of qubits, wherein the second defined number is a multiple of the first defined number by a third defined number corresponding to a length of a qubit register, and

performing affine transformations to adjust respective centers and respective volatilities of Gaussians resulting from the applying; and

an estimation component that estimates at least one defined criterion of a quantum computer to be used to compute an expectation value of a stochastic process associated with the target probability distribution.

2. The system of claim 1 , wherein the performing the affine transformations obtains at least one of: a defined mean of the target probability distribution; a defined standard deviation of the target probability distribution; or one or more explicit parameters that specify the target probability distribution.

3. The system of claim 1 , wherein the re-parameterization component applies the quantum fault-tolerant operation to the variationally prepared quantum state to prepare the quantum state as a superposition over possible paths of a discrete time multivariate stochastic process.

4. The system of claim 1 , wherein the computer executable components further comprise:

a variational component that trains a variational quantum circuit to prepare the variationally prepared quantum state and to reduce computational costs of quantum arithmetic operations performed by the quantum computer to compute the expectation value of the stochastic process associated with the target probability distribution.

5. The system of claim 1 , wherein the computer executable components further comprise:

a variational component that trains a variational quantum circuit to prepare the variationally prepared quantum state, and wherein the variational component trains the variational quantum circuit using a Hamiltonian operator to generate a ground state corresponding to the target probability distribution.

6. The system of claim 1 , wherein the computer executable components further comprise:

an error analysis component that calculates one or more errors associated with at least one of: the application of the quantum fault-tolerant operation to the variationally prepared quantum state to produce the quantum state; the estimation of the at least one defined criterion; or the computation of the expectation value of the stochastic process associated with the target probability distribution.

7. The system of claim 1 , wherein the at least one defined criterion is selected from a group consisting of an attribute, a condition, a property, a parameter, or a configuration of the quantum computer that enables the quantum computer to achieve a defined quantum advantage in computing the expectation value of the stochastic process associated with the target probability distribution, and wherein the probability distribution comprises a standard normal probability distribution and the target probability distribution comprises a normal probability distribution.

8. A computer-implemented method, comprising:

applying, by a system operatively coupled to a processor, a quantum fault-tolerant operation to a variationally prepared quantum state corresponding to a probability distribution to produce a quantum state corresponding to a target probability distribution, wherein the applying the quantum fault-tolerant operation comprises:

applying a first defined number of Gaussian operators to a second defined number of qubits, wherein the second defined number is a multiple of the first defined number by a third defined number corresponding to a length of a qubit register, and

performing affine transformations to adjust respective centers and respective volatilities of Gaussians resulting from the applying; and

estimating, by the system, at least one defined criterion of a quantum computer to be used to compute an expectation value of a stochastic process associated with the target probability distribution.

9. The computer-implemented method of claim 8 , wherein the performing the affine transformations obtains at least one of: a defined mean of the target probability distribution; a defined standard deviation of the target probability distribution; or one or more explicit parameters that specify the target probability distribution.

10. The computer-implemented method of claim 8 , wherein the applying the quantum fault-tolerant operation to the variationally prepared quantum state prepares the quantum state as a superposition over possible paths of a discrete time multivariate stochastic process.

11. The computer-implemented method of claim 8 , further comprising:

training, by the system, a variational quantum circuit to prepare the variationally prepared quantum state and to reduce computational costs of quantum arithmetic operations performed by the quantum computer to compute the expectation value of the stochastic process associated with the target probability distribution.

12. The computer-implemented method of claim 8 , further comprising:

training, by the system, a variational quantum circuit to prepare the variationally prepared quantum state; and

training, by the system, the variational quantum circuit using a Hamiltonian operator to generate a ground state corresponding to the target probability distribution.

13. The computer-implemented method of claim 8 , further comprising:

calculating, by the system, one or more errors associated with at least one of: the application of the quantum fault-tolerant operation to the variationally prepared quantum state to produce the quantum state; the estimation of the at least one defined criterion; or the computation of the expectation value of the stochastic process associated with the target probability distribution.

14. The computer-implemented method of claim 8 , wherein the at least one defined criterion is selected from a group consisting of an attribute, a condition, a property, a parameter, or a configuration of the quantum computer that enables the quantum computer to achieve a defined quantum advantage in computing the expectation value of the stochastic process associated with the target probability distribution, and wherein the probability distribution comprises a standard normal probability distribution and the target probability distribution comprises a normal probability distribution.

15. A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to:

apply a quantum fault-tolerant operation to a variationally prepared quantum state corresponding to a probability distribution to produce a quantum state corresponding to a target probability distribution, wherein the applying the quantum fault-tolerant operation comprises:

applying a first defined number of Gaussian operators to a second defined number of qubits, wherein the second defined number is a multiple of the first defined number by a third defined number corresponding to a length of a qubit register, and

performing affine transformations to adjust respective centers and respective volatilities of Gaussians resulting from the applying; and

estimate at least one defined criterion of a quantum computer to be used to compute an expectation value of a stochastic process associated with the target probability distribution.

16. The computer program product of claim 15 , wherein the performing the affine transformations obtains at least one of: a defined mean of the target probability distribution; a defined standard deviation of the target probability distribution; or one or more explicit parameters that specify the target probability distribution.

17. The computer program product of claim 15 , wherein the applying the quantum fault-tolerant operation to the variationally prepared quantum state prepares the quantum state as a superposition over possible paths of a discrete time multivariate stochastic process.

18. The computer program product of claim 15 , wherein the program instructions are further executable by the processor to cause the processor to:

train a variational quantum circuit to prepare the variationally prepared quantum state and to reduce computational costs of quantum arithmetic operations performed by the quantum computer to compute the expectation value of the stochastic process associated with the target probability distribution.

19. The computer program product of claim 15 , wherein the program instructions are further executable by the processor to cause the processor to:

train a variational quantum circuit to prepare the variationally prepared quantum state; and

train the variational quantum circuit using a Hamiltonian operator to generate a ground state corresponding to the target probability distribution.

20. The computer program product of claim 15 , wherein the program instructions are further executable by the processor to cause the processor to:

calculate one or more errors associated with at least one of: the application of the quantum fault-tolerant operation to the variationally prepared quantum state to produce the quantum state; the estimation of the at least one defined criterion; or the computation of the expectation value of the stochastic process associated with the target probability distribution.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 3, 2020
From: MAZZOLA, GUGLIELMO; WOERNER, STEFAN
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 054535/0641 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 3, 2020
From: KRISHNAKUMAR, RAJIV; ZENG, WILLIAM JOSEPH; STAMATOPOULOS, NIKITAS; CHAKRABARTI, SHOUVANIK
To: GOLDMAN SACHS & CO. LLC
Reel/Frame 054535/0728 →
Continuity (1)
Related Publication 20220188679A1 · Jun 16, 2022
References Cited (57)
US 10810665B2 · Woerner et al. · 2020 [cited by applicant]
US 20180336015A1 · Roetteler · 2018 [cited by examiner]
US 20200394537A1 · Wang · 2020 [cited by examiner]
WO 2019177951A1 · 2019 [cited by applicant]
Eldar et al., “Local Hamiltonians Whose Ground States are Hard to Approximate,” arXiv (2016)) (Year: 2016). [cited by examiner]
Gao et al., “A quantum machine learning algorithm based on generative models,” Sci. Adv. (2018) (Year: 2018). [cited by examiner]
Stamatopoulos et al., “Option Pricing using Quantum Computers,” arXiv (2019) (Year: 2019). [cited by examiner]
Nikitas Stamatopoulos, “Option Pricing using Quantum Computers,” YouTube generated transcript of presentation at Q2B 2019 (Feb. 2020) <https://www.youtube.com/watch?v=_e0TndqTxbo> (Year: 2020). [cited by examiner]
Tang et al., “Quantum Computation for Pricing the Collateral Debt Obligations,” arXiv (Aug. 6, 2020) (Year: 2020). [cited by examiner]
Mell et al., “The NIST Definition of Cloud Computing,” Recommendations of the National Institute of Standards and Technology, NIST Special Publication 800-145, Sep. 2011, 7 pages. [cited by applicant]
Aaronson et al., “Quantum Approximate Counting, Simplified,” Symposium on Simplicity in Algorithms, arXiv:1908.10846v5 [quant-ph], 2020, 13 pages. [cited by applicant]
Bhaskar et al., “Quantum Algorithms and Circuits for Scientific Computing,” Quantum Information and Computation 16, No. 3 & 4, arXiv:1511.08253 [quant-ph], 2016, 43 pages. [cited by applicant]
Black et al., “The pricing of options and corporate liabilities,” The Journal of Political Economy, vol. 81, No. 3, May-Jun. 1973, 19 pages. [cited by applicant]
Brassard et al., “Quantum Amplitude Amplification and Estimation,” Contemporary Mathematics, arXiv:quant-ph/0005055, 2002, 32 pages. [cited by applicant]
Cuccaro et al., “A new quantum ripple-carry addition circuit,” arXiv:quant-ph/0410184, 2004, 9 pages. [cited by applicant]
Dawson et al., “The Solovay-Kitaev Algorithm,” Quantum Information and Computation, arXiv:quant-ph/0505030, 2005, 15 pages. [cited by applicant]
Draper et al., “A logarithmic-depth quantum carry-lookahead adder,” Quant. Inf. Comp. vol. 6, No. 4-5, arXiv:quant-ph/0406142, 2006, 21 pages. [cited by applicant]
Egger et al., “Credit risk analysis using quantum computers,” arXiv:1907.03044v1 [quant-ph], 2019, 8 pages. [cited by applicant]
Gidney, “Asymptotically efficient quantum karatsuba multiplication,” arXiv:1904.07356v1 [quant-ph], 2019, 11 pages. [cited by applicant]
Grover et al., “Creating superpositions that correspond to efficiently integrable probability distributions,” arXiv:quant-ph/0208112, 2002, 2 pages. [cited by applicant]
Haner et al., “Optimizing quantum circuits for arithmetic,” arXiv:1805.12445v1 [quant-ph], 2018, 12 pages. [cited by applicant]
Holmes et al., “Efficient Quantum Circuits for Accurate State Preparation of Smooth, Differentiable Functions,” arXiv:2005.04351v1 [quant-ph], 2020, 12 pages. [cited by applicant]
Kaneko et al., “Quantum pricing with a smile: Implementation of local volatility model on quantum computer,” arXiv:2007.01467v1 [quant-ph], 2020, 29 pages. [cited by applicant]
McArdle et al., “Variational ansatz-based quantum simulation of imaginary time evolution,” Nature Partner Journals, Quantum Information, 2019, 6 pages. [cited by applicant]
Montanaro et al., “Quantum speedup of monte carlo methods,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2015, 20 pages. [cited by applicant]
Muñoz-Coreas et al., “T-count and Qubit Optimized Quantum Circuit Design of the Non-Restoring Square Root Algorithm,” J. Emerg. Technol. Comput. Syst., arXiv:1712.08254v3 [quant-ph], Oct. 2018, 16 pages. [cited by applicant]
Nakaji, “Faster amplitude estimation,” arXiv:2003.02417v3 [quant-ph], 2020, 13 pages. [cited by applicant]
Parent et al., “Improved reversible and quantum circuits for karatsuba-based integer multiplication,” arXiv:1706.03419v1 [quant-ph], 2017, 16 pages. [cited by applicant]
Peruzzo et al,, “A variational eigenvalue solver on a photonic quantum processor,” Nature Communications, 2014, 7 pages. [cited by applicant]
Plesch et al., “Quantum State Preparation with Universal Gate Decompositions,” Physical Review A, arXiv: 1003.5760v2 [quant-ph], 2011, 5 pages. [cited by applicant]
Rebentrost et al., “Quantum computational finance: Monte Carlo pricing of financial derivatives,” Physical Review A, arXiv:1805.00109v2 [quant-ph], 2018, 17 pages. [cited by applicant]
Ross et al., “Optimal ancilla-free clifford+T approximation of z-rotations,” Quantum Information and Computation, arXiv:1403.2975 [quant-ph], 2016, 40 pages. [cited by applicant]
Rubinstein et al., “Simulation and the Monte Carlo Method,” John Wiley & Sons, 2016, 396 pages. [cited by applicant]
Selinger, “Efficient Clifford+T approximation of single-qubit operators,” arXiv:1212.6253 [quant-ph], 2012, 17 pages. [cited by applicant]
Stamatopoulos et al., “Option pricing using quantum computers,” Quantum, arXiv:1905.02666v5 [quant-ph], 2020, 20 pages. [cited by applicant]
Stokes et al., “Quantum natural gradient,” Quantum, arXiv:1909.02108v3 [quant-ph], 2020, 15 pages. [cited by applicant]
Suzuki et al., “Amplitude estimation without phase estimation,” Quantum Information Processing, 2020, 17 pages. [cited by applicant]
Takahashi et al., “Quantum addition circuits and unbounded fan-out,” Quantum Information and Computation, vol. 10, No. 9 & 10, arXiv:0910.2530 [quant-ph], 2010, 17 pages. [cited by applicant]
Tanaka et al., “Amplitude estimation via maximum likelihood on noisy quantum computer,” arXiv:2006.16223 [quant-ph], 2020, 25 pages. [cited by applicant]
Thapliyal, “Mapping of Subtractor and Adder-Subtractor Circuits on Reversible Quantum Gates,” Springer Berlin Heidelberg, 2016, 25 pages. [cited by applicant]
Vazquez et al., “Efficient state preparation for quantum amplitude estimation,” arXiv:2005.07711v1 [quant-ph], 2020, 12 pages. [cited by applicant]
Venkateswaran et al., “Quantum approximate counting with nonadaptive grover iterations,” arXiv:2010.04370v1 [quant-ph], 2020, 13 pages. [cited by applicant]
Lee et al., “Quantum shift register,” arXiv:quant-ph/0112107, 2001, 3 pages. [cited by applicant]
Woerner et al., “Quantum risk analysis,” Nature Partner Journals, Quantum Information, 2019, 8 pages. [cited by applicant]
Zoufal et al., “Quantum generative adversarial networks for learning and loading random distributions,” Nature Partner Journals, Quantum Information, 2019, 9 pages. [cited by applicant]
Barkoutsos et al., “Quantum algorithms for electronic structure calculations: Particle-hole hamiltonian and optimized wave-function expansions,” Phys. Rev. A 98, arXiv: 1805.04340v1 [quant-ph], 2018, 14 pages. [cited by applicant]
Bocharov et al., “Efficient synthesis of universal repeat-until-success quantum circuits,” Physical Review Letters 114, arXiv:1404.5320v2 [quant-ph], 2015, 15 pages. [cited by applicant]
Grinko et al., “Iterative quantum amplitude estimation,” arXiv:1912.05559v2 [quant-ph], 2019, 13 pages. [cited by applicant]
Kim et al., “Efficient decomposition methods for controlled-r n using a single ancillary qubit,” www.nature.com/scientificreports, 2018. 7 pages. [cited by applicant]
Nielsen et al., “Quantum Information and Quantum Computation,” Cambridge University Press, 2010, 8 pages. [cited by applicant]
Ollitrault et al., “Non-adiabatic molecular quantum dynamics with quantum computers,” arXiv:2006.09405v1 [quant-ph], 2020, 12 pages. [cited by applicant]
Sellinger, “Quantum circuits of T-depth one,” Physical Review A, arXiv:1210.0974 [quant-ph], 2013, 5 pages. [cited by applicant]
Wiesner, “Simulations of many-body quantum systems by a quantum computer,” arXiv:quant-ph/9603028, 1996, 3 pages. [cited by applicant]
Zalka, “Simulating quantum systems on a quantum computer,” Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 1998, 11 pages. [cited by applicant]
Tang et al., “Quantum Computation for Pricing the Collateral Debt Obligations”, arXiv preprint arXiv:2008.04110, Aug. 6, 2020, 11 pages. [cited by applicant]
Stamatopoulos et al., “Option Pricing using Quantum Computers,” Quantum 4 (2020): 291, 20 pages. [cited by applicant]
International Search Report and Written Opinion received for PCT Application Serial No. PCT/IB2021/061336 dated Apr. 3, 2022, 11 pages. [cited by applicant]