Realizing a Continuous Set of Two-Qubit Gates Parameterized by an Idle Time

Continuous gate sets are a key ingredient for near-term quantum algorithms. Here, we demonstrate a hardware-efficient, continuous set of controlled arbitrary-phase ( <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"> <a:msub> <a:mrow> <a:mstyle mathsize="0.85em"> <a:mi>CZ</a:mi> </a:mstyle> </a:mrow> <a:mi>θ</a:mi> </a:msub> </a:math> ) gates acting on flux-tunable transmon qubits. This implementation is robust to control pulse distortions on time scales longer than the duration of the gate, making it suitable for deep quantum circuits. Our calibration procedure makes it possible to parameterize the continuous gate set with a single control parameter, the idle time between the two rectangular halves of the net-zero control pulse. For calibration and characterization, we develop a leakage measurement based on coherent amplification, and a new cycle design for cross-entropy benchmarking. We demonstrate gate errors of <d:math xmlns:d="http://www.w3.org/1998/Math/MathML" display="inline"> <d:mrow> <d:mn>0.7</d:mn> </d:mrow> <d:mrow> <d:mi mathvariant="normal">%</d:mi> </d:mrow> </d:math> and leakage of <g:math xmlns:g="http://www.w3.org/1998/Math/MathML" display="inline"> <g:mn>4</g:mn> <g:mo>×</g:mo> <g:msup> <g:mn>10</g:mn> <g:mrow> <g:mo>−</g:mo> <g:mn>4</g:mn> </g:mrow> </g:msup> </g:math> across the entire gate set. This native gate set has the potential to reduce the depth and improve the performance of near-term quantum algorithms compared to decompositions into <i:math xmlns:i="http://www.w3.org/1998/Math/MathML" display="inline"> <i:msub> <i:mrow> <i:mstyle mathsize="0.85em"> <i:mi>CZ</i:mi> </i:mstyle> </i:mrow> <i:mi>π</i:mi> </i:msub> </i:math> gates and single-qubit gates. Moreover, we expect the calibration and benchmarking methods to find further possible applications.

Authors

Institutions

Publication Details

Journal
PRX Quantum
Published
2025-08-04
DOI
https://doi.org/10.1103/h7cv-xgw2
Citations
2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
4.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Realizing a Continuous Set of Two-Qubit Gates Parameterized by an Idle Time

Andreas J. Wallraff, Alexander Flasby, Colin Scarato, Stefania Lazăr et al.
2 citations
PRX Quantum
Quantum Computing Algorithms and Architecture
4.96
article

Realizing a Continuous Set of Two-Qubit Gates Parameterized by an Idle Time

Andreas J. Wallraff, Alexander Flasby, Colin Scarato, Stefania Lazăr, Christoph Hellings, Nathan Lacroix, Konstantin Hanke, Ants Remm, Dante Colao Zanuz
article en
2 citations

Abstract

Continuous gate sets are a key ingredient for near-term quantum algorithms. Here, we demonstrate a hardware-efficient, continuous set of controlled arbitrary-phase ( <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"> <a:msub> <a:mrow> <a:mstyle mathsize="0.85em"> <a:mi>CZ</a:mi> </a:mstyle> </a:mrow> <a:mi>θ</a:mi> </a:msub> </a:math> ) gates acting on flux-tunable transmon qubits. This implementation is robust to control pulse distortions on time scales longer than the duration of the gate, making it suitable for deep quantum circuits. Our calibration procedure makes it possible to parameterize the continuous gate set with a single control parameter, the idle time between the two rectangular halves of the net-zero control pulse. For calibration and characterization, we develop a leakage measurement based on coherent amplification, and a new cycle design for cross-entropy benchmarking. We demonstrate gate errors of <d:math xmlns:d="http://www.w3.org/1998/Math/MathML" display="inline"> <d:mrow> <d:mn>0.7</d:mn> </d:mrow> <d:mrow> <d:mi mathvariant="normal">%</d:mi> </d:mrow> </d:math> and leakage of <g:math xmlns:g="http://www.w3.org/1998/Math/MathML" display="inline"> <g:mn>4</g:mn> <g:mo>×</g:mo> <g:msup> <g:mn>10</g:mn> <g:mrow> <g:mo>−</g:mo> <g:mn>4</g:mn> </g:mrow> </g:msup> </g:math> across the entire gate set. This native gate set has the potential to reduce the depth and improve the performance of near-term quantum algorithms compared to decompositions into <i:math xmlns:i="http://www.w3.org/1998/Math/MathML" display="inline"> <i:msub> <i:mrow> <i:mstyle mathsize="0.85em"> <i:mi>CZ</i:mi> </i:mstyle> </i:mrow> <i:mi>π</i:mi> </i:msub> </i:math> gates and single-qubit gates. Moreover, we expect the calibration and benchmarking methods to find further possible applications.

PRX QuantumVol. 6(4)
Paul Scherrer Institute (CH), ETH Zurich (CH)
Openalex Percentile: Top 4%
Quantum Computing Algorithms and Architecture
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.