# US 2024/0004773 A1 · Benchmarking protocol for quantum gates

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

- Number: US 2024/0004773 A1
- Document ID: US20240004773A1
- Status: Published application
- Kind: A1
- Application number: 17/804,673
- Filed: 2022-05-31
- Published: 2024-01-04
- Earliest claimed: 2022-05-31
- Assignees: Z-Axis Pte. Ltd.
- Applicants: Alibaba (China) Co., Ltd.
- Inventors: Jiachen HUANG
- Web page: https://patentgrep.com/patent/US20240004773A1

## CPC

- G06F 11/3428: {Benchmarking}
- G06N 10/70: Quantum error correction, detection or prevention, e.g. surface codes or magic state distillation
- G06F 11/3452: {Performance evaluation by statistical analysis}
- G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Systems and methods are disclosed for benchmarking a set of quantum gates. The set of quantum gates can have an input domain and a fidelity function defined over this input domain. Benchmarking the set of quantum gates can include determining an approximate value of the fidelity function over the input domain. Such benchmarking can include determining multiple fidelity measures. Each fidelity measure can be associated with one of a set of basis functions. This basis function can be used to generate a probability distribution. The probability distribution can be used to determine the fidelity measure. The approximate fidelity function can be generated using the fidelity measures and corresponding basis functions.

## Claims

### Claim 1

A method of benchmarking a set of quantum gates comprising:
selecting a set of quantum gates, the quantum gates being defined over an input domain;
determining an approximate fidelity function for the set of quantum gates, the determination comprising:
selecting a set of basis functions defined over the input domain;
generating a first probability distribution defined over the input domain using one of the set of basis functions;
obtaining, by performing randomized benchmarking on a quantum component, a fidelity measure for the set of quantum gates under the first probability distribution; and
wherein the approximate fidelity function is a function of the fidelity measure and the one of the set of basis functions; and
providing the approximate fidelity function.

### Claim 2 (depends on 1)

The method of claim 1, wherein:
obtaining the fidelity measure comprises scaling a first fidelity value for an interleaved sequence of quantum gates by a second fidelity value for an un-interleaved sequence of quantum gates.

### Claim 3 (depends on 1)

The method of claim 1, wherein:
performing randomized benchmarking on the quantum component comprises:
determining a first fidelity value for first sequences of quantum gates, each of the first sequences interleaving:
a sequence selected from the set of quantum gates according to the at least one first probability distribution; and
a sequence selected from a group of quantum gates according to a second probability distribution.

### Claim 4 (depends on 1)

The method of claim 1, wherein:
the second probability distribution is a uniform probability distribution over the input domain.

### Claim 5 (depends on 1)

The method of claim 1, wherein the set is subset of a group of quantum gates.

### Claim 6 (depends on 1)

The method of claim 1, wherein the set of basis functions comprises:
a set of trigonometric basis functions;
a set of polynomial basis functions; or
a set of wavelet basis functions.

### Claim 7 (depends on 1)

The method of claim 1, wherein the approximate fidelity function comprises two or more terms of a Fourier, Taylor, or wavelet expansion of a fidelity function of the set of quantum gates on the quantum component.

### Claim 8 (depends on 1)

The method of claim 1, wherein the input domain includes two or more variables.

### Claim 9 (depends on 1)

The method of claim 1, wherein the quantum component comprises a transmon or fluxonium qubit.

### Claim 10

A system for benchmarking a set of quantum gates comprising:
at least one processor; and
at least one non-transitory computer-readable medium containing instructions that, when executed by the at least one processor, cause the system to perform operations comprising:
selecting a set of quantum gates, the quantum gates defined over an input domain;
determining an approximate fidelity function for the set of quantum gates, the determination comprising:
selecting a set of basis functions defined over the input domain;
generating a first probability distribution defined over the input domain using one of the set of basis functions;
obtaining, by performing randomized benchmarking on a quantum component, a fidelity measure for the set of quantum gates under the first probability distribution; and
wherein the approximate fidelity function is a function of the fidelity measure and the set of basis functions; and
providing the approximate fidelity function.

### Claim 11 (depends on 10)

The system of claim 10, wherein:
obtaining the fidelity measure comprises scaling a first fidelity value for an interleaved sequence of quantum gates by a second fidelity value for an un-interleaved sequence of quantum gates.

### Claim 12 (depends on 10)

The system of claim 10, wherein:
performing randomized benchmarking on the quantum component comprises:
determining a first fidelity value for first sequences of quantum gates, each of the first sequences interleaving:
a sequence selected from the set of quantum gates according to the at least one first probability distribution; and
a sequence selected from a group of quantum gates according to a second probability distribution.

### Claim 13 (depends on 10)

The system of claim 10, wherein the set is subset of a group of quantum gates.

### Claim 14 (depends on 10)

The system of claim 10, wherein the set of basis functions comprises:
a set of trigonometric basis functions;
a set of polynomial basis functions; or
a set of wavelet basis functions.

### Claim 15 (depends on 10)

The system of claim 10, wherein the approximate fidelity function comprises two or more terms of a Fourier, Taylor, or wavelet expansion of a fidelity function of the set of quantum gates on the quantum component.

### Claim 16 (depends on 10)

The system of claim 10, wherein the quantum component comprises a transmon or fluxonium qubit.

### Claim 17

A non-transitory computer-readable medium containing instructions that, when executed by at least one processor of a system, cause the system to perform operations comprising:
selecting a set of quantum gates, the quantum gates defined over an input domain;
determining an approximate fidelity function for the set of quantum gates, the determination comprising:
selecting a set of basis functions defined over the input domain;
generating a first probability distribution defined over the input domain using one of the set of basis functions;
obtaining, by performing randomized benchmarking on a quantum component, a fidelity measure for the set of quantum gates under the first probability distribution; and
wherein the approximate fidelity function is a function of the fidelity measure and the one of the set of basis functions; and
providing the approximate fidelity function.

### Claim 18 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein:
obtaining the fidelity measure comprises scaling a first fidelity value for an interleaved sequence of quantum gates by a second fidelity value for an un-interleaved sequence of quantum gates.

### Claim 19 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein:
performing randomized benchmarking on the quantum component comprises:
determining a first fidelity value for first sequences of quantum gates, each of the first sequences interleaving:
a sequence selected from the set of quantum gates according to the first probability distribution; and
a sequence selected from a group of quantum gates according to a second probability distribution.

### Claim 20 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein the set is subset of a group of quantum gates.

### Claim 21 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein the set of basis functions comprises:
a set of trigonometric basis functions;
a set of polynomial basis functions; or
a set of wavelet basis functions.

### Claim 22 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein the approximate fidelity function comprises two or more terms of a Fourier, Taylor, or wavelet expansion of a fidelity function of the set of quantum gates on the quantum component.

### Claim 23 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein the quantum component comprises a transmon or fluxonium qubit.
