IP Library › Granted Patent US 12,619,898
Granted Patent B1
US 12,619,898 · App. 17/934,105 · Granted May 5, 2026

Systems and methods for preparation of a quantum state encoding an approximate normal distribution

Inventors: Constantin Gonciulea (Summit, NJ); Vanio Markov (New York, NY); Charlee Alexandra Stefanski (New York, NY); Abhijit Bhima Rao (San Francisco, CA)
Assignee: Wells Fargo Bank, N.A.
G06N10/40
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,619,898
App. No.
17/934,105
Granted
May 5, 2026
Kind
B1
Abstract

Systems, apparatuses, methods, and computer program products are disclosed for preparation of a quantum state encoding an approximate normal distribution (QSEAND) in a set of qubits. An example method includes initializing the set of qubits by preparing the set of qubits in an initial quantum state. The example method also includes encoding the approximate normal distribution in the quantum state of the set of qubits, wherein encoding the approximate normal distribution comprises preparing the set of qubits to be in a quantum state representing a plurality of Fourier coefficients, and applying an inverse quantum Fourier transform to the set of qubits in the quantum state representing the plurality of Fourier coefficients to obtain the QSEAND. The example method also includes utilizing the QSEAND, wherein the utilization alters or transfers the QSEAND.

Claims (73)

1 . A method for preparation of a quantum state encoding an approximate normal distribution (QSEAND) in a set of qubits, the method comprising:

initializing, via state initialization circuitry, the set of qubits by preparing the set of qubits in an initial quantum state;

encoding, via state preparation circuitry, the approximate normal distribution in the quantum state of the set of qubits, wherein encoding the approximate normal distribution causes the set of qubits to be in the QSEAND, and wherein encoding the approximate normal distribution comprises:

preparing, via the state preparation circuitry, the set of qubits to be in a quantum state representing a plurality of Fourier coefficients, and

applying, via the state preparation circuitry, an inverse quantum Fourier transform to the set of qubits in the quantum state representing the plurality of Fourier coefficients to obtain the QSEAND; and

utilizing, via state transformation circuitry, the QSEAND, wherein the utilization alters or transfers the QSEAND.

2 . The method of claim 1 , wherein the quantum state representing the plurality of Fourier coefficients represents three Fourier coefficients or five Fourier coefficients.

3 . The method of claim 1 , wherein utilizing the QSEAND comprises:

measuring the QSEAND;

storing information from the QSEAND;

further transforming the QSEAND with a quantum circuit; or

a combination thereof.

4 . The method of claim 1 , further comprising:

before encoding the approximate normal distribution: transpiling, via transpilation circuitry, a quantum circuit to obtain a transpiled quantum circuit,

wherein encoding the approximate normal distribution in the quantum state of the set of qubits uses the transpiled quantum circuit.

5 . The method of claim 1 , further comprising:

acquiring, via communications hardware, user input providing attributes of the approximate normal distribution;

wherein encoding the approximate normal distribution in the quantum state of the set of qubits proceeds according to the attributes of the approximate normal distribution from the user input.

6 . The method of claim 1 , wherein utilizing the QSEAND comprises:

initializing, via the state initialization circuitry, a second set of qubits;

entangling, via the state transformation circuitry, the set of qubits with the second set of qubits using a transformation derived from a payoff function of a financial product;

applying a first transformation H, via the state transformation circuitry, to the set of qubits, wherein the first transformation H results in the set of qubits being in superposition;

applying a second transformation U, via the state transformation circuitry, to the second set of qubits, wherein the Hermitian conjugate of U encodes a linear distribution function; and

measuring, via the state transformation circuitry, a quantum state of the set of qubits and the second set of qubits to evaluate a price for the financial product.

7 . The method of claim 1 , wherein the QSEAND models a feature of a dataset used to build a linear classifier, wherein the distribution of the feature of the dataset lies within a pre-defined tolerance of values of the normal distribution.

8 . The method of claim 1 , wherein values of the approximate normal distribution lie within a pre-defined tolerance of values of the normal distribution.

9 . An apparatus for preparing a QSEAND in a set of qubits, the apparatus comprising:

state initialization circuitry configured to:

initialize the set of qubits by preparing the set of qubits in an initial quantum state;

state preparation circuitry configured to:

encode an approximate normal distribution in the quantum state of the set of qubits, wherein encoding the approximate normal distribution causes the set of qubits to be in the QSEAND, and wherein encoding the approximate normal distribution comprises:

preparing, via the state preparation circuitry, the set of qubits to be in a quantum state representing a plurality of Fourier coefficients, and

applying, via the state preparation circuitry, an inverse quantum Fourier transform to the set of qubits in the quantum state representing the plurality of Fourier coefficients to obtain the QSEAND; and

state transformation circuitry configured to:

utilize the QSEAND, wherein the utilization alters or transfers the QSEAND.

10 . The apparatus of claim 9 , wherein the quantum state representing the plurality of Fourier coefficients represents three Fourier coefficients or five Fourier coefficients.

11 . The apparatus of claim 9 , wherein utilizing the QSEAND comprises:

measuring the QSEAND;

storing information from the QSEAND;

further transforming the QSEAND with a quantum circuit; or

a combination thereof.

12 . The apparatus of claim 9 , further comprising:

transpilation circuitry configured to:

before encoding the approximate normal distribution: transpile a quantum circuit to obtain a transpiled quantum circuit,

wherein the state transformation circuitry is further configured such that encoding the approximate normal distribution in the quantum state of the set of qubits uses the transpiled quantum circuit.

13 . The apparatus of claim 9 , further comprising:

communications hardware configured to:

acquire user input providing attributes of the approximate normal distribution,

wherein encoding the approximate normal distribution in the quantum state of the set of qubits proceeds according to the attributes of the approximate normal distribution from the user input.

14 . The apparatus of claim 9 , wherein utilizing the QSEAND comprises:

initializing a second set of qubits;

entangling the set of qubits with the second set of qubits using a transformation derived from a payoff function of a financial product;

applying a first transformation H to the set of qubits; wherein the first transformation H creates a superposition quantum state in the set of qubits;

applying a second transformation U to the second set of qubits, wherein the Hermitian conjugate of U encodes a linear distribution function; and

measuring a quantum state of the set of qubits and second set of qubits to evaluate a price for the financial product.

15 . The apparatus of claim 9 , wherein the QSEAND models a feature of a dataset used to build a linear classifier, wherein the distribution of the feature of the dataset lies within a pre-defined tolerance of values of the normal distribution.

16 . The apparatus of claim 9 , wherein values of the approximate normal distribution lie within a pre-defined tolerance of values of the normal distribution.

17 . A computer program product for preparing a QSEAND in a set of qubits, the computer program product comprising at least one non-transitory computer-readable storage medium storing software instructions that, when executed, cause an apparatus to:

initialize the set of qubits by preparing the set of qubits in an initial quantum state;

encode an approximate normal distribution in the quantum state of the set of qubits, wherein encoding the approximate normal distribution causes the set of qubits to be in the QSEAND, and wherein encoding the approximate normal distribution comprises:

preparing the set of qubits to be in a quantum state representing a plurality of Fourier coefficients, and

applying an inverse quantum Fourier transform to the set of qubits in the quantum state representing the plurality of Fourier coefficients to obtain the QSEAND; and

utilize the QSEAND, wherein the utilization alters or transfers the QSEAND.

18 . The computer program product of claim 17 , wherein values of the approximate normal distribution lie within a pre-defined tolerance of values of the normal distribution.

19 . The computer program product of claim 17 , wherein the software instructions, when executed, further cause the apparatus to:

before encoding the approximate normal distribution: transpiling a quantum circuit to obtain a transpiled quantum circuit,

wherein encoding the approximate normal distribution in the quantum state of the set of qubits uses the transpiled quantum circuit.

20 . The computer program product of claim 17 , wherein utilizing the QSEAND comprises:

initializing a second set of qubits;

entangling the set of qubits with the second set of qubits using a transformation derived from a payoff function of a financial product;

applying a first transformation H to the set of qubits, wherein the first state preparation transformation H creates a superposition quantum state in the set of qubits;

applying a second transformation U to the second set of qubits, wherein the Hermitian conjugate of U encodes a linear distribution function; and

measuring a quantum state of the set of qubits and the second set of qubits to evaluate a price for the financial product.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 28, 2022
From: GONCIULEA, CONSTANTIN; MARKOV, VANIO; STEFANSKI, CHARLEE ALEXANDRA; RAO, ABHIJIT BHIMA
To: WELLS FARGO BANK, N.A.
Reel/Frame 061887/0291 →
References Cited (44)
US 11516190B1 · McCarty · 2022 [cited by examiner]
US 11593707B2 · Romero · 2023 [cited by examiner]
US 11694107B1 · Budinski · 2023 [cited by applicant]
US 12346770B2 · Babbush · 2025 [cited by examiner]
US 12530607B1 · Gonciulea · 2026 [cited by examiner]
US 20030005010A1 · Cleve · 2003 [cited by applicant]
US 20110153257A1 · Ishizaka · 2011 [cited by examiner]
US 20180096258A1 · Burchard · 2018 [cited by applicant]
US 20200089832A1 · Shao · 2020 [cited by applicant]
US 20200104740A1 · Cao · 2020 [cited by examiner]
US 20200334563A1 · Gambetta · 2020 [cited by applicant]
US 20200342344A1 · Gambetta · 2020 [cited by applicant]
US 20210271477A1 · Jiang · 2021 [cited by examiner]
US 20210271999A1 · Paik · 2021 [cited by examiner]
US 20210357229A1 · Gonciulea · 2021 [cited by applicant]
US 20210365622A1 · Gonthier · 2021 [cited by examiner]
US 20220391468A1 · Sun · 2022 [cited by examiner]
US 20230030423A1 · Rubin · 2023 [cited by applicant]
US 20230036827A1 · Herbert · 2023 [cited by applicant]
US 20230385676A1 · Mentovich · 2023 [cited by examiner]
US 20240020568A1 · Orus Lacort · 2024 [cited by examiner]
US 20240119326A1 · Satzinger · 2024 [cited by examiner]
US 20240152794A1 · Chiaro · 2024 [cited by examiner]
US 20240183670A1 · Ushijima-Mwesigwa · 2024 [cited by applicant]
US 20240193450A1 · Naveh · 2024 [cited by examiner]
US 20240220836A1 · Debroy · 2024 [cited by examiner]
US 20250181951A1 · Gross · 2025 [cited by examiner]
Vanio Markov, Charlee Stefanski, Abhijit Rao, and Constantin Gonciulea. “A Generalized Quantum Inner Product and Applications to Financial Engineering”. 2022. [cited by applicant]
Lov K Grover. “A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing”, pp. 212-219, 1996. [cited by applicant]
Don Coppersmith. “An approximate fourier transform useful in quantum factoring. Technical Report IBM Research Report RC19642”, IBM, 1994. [cited by applicant]
Austin Gilliam, Charlene Venci, Sreraman Muralidharan, Vitaliy Dorum, Eric May, Rajesh Narasimhan, and Constantin Gonciulea. “Foundational patterns for efficient quantum computing”, 2021. URL: https://arxiv.org/abs/1907… [cited by applicant]
Austin Gilliam, Stefan Woerner, and Constantin Gonciulea. “Grover adaptive search for constrained polynomial binary optimization”. Quantum, 5:428, Apr. 2021. ISSN 2521-327X. DOI: 10.22331/q-2021-04-08-428. [cited by applicant]
Maria Schuld and Nathan Killoran. “Quantum machine learning in feature hilbert spaces”. Physical Review Letters, 122(4), Feb. 2019. ISSN 1079-7114. DOI: 10.1103/physrevlett.122.040504. [cited by applicant]
Ryan O'Donnell. “Analysis of boolean functions”. CoRR, abs/2105.10386, 2021. URL: https://arxiv.org/abs/2105.10386. [cited by applicant]
Steven Herbert. “No. quantum speedup with grover-rudolph state preparation for quantum monte carlo integration”. Physical Review E, 103(6), Jun. 2021. ISSN 2470-0053. DOI: 10.1103/physreve.103.063302. [cited by applicant]
Stefan Woerner and Daniel J. Egger. “Quantum risk analysis”. npj Quantum Information, 5 (1), Feb. 2019. ISSN 2056-6387. DOI: 10.1038/s41534-019-0130-6. [cited by applicant]
David H Raab and Edward H Green. “A cosine approximation to the normal distribution”. Psychometrika, 26(4):447-450, 1961. ISSN 0033-3123. [cited by applicant]
Nikitas Stamatopoulos, Daniel J. Egger, Yue Sun, Christa Zoufal, Raban Iten, Ning Shen, and Stefan Woerner. “Option pricing using quantum computers”. Quantum, 4:291, Jul. 2020. ISSN 2521-327X. DOI: 10.22331/q-2020-07-06… [cited by applicant]
Harry Buhrman, Richard Cleve, John Watrous, and Ronald de Wolf. “Quantum fingerprinting”. Physical Review Letters, 87 (16), Sep. 2001. ISSN 1079-7114. DOI: 10.1103/physrevlett.87.167902. [cited by applicant]
Seth Lloyd, Masoud Mohseni, and Patrick Rebentrost. “Quantum algorithms for supervised and unsupervised machine learning”, 2013. [cited by applicant]
Francesco Tacchino, Chiara Macchiavello, Dario Gerace, and Daniele Bajoni. “An artificial neuron implemented on an actual quantum processor”. npj Quantum Information, 5(1), Mar. 2019. ISSN 2056-6387. DOI: 10.1038/s41534… [cited by applicant]
Yunchao Liu, Srinivasan Arunachalam, and Kristan Temme. “A rigorous and robust quantum speed-up in supervised machine learning”. CoRR, abs/2010.02174, 2020. URL: http://dblp.uni-trier.de/db/journals/corr/corr2010.html#a… [cited by applicant]
Botsinis et al., “Quantum Search Algorithms for Wireless Communications”, in IEEE Communications Surveys & Tutorials, vol. 21, No. 2, Second Quarter 2019, pp. 1209-1242. [cited by applicant]
Schuld et al., “The effect of data encoding on the expressive power of variational quantum machine learning models”, arXiv preprint arXiv:2008.08605vs, Oct. 9, 2021 (16 pages). [cited by applicant]