# US 2025/0148345 A1 · Methods and systems for characterization and calibration of a quantum processor

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

- Number: US 2025/0148345 A1
- Document ID: US20250148345A1
- Status: Published application
- Kind: A1
- Application number: 18/896,453
- Filed: 2024-09-25
- Published: 2025-05-08
- Earliest claimed: 2023-11-07
- Assignees: QEDMA Quantum Computing LTD.
- Applicants: QEDMA Quantum Computing LTD.
- Inventors: Itsik COHEN; Adiel Reuvan Meyer BERMAN; Eyal BAIREY; Eyal LEVIATAN; Omrie OVDAT; Ilya GURWICH; Ron MELCER; Yaron ITKIN; Omri GOLAN; Shlomi KOTLER; Netanel Hanan LINDNER
- Web page: https://patentgrep.com/patent/US20250148345A1

## CPC

- G06N 10/70: Quantum error correction, detection or prevention, e.g. surface codes or magic state distillation
- G06N 10/40: Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A computer implemented method for characterizing at least one target error parameter of implementation errors in a quantum logic operation g acting on a targeted set of qubits of a quantum processor is presented. The method comprises: (a) generating at least one characterization sequence S configured for amplifying said at least one target error parameter, said at least one characterization sequence S comprises at least one refocusing sequence, wherein the at least one refocusing sequence is configured so that the characterization sequence reduces predefined generator terms including crosstalk between said targeted set of qubits and another set of qubits of the quantum processor; and (b) characterizing said at least one target error parameter using said at least one characterization sequence in a characterization protocol.

## Claims

### Claim 1

A computer implemented method for characterizing at least one target error parameter of implementation errors in a quantum logic operation g acting on a targeted set of qubits of a quantum processor, the method comprising:
(a) generating at least one characterization sequence S configured for amplifying said at least one target error parameter, said at least one characterization sequence S comprises at least one refocusing sequence, wherein the at least one refocusing sequence is configured so that the characterization sequence reduces predefined generator terms including crosstalk between said targeted set of qubits and another set of qubits of the quantum processor;
(b) characterizing said at least one target error parameter using said at least one characterization sequence in a characterization protocol.

### Claim 2 (depends on 1)

The method according to claim 1, wherein characterizing the at least one target error parameter comprises:
(a) applying the at least one characterization sequence S to the quantum processor;
(b) measuring the targeted set of qubits using a measurement apparatus of said quantum processor, thereby obtaining a set of measurement values;
(c) computing a value of said at least one target error parameter, by fitting a model to said set of measurement values.

### Claim 3 (depends on 1)

The method according to claim 1, wherein:
(a) said at least one characterization sequence S is configured for reducing predefined coherent error generator terms in said targeted set of qubits;
(b) the method characterizes a single target error parameter of implementation errors in the quantum logic operation g;
(c) said at least one target error parameter is a Pauli generator term Pt; said at least one characterization sequence S is configured to eliminate predefined Pauli generator terms of said implementation errors distinct from the at least one target error parameter; and
(d) said at least one refocusing sequence commutes with said Pauli generator term Pt.

### Claim 4 (depends on 1)

The method according to claim 1, wherein said at least one refocusing sequence is any of: a dynamical decoupling sequence, and a twirling sequence.

### Claim 5 (depends on 1)

The method according to claim 1, wherein said at least one characterization sequence S is configured to any of: reducing a magnitude measure of said crosstalk, and eliminating at least a first-order error of implementation errors distinct from the at least one target error parameter.

### Claim 6 (depends on 1)

The method according to claim 1, wherein the at least one refocusing sequences includes a set of refocusing sequences, and wherein said at least one characterization sequence S comprises at least one recursively concatenated germ obtained by computing a predefined number n of concatenations Gk+1=ΠmGkβm(k), wherein k=0, 1, . . . , n−1, wherein, βm(k) are refocusing sequences included in said set of refocusing sequences and G0=g, g being said quantum logic operation.

### Claim 7 (depends on 3)

The method according to claim 3, wherein said at least one characterization sequence S comprises at least one fiducial operation, and wherein:
(a) said at least one fiducial operation comprises state preparation operations configured for setting a state of said set of qubits to a preparation Pauli state Pp;
(b) said at least one fiducial operation comprises measuring said set of qubits according to a measurement Pauli Pm;
(c) said preparation Pauli state Pp and measurement Pauli Pm are configured for increasing a sensitivity of said least one characterization sequence S to said at least one error parameter; and
(d) said preparation Pauli state Pp, measurement Pauli Pm, and said Pauli generator term Pt, span an algebra isomorphic to the SU(2) Lie algebra.

### Claim 8 (depends on 1)

The method according to claim 1, wherein said quantum logic operation g is a two-qubit operation, and wherein:
(a) said Pauli generator term Pt anti-commutes with at least one generator of a KAK decomposition of an ideal version of said quantum logic operation g;
(b) a sum of coefficients is greater than
3
⁢
π
4
,
said coefficients corresponding to said at least one KAK generator anti-commuting with said Pauli generator term Pt; and
(c) said at least one refocusing sequence comprises at least one secondary refocusing sequence, said at least one secondary refocusing sequence commuting with all commutators of said Pauli generator term Pt and generators of said KAK decomposition of an ideal version of said quantum logic operation g.

### Claim 9 (depends on 6)

The method according to claim 6, wherein any one of the following:
(a) said Pauli generator term Pt is distinct from an over-rotation term and wherein:
i) said recursively concatenated germ comprises at least n concatenation steps;
ii) said Pauli generator term Pt is distinct from an over-rotation term and a primary refocusing sequence anti-commutes with a corresponding Pauli generator term of an ideal version of said quantum logic operation g; and
iii) said at least one characterization sequence S is configured to eliminate a fraction of 1-2−n of Pauli generator terms of said implementation errors;
(b) said Pauli generator term Pt is an over-rotation term and said recursively concatenated germ comprises at least n concatenation steps, and wherein said at least one characterization sequence S is configured to eliminate a fraction of 1-2−(n+1) of Pauli generator terms of said implementation errors;
wherein said at least one characterization sequence S is preferably configured to isolate said Pauli generator term Pt of said implementation errors.

### Claim 10 (depends on 9)

The method according to claim 9, wherein any one of the following:
(a) said Pauli generator term Pt is an over-rotation term, and said at least one characterization sequence S comprises any one of the germs G0(1)=gA, G1(1)=BG0(1)CG0(1), and G0(2)=gAgA, and G1(2)=BG0(2)CG0(2) wherein said A, B, C being refocusing sequences; and
(b) said Pauli generator term Pt is distinct from an over-rotation term, and said at least one characterization sequence S comprises any of the germs G0(3)=gAgA, G1(3)=G0(3)AG0(3)A, G2(3)=BG1(3)CG1(3), and G3(3)=G1(3)BG1(3)C, wherein said A, B, C being refocusing sequences.

### Claim 11 (depends on 3)

The method according to claim 3, wherein any one of the following:
(a) said Pauli generator term Pt is distinct from an over-rotation term, wherein said at least one characterization sequence S comprises at least one subsequence G(4)=PgDgDP, and wherein:
i) said P being a randomly sampled Pauli operator; and
ii) said D being a refocusing sequence commuting with said Pauli generator term Pt, and anti-commuting with a corresponding Pauli generator term of an ideal version of said quantum logic operation g;
(b) said Pauli generator term Pt is an over-rotation term, wherein said at least one characterization sequence S comprises at least one subsequence G(5)=PgP, wherein said P being a randomly sampled Pauli operator commuting with said Pauli generator term Pt.

### Claim 12 (depends on 1)

The method according to claim 1, applied to at least two quantum logic operations in parallel, wherein said at least two quantum logic operations operate on corresponding subsets of qubits, each of said corresponding subsets of qubits having no common qubit.

### Claim 13 (depends on 12)

The method according to claim 12, wherein no crosstalk is present between each of said corresponding subsets of qubits.

### Claim 14 (depends on 12)

The method according to claim 12, wherein each of said corresponding subsets of qubits is included in a corresponding hyperedge of an interaction hypergraph, wherein each of said corresponding hyperedges being unique for each of said corresponding subsets of qubits.

### Claim 15 (depends on 1)

A non-transient computer readable storage medium, storing computer instructions, wherein the computer instructions are used for causing a computer to execute the method according to claim 1.

### Claim 16

A system for characterizing implementation errors in a quantum logic operation g operating on a targeted set of qubits of a quantum processor, comprising a processor configured for executing computer-executable components stored in a memory, wherein the computer-executable components comprise:
(a) a sequence component, configured for generating at least one characterization sequence, said at least one characterization sequence including at least one refocusing sequence and said quantum logic operation g, the at least one characterization sequence is configured for amplifying at least one target error parameter, and the at least one refocusing sequence is configured for reducing predefined crosstalk Pauli terms between said targeted set of qubits and another set of qubits of the quantum processor; and
(b) a characterization component, configured for characterizing errors in said quantum logic operation g, using said sequence.

### Claim 17 (depends on 16)

The system according to claim 16, wherein said at least one target error parameter is a Pauli generator term Pt, and wherein said at least one characterization sequence is configured for reducing predefined Pauli generator terms in said targeted set of qubits.

### Claim 18 (depends on 16)

The system according to claim 16, wherein said at least one refocusing sequence is any of: a dynamical decoupling sequence, and a twirling sequence.

### Claim 19 (depends on 17)

The system according to claim 17, wherein said at least one refocusing sequence commutes with said Pauli generator term Pt.

### Claim 20 (depends on 17)

The system according to claim 17, wherein a first refocusing sequence included in said at least one characterization sequence anti-commutes with a Pauli generator term of an ideal version of said quantum logic operation g corresponding said Pauli generator term Pt.
