IP Library › Granted Patent US 12,361,311
Granted Patent B2
US 12,361,311 · App. 17/990,316 · Granted Jul 15, 2025

Quantum code with simpler pairwise checks

Inventors: Matthew Benjamin Hastings (Seattle, WA); Zhenghan Wang (Goleta, CA); David Alexander Aasen (Santa Barbara, CA)
Assignee: Microsoft Technology Licensing, LLC
G06N10/70B82Y10/00G06N10/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,361,311
App. No.
17/990,316
Granted
Jul 15, 2025
Kind
B2
Abstract

A method and apparatus for performing quantum error correction using an automorphism code related to the honeycomb code. The automorphism code is based on Kramers-Wannier (KW) duality. For embodiments on a hexagonal lattice using three repeated time steps, ⅓ of the pixels are active in a given time steps. In a given time step r, a KW circuit is applied to plaquettes labeled r mod 3, transferring quantum information from the active qubits at the beginning to a new set of active qubits at the end of the time step. Each of the three plaquette types is associated with one stabilizer either given by a product of six Z operators or three X operators. The KW circuit maps the product of X operators to the product of Z operators and vice-versa. The stabilizer group of the superlattice toric code changes every round.

Claims (46)

1. An apparatus, comprising:

a quantum processor comprising:

a plurality of qubits arranged in a 3-colorable lattice of plaquettes such that each qubit of the plurality of qubits is represented by a respective edge of the lattice, each edge representing a single qubit of the plurality of qubits,

wherein the plaquettes comprise plaquettes of a first plaquette type, a second plaquette type, and a third plaquette type, the plaquettes being arranged such that no plaquette is adjacent to a plaquette of the same plaquette type; and

a classical processor configured to:

control quantum measurements on the plurality of qubits to perform a quantum error correction code based on Kramers-Wannier duality by performing a Kramers-Wannier circuit in a periodic sequence.

2. The apparatus of claim 1 , wherein each of said plaquettes consists of six qubits.

3. The apparatus of claim 1 , wherein the classical processor performs the quantum error correction code as rounds of a repeating sequence of three steps.

4. The apparatus of claim 3 , wherein at a beginning of each of the three steps one third of the qubits are active qubits, and which qubits are the active qubits is different for each of the three steps.

5. The apparatus of claim 3 , wherein the quantum error correction code is an automorphism code such that,

at each time step, the Kramers-Wannier circuit maps a logical operator to another logical operator and vice versa, and,

for each of the rounds of the three steps, the logical operator alternates with the another logical operator.

6. The apparatus of claim 3 , wherein

a first step of the three steps is performed by performing the Kramers-Wannier circuit on qubits of the plaquettes of the first plaquette type,

a second step of the three steps is performed by performing the Kramers-Wannier circuit on qubits of the plaquettes of the second plaquette type, and

a third step of the three steps is performed by performing the Kramers-Wannier circuit on qubits of the plaquettes of the third plaquette type.

7. The apparatus of claim 1 , wherein the Kramers-Wannier circuit maps a product of Z operators to a product of X operators and maps products of X operators to respective products of Z operators.

8. The apparatus of claim 1 , wherein the Kramers-Wannier circuit implements one of four types of Kramers-Wannier duality, and the classical processor uses results of the quantum measurements on the plurality of qubits to determine which of the four types of Kramers-Wannier duality was implemented.

9. The apparatus of claim 1 , wherein the classical processor

records measurement outcomes from each step of the periodic sequence of the quantum error correction code,

determines how plaquette stabilizers evolve based on the record measurement outcomes,

checks whether the record measurement outcomes agree with expected outcomes, and

when the record measurement outcomes do not agree with the expected outcomes, (i) the classical processor signals a fault occurred and (ii) the classical processor determines which fault occurred and applies one or more corrective unitary operators to the plurality of qubits.

10. The apparatus of claim 1 , wherein the Kramers-Wannier circuit maps a product of X operators to a product of Z operators and vice-versa.

11. The apparatus of claim 1 , wherein the Kramers-Wannier circuit comprises a set of Hadamard gates, a set of single-qubit Z measurements, a set of two-qubit XX measurements, a set of two-qubit ZZ measurements, and a set of single-qubit X measurements.

12. The apparatus of claim 1 , wherein the Kramers-Wannier circuit comprises, a set of single-qubit X measurements, a set of two-qubit XZ measurements, a set of two-qubit ZX measurements, and another set of single-qubit X measurements.

13. The apparatus of claim 1 , wherein the Kramers-Wannier circuit comprises a first set of single-qubit X measurements, a first set of controlled Z gates, a second set of controlled Z gates, and a second set of single-qubit X measurements.

14. A method of performing an error correction code, comprising:

controlling, using a classical processor, quantum measurements on a plurality of qubits to perform a quantum error correction code, the quantum error correction code being based on Kramers-Wannier duality, and the quantum error correction code includeing performing a Kramers-Wannier circuit in a periodic sequence,

wherein the plurality of qubits is arranged in a 3-colorable lattice of plaquettes such that each qubit of the plurality of qubits is represented by a respective edge of the lattice, each edge representing a single qubit of the plurality of qubits, wherein the plaquettes comprise plaquettes of a first plaquette type, a second plaquette type, and a third plaquette type, the plaquettes being arranged such that no plaquette is adjacent to a plaquette of the same plaquette type.

15. The method of claim 14 , wherein the classical processor controls the quantum measurements on the plurality of qubits such that the quantum error correction code is performed as rounds of a repeating sequence of three steps.

16. The method of claim 15 , wherein the classical processor controls the quantum measurements on the plurality of qubits such that

in a first step of the three steps, the Kramers-Wannier circuit is performed on qubits of the plaquettes of the first plaquette type,

in a second step of the three steps, the Kramers-Wannier circuit is performed on qubits of the plaquettes of the second plaquette type, and

in a third step of the three steps, the Kramers-Wannier circuit is performed on qubits of the plaquettes of the third plaquette type.

17. The method of claim 15 , wherein the classical processor controls the quantum measurements to perform the quantum error correction code that is an automorphism code such that, at each step, the Kramers-Wannier circuit maps a logical operator to another logical operator and vice versa, and, for each of the rounds of the three steps, the logical operator alternates with the another logical operator.

18. The method of claim 14 , wherein the classical processor controls the quantum measurements to perform the Kramers-Wannier circuit, and Kramers-Wannier circuit maps a product of Z operators to a product of X operators and maps products of X operators to respective products of X operators.

19. The method of claim 14 , wherein the classical processor controls the quantum measurements on the plurality of qubits to perform the Kramers-Wannier circuit, wherein the Kramers-Wannier circuit implements one of four types of Kramers-Wannier duality, and the classical processor uses results of the quantum measurements on the plurality of qubits to determine which of the four types of Kramers-Wannier duality was implemented.

20. The method of claim 14 , wherein the classical processor performs steps of

recording measurement outcomes from each step of the periodic sequence of the quantum error correction code,

determining how plaquette stabilizers evolve based on the record measurement outcomes,

checking whether the record measurement outcomes agree with expected outcomes, and

when the record measurement outcomes do not agree with expected outcomes, the classical processor performs steps of

signaling a fault occurred,

determining which fault occurred, and

applying one or more corrective unitary operators to the plurality of qubits.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 29, 2022
From: HASTINGS, MATTHEW BENJAMIN; WANG, ZHENGHAN; AASEN, DAVID ALEXANDER
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 061913/0226 →
Continuity (2)
Provisional Application 63268119 · Feb 16, 2022
Related Publication 20240354629A1 · Oct 24, 2024
References Cited (18)
US 11455207B2 · Chamberland · 2022 [cited by examiner]
US 11853159B1 · Chamberland · 2023 [cited by examiner]
US 20200401927A1 · Nickerson · 2020 [cited by examiner]
US 20210117843A1 · Delfosse · 2021 [cited by examiner]
US 20220059919A1 · Underwood · 2022 [cited by examiner]
US 20220269963A1 · Delfosse · 2022 [cited by examiner]
US 20230162081A1 · Verresen · 2023 [cited by examiner]
US 20240354629A1 · Hastings · 2024 [cited by examiner]
Song et al. (“Optimal Thresholds for Fraction Codes and Random Spin Models With Subsystem Symmetry”, Dec. 9, 2021, Phys. Rev. Lett. 129, 230502) (Year: 2021). [cited by examiner]
Vodola et al., “Fundamental threshold of realistic quantum error correction circuits from classical spin models”, arXiv:2104.04847v2 [quant-ph], Dec. 22, 2021 (Year: 2021). [cited by examiner]
Bombin et al., “Statistical Mechanical Models and Topological Color Codes”, arXiv:0711.0468 [quant-ph], Nov. 3, 2007 (Year: 2007). [cited by examiner]
Hastings, et al., “Dynamically Generated Logical Qubits”, In Repository of arXiv:2107.02194v2, Oct. 12, 2021, 19 Pages. [cited by applicant]
U.S. Appl. No. 63/268,119, filed Feb. 16, 2022. [cited by applicant]
Ashkenazi, et al., “Duality as a Feasible Physical Transformation”, arxiv.2111.04765v1, Nov. 8, 2021, 16 pages. [cited by applicant]
International Search Report and Written Opinion received for PCT Application No. PCT/US2022/052863 (MS#411137-PCT01), Feb. 5, 2024, 14 pages. [cited by applicant]
Kuo, et al., “Comparison of 2D topological codes and their decoding performances”, arxiv:2202.06612v1, Feb. 14, 2022, 6 pages. [cited by applicant]
Lootens, et al., “Mapping between Morita equivalent string-net states with a constant depth quantum circuit”, arxiv:2112.12757v1, Dec. 23, 2021, 13 pages. [cited by applicant]
Tantivasadakarn, et al., “Long-range entanglement from measuring symmetry-protected topological phases”, arxiv:2112.01519v2, Jan. 6, 2022, 19 pages. [cited by applicant]