IP Library › Granted Patent US 12,657,503
Granted Patent B2
US 12,657,503 · App. 17/164,630 · Granted Jun 16, 2026

Execution of qubit gates

Inventors: Vadym Kliuchnikov (Redmond, WA); Alexander Vaschillo (Redmond, WA); Martin Henri Roetteler (Woodinville, WA)
Assignee: Microsoft Technology Licensing, LLC
G06N10/60H03K19/195
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,657,503
App. No.
17/164,630
Granted
Jun 16, 2026
Kind
B2
Abstract

One aspect of this disclosure relates to a method for operating a quantum computing device. A request to execute a first n-qubit gate on a set of n target qubits is received. The first n-qubit gate is representable as an m-qubit diagonal gate conjugated by a Clifford gate, where m≤n. A set of m interface qubits on which to perform the m-qubit diagonal gate are identified. A Clifford operation is executed on each interface qubit and its corresponding target qubits. The m-qubit diagonal gate is executed on the set of m interface qubits.

Claims (41)

1 . A method, comprising:

receiving a request to execute a first qubit gate on a set of target qubits, the first qubit gate representable as a diagonal gate conjugated by a Clifford gate, where the diagonal gate is executable on a set of interface qubits, the set of interface qubits having at most the same number of qubits as the set of target qubits;

executing Clifford operations on the set of interface qubits and the set of target qubits; and

executing the diagonal gate on the set of interface qubits.

2 . The method of claim 1 , wherein the Clifford operations executed on the set of interface qubits and the set of target qubits are multi-qubit Pauli measurements, and wherein a number of qubits in the first qubit gate is less than or equal to 8 qubits.

3 . The method of claim 2 , wherein the multi-qubit Pauli measurements are executed by using pre-established entanglement.

4 . The method of claim 1 , wherein the Clifford operations executed on the set of interface qubits and the set of target qubits are multi-qubit Pauli gates X-controlled on the set of interface qubits.

5 . The method of claim 4 , wherein the multi-qubit Pauli gates X-controlled on the set of interface qubits are executed using pre-established entanglement.

6 . A method, comprising:

receiving a request to execute a first qubit gate on a first set of target qubits, the first qubit gate representable as a diagonal gate conjugated by a Clifford gate, where the diagonal gate is executable on a set of interface qubits, the set of interface qubits having at most the same number of qubits as the first set of target qubits;

executing Clifford operations on the set of interface qubits and the first set of target qubits;

executing the diagonal gate on the set of interface qubits; and

performing computations on one or more qubits of the first set of target qubits prior to completion of the execution of the diagonal gate on the set of interface qubits.

7 . The method of claim 6 , wherein the Clifford operations executed on the set of interface qubits and the first set of target qubits are multi-qubit Pauli measurements.

8 . The method of claim 7 , wherein the multi-qubit Pauli measurements are executed by using pre-established entanglement.

9 . The method of claim 6 , wherein the Clifford operations executed on the set of interface qubits and the first set of target qubits are multi-qubit Pauli gates X-controlled on the set of interface qubits.

10 . The method of claim 9 , wherein the multi-qubit Pauli gates X-controlled on the set of interface qubits are executed using pre-established entanglement.

11 . The method of claim 6 , further comprising:

receiving a request to execute a second qubit gate on a second set of target qubits, the second set of target qubits including one or more of the first set of target qubits; and

initiating execution of the second qubit gate on the second set of target qubits prior to completion of the execution of the diagonal gate on the set of interface qubits.

12 . The method of claim 11 , wherein executing the second qubit gate on the second set of target qubits includes executing a Clifford operation on one or more qubits of the set of interface qubits and one or more corresponding target qubits of the second set of target qubits.

13 . The method of claim 12 , wherein the Clifford operations executed on one or more qubits of the set of interface qubits and the one or more corresponding target qubits of the second set of target qubits are multi-qubit Pauli measurements.

14 . The method of claim 13 , wherein the multi-qubit Pauli measurements are executed by using pre-established entanglement.

15 . The method of claim 11 , wherein the Clifford operations executed on one or more qubits of the set of interface qubits and the one or more corresponding target qubits of the second set of target qubits are multi-qubit Pauli gates X-controlled on the one or more qubits of the set of interface qubits.

16 . The method of claim 15 , wherein the multi-qubit Pauli gates X-controlled on the one or more qubits of the set of interface qubits are executed using pre-established entanglement.

17 . The method of claim 11 , wherein the method further comprises:

responsive to completing the execution of the diagonal gate on the set of interface qubits, measuring spin along X on the set of interface qubits; and

storing measured spin values for X.

18 . The method of claim 17 , further comprising:

performing multi-qubit Pauli corrections on one or more qubits of the first set of target qubits and the second set of target qubits.

19 . The method of claim 18 , wherein the multi-qubit Pauli corrections are performed by using pre-established entanglement.

20 . A method, comprising:

receiving a request to execute a first qubit gate on a first set of target qubits, and where the first qubit gate is representable as a diagonal gate conjugated by a Clifford gate, where the diagonal gate is executable on a set of interface qubits, the set of interface qubits having at most the same number of qubits as the first set of target qubits;

executing Clifford operations on the set of interface qubits and the first set of target qubits;

executing the diagonal gate on the set of interface qubits;

performing computations on one or more qubits of the first set of target qubits prior to completion of the execution of the diagonal gate on the set of interface qubits;

receiving a request to execute a second qubit gate on a second set of target qubits, the second set of target qubits including one or more qubits of the first set of target qubits;

initiating execution of the second qubit gate on the second set of target qubits prior to completion of the execution of the diagonal gate on the set of interface qubits;

responsive to completing the execution of the diagonal gate on the set of interface qubits, measuring spin along X on the set of interface qubits;

storing measured spin values for X; and

performing multi-qubit Pauli corrections on one or more qubits of the first set of target qubits and the second set of target qubits.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 1, 2021
From: KLIUCHNIKOV, VADYM; VASCHILLO, ALEXANDER; ROETTELER, MARTIN HENRI
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 055104/0642 →
Continuity (2)
Continuation In Part 16888351 · May 29, 2020
Related Publication 20210374591A1 · Dec 2, 2021
References Cited (37)
US 20040078421A1 · Routt · 2004 [cited by applicant]
US 20210374586A1 · Kliuchnikov et al. · 2021 [cited by applicant]
WO 2019032103A1 · 2019 [cited by applicant]
“Quantum Computing: Progress and Prospects (2019)” by the Nation Academies of Sciences, Engineering and Medicine chapter 7 (Year: 2019). [cited by examiner]
“First quantum computer to pack 100 qubits enters crowded race” Nature vol. 599 p. 542 (Year: 2021). [cited by examiner]
“Will Quantum Computing Ever Live Up to Its Hype?” by John Horgan, Scientific American (Year: 2021). [cited by examiner]
“How to Fix Quantum Bugs” by Zaira Nazario Scientific American (Year: 2022). [cited by examiner]
Quantum Computing in the NISQ era and beyond by John Preskill Quantum Journal (Year: 2018). [cited by examiner]
“Quantum Technology Monitor” Mckinsey&Company (Year: 2022). [cited by examiner]
“Building a large-scale quantum computer with continuous-variable optical technologies” Fukui et al. J. Physics B At. Mol. Opt. Phys. 55 (Year: 2022). [cited by examiner]
NISQ computing: where we are and where do we go? Lau et al., AAPS Bulletin (Year: 2022). [cited by examiner]
Cuomo, et al., “Towards a Distributed Quantum Computing Ecosystem (Invited Paper)”, In Repository of arXiv:2002.11808v2, Mar. 28, 2020, 8 Pages. [cited by applicant]
Litinski, Daniel, “A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery”, In Repository of arXiv:1808.02892v1, Aug. 8, 2018, 35 Pages. [cited by applicant]
“International Search Report & Written Opinion issued in PCT Application No. PCT/US2021/020485”, Mailed Date: Nov. 26, 2021, 12 Pages. [cited by applicant]
Sarvaghad-Moghaddam, et al., “A General Protocol for Distributed Quantum Gates”, In Repository of arXiv:1812.07798v2, Dec. 21, 2018, 8 Pages. [cited by applicant]
Litinski, Daniel, “Magic State Distillation: Not as Costly as You Think”, In Repository of arXiv:1905.06903, Nov. 6, 2019, 22 Pages. [cited by applicant]
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US22/013860”, Mailed Date: May 27, 2022, 15 Pages. [cited by applicant]
“Non Final Office Action Issued in U.S. Appl. No. 16/888,351”, Mailed Date: Jun. 15, 2022, 12 Pages. [cited by applicant]
Cross, et al., “Open Quantum Assembly Language”, In Repository of arXiv:1707.03429v2, Jul. 13, 2017, 24 Pages. [cited by applicant]
Devitt, Simon J. , “Classical Control of Large-Scale Quantum Computers”, In Repository of arXiv:1405.4943v1, May 20, 2014, 14 Pages. [cited by applicant]
Dijk, et al., “Impact of Classical Control Electronics on Qubit Fidelity”, In Journal of Physical Review Applied, vol. 12, Issue 4, Oct. 24, 2019, 20 Pages. [cited by applicant]
Ryan, et al., “Hardware for Dynamic Quantum Computing”, In Repository of arXiv:1704.08314v1, Apr. 26, 2017, 13 Pages. [cited by applicant]
Litinski, et al., “A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery”, In Repository of arXiv:1808.02892v3, Feb. 3, 2019, 37 Pages. [cited by applicant]
“Final Office Action Issued in U.S. Appl. No. 16/888,351”, Mailed Date: Dec. 22, 2022, 17 Pages. [cited by applicant]
“Extended Search Report Issued in European Patent Application No. 23175295.7”, Mailed Date: Sep. 14, 2023, 11 Pages. [cited by applicant]
“Patent Board Decision Received in U.S. Appl. No. 16/286,337”, Mailed Date : Nov. 30, 2023, 9 Pages. [cited by applicant]
“Hartree-Fock on a Superconducting Qubit Quantum Computer”, In Repository of arXiv:2004.04174v4, Sep. 18, 2020, 30 Pages. [cited by applicant]
Arute, et al., “Quantum Supremacy Using a Programmable Superconducting Processor”, In Journal of Nature, vol. 574, Issue 7779, Oct. 23, 2019, pp. 505-510. [cited by applicant]
Barenco, et al., “Elementary Gates for Quantum Computation”, In Journal of Physical Review A, vol. 52, No. 5, Nov. 1, 1995, pp. 3457-3467. [cited by applicant]
Nielsen, et al., “Programmable Quantum Gate Arrays”, In Journal of Physical Review Letters, vol. 79, Issue 2, Jul. 14, 1997, pp. 321-324. [cited by applicant]
Beverland, et al., “Surface Code Compilation via Edge-Disjoint Paths”, In Journal of PRX Quantum, vol. 3, Issue 2, May 25, 2022, 25 Pages. [cited by applicant]
“Non-Final Office Action Issued in U.S. Appl. No. 16/888,351”, Mailed Date: Jun. 8, 2023, 11 Pages. [cited by applicant]
First office Action Received for Chinese Application No. 202180038370.2, mailed on Aug. 4, 2025, 25 pages. (English Translation Provided). [cited by applicant]
Litinski et al., “A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery”, arXiv:1808.02892v3, Feb. 3, 2019, 37 Pages. [cited by applicant]
Office Action Received for Japanese Application No. 2022561408, mailed on Jan. 24, 2025, 6 pages. (English Translation Provided). [cited by applicant]
Communication pursuant to Article 94(3) EPC Received in European Patent Application No. 21783062.9, mailed on Mar. 3, 2026, 07 pages. [cited by applicant]
Communication pursuant to Article 94(3) EPC Received in European Patent Application No. 23175295.7, mailed on Mar. 3, 2026, 08 pages. [cited by applicant]