# US 2026/0065112 A1 · Quantum codes implemented using cat data qubits and transmon ancilla qubits

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0065112 A1
- Document ID: US20260065112A1
- Status: Published application
- Kind: A1
- Application number: 19/315,326
- Filed: 2025-08-29
- Published: 2026-03-05
- Earliest claimed: 2021-12-10
- Assignees: Amazon Technologies, Inc.
- Applicants: Amazon Technologies, Inc.
- Inventors: Kyungjoo Noh; Christopher Chamberland; Harald Esko Jakob Putterman; Oskar Jon Painter; Fernando Brandao; Andrew Joseph Keller; Patricio Arrangoiz Arriola; Thomas Scaffidi; Menyoung Lee; Matthew Matheny; Colm Andrew Ryan; Prasahnt Sivarajah; Connor Hann; Arne Grimsmo; Joseph Kramer Iverson; Ashley James Milsted
- Web page: https://patentgrep.com/patent/US20260065112A1

## CPC

- G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers
- G06N 10/40: Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
- G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
- G06N 10/70: Quantum error correction, detection or prevention, e.g. surface codes or magic state distillation
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Systems and methods for implementing a quantum code using cat qubits as data qubits and transmon qubits as ancilla qubits is disclosed. In some embodiments, a three-level transmon is used and Chi-matching is performed to determine dispersive coupling coefficients between the cat qubits and first and second excited states of the transmon qubits, wherein the dispersive coupling coefficients are used to perform gates between the cat data qubits and the transmon ancilla qubits. The Chi-matching determines the dispersive coupling coefficients such that the cat qubits are rotated in a same manner while performing the gates regardless as to whether a given transmon ancilla qubit remains in a second excited state or has decayed to a first excited state.

## Claims

### Claim at position 1

-20. (canceled)

### Claim 21

A system, comprising:
a quantum device configured to redundantly store information in a two-dimensional surface code, wherein the two-dimensional surface code comprises:
data qubits implemented using cat qubits; and
ancilla qubits implemented using transmon qubits.

### Claim 22 (depends on 21)

The system of claim 21, further comprising a computing device storing program instructions that when executed, cause error information to be extracted from the two-dimensional surface code, wherein extracting the error information comprises:
measuring the ancilla qubits in:
a ground state (g) of the transmon qubits,
a first excited state (e) of the transmon qubits, and
a second excited state (f) basis of the transmon qubits.

### Claim 23 (depends on 22)

The system of claim 22, wherein a given transmon qubit measured to be in the first excited state (e) indicates a decay event has occurred in the given transmon qubit, and
wherein the program instructs, when executed, further cause:
a measurement result of the given transmon qubit measured to be in the first excited state (e) to be replaced with a measurement result of the given transmon qubit from a preceding measurement round to correct for the decay event.

### Claim 24 (depends on 21)

The system of claim 21, wherein the quantum device is further configured to:
implement a first repetition code comprising data qubits implemented using cat qubits and ancilla qubits implemented using transmon qubits;
implement a second repetition code comprising data qubits implemented using cat qubits and ancilla qubits implemented using transmon qubits; and
perform a logical gate between the first repetition code and the second repletion code via lattice surgery.

### Claim 25 (depends on 24)

The system of claim 24, wherein the logical gate is a logical Z⊗Z gate.

### Claim 26 (depends on 25)

The system of claim 25, wherein to perform the lattice surgery the quantum device is further configured to:
implement a strip of ancilla qubits (transmons) in a |+ state between the first repetition code and the second repletion code; and
merge the first repetition code, the strip of ancilla qubits, and the second repletion code, wherein in the merged state they form a Bacon-Shor code.

### Claim 27 (depends on 21)

The system of claim 21, further comprising a computing device storing program instructions that, when executed, cause the quantum device to implement the two-dimensional surface code, wherein to implement the two-dimensional surface code, the program instructions:
cause the transmon qubits to be implemented on the quantum device in a
1
2
⁢
(
❘
"\[LeftBracketingBar]"
g
〉
+
❘
"\[RightBracketingBar]"
⁢
f
〉
)
state;
cause error information to be extracted from the data qubits by applying a set of gates on respective sets of the cat qubits, wherein the respective ones of the transmon qubits act as control qubits for the gates with targets of the gates being the cat qubits;
apply Hadamard gates to the respective transmon qubits in a ground (g) and second excited state (f) manifold of the respective transmon qubits;
read out the extracted error information and information indicating whether or not decay has occurred in the transmon qubits by measuring the transmon qubits in a ground state (g), a first excited state (e), and a second excited state (f) basis; and
reset the transmon qubits to the ground state (g).

### Claim 28 (depends on 27)

The system of claim 27, wherein the program instruction, when executed, further cause the computing device to:
perform chi matching to set dispersive coupling coefficients between respective ones of the cat qubits and the respective ones of the transmon qubits, wherein the dispersive coupling coefficients are set via the chi matching such that the respective ones of the cat qubits rotate in a same manner during the set of gates regardless as to whether a corresponding one of the transmon qubits remains in the second excited state (f) or has decayed to the first excited state (e).

### Claim 29

A method comprising:
implementing a surface code, wherein the surface code comprises:
data qubits implemented using cat qubits; and
ancilla qubits implemented using transmon qubits.

### Claim 30 (depends on 29)

The method of claim 29, further comprising extracting error information from the surface code by measuring the ancilla qubits in:
a ground state (g) of the transmon qubits,
a first excited state (e) of the transmon qubits, and
a second excited state (f) basis of the transmon qubits.

### Claim 31 (depends on 30)

The method of claim 30, wherein a given transmon qubit measured to be in the first excited state (e) indicates a decay event has occurred in the given transmon qubit, and
wherein the method further comprises:
replacing a measurement result of the given transmon qubit measured to be in the first excited state (e) with a measurement result of the given transmon qubit from a preceding measurement round to correct for the decay event.

### Claim 32 (depends on 31)

The method of claim 31, further comprising:
decoding the measurement results, using a minimum weight perfect matching (MWPM) graph, wherein:
a vertex in the MWPM graph corresponding to the given transmon measured to be in the first excited state (e) is not highlighted for the measurement round in which the given transmon was measured to be in the first excited state (e).

### Claim 33 (depends on 29)

The method of claim 29, further comprising:
implementing the transmon qubits in a
1
2
⁢
(
❘
"\[LeftBracketingBar]"
g
〉
+
❘
"\[RightBracketingBar]"
⁢
f
〉
)
state;
extracting error information from the data qubits by applying a set of gates on respective sets of the cat qubits and respective ones of the transmon qubits, wherein the respective ones of the transmon qubits act as control qubits for the gates with targets of the gates being the cat qubits;
applying Hadamard gates to the respective transmon qubits in a ground (g) and second excited state (f) manifold of the respective transmon qubits;
reading out the extracted error information and information indicating whether or not decay has occurred in the transmon.

### Claim 34 (depends on 33)

The method of claim 33, further comprising:
performing chi matching to set dispersive coupling coefficients between respective ones of the cat qubits and the respective ones of the transmon qubits, wherein the dispersive coupling coefficients are set via the chi matching such that the respective ones of the cat qubits rotate in a same manner during the set of gates regardless as to whether a corresponding one of the transmon qubits remains in the second excited state (f) or has decayed to the first excited state (e).

### Claim 35 (depends on 29)

The method of claim 29, further comprising:
implementing a second surface code comprising data qubits implemented using cat qubits and ancilla qubits implemented using transmon qubits; and
performing a logical gate between the surface code and the second surface code via lattice surgery.

### Claim 36

One or more non-transitory, computer-readable storage media storing program instructions, that when executed, cause a quantum device to:
redundantly store information in a two-dimensional surface code, wherein the two-dimensional surface code comprises:
data qubits implemented using cat qubits; and
ancilla qubits implemented using transmon qubits.

### Claim 37 (depends on 36)

The one or more non-transitory, computer-readable storage media of claim 36, wherein the program instructions, when executed, further cause:
error information to be extracted from the two-dimensional surface code, wherein extracting the error information comprises:
measuring the ancilla qubits in:
a ground state (g) of the transmon qubits,
a first excited state (e) of the transmon qubits, and
a second excited state (f) basis of the transmon qubits.

### Claim 38 (depends on 37)

The one or more non-transitory, computer-readable storage media of claim 37, wherein a given transmon qubit measured to be in the first excited state (e) indicates a decay event has occurred in the given transmon qubit, and
wherein the program instructs, when executed, further cause:
a measurement result of the given transmon qubit measured to be in the first excited state (e) to be replaced with a measurement result of the given transmon qubit from a preceding measurement round to correct for the decay event.

### Claim 39 (depends on 36)

The one or more non-transitory, computer-readable storage media of claim 36, wherein the program instructions, when executed, further cause the quantum device to:
implement a first repetition code comprising data qubits implemented using cat qubits and ancilla qubits implemented using transmon qubits;
implement a second repetition code comprising data qubits implemented using cat qubits and ancilla qubits implemented using transmon qubits; and
perform a logical gate between the first repetition code and the second repletion code via lattice surgery.

### Claim 40 (depends on 39)

The one or more non-transitory, computer-readable storage media of claim 39, wherein the program instructions, when executed, further cause the quantum device to:
implement a strip of ancilla qubits (transmons) in a |+ state between the first repetition code and the second repletion code; and
merge the first repetition code, the strip of ancilla qubits, and the second repletion code, wherein in the merged state they form a Bacon-Shor code.
