Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2105.02398 · Physical Review Research

Compiling arbitrary single-qubit gates via the phase shifts of microwave pulses

Jianxin Chen, Dawei Ding, Cupjin Huang, Qi Ye

Published May 12, 2023• 20 citations
arXivHTMLPDF

Abstract

Applying phase shifts to qubit drives is known to give essentially perfect $Z$ rotations, but the current scheme is only compatible with a very special class of two-qubit gates. This puts unnecessary restrictions on the quantum instruction set. A proposed scheme is compatible with arbitrary two-qubit gates and is also uniquely optimal in the number of pulses needed.

DOI
10.1103/physrevresearch.5.l022031

Related papers

Halving the cost of quantum multiplexed rotations

Guang Hao Low

We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls applying $n$ single-qubit arbitrary phase rotations from $4n b+\mathcal{O}(\sqrt{cn b})$ to $2n b+\mathcal{O}(\sqrt{cn b})$, and reduce the number of qubits needed by up to a factor of two. This generic quantum circuit primitive is found in many quantum algorithms, and our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations. We achieve this by extending recent ideas on stochastic compilation of quantum circuits to classical data and discuss space-time trade-offs and concentration of measure in its implementation.

arXiv:2110.13439•Oct 26, 2021•10 citations

Efficient Z gates for quantum computing

David C. McKay, Christopher J. Wood, Sarah Sheldon +2 more

For superconducting qubits, microwave pulses drive rotations around the Bloch sphere. The phase of these drives can be used to generate zero-duration arbitrary virtual $Z$ gates, which, combined with two ${X}_{\ensuremath{\pi}/2}$ gates, can generate any SU(2) gate. Here we show how to best utilize these virtual $Z$ gates to both improve algorithms and correct pulse errors. We perform randomized benchmarking using a Clifford set of Hadamard and $Z$ gates and show that the error per Clifford is reduced versus a set consisting of standard finite-duration $X$ and $Y$ gates. $Z$ gates can correct unitary rotation errors for weakly anharmonic qubits as an alternative to pulse-shaping techniques such as derivative removal by adiabatic gate (DRAG). We investigate leakage and show that a combination of DRAG pulse shaping to minimize leakage and $Z$ gates to correct rotation errors realizes a 13.3 ns ${X}_{\ensuremath{\pi}/2}$ gate characterized by low error $[1.95(3)\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}4}]$ and low leakage $[3.1(6)\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}6}]$. Ultimately leakage is limited by the finite temperature of the qubit, but this limit is two orders of magnitude smaller than pulse errors due to decoherence.

arXiv:1612.00858•Physical Review A•Aug 31, 2017•624 citations

From virtual Z gates to virtual Z pulses

Christopher K. Long, C. H. W. Barnes

Virtual $Z$ gates have become integral for implementing fast, high-fidelity single-qubit operations. However, virtual $Z$ gates require that the system's two-qubit gates are microwave-activated or normalise the single-qubit $Z$ rotations$\unicode{x2014}$the group generated by $X$, $\operatorname{SWAP}$, and arbitrary phase gates. Herein, we extend the theory of virtual $Z$ gates to the pulse-level, which underlies both gate design and the recent advancements of pulse-level quantum algorithms. These algorithms attempt to utilise the full potential of present-day noisy intermediate-scale quantum (NISQ) devices by removing overheads associated with the compilation and transpilation of gates. To extend the theory of virtual $Z$ gates, we derive a platform-agnostic theoretical framework for virtual $Z$ pulses by employing time dilations of the pulse sequences that control the quantum processor. Additionally, we provide worked examples of the implementation of virtual $Z$ pulses on both semiconductor spin qubit and superconducting quantum processor architectures. Moreover, we present a general overview of the hardware support for virtual $Z$ pulses. We find virtual $Z$ pulses (and thus, virtual $Z$ gates) can be used on hardware that, with previous methods, did not support the virtual $Z$ gate. Finally, we present two additional applications of virtual $Z$ pulses to pulse-level algorithms. First, broadening the class of Hamiltonians that can be natively simulated in an analogue manner. Second, increasing the expressibility of pulse-based variational quantum algorithms.

arXiv:2509.13453•Sep 16, 2025•2 citations

An arbitrary two-qubit computation in 23 elementary gates or less

Stephen S. Bullock, Igor L. Markov

Quantum circuits currently constitute a dominant model for quantum computation according to M. Nielsen and I. Chuang (2000). Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and a small number of elementary quantum gates by A. Barenco et al. (1995) and G. Song and A. Klappenecker (2003) as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least 17 gates: 15 one-qubit rotations and 2 CNOTs. To this end, we constructively prove a worst-case upper bound to 23 elementary gates, of which at most 4 (CNOTs) entail multi-qubit interactions. Our analysis shows that previous known synthesis algorithms, although more general, entail much larger quantum circuits than ours in the special case of two qubits. One such algorithm according to G. Cybenko (2001) has a worst case of 61 gates of which 18 may be CNOTs. Our technique rely on the KAK decomposition from Lie theory as well as the polar and spectral (symmetric Shur) matrix decompositions from numerical analysis. They are related to the canonical decomposition of two-qubit gate with respect to the "magic basis" of phase-shifted Bell states by N. Khaneja et al. (2001) and M. Lewenstein et al. (2001). We extend this decomposition in terms of elementary gates for quantum computation.

ACM/IEEE Design Automation Conference (DAC)•Mar 1, 2004•7 citations

An arbitrary twoqubit computation In 23 elementary gates or less

Stephen S. Bullock, Igor L. Markov

Quantum circuits currently constitute a dominant model for quantum computation [14]. Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and as small a number of elementary quantum gates [1, 9] as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least 17 gates: 15 one-qubit rotations and 2 CNOTs. To this end, we constructively prove a worstcase upper bound of 23 elementary gates, of which at most 4 (CNOTs) entail multi-qubit interactions. Our analysis shows that previously known synthesis algorithms, although more general, entail much larger quantum circuits than ours in the special case of two qubits. One such algorithm [4] has a worst case of 61 gates of which 18 may be CNOTs. Our techniques rely on the KAK decomposition from Lie theory as well as the polar and spectral (symmetric Shur) matrix decompositions from numerical analysis. They are related to the canonical decomposition of a two-qubit gate with respect to the "magic basis" of phase-shifted Bell states [11, 12]. We extend this decomposition in terms of elementary gates for quantum computation.

ACM/IEEE Design Automation Conference (DAC)•Jun 2, 2003•22 citations

Reconfigurable Quantum Instruction Set Computers for High Performance Attainable on Hardware

Zhaohui Yang, Dawei Ding, Qi Ye +3 more

The performance of current quantum hardware is severely limited. While expanding the quantum ISA with high-fidelity, expressive basis gates is a key path forward, it imposes significant gate calibration overhead and complicates compiler optimization. As a result, even though more powerful ISAs have been designed, their use remains largely conceptual rather than practical. To move beyond these hurdles, we introduce the concept of "reconfigurable quantum instruction set computers" (ReQISC), which incorporates: (1) a unified microarchitecture capable of directly implementing arbitrary 2Q gates equivalently, i.e., SU(4) modulo 1Q rotations, with theoretically optimal gate durations given any 2Q coupling Hamiltonians; (2) a compilation framework tailored to ReQISC primitives for end-to-end synthesis and optimization, comprising a program-aware pass that refines high-level representations, a program-agnostic pass for aggressive circuit-level optimization, and an SU(4)-aware routing pass that minimizes hardware mapping overhead. We detail the hardware implementation to demonstrate the feasibility, in terms of both pulse control and calibration of this superior gate scheme on realistic hardware. By leveraging the expressivity of SU(4) and the time minimality realized by the underlying microarchitecture, the SU(4)-based ISA achieves remarkable performance, with a 4.97-fold reduction in average pulse duration to implement arbitrary 2Q gates, compared to the usual CNOT/CZ scheme on mainstream flux-tunable transmons. Supported by the end-to-end compiler, ReQISC outperforms the conventional CNOT-ISA, SOTA compiler, and pulse implementation counterparts, in significantly reducing 2Q gate counts, circuit depth, pulse duration, qubit mapping overhead, and program fidelity losses. For the first time, ReQISC makes the theoretical benefits of continuous ISAs practically feasible.

quant-pharXiv:2511.06746•International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)•Nov 11, 2025•2 citations
Applying phase shifts to qubit drives is known to give essentially perfect ZZZ rotations, but the current scheme is only compatible with a very special class of two-qubit gates. This puts unnecessary restrictions on the quantum instruction set. A proposed scheme is compatible with arbitrary two-qubit gates and is also uniquely optimal in the number of pulses needed.
We improve the number of TTT gates needed for a bbb-bit approximation of a multiplexed quantum gate with ccc controls applying nnn single-qubit arbitrary phase rotations from 4nb+O(cnb)4n b+\mathcal{O}(\sqrt{cn b})4nb+O(cnb​) to 2nb+O(cnb)2n b+\mathcal{O}(\sqrt{cn b})2nb+O(cnb​), and reduce the number of qubits needed by up to a factor of two. This generic quantum circuit primitive is found in many quantum algorithms, and our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations. We achieve this by extending recent ideas on stochastic compilation of quantum circuits to classical data and discuss space-time trade-offs and concentration of measure in its implementation.
For superconducting qubits, microwave pulses drive rotations around the Bloch sphere. The phase of these drives can be used to generate zero-duration arbitrary virtual ZZZ gates, which, combined with two ${X}_{\ensuremath{\pi}/2}$ gates, can generate any SU(2) gate. Here we show how to best utilize these virtual ZZZ gates to both improve algorithms and correct pulse errors. We perform randomized benchmarking using a Clifford set of Hadamard and ZZZ gates and show that the error per Clifford is reduced versus a set consisting of standard finite-duration XXX and YYY gates. ZZZ gates can correct unitary rotation errors for weakly anharmonic qubits as an alternative to pulse-shaping techniques such as derivative removal by adiabatic gate (DRAG). We investigate leakage and show that a combination of DRAG pulse shaping to minimize leakage and ZZZ gates to correct rotation errors realizes a 13.3 ns ${X}_{\ensuremath{\pi}/2}$ gate characterized by low error $[1.95(3)\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}4}]$ and low leakage $[3.1(6)\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}6}]$. Ultimately leakage is limited by the finite temperature of the qubit, but this limit is two orders of magnitude smaller than pulse errors due to decoherence.
Virtual ZZZ gates have become integral for implementing fast, high-fidelity single-qubit operations. However, virtual ZZZ gates require that the system's two-qubit gates are microwave-activated or normalise the single-qubit ZZZ rotations$\unicode{x2014}$the group generated by XXX, SWAP⁡\operatorname{SWAP}SWAP, and arbitrary phase gates. Herein, we extend the theory of virtual ZZZ gates to the pulse-level, which underlies both gate design and the recent advancements of pulse-level quantum algorithms. These algorithms attempt to utilise the full potential of present-day noisy intermediate-scale quantum (NISQ) devices by removing overheads associated with the compilation and transpilation of gates. To extend the theory of virtual ZZZ gates, we derive a platform-agnostic theoretical framework for virtual ZZZ pulses by employing time dilations of the pulse sequences that control the quantum processor. Additionally, we provide worked examples of the implementation of virtual ZZZ pulses on both semiconductor spin qubit and superconducting quantum processor architectures. Moreover, we present a general overview of the hardware support for virtual ZZZ pulses. We find virtual ZZZ pulses (and thus, virtual ZZZ gates) can be used on hardware that, with previous methods, did not support the virtual ZZZ gate. Finally, we present two additional applications of virtual ZZZ pulses to pulse-level algorithms. First, broadening the class of Hamiltonians that can be natively simulated in an analogue manner. Second, increasing the expressibility of pulse-based variational quantum algorithms.
Quantum circuits currently constitute a dominant model for quantum computation according to M. Nielsen and I. Chuang (2000). Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and a small number of elementary quantum gates by A. Barenco et al. (1995) and G. Song and A. Klappenecker (2003) as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least 17 gates: 15 one-qubit rotations and 2 CNOTs. To this end, we constructively prove a worst-case upper bound to 23 elementary gates, of which at most 4 (CNOTs) entail multi-qubit interactions. Our analysis shows that previous known synthesis algorithms, although more general, entail much larger quantum circuits than ours in the special case of two qubits. One such algorithm according to G. Cybenko (2001) has a worst case of 61 gates of which 18 may be CNOTs. Our technique rely on the KAK decomposition from Lie theory as well as the polar and spectral (symmetric Shur) matrix decompositions from numerical analysis. They are related to the canonical decomposition of two-qubit gate with respect to the "magic basis" of phase-shifted Bell states by N. Khaneja et al. (2001) and M. Lewenstein et al. (2001). We extend this decomposition in terms of elementary gates for quantum computation.
Quantum circuits currently constitute a dominant model for quantum computation [14]. Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and as small a number of elementary quantum gates [1, 9] as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least 17 gates: 15 one-qubit rotations and 2 CNOTs. To this end, we constructively prove a worstcase upper bound of 23 elementary gates, of which at most 4 (CNOTs) entail multi-qubit interactions. Our analysis shows that previously known synthesis algorithms, although more general, entail much larger quantum circuits than ours in the special case of two qubits. One such algorithm [4] has a worst case of 61 gates of which 18 may be CNOTs. Our techniques rely on the KAK decomposition from Lie theory as well as the polar and spectral (symmetric Shur) matrix decompositions from numerical analysis. They are related to the canonical decomposition of a two-qubit gate with respect to the "magic basis" of phase-shifted Bell states [11, 12]. We extend this decomposition in terms of elementary gates for quantum computation.
The performance of current quantum hardware is severely limited. While expanding the quantum ISA with high-fidelity, expressive basis gates is a key path forward, it imposes significant gate calibration overhead and complicates compiler optimization. As a result, even though more powerful ISAs have been designed, their use remains largely conceptual rather than practical. To move beyond these hurdles, we introduce the concept of "reconfigurable quantum instruction set computers" (ReQISC), which incorporates: (1) a unified microarchitecture capable of directly implementing arbitrary 2Q gates equivalently, i.e., SU(4) modulo 1Q rotations, with theoretically optimal gate durations given any 2Q coupling Hamiltonians; (2) a compilation framework tailored to ReQISC primitives for end-to-end synthesis and optimization, comprising a program-aware pass that refines high-level representations, a program-agnostic pass for aggressive circuit-level optimization, and an SU(4)-aware routing pass that minimizes hardware mapping overhead. We detail the hardware implementation to demonstrate the feasibility, in terms of both pulse control and calibration of this superior gate scheme on realistic hardware. By leveraging the expressivity of SU(4) and the time minimality realized by the underlying microarchitecture, the SU(4)-based ISA achieves remarkable performance, with a 4.97-fold reduction in average pulse duration to implement arbitrary 2Q gates, compared to the usual CNOT/CZ scheme on mainstream flux-tunable transmons. Supported by the end-to-end compiler, ReQISC outperforms the conventional CNOT-ISA, SOTA compiler, and pulse implementation counterparts, in significantly reducing 2Q gate counts, circuit depth, pulse duration, qubit mapping overhead, and program fidelity losses. For the first time, ReQISC makes the theoretical benefits of continuous ISAs practically feasible.