IP Library Granted Patent US 12,639,610
Granted Patent B2
US 12,639,610 · App. 17/684,254 · Granted May 26, 2026

Quantum-classical hybrid computer for calculating arithmetic functions using fourier analysis

Inventor: Steven Herbert (Cambridge, GB)
Assignee: Quantinuum Ltd
G06N10/60G06N10/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,639,610
App. No.
17/684,254
Filed
Mar 1, 2022
Granted
May 26, 2026
Kind
B2
Art Unit
2125
USPC
706/62
Abstract

A quantum computing system includes a classical computer coupled in combination with a quantum computer, wherein the quantum computing system is configurable to execute program instructions to process input data to generate corresponding output data. The program instructions include one or more arithmetic functions to be executed using the quantum computer. The quantum computing system is configured to apply a transformation to transform the one or more arithmetic functions into a series of Fourier components that are executable using the quantum computer by using one or more quantum circuits utilizing rotation gates acting on qubits representing the Fourier components, and to process outputs from the one or more quantum circuits to generate results of the one or more arithmetic functions, wherein the results are used to generate the corresponding output data.

Claims (53)

1 . A quantum computing system configured to compute a value of an arithmetic function using samples from a probability distribution, the quantum computing system comprising:

a classical computer;

a quantum computer comprising one or more qubits and one or more quantum gates configured to act on the one or more qubits, wherein at least a portion of quantum gates comprise rotation gates, and wherein the quantum computer is in communication with the classical computer;

a non-transitory memory configured to store specific computer-executable instructions; and

a hardware processor in communication with the non-transitory memory, wherein the hardware processor is configured to execute the specific computer-executable instructions to at least:

receive input data, wherein the input data comprise at least the arithmetic function;

transform the arithmetic function into a series of Fourier components;

generate configuration data, based at least in part on the Fourier components and the input data, by determining a symbolic form of a quantum circuit A and a numerical value of the symbolic form of the quantum circuit A for each Fourier component, wherein the configuration data comprises a number of uses of A for each Fourier component;

determine the number of uses of A based at least in part on a desired value of an error function;

configure the quantum computer based at least in part on the configuration data to prepare one or more quantum circuits representing the Fourier components, wherein the one or more quantum circuits comprise the rotation gates;

execute a quantum algorithm using the one or more quantum circuits to generate outputs comprising quantum measurement results; and

generate output data comprising the value of the arithmetic function using the quantum measurement results.

2 . The quantum computing system of claim 1 , wherein the hardware processor is further configured to execute the specific computer-executable instructions to determine the number of uses of A based at least in part on the input data.

3 . The quantum computing system of claim 1 , wherein the input data further comprise the probability distribution.

4 . The quantum computing system of claim 1 , wherein the quantum algorithm comprises a quantum amplitude estimation algorithm.

5 . The quantum computing system of claim 1 , wherein the input data comprise a stopping criterion or data usable to determine a stopping criterion.

6 . The quantum computing system of claim 5 , wherein the hardware processor is further configured to execute the specific computer-executable instructions to determine a maximum number of Fourier components based at least in part on the stopping criterion or the data usable to determine a stopping criterion.

7 . The quantum computing system of claim 6 , wherein a number of Fourier components is equal to or less than the maximum number of Fourier components.

8 . The quantum computing system of claim 1 , wherein the probability distribution comprises a marginal probability distribution associated with a multidimensional discrete probability distribution.

9 . The quantum computing system of claim 8 , wherein the arithmetic function is a continuous function that has a continuous first derivative over support of a probability function associated with the probability distribution.

10 . The quantum computing system of claim 1 , wherein the probability distribution comprises samples from a single dimension of a multivariate probability distribution.

11 . The quantum computing system of claim 1 , wherein the value of the arithmetic function is an expectation value of the arithmetic function.

12 . The quantum computing system of claim 11 , wherein the expectation value of the arithmetic function is a mean of the probability distribution.

13 . The quantum computing system of claim 1 , wherein the hardware processor is a hardware processor of the classical computer.

14 . The quantum computing system of claim 1 , wherein the classical computer is a classical computer in a remote computing system.

15 . The quantum computing system of claim 14 , wherein a controller of the quantum computer is configured to receive compiled configuration data generated by the classical computer and to configure the quantum computer based at least in part on the compiled configuration data.

16 . The quantum computing system of claim 14 , wherein the classical computer is in communication with the quantum computer via a wireless communication link.

17 . A quantum computing system configured to compute a value of an arithmetic function using samples from a probability distribution, the quantum computing system comprising:

a classical computer;

a quantum computer comprising one or more qubits and one or more quantum gates configured to act on the one or more qubits, wherein at least a portion of quantum gates comprise rotation gates, and wherein the quantum computer is in communication with the classical computer;

a non-transitory memory configured to store specific computer-executable instructions; and

a hardware processor in communication with the non-transitory memory, wherein the hardware processor is configured to execute the specific computer-executable instructions to at least:

receive input data, wherein the input data comprise at least the arithmetic function;

transform the arithmetic function into a series of Fourier components;

generate configuration data, based at least in part on the Fourier components and the input data, by:

determining a symbolic form of a quantum circuit A and a numerical value of the symbolic form of the quantum circuit A for each Fourier component; and

determining a symbolic form of a quantum circuit P;

configure the quantum computer based at least in part on the configuration data to prepare one or more quantum circuits representing the Fourier components, wherein the one or more quantum circuits comprise the rotation gates;

execute a quantum algorithm using the one or more quantum circuits to generate outputs comprising quantum measurement results; and

generate output data comprising the value of the arithmetic function using the quantum measurement results, wherein the symbolic form of the quantum circuit A is generated based at least in part on the symbolic form of the quantum circuit P.

18 . The quantum computing system of claim 17 , wherein the hardware processor is further configured to execute the specific computer-executable instructions to configure the quantum computer by further preparing a quantum state |p> associated with the probability distribution using the quantum circuit P.

19 . A method for operating a quantum computing system configured to compute a value of an arithmetic function using samples from a probability distribution, the quantum computing system comprising:

a classical computer; and

a quantum computer comprising one or more qubits and one or more quantum gates configured to act on the one or more qubits, wherein at least a portion of quantum gates comprise rotation gates, and wherein the quantum computer is in communication with the classical computer;

the method comprising, by a hardware processor of the quantum computing system executing instructions stored on non-transitory memory connected to the hardware processor:

receiving input data, wherein the input data comprise at least the arithmetic function;

transforming the arithmetic function into a series of Fourier components;

generating configuration data, based at least in part on the Fourier components and the input data, by determining a symbolic form of a quantum circuit A and a numerical value of the symbolic form of the quantum circuit A for each Fourier component, wherein the configuration data comprises a number of uses of A for each Fourier component;

determining the number of uses of A based at least in part on a desired value of an error function;

configuring the quantum computer based at least in part on the configuration data to prepare one or more quantum circuits representing the Fourier components, wherein the one or more quantum circuits comprise the rotation gates;

executing a quantum algorithm using the one or more quantum circuits to generate outputs comprising quantum measurement results; and

generating output data comprising the value of an arithmetic function using the quantum measurement results.

20 . A non-transitory machine-readable data storage medium comprising specific instructions that are executable on data processing hardware, wherein the specific instructions, when executed by the data processing hardware, implement the method of claim 19 .

Assignments (2)
CHANGE OF NAME Recorded Oct 30, 2023
From: CAMBRIDGE QUANTUM COMPUTING LIMITED
To: QUANTINUUM LTD
Reel/Frame 065396/0682 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 19, 2022
From: HERBERT, STEVEN
To: CAMBRIDGE QUANTUM COMPUTING LTD.
Reel/Frame 061285/0464 →
Priority Claims (3)
GB 2102902 · Mar 2, 2021 · national
SE 2130060-3 · Mar 2, 2021 · national
GB 2110299 · Jul 16, 2021 · national
Continuity (1)
Related Publication 20230036827A1 · Feb 2, 2023
References Cited (43)
US 11537870B1 · Teig · 2022 [cited by examiner]
US 20160328253A1 · Majumdar · 2016 [cited by examiner]
US 20180040032A1 · Chalasani · 2018 [cited by examiner]
US 20190220497A1 · Wiebe · 2019 [cited by examiner]
US 20190236627A1 · Christensen · 2019 [cited by examiner]
US 20200167278A1 · Gunnels · 2020 [cited by examiner]
US 20200349457A1 · Low et al. · 2020 [cited by applicant]
US 20210279625A1 · Shani · 2021 [cited by examiner]
US 20210287126A1 · Prakash et al. · 2021 [cited by applicant]
US 20220014364A1 · McCarty · 2022 [cited by examiner]
US 20220107989A1 · Kachman · 2022 [cited by examiner]
US 20220222412A1 · Huffman · 2022 [cited by examiner]
WO WO15188025 · 2015 [cited by applicant]
WO WO18086761 · 2018 [cited by applicant]
Aaronson et al., Jan. 2020, Quantum approximate counting, simplified, Symposium on Simplicity in Algorithms, pp. 24-32, http://dx.doi.org/10.1137/1.9781611976014.5. [cited by applicant]
Bennett et al., 2020. Quantum cryptography: Public key distribution and coin tossing, Theoretical Computer Science, 560:7-11. [cited by applicant]
Brassard et al., Mar. 2, 2000, Quantum amplitude amplification and estimation, arXiv:quanti-ph/0005055v1, 32 pp. [cited by applicant]
Chakrabarti et al., Dec. 16, 2020, A threshold for quantum advantage in derivative pricing, arXiv:2012.03819v2 [quant-ph], 36 pp. [cited by applicant]
Egger et al., Jul. 5, 2019, Credit risk analysis using quantum computers, arXiv:1907.03044v1 [quant-ph], 8 pp. [cited by applicant]
Grinko et al., Dec. 11, 2019, Iterative quantum amplitude estimation, arXiv:1912.05559v1 [quant-ph], 10 pp. [cited by applicant]
Grover Aug. 15, 2002, Creating superpositions that correspond to efficiently integrable probability distributions, arXiv:quant-ph/0208112v1, 2 pp. [cited by applicant]
Herbert, Dec. 10, 2021, Quantum Monte-Carlo integration: the full advantage in minimal circuit depth, ariv:2105.09100v3 [quant-ph], 17 pp. [cited by applicant]
Herbert, May 18, 2021, The problem with grover-rudolph state preparation for quantum monte-carlo integration, arxiv:2101.02240v2 [quant-ph], 7 pp. [cited by applicant]
Koch et al., Aug. 24, 2020, Fundamentals In Quantum Algorithms: A Tutorial Series Using Qiskit Continued, arxiv.org, Cornell University Library, 170 pp. [cited by applicant]
Koch et al., Jan. 21, 2021, Gate-Based Circuit Designs for Quantum Adder Inspired Quantum Random Walks on Superconducting Qubits, arXiv:2012.10268v2 [quant-ph] 15 pp. [cited by applicant]
Lloyd et al., Jul. 2018, Quantum generative adversarial learning, Physical Review Letters, 121(4):040502, 5 pp. [cited by applicant]
Nakaji, Mar. 5, 2020, Faster amplitude estimation, arXiv:2003.02417v1 [quant-ph], 10 pp. [cited by applicant]
Nielsen et al., 2000, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK, pp. 608-609. [cited by applicant]
Orus et al., 2019, Quantum computing for finance: Overview and prospects, Review in Physics, 4:100028, 12 pp. [cited by applicant]
Pogorelov et al., Jun. 7, 2021, A compact ion-trap quantum computing demonstrator, arXiv:2101.11390v3 [quant-ph], 22 pp. [cited by applicant]
Rebentrost et al., Nov. 9, 2018, Quantum computational finance: quantum algorithm for portfolio optimization, arXiv:1811.03975v1 [quant-ph]. [cited by applicant]
Scherer et al., Jan. 25, 2017, Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target, Quantum Information Processing, 16(3):1-65. [cited by applicant]
Stamatopoulos et al., Jul. 2020, Option pricing using quantum computers, Quantum, 4:291. [cited by applicant]
Suzuki et al., Jan. 2020, Amplitude estimation without phase estimation, Quantum Information Processing, 19:75http://dx.doi.org/10.1007/s11128-019-2565-2, 17 pp. [cited by applicant]
Suzuki et al., Jan. 2020, Amplitude estimation without phase estimation, arXiv:1904.10246v2 [quant-ph], 13 pp. [cited by applicant]
Van den Berg et al., 2020, Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters, arXiv:2003.13599v2 [quant-ph], 28 pp. [cited by applicant]
Vazquez et al., 2021, Efficient state preparation for quantum amplitude estimation. Physical Review Applied, 15(3), 034027. [cited by applicant]
Vazquez et al., May 15, 2020, Efficient state preparation for quantum amplitude estimation, arXiv:2005.0771v1 [quant-ph], 12 pp. [cited by applicant]
Woerner et al., Feb. 2019, Quantum risk analysis, NPJ/Quantum Information, 5(15), 8 pp. [cited by applicant]
Zhou et al., Feb. 10, 2017, Quantum Fourier transform in computational basis, Quantum Information Processing, 16(3):1-19. [cited by applicant]
Zoufal et al., Nov. 2019, Quantum generative adversarial networks for learning and loading random distributions, npj Quantum Information, 5:103, 9 pp. [cited by applicant]
European Search Report for Appl. No. EP 22159844, Sep. 8, 2022, 10 pp. [cited by applicant]
Nagy et al., 2006, Quantum computation and quantum information, International Journal of Parallel, Emergent and Distributed Systems, 21:1, 1-59. [cited by applicant]