Robust quantum computing

US12530610B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-12530610-B2
Application numberUS-202218690933-A
CountryUS
Kind codeB2
Filing dateSep 9, 2022
Priority dateSep 9, 2021
Publication dateJan 20, 2026
Grant dateJan 20, 2026

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Robust optimal control techniques are provided that may shape driving pulses such that the gates are realised with high fidelity despite experimental uncertainty in all or some of the physical parameters of the qubits, drives, qubit-qubit coupling, and qubit-drive coupling. For example, a method for controlling a quantum system comprising a plurality of coupled qubits may comprise: i) assigning the qubits to a plurality of subgroups, wherein the assigning comprises selecting at least one driven qubit and a plurality of undriven qubits for each subgroup, such that each undriven qubit in a subgroup is coupled to a driven qubit in that subgroup and such that any two adjacent subgroups share at least one undriven qubit and do not share any driven qubit; and ii) applying drive signals to each driven qubit to implement a set of desired quantum gates at the driven qubits, wherein the application of the drive signals to the driven qubits at the same time implements the identity gate at each undriven qubit.

First claim

Opening claim text (preview).

The invention claimed is: 1 . A method for controlling a quantum system comprising a plurality of coupled qubits, comprising: i) assigning the qubits to a plurality of subgroups, wherein the assigning comprises selecting at least one driven qubit and a plurality of undriven qubits for each subgroup, such that each undriven qubit in a subgroup is coupled to a driven qubit in that subgroup and such that any two adjacent subgroups share at least one undriven qubit and do not share any driven qubit; and ii) applying drive signals to each driven qubit to implement a set of desired quantum gates at the driven qubits, wherein the application of the drive signals to the driven qubits at the same time implements the identity gate at each undriven qubit through fixed qubit-qubit coupling. 2 . A method according to claim 1 , wherein the qubit-qubit coupling has a form such that the Hamiltonians of the subgroups mutually commute. 3 . A method according to claim 1 , wherein coupling between the qubits comprises ZZ coupling, or any coupling which commutes with the qubit's free evolution Hamiltonian. 4 . A method according to claim 1 , wherein the plurality of coupled qubits are arranged as a 1D, 2D, or 3D array. 5 . A method according to claim 1 , further comprising repeating steps i) and ii) to implement a further set of desired quantum gates. 6 . A method according to claim 5 , wherein repeating step i) comprises selecting different driven qubits. 7 . A method according to claim 5 , wherein the drive signals from an earlier iteration of step ii) continue to be applied until the drive signals from a subsequent iteration of step ii) are applied. 8 . A method according to claim 1 , wherein the set of desired quantum gates comprises the Hadamard gate, the π/8 gate, the identity gate, and the CNOT gate. 9 . A method according to claim 1 , wherein the set of desired quantum gates may comprise at least one two-qubit gate. 10 . A method according to claim 1 , wherein the drive signals are obtained by: generating a representation of the quantum system; defining a region reflecting a range of uncertainty for one or more parameters of the quantum system; identifying, for a point within the region, initial drive signals for which a calculated fidelity is maximised using the representation; identifying, simultaneously for a plurality of points on the boundary of the region, final drive signals for which a calculated fidelity is maximised using the and the initial drive signal, wherein the final drive signals are applied to the driven qubits. 11 . A method according to claim 10 , wherein the representation of the quantum system is a tensor network representation. 12 . A method according to claim 10 , further comprising, prior to applying the final drive signals to the driven qubits: calculating the fidelity of the final drive signals at one or more further points within the region; and determining a distribution of the fidelity across the region from the calculated fidelities. 13 . A method according to claim 10 , wherein the step of identifying the initial drive signals comprises utilising a gradient ascent/descent method. 14 . A method according to claim 10 , wherein the step of identifying the final drive signals comprises utilising a gradient ascent/descent method starting from the initial drive signals. 15 . A method according to claim 1 , further comprising: iii) measuring the state of at least one of the qubits. 16 . A method according to claim 1 , wherein the qubits are superconducting qubits. 17 . A method according to claim 16 , wherein the qubits are transmon or flux qubits. 18 . A method for obtaining drive signals to be applied to a quantum system comprising a plurality of qubits, the method comprising: generating a representation of the quantum system; defining a region reflecting a range of uncertainty for one or more parameters of the quantum system; identifying, for a point within the region, initial drive signals for which a calculated fidelity is maximised using the representation; identifying, simultaneously for a plurality of points on the boundary of the region, final drive signals for which a calculated fidelity is maximised using the representation and the initial drive signal, wherein the final drive signals are applied to one or more qubits. 19 . A computer program product comprising computer executable instructions which, when the instructions are executed by a computer, cause the computer to carry out the method according to claim 18 .

Assignees

Inventors

Classifications

  • Models of quantum computing, e.g. quantum circuits or universal quantum computers · CPC title

  • Quantum error correction, detection or prevention, e.g. surface codes or magic state distillation · CPC title

  • G06N10/40Primary

    Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US12530610B2 cover?
Robust optimal control techniques are provided that may shape driving pulses such that the gates are realised with high fidelity despite experimental uncertainty in all or some of the physical parameters of the qubits, drives, qubit-qubit coupling, and qubit-drive coupling. For example, a method for controlling a quantum system comprising a plurality of coupled qubits may comprise: i) assigning…
Who is the assignee on this patent?
Univ Surrey
What technology area does this patent fall under?
Primary CPC classification G06N10/40. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Jan 20 2026 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 2 related publications on this page (citations in our corpus or others sharing the same primary CPC).