# US 2022/0035978 A1 · Synthesis of a quantum circuit

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

- Number: US 2022/0035978 A1
- Document ID: US20220035978A1
- Status: Published application
- Kind: A1
- Application number: 17/505,308
- Filed: 2021-10-19
- Published: 2022-02-03
- Earliest claimed: 2020-06-10
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Sergey Bravyi; Andrew W. Cross; Shelly-Erika Garion; Dmitri Maslov
- Web page: https://patentgrep.com/patent/US20220035978A1

## CPC

- G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers
- G06F 30/28: using fluid dynamics, e.g. using Navier-Stokes equations or computational fluid dynamics [CFD]
- G06F 30/327: Logic synthesis; Behaviour synthesis, e.g. mapping logic, HDL to netlist, high-level language to RTL or netlist
- G06F 30/392: Floor-planning or layout, e.g. partitioning or placement
- G06F 2111/02: CAD in a network environment, e.g. collaborative CAD or distributed simulation
- G06F 2119/02: Reliability analysis or reliability optimisation; Failure analysis, e.g. worst case scenario performance, failure mode and effects analysis [FMEA]
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Systems, computer-implemented methods, and computer program products to facilitate synthesis of a quantum circuit are provided. According to an embodiment, a system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a circuit generation component that generates, iteratively, quantum circuits from 1 to N two-qubit gates, wherein at least one or more iterations (1, 2, . . . , N) adds a single two-qubit gate to circuits from a previous iteration based on using added single 2-qubit gates that represent operations distinct from previous operations relative to previous iterations. The computer executable components can further comprise a circuit identification component that identifies, from the quantum circuits, a desired circuit that matches a quantum circuit representation.

## Claims

### Claim 1

A system, comprising:
a memory that stores computer executable components; and
a processor that executes the computer executable components stored in the memory, wherein the computer executable components comprise:
a circuit generation component that generates, during a first iteration, a first set of quantum circuits comprising 2-qubit gates;
a second circuit generation component that generates, during a second iteration, a second set of quantum circuits by adding a 2-qubit gate to the first set of quantum circuits such that the second set of quantum circuits are selected to a redundant operation use the 2-qubit gate without introducing the redundant operation to that of the first set of quantum circuits; and
a circuit identification component that identifies, from the first set of quantum circuits and the second set of quantum circuits, a desired circuit that matches a quantum circuit representation.

### Claim 2 (depends on 1)

The system of claim 1, wherein the first set of quantum circuits and the second set of quantum circuits comprise Clifford quantum circuits having a Clifford group, and wherein the computer executable components further comprise:
an interface component that receives the quantum circuit representation.

### Claim 3 (depends on 1)

The system of claim 1, wherein the first set of quantum circuits and the second set of quantum circuits comprise CNOT-Dihedral quantum circuits having a CNOT-Dihedral group.

### Claim 4 (depends on 1)

The system of claim 1, wherein the circuit generation component generates, iteratively, the first set of quantum circuits and the second circuit generation component generates, iteratively, the second set of quantum circuits to minimize a number of CNOT gates in the desired circuit.

### Claim 5 (depends on 1)

The system of claim 1, wherein the desired circuit comprises a defined number of CNOT gates and a Clifford quantum circuit having a Clifford group or a CNOT-Dihedral quantum circuit having a CNOT-Dihedral group.

### Claim 6 (depends on 5)

The system of claim 5, wherein the computer executable components further comprise:
an application component that performs randomized benchmarking on a defined number of qubits in a quantum device based on the desired circuit, thereby facilitating at least one of improved efficiency, improved performance, or reduced computational costs associated with at least one of the application component, the processor, or the system in performing the randomized benchmarking based on the desired circuit.

### Claim 7

A computer-implemented method of synthesizing a quantum circuit, comprising:
generating, by a system operatively coupled to a processor, during a first iteration, a first set of quantum circuits comprising 2-qubit gates;
generating, by the system, during a second iteration, a second set of quantum circuits by adding a 2-qubit gate to the first set of quantum circuits such that the second set of quantum circuits are selected to a redundant operation use the 2-qubit gate without introducing the redundant operation to that of the first set of quantum circuits; and
identifying, by the system, from the first set of quantum circuits and the second set of quantum circuits, a desired circuit that matches a quantum circuit representation.

### Claim 8 (depends on 7)

The computer-implemented method of claim 7, wherein the first set of quantum circuits and the second set of quantum circuits comprise Clifford quantum circuits having a Clifford group, and further comprising:
receiving, by the system, the quantum circuit representation.

### Claim 9 (depends on 7)

The computer-implemented method of claim 7, wherein the first set of quantum circuits and the second set of quantum circuits comprise CNOT-Dihedral quantum circuits having a CNOT-Dihedral group.

### Claim 10 (depends on 7)

The computer-implemented method of claim 7, further comprising:
generating, by the system, iteratively, the first set of quantum circuits and the second set of quantum circuits to minimize a number of CNOT gates in the desired circuit.

### Claim 11 (depends on 7)

The computer-implemented method of claim 7, wherein the desired circuit comprises a defined number of CNOT gates and a Clifford quantum circuit having a Clifford group or a CNOT-Dihedral quantum circuit having a CNOT-Dihedral group.

### Claim 12 (depends on 11)

The computer-implemented method of claim 11, further comprising:
performing, by the system, randomized benchmarking on a defined number of qubits in a quantum device based on the desired circuit, thereby facilitating at least one of improved efficiency, improved performance, or reduced computational costs associated with at least one of the processor or the system in performing the randomized benchmarking based on the desired circuit.
