# US 2026/0107694 A1 · Device and method for operating a semiconductor spin qubit quantum computer

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

- Number: US 2026/0107694 A1
- Document ID: US20260107694A1
- Status: Published application
- Kind: A1
- Application number: 19/113,735
- Filed: 2023-03-09
- Published: 2026-04-16
- Earliest claimed: 2023-02-28
- Applicants: Forschungszentrum Jülich GmbH
- Inventors: Matthias Künne
- Web page: https://patentgrep.com/patent/US20260107694A1

## CPC

- H10N 60/128: {having three or more electrodes, e.g. transistor-like structures}
- 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/70: Quantum error correction, detection or prevention, e.g. surface codes or magic state distillation
- H10N 50/20: Spin-polarised current-controlled devices (magnetoresistive devices H10N50/10)
- H10N 99/05: {Devices based on quantum mechanical effects, e.g. quantum interference devices or metal single-electron transistors}
- G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
- H10N: ELECTRIC SOLID-STATE DEVICES NOT OTHERWISE PROVIDED FOR
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A method, using a microprocessor, of operating a quantum chip comprised of a semiconductor heterostructure and a plurality of gate electrodes arranged on the semiconductor heterostructure to form a plurality of manipulation zones and a plurality of T-junctions to provide a plurality of shuttling lanes for moving a plurality of qubits along a plurality of paths. The manipulation zones comprises an interface where two shuttling lanes meet one another, and the plurality of T-junctions comprise junctions where a shuttling lane joins another shuttling lanes. The method comprises selecting a path along selected ones of the plurality of shuttling lanes between a start location and a finishing location; estimating a fidelity relating to shuttling a qubit along the path based on a predetermined shuttling fidelity relating to at least one of the selected ones of the plurality of shuttling lanes.

## Claims

### Claim 1

A method, using a microprocessor, of operating a quantum chip,
wherein the quantum chip comprises a semiconductor heterostructure and a plurality of gate electrodes arranged on the semiconductor heterostructure to provide a plurality of shuttling lanes for moving a plurality of qubits along a plurality of paths
the plurality of gate electrodes are further arranged to form a plurality of manipulation zones and a plurality of T-junctions, and
any one of the manipulation zones comprises an interface at which two of the plurality of shuttling lanes meet one another, and any one of the plurality of T-junctions comprises a junction, at which one of the plurality of shuttling lanes joins another one of the plurality of shuttling lanes,
the method comprising the steps of
selecting a path along selected ones of the plurality of shuttling lanes between a start location (S) and a finishing location (F),
estimating a fidelity relating to shuttling a qubit along the path based on a predetermined shuttling fidelity relating to at least one of the selected ones of the plurality of shuttling lanes.

### Claim 2 (depends on 1)

The method of claim 1, further comprising comparing the estimated fidelity with a target value.

### Claim 3 (depends on 1)

The method of claim 1, wherein the estimating of the fidelity is further based on a predetermined shuttling fidelity relating to the interface of the at least one interposed one of the plurality of manipulation zones, or on a predetermined turning-off fidelity relating to the junction of the at least one interposed one of the plurality of T-junctions.

### Claim 4 (depends on 1)

The method of claim 1, wherein the path is directed back and forth in the shuttling direction (D2) along at least one of the selected ones of the plurality of shuttling lanes.

### Claim 5 (depends on 1)

The method of claim 1, further comprising estimating the fidelity relating to shuttling a qubit along at least one further path along different selected ones of the plurality of shuttling lanes between the start location (S) and the finishing location (F).

### Claim 6 (depends on 5)

The method of claim 5, further comprising comparing the fidelity estimated for the path and the fidelity estimated for the path.

### Claim 7 (depends on 1)

The method of claim 1, wherein the path is selected such that two of the selected ones of the plurality of shuttling lanes meet at the interface (25i) of at least one interposed one of the plurality of manipulation zones, or join at the junction of at least one interposed one of the plurality of T-junctions.

### Claim 8 (depends on 1)

The method of claim 1, wherein the selected path is selected for performing a sequence of actions on at least one qubit.

### Claim 9 (depends on 8)

The method of claim 8, wherein the sequence of actions performed on the at least one qubit is part of a surface code.

### Claim 10 (depends on 1)

The method of claim 1, wherein the finishing location (F) is located at the interface of another selected one of the plurality of manipulation zones, at the junction of another selected one of the plurality of T-junctions, or at a readout zone.

### Claim 11 (depends on 1)

The method of claim 1, wherein the start location (S) is located at a selected one of the plurality of manipulation zones at a selected one of the plurality of T-junctions, or at an initialization zone.

### Claim 12 (depends on 1)

The method of claim 1, wherein the selected path has a predetermined maximum length.

### Claim 13 (depends on 12)

The method of claim 12, repeating the method for several ones of the plurality of manipulation zones as the start location (S) and for several ones of the plurality of manipulation zones as finishing location (F), further comprising determining, for any one the start locations (S), a distribution of the fidelity, relating to shuttling a qubit along the path, over the several finishing locations (F).

### Claim 14 (depends on 13)

The method of claim 13, further comprising including a manipulation fidelity relating to the manipulation zone at the finishing location (F) in the estimated fidelity.

### Claim 15 (depends on 14)

The method of claim 14, further comprising including an initialization fidelity and/or a readout fidelity in the estimated fidelity.

### Claim 16 (depends on 13)

The method of claim 13, wherein the at least one qubit is an ancilla qubit, and a two-qubit action is performed on the ancilla qubit and a data qubit present at the one of the plurality of manipulation zones.

### Claim 17

A computing system comprising a quantum processor, a voltage source, and a microprocessor,
the quantum chip comprising a semiconductor heterostructure and a plurality of gate electrodes arranged on the semiconductor heterostructure, wherein
a) the plurality of gate electrodes are arranged to provide a plurality of manipulation zones for manipulating a plurality of qubits, a plurality of T-junctions for interconnecting the plurality of qubits, and a plurality of shuttling lanes which provide a plurality of paths along which the plurality of qubits are movable, and
b) the plurality of manipulation zones are interconnected by the plurality of paths and the plurality of T-junctions, and
the microprocessor being configured to control the voltages and comprising a memory storing at least one shuttling fidelity relating to the plurality of shuttling lanes.

### Claim 18 (depends on 17)

The computing system of claim 17, wherein the memory further stores at least one turning-off fidelity relating to the plurality of T-junctions, or at least one straight-shuttling fidelity relating to the plurality of T-junctions.

### Claim 19 (depends on 17)

The computing system of claim 17, or wherein any one of the plurality of manipulation zones has an interface at which two meeting ones of the plurality of shuttling lanes meet one another.

### Claim 20 (depends on 19)

The computing system of claim 19, wherein ones of the manipulation zone further comprise at least one plunger gate and/or at least one barrier gate at the interface.

### Claim 21 (depends on 17)

The computing system of claim 17, wherein any one of the plurality of T-junctions has a junction at which two joining ones of the plurality of shuttling lanes join one another.

### Claim 22 (depends on 21)

The computing system of claim 21, wherein ones of the plurality of T-junctions further comprise at least one plunger gate and/or at least one barrier gate at the junction.

### Claim 23 (depends on 17)

The computing system of any claim 17, wherein at least one of the plurality of manipulation zones further comprises a top gate.

### Claim 24 (depends on 17)

The computing system of claim 17, further comprising a voltage source for providing at least one DC voltage and/or at least one AC voltage.

### Claim 25 (depends on 17)

The computing system of claim 17, wherein the quantum processor is arranged at a first cryogenic temperature.

### Claim 26 (depends on 17)

The computing system of claim 17, wherein the microprocessor is arranged at an ambient temperature or at a second cryogenic temperature, the second cryogenic temperature being equal to, or different from, the first cryogenic temperature.

### Claim 27 (depends on 17)

A system comprising the computing system of claim 17 and an external magnet for providing an external magnetic field B0.
