IP Library Granted Patent US 12,676,739
Granted Patent B2
US 12,676,739 · App. 18/431,009 · Granted Jul 7, 2026

Quantum neural network

Inventors: Hartmut Neven (Malibu, CA); Edward Henry Farhi (Venice, CA)
Assignee: Google LLC
H04L9/0852B82Y10/00G06N3/063G06N3/08G06N10/00G06N10/60G06N20/00H04L2209/34
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,676,739
App. No.
18/431,009
Filed
Feb 2, 2024
Granted
Jul 7, 2026
Kind
B2
Examiner
SONG, HOSUK
Art Unit
2435
USPC
380/256
Abstract

A quantum neural network architecture. In one aspect, a quantum neural network trained to perform a machine learning task includes: an input quantum neural network layer comprising (i) multiple qubits prepared in an initial quantum state encoding a machine learning task data input, and (ii) a target qubit; a sequence of intermediate quantum neural network layers, each intermediate quantum neural network layer comprising multiple quantum logic gates that operate on the multiple qubits and target qubit; and an output quantum neural network layer comprising a measurement quantum gate that operates on the target qubit and provides as output data representing a solution to the machine learning task.

Claims (166)

1 . A quantum neural network system implemented by one or more quantum processors, the quantum neural network comprising:

an input quantum neural network layer comprising a plurality of qubits prepared in an initial quantum state and encoding a machine learning task data input;

a sequence of intermediate quantum neural network layers, each intermediate quantum neural network layer comprising multiple parameterized quantum logic gates that operate on the plurality of qubits, wherein values of parameters of the multiple parameterized quantum logic gates are determined during training using a loss function; and

an output quantum neural network layer comprising multiple measurement quantum gates, wherein the output quantum neural network layer provides as output a measurement result that represents a solution to the machine learning task;

wherein the machine learning task comprises a binary classification task; and

wherein the machine learning task data input comprises a Boolean function input {0, 1} n and the solution to the machine learning task comprises a Boolean function output {0, 1}.

2 . The quantum neural network system of claim 1 , wherein the multiple parameterized quantum logic gates comprise Y gates.

3 . The quantum neural network system of claim 1 , wherein the multiple parameterized quantum logic gates comprise single qubit gates of the form exp(−iθ j X j ), wherein j indexes the single qubit, θ i represents parameters of the single qubit gate, and X i represents a Pauli X operator on qubit j.

4 . The quantum neural network system of claim 1 , wherein the multiple parameterized quantum logic gates comprise two qubit gates of the form exp(−iθZ i Z k ), wherein θ represents parameters of the two qubit gate, Z i represents a Pauli Z operator on qubit j, and Z k represents a Pauli Z operator on qubit k.

5 . The quantum neural network system of claim 1 , wherein the loss function is given by

Loss

(

s

,

θ

)

=

(

ψ

(

θ

,

z

s

)

"\[LeftBracketingBar]"

σ

y

out

"\[RightBracketingBar]"

ψ

(

θ

,

z

s

)

-

y

s

)

2

where θ represents the parameters of the multiple quantum logic gates, ψ(θ, z s ) represents an evolved quantum state of the plurality of qubits, σ v out represents the measurement quantum gates, and y s represents a known binary classification for a corresponding Boolean function input.

6 . The quantum neural network system of claim 1 , wherein the sequence of intermediate quantum neural network layers evolve the initial quantum state under a sequence of unitary operators that is parameterized by the parameters of the multiple parameterized quantum logic gates.

7 . A method for processing a data input using a quantum neural network that has been trained to perform a machine learning task, the method comprising:

preparing multiple qubits of an input quantum neural network layer in an initial quantum state to encode machine learning task data input;

processing the initial quantum state using one or more intermediate quantum neural network layers to generate an evolved quantum state, each intermediate quantum neural network layer comprising multiple parameterized quantum logic gates that operate on the multiple qubits, wherein values of parameters of the multiple parameterized quantum logic gates are determined during training using a loss function; and

measuring the multiple qubits in the evolved quantum state using multiple measurement quantum gates in an output quantum neural network layer to generate an output that represents a solution to the machine learning task;

wherein the machine learning task comprises a binary classification task; and

wherein the machine learning task data input comprises a Boolean function input {0, 1} n and the solution to the machine learning task comprises a Boolean function output {0, 1}.

8 . The method of claim 7 , wherein the multiple parameterized quantum logic gates comprise Y gates.

9 . The method of claim 7 , wherein processing the initial quantum state using the one or more intermediate quantum neural network layers comprises, for each intermediate quantum neural network layer and in a sequence, applying quantum logic gates in the intermediate quantum neural network layer to a current quantum state of the multiple qubits.

10 . The method of claim 7 , wherein the multiple parameterized quantum logic gates comprise single qubit gates of the form exp(−θ i X i ), wherein j indexes the single qubit, θ i represents parameters of the single qubit gate, and X i represents a Pauli X operator on qubit j.

11 . The method of claim 7 , wherein the multiple parameterized quantum logic gates comprise two qubit gates of the form exp(−iθZ j Z k ), wherein θ represents parameters of the two qubit gate, Z j represents a Pauli Z operator on qubit j, and Z k represents a Pauli Z operator on qubit k.

12 . The method of claim 7 , wherein the loss function is given by

Loss

(

s

,

θ

)

=

(

ψ

(

θ

,

z

s

)

"\[LeftBracketingBar]"

σ

y

out

"\[RightBracketingBar]"

ψ

(

θ

,

z

s

)

-

y

s

)

2

where θ represents the parameters of the multiple quantum logic gates, ψ(θ, z s ) represents an evolved quantum state of the multiple qubits, σ y out represents the measurement quantum gates, and y s represents a known binary classification for a corresponding Boolean function input.

13 . The method of claim 7 , wherein the intermediate quantum neural network layers evolve the initial quantum state under a sequence of unitary operators that is parameterized by the parameters of the multiple parameterized quantum logic gates.

14 . A method for training a quantum neural network, the method comprising:

obtaining multiple training examples, each training example comprising a machine learning task input paired with a known classification for the machine learning task input; and

training the quantum neural network on the training examples, comprising, for each training example:

preparing multiple qubits of an input quantum neural network layer in an initial quantum state to encode a machine learning task input included in the training example;

processing the initial quantum state using one or more intermediate quantum neural network layers, to generate an evolved quantum state, each intermediate quantum neural network layer comprising multiple parameterized quantum logic gates that operate on the multiple qubits;

measuring the multiple qubits in the evolved quantum state using multiple measurement quantum gates in an output quantum neural network layer to generate an output that represents a solution to the machine learning task;

using a loss function to compare the output to a known classification included in the training example and determine one or more adjustments to parameters of the multiple parameterized quantum logic gates; and

adjusting values of the gate parameters from initial values to trained values.

15 . The method of claim 14 , wherein the multiple parameterized quantum logic gates comprise Y gates.

16 . The method of claim 14 , wherein the multiple parameterized quantum logic gates comprise single qubit gates of the form exp(−iθ j X i ), wherein j indexes the single qubit, θ j represents parameters of the single qubit gate, and X j represents a Pauli X operator on qubit j.

17 . The method of claim 14 , wherein the multiple parameterized quantum logic gates comprise two qubit gates of the form exp(−iθZ j Z k ), wherein θ represents parameters of the two qubit gate, Z j represents a Pauli Z operator on qubit j, and Z k represents a Pauli Z operator on qubit k.

18 . The method of claim 14 , wherein the loss function is given by

Loss

(

s

,

θ

)

=

(

ψ

(

θ

,

z

s

)

"\[LeftBracketingBar]"

σ

y

out

"\[RightBracketingBar]"

ψ

(

θ

,

z

s

)

-

y

s

)

2

where θ represents the parameters of the multiple quantum logic gates, ψ(θ, z s ) represents an evolved quantum state of the multiple qubits, σ y out our represents the measurement quantum gates, and y z represents a known binary classification for a corresponding Boolean function input.

19 . The method of claim 14 , wherein the intermediate quantum neural network layers evolve the initial quantum state under a sequence of unitary operators that is parameterized by the parameters of the multiple parameterized quantum logic gates.

20 . The method of claim 14 , wherein processing the initial quantum state using the one or more intermediate quantum neural network layers comprises, for each intermediate quantum neural network layer and in a sequence, applying quantum logic gates in the intermediate quantum neural network layer to a current quantum state of the multiple qubits.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 13, 2024
From: NEVEN, HARTMUT; FARHI, EDWARD HENRY
To: GOOGLE LLC
Reel/Frame 066454/0421 →
Continuity (4)
Continuation 18117232 · Mar 3, 2023
Continuation 16618713 · Jun 1, 2018
Provisional Application 62514475 · Jun 2, 2017
Related Publication 20250240154A1 · Jul 24, 2025
References Cited (78)
US 10417553B2 · Adachi et al. · 2019 [cited by applicant]
US 10637142B1 · Tran · 2020 [cited by examiner]
US 10755188B2 · Ashrafi et al. · 2020 [cited by applicant]
US 11152925B2 · Debnath et al. · 2021 [cited by applicant]
US 11507872B2 · Cao et al. · 2022 [cited by applicant]
US 11537928B2 · Cao et al. · 2022 [cited by applicant]
US 11562284B1 · Ryan et al. · 2023 [cited by applicant]
US 11568293B2 · Linvill · 2023 [cited by applicant]
US 11593707B2 · Romero et al. · 2023 [cited by applicant]
US 11601265B2 · Neven et al. · 2023 [cited by applicant]
US 11829877B2 · Kerenidis · 2023 [cited by examiner]
US 11836572B2 · Bondesan · 2023 [cited by examiner]
US 11900219B1 · Ryan · 2024 [cited by examiner]
US 11924334B2 · Neven · 2024 [cited by examiner]
US 11960972B1 · Otterbach · 2024 [cited by examiner]
US 11989162B2 · Ganesh · 2024 [cited by examiner]
US 12001918B2 · Farhi · 2024 [cited by examiner]
US 12001923B2 · Tezak · 2024 [cited by examiner]
US 12165004B2 · Pichler · 2024 [cited by examiner]
US 12182661B2 · Rigetti · 2024 [cited by examiner]
US 12204991B1 · Ryan · 2025 [cited by examiner]
US 20150317558A1 · Adachi et al. · 2015 [cited by applicant]
US 20190220497A1 · Wiebe et al. · 2019 [cited by applicant]
US 20200272930A1 · Aspuru-Guzik et al. · 2020 [cited by applicant]
US 20210089955A1 · Bondesan et al. · 2021 [cited by applicant]
CN 106127300 · 2016 [cited by applicant]
Nobuyuki et al., “quantum neuro-computing” system system A informatics meeting magazine, Japan, Institute of Systems, Control and Information Engineers, vol. 52, No. 5, May 15, 2008, 169-174. [cited by applicant]
Office Action in Japanese Appln. No. 2023-172891, mailed on Dec. 9, 2024, 6 pages (with English translation). [cited by applicant]
Notice of Allowance in Japanese Appln. No. 2023-172891, mailed on Apr. 1, 2025, 5 pages (with English translation). [cited by applicant]
Aaronson et al., “The Computational Complexity of Linear Optics” arXiv:1011.3245v1, Nov. 2010, 94 pages. [cited by applicant]
Aaronson, “Quantum Computing, Postselection, and Probabilistic Polynomial-Time”, arXiv:quant-ph/0412187v1, Dec. 2004, 8 pages. [cited by applicant]
Aaronson, “Quantum Lower Bound for Recursive Fourier Sampling”, arXiv:quant-ph/0209060v2, Dec. 2004, 8 pages. [cited by applicant]
Aasen et al., “Milestones Toward Majorana Based Quantum Computing”, Physical Review, 2016, 6:031016, 28 pages. [cited by applicant]
Barends et al., “Logic gate at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing”, Nature, 2014, 508:500-503. [cited by applicant]
Boixo et al., “Characterizing Quantum Supremacy in Near Term Devices”, arXiv:1608.00263v3, Apr. 2017, 23 pages. [cited by applicant]
Brassard et al., “Quantum Amplitude Amplification and Estimation”, arXiv:quant-ph/0005055v1, May 2000, 32 pages. [cited by applicant]
Bremner et al., “Average case complexity versus approximate simulation of commuting quantum computations”, arXiv:1504.07999v2, Sep. 2015, 10 pages. [cited by applicant]
Bremner et al., “Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy”, Proceedings of the Royal Society, 2011, 467:459-472. [cited by applicant]
Corcoles et al., “Demonstration of a quantum error detection code using a square lattice for superconducting qubits”, Nature Communications, Apr. 2015, 6(6979): 10 pages. [cited by applicant]
Da Silva et al., “Classical and Superposed Learning for Quantum Weightless Neural Networks”, Neurocommuting, 2012, 75:52-60. [cited by applicant]
Debnath et al., “Demonstration of a small programmable quantum computer with atomic qubits”, arXiv:1603.04512v3, Aug. 2016, 10 page. [cited by applicant]
Farhi et al., “A Quantum Approximate Optimization Algorithm” arXiv:1411.4028v1, Nov. 2014, 16 pages. [cited by applicant]
Farhi et al., “Quantum Algorithms for Fixed Qubit Architectures” arXiv1703.06199v1, Mar. 2017, 20 pages. [cited by applicant]
Farhi et al., “Quantum Computation by Adiabatic Evolution”, arXiv:quant-ph/0001106v1, Jan. 2000, 24 pages. [cited by applicant]
Farhi et al., “Quantum Supremacy through the Quantum Approximate Optimization Algorithm” arXiv:1602.07674v2, Oct. 2019, 23 pages. [cited by applicant]
Fujii et al., “Commuting Quantum Circuits and Complexity of Ising Partition Functions”, arXiv:1311.2128v2, Aug. 2016, 36 pages. [cited by applicant]
Goemans et al., “Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming”, Journal of the ACM, 1995, 42(6):1115-1145. [cited by applicant]
Grover, “A Fast Quantum Mechanical Algorithm for Database Search”, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, 212-219. [cited by applicant]
Guerreschi et al., “Practical Optimization for hybrid quantum-classical algorithms”, arXiv:1701.01450v1, Jan. 2017, 25 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/US2018/035665, mailed on Dec. 12, 2019, 8 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/US2018/035665, mailed on Oct. 5, 2018, 14 pages. [cited by applicant]
Jozsa et al., “Classical simulation complexity of extended Clifford circuits”, arXiv:1305.6190v1, May 2013, 17 pages. [cited by applicant]
Khot et al., “Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?”, SIAM Journal on Computing, 2007, 37(1):319-357. [cited by applicant]
Li et al., “Model and algorithm of quantum-inspired neural network with sequence input based on controlled rotation gates”, Applied Intelligence, 2014, 40:107-126. [cited by applicant]
McClean et al., “Barren plateaus in quantum neural network training landscapes”, Nature Communications, 2018, 9(4812): 1-6. [cited by applicant]
McClean et al., “The Theory of Variational Hybrid Quantum-Classical Algorithms”, New Journal of Physics, 2016, 18:023023: 22 pages. [cited by applicant]
Mnih et al., “Human-level control through deep reinforcement learning”, Nature, 518(7540):529-533. [cited by applicant]
Monz et al., “Realization of a scalable Shor algorithm”, Science, 2016, 351:1068-1070. [cited by applicant]
Nelder et al., “A simplex method for function minimization”, The Computer Journal, 1965, 7(4):308-313. [cited by applicant]
Notice of Allowance in Japanese Appln. No. 2021-078683, mailed on Sep. 4, 2023, 6 pages (with English translation). [cited by applicant]
Ofek et al., “Extending the lifetime of a quantum bit with error correction in superconducting circuits”, Nature, 2016, 536:441-445. [cited by applicant]
Office Action in Australian Appln. No. 2018278348, mailed on Nov. 18, 2020, 4 pages. [cited by applicant]
Office Action in Chinese Appln. No. 201880036533.1, mailed on Nov. 1, 2022, 14 pages (with English Translation). [cited by applicant]
Office Action in Chinese Appln. No. 3,065,859, mailed on Mar. 17, 2021, 5 pages. [cited by applicant]
Office Action in European Appln. No. 18733461.0, mailed on Dec. 6, 2021, 11 pages. [cited by applicant]
Office Action in Japanese Appln. No. 2021-078683, mailed on Aug. 1, 2022, 6 pages (with English Translation). [cited by applicant]
Peruzzo et al., “A variational eigenvalue solver on a photonic quantum processor”, Nature Communications, Jul. 2014, 5(4213): 7 pages. [cited by applicant]
Plagianakos et al., “Training Neural Networks with Threshold Activation Functions and Constrained Integer Weights” IEEE, 2000, 6 pages. [cited by applicant]
Riste et al., “Detecting bit-flip errors in a logical qubit using stabilizer measurements”, Nature Communications, 2015, 6(6983):6 pages. [cited by applicant]
Romero et al., “Quantum autoencoders for efficient compression of quantum data”, arXiv, Feb. 2017, 10 pages. [cited by applicant]
Romero et al., “Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz”, arXiv:1701.02691v2, Feb. 2018, 18 pages. [cited by applicant]
Sete et al., “A Functional Architecture for Scalable Quantum Computing”, IEEE International Conference on Rebooting Computing, 2016, 1-6. [cited by applicant]
Silver et al., “Mastering the game of Go with deep neural networks and tree search”, Nature, 2016, 529(7587):484. [cited by applicant]
Svore et al., “Faster Phase Estimation”, arXiv:1304.0741v1, Apr. 2013, 14 pages. [cited by applicant]
Terhal et al., “Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games”, arXiv:quant-ph/0205133v6, Mar. 2004, 13 pages. [cited by applicant]
Wan et al., “Quantum generalisation of feedforward neural networks”, npj Quantum Information, 2017, 3(1):1-8. [cited by applicant]
Wecker et al., “Progress towards practical quantum variational algorithms” arXiv:1507.08969v2, Sep. 8, 2015, 11 pages. [cited by applicant]
Yan et al., “The flux qubit revisited to enhance coherence and reproducibility”, Nature Communications, 2016, 7:12964: 9 pages. [cited by applicant]