# US 2019/0378032 A1 · Layouts for fault-tolerant quantum computers

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

- Number: US 2019/0378032 A1
- Document ID: US20190378032A1
- Status: Published application
- Kind: A1
- Application number: 16/428,913
- Filed: 2019-05-31
- Published: 2019-12-12
- Earliest claimed: 2018-06-06
- Assignees: Microsoft Technology Licensing, LLC
- Applicants: Microsoft Technology Licensing, LLC
- Inventors: Vadym Kliuchnikov; Nicolas Delfosse; Alexander Vaschillo
- Web page: https://patentgrep.com/patent/US20190378032A1

## CPC

- G06F 30/392: Floor-planning or layout, e.g. partitioning or placement
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- 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
- H03K 19/20: characterised by logic function, e.g. AND, OR, NOR, NOT circuits (H03K19/003 - H03K19/01 take precedence)
- G06N 5/022: Knowledge engineering; Knowledge acquisition
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- H03K: PULSE TECHNIQUE (measuring pulse characteristics G01R; modulating sinusoidal oscillations with pulses H03C; transmission of digital information H04L; discriminator circuits detecting phase difference between two signals by counting or integrating cycles of oscillation H03D3/04; automatic control, starting, synchronisation or stabilisation of generators of electronic oscillations or pulses where the type of generator is irrelevant or unspecified H03L; coding, decoding or code conversion, in general H03M)

## Abstract

Disclosed herein are example layouts and layout generation techniques for fault-tolerant quantum computers. Example embodiments comprise methods for performing a layout reduction technique for fault-tolerant quantum computing. In certain embodiments, a layout of an arbitrary quantum circuit is reduced to a layout of exponents of a multiple qubit Pauli matrix and measurements of a multiple qubit Pauli matrix. In certain embodiments, qubits are marked as one of a data, interface, or ancilla qubit for a 2D nearest neighbor graph of qubit connectivity, and an ancilla-path is provided from a respective data qubit to a respective interface qubit.

## Claims

### Claim 1

A method performed by one or more classical computers, comprising:
reducing a layout of an arbitrary quantum circuit to a layout of exponents of a multiple qubit Pauli matrix and measurements of a multiple qubit Pauli matrix; and
configuring a quantum computer to implement the reduced layout.

### Claim 2 (depends on 1)

A method of claim 1, wherein qubits of the quantum computer comprise data qubits, interface qubits, and ancilla qubits.

### Claim 3 (depends on 2)

A method of claim 2, where a graph of qubit connectivity satisfies a condition of providing an ancilla-path from one or more data qubits to the interface qubits.

### Claim 4 (depends on 1)

A system, comprising:
a quantum computing device; and
one or more classical-computing devices, at least some of the one or more classical computing devices being programmed to perform the method of claim 1.

### Claim 5 (depends on 1)

One or more classical-computer-readable-media storing classical-computer-executable instructions, which when executed by a classical computer cause the classical computer to perform the method of claim 1.

### Claim 6

A quantum circuit configured to apply an exponent of a multiple qubit Pauli matrix and measure a multiple qubit Pauli matrix.

### Claim 7 (depends on 6)

The quantum circuit of claim 6, wherein an ancilla-path is provided from data qubits to the interface qubits.

### Claim 8 (depends on 6)

The quantum circuit of claim 6, wherein the quantum circuit has a depth not depending on the number of vertexes.

### Claim 9 (depends on 6)

The quantum circuit of claim 6, wherein the quantum circuit uses single or low-depth multiple-target CNOT gates as a sub-circuits.

### Claim 10

A method performed by one or more classical computers, comprising:
marking qubits as one of a data, interface, or ancilla qubit for a 2D nearest neighbor graph of qubit connectivity;
providing an ancilla-path from a respective data qubit to a respective interface qubit; and
configuring a quantum computer to implement the ancilla-path from a respective data qubit to a respective interface qubit.

### Claim 11 (depends on 10)

The computer-implemented method of claim 10, wherein the method accounts for and avoids any broken qubits and satisfies a condition of providing an ancilla-path from a data qubit to the interface qubits.

### Claim 12 (depends on 10)

A system, comprising:
a quantum computing device; and
one or more classical-computing devices, at least some of the one or more classical computing devices being programmed to perform the method of claim 10.

### Claim 13 (depends on 10)

One or more classical-computer-readable-media storing classical-computer-executable instructions, which when executed by a classical computer cause the classical computer to perform the method of claim 10.

### Claim 14

A quantum circuit configured to (a) provide a multi-target CNOT gate using a single-qubit and two-qubit Pauli measurements and single qubit Clifford gates; or (b) provide a multi-target CNOT gate using a single-qubit, Pauli measurements, single qubit, Clifford gates and Controlled-Z gates.

### Claim 15 (depends on 14)

The quantum circuit of claim 14, wherein the quantum circuit provides a multi-target CNOT gate using a single-qubit and two-qubit Pauli measurements and single qubit Clifford gates, wherein the quantum circuit works with qubits for which a graph of qubit connectivity satisfies a condition of providing an ancilla-path from a target qubit to the control qubit.

### Claim 16 (depends on 14)

The quantum circuit of claim 14, wherein the quantum circuit provides a multi-target CNOT gate using a single-qubit and two-qubit Pauli measurements and single qubit Clifford gates, wherein the quantum circuit has a depth not depending on the number of vertexes.

### Claim 17 (depends on 14)

The quantum circuit of claim 14, wherein the quantum circuit is configured to provide a multi-target CNOT gate using a single-qubit, Pauli measurements, single qubit Clifford gates and Controlled-Z gates, and wherein the quantum circuit works with qubits for which graph of qubit connectivity satisfies a condition of providing an ancilla-path from a target qubit to the control qubit.

### Claim 18 (depends on 14)

The quantum circuit of claim 14, wherein the quantum circuit is configured to provide a multi-target CNOT gate using a single-qubit, Pauli measurements, single qubit Clifford gates and Controlled-Z gates, wherein the quantum circuit has a depth not depending on the number of vertexes.
