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:2509.13453

From virtual Z gates to virtual Z pulses

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

Published Sep 16, 2025• 2 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2509.13453

Related papers

Pulse-based variational quantum algorithms

Han-Xiao Tao, Re-Bing Wu

Variational quantum algorithms (VQAs) are the leading candidates for practical applications of noisy intermediate-scale quantum (NISQ) devices. Recently, pulse-based variational quantum algorithms (p-VQAs) have emerged as a compelling alternative to traditional gate-based VQAs. By optimizing continuous control fields directly on hardware-native Hamiltonians, pulse-based methods are easy to implement and can significantly reduce quantum resource overhead, thereby enhancing the overall performance of quantum algorithms on NISQ devices. In this review, we present a comprehensive survey over recent advances in p-VQAs, covering theory, algorithms, and hardware deployments across various quantum computing platforms. We also review applications of p-VQAs to variational quantum eigensolver in quantum chemistry, quantum approximate optimization algorithm for combinatorial optimization, and quantum machine learning tasks.

Quantum Review Letters•Jan 1, 2026•0 citations

Programmable quantum simulation by dynamic Hamiltonian engineering

David Hayes, Steven T. Flammia, Michael J. Biercuk

Quantum simulation is a promising near term application for quantum information processors with the potential to solve computationally intractable problems using just a few dozen interacting qubits. A range of experimental platforms have recently demonstrated the basic functionality of quantum simulation applied to quantum magnetism, quantum phase transitions and relativistic quantum mechanics. However, in all cases, the physics of the underlying hardware restricts the achievable inter-particle interactions and forms a serious constraint on the versatility of the simulators. To broaden the scope of these analog devices, we develop a suite of pulse sequences that permit a user to efficiently realize average Hamiltonians that are beyond the native interactions of the system. Specifically, this approach permits the generation of all symmetrically coupled translation-invariant two-body Hamiltonians with homogeneous on-site terms, a class which includes all spin- XYZ chains, but generalized to include long-range couplings. Our work builds on previous work proving that universal simulation is possible using both entangling gates and single-qubit unitaries. We show that determining the appropriate 'program' of unitary pulse sequences which implements an arbitrary Hamiltonian transformation can be formulated as a linear program over functions defined by those pulse sequences, running in polynomial time and scaling efficiently in hardware resources. Our analysis extends from circuit model quantum information to adiabatic quantum evolutions, representing an important and broad-based success in applying functional analysis to the field of quantum information.

arXiv:1309.6736•New Journal of Physics•Aug 12, 2014•37 citations

Implementing quantum computing on superconducting qubits

Paul Yuan Zheng Tan

Quantum computing utilizes quantum mechanics to perform computations with superconducting qubits being the more mature technology as of writing in realizing a quantum computer. In this thesis, we describe an implementation of a Quantum Processor Unit (QPU), which is used to execute instructions in the form of microwave pulses on a superconducting qubit device through the use of signal generators and to perform qubit readout. We further extend the QPU as a platform to perform qubit characterization tasks such as spectroscopy and decoherence measurements in order to determine and optimize the working parameters to perform quantum gate operations. We also demonstrate the use of the QPU in performing qubit experiments such as Gauss Sum Factorization in determining the factors of an integer and the Bell Inequality test in examining the entanglement strength between a pair of qubits. We bridge the divide of quantum computation and qubit hardware in the compilation of quantum circuits into microwave pulse sequences for the QPU to execute. The process of compilation, as well as hardware limitations and pre-compilation optimization procedures are discussed. Finally, we show an example of executing a variational quantum algorithm and break down this example in all layers from the quantum circuit provided by the user to the pulse sequence that will be executed on the QPU.

•Jan 1, 2022•0 citations

Pulse Shaping for Superconducting Qubits

Animesh Patra, Ankur Raina

High-fidelity control of superconducting qubits requires carefully shaped microwave pulses to avoid several different kinds of error at once. This article is a pedagogical bridging text aimed at upper-level undergraduate and early graduate students who have completed an introductory quantum mechanics course and a first course in quantum computing or quantum information, but who have not yet encountered the physical implementation of qubit gates. We integrate physical intuition for pulse design, analytical gate-level descriptions, and practical hardware considerations into a single, derivation-driven narrative, with explicit learning objectives. We begin with simple pulse envelopes and their spectral properties, showing how finite bandwidth produces leakage outside the computational subspace. This motivates the derivative removal by adiabatic gate (DRAG) technique, which we derive explicitly using the Magnus expansion, obtaining a clear, order-by-order account of which physical error channel appears at which order and why DRAG's cancellation is necessarily incomplete. We discuss the practical hardware realities of control pulse generation, focusing on arbitrary waveform generators (AWG), local oscillators (LO), and IQ mixing. Finally, we extend the discussion to two-qubit operation via the cross-resonance gate, and interpret how driving the control qubit at the target qubit's transition frequency necessarily produces several unwanted interaction terms alongside the desired one, and how successive generations of pulse-engineering strategies have been designed to suppress them.

quant-pharXiv:2604.21565•Apr 24, 2026•2 citations

Quantum Gate Engineering in Superconducting NISQ Platforms: Experimental Methods and Emerging Directions

Alessandro Sarno, Viviana Stasino, Antonio Pio Italiano +7 more

This review aims to provide researchers, experimentalists, and quantum engineers with an updated and technically grounded perspective on the implementation of quantum gates in superconducting NISQ devices. The goal is to establish a comprehensive bridge between theoretical quantum circuit synthesis and its practical, experimental implementation, focusing on superconducting quantum technologies. We systematically examine the diverse landscape of superconducting qubits and processor architectures, ranging from conventional transmons to alternative and unconventional designs, evaluating their unique design trade-offs, connectivity constraints, device physics, and materials impact. Moving from theory to actual implementation, we detail how single- and two-qubit operations are synthesized via microwave-driven and flux-activated pulses. We here present our pulse engineering, wave shaping, calibration workflows, demonstrating how to bridge the gap between abstract gate models and real-world hardware limitations in the direction of a hardware-software co-design framework. To validate these operations, we choose benchmarking methodologies with the purpose to get the more efficient metric for the specific evaluation aspect, including truth tables and quantum process tomography. Therefore, we both discuss the theoretical concepts behind the gate synthesis and show experimental implementation of most fundamental gates by proposing a practical workflow.

quant-pharXiv:2610.38635•Oct 29, 2026•0 citations

Control techniques for superconducting quantum computer hardware: New radio-frequency quantum gate implementations, and electrical annealing of Josephson junctions

Christian Križan

The thesis investigates three challenges in superconducting quantum computing: efficient quantum gate compilation, scalable microwave interfacing of quantum processors (QPUs), and electrical annealing of Josephson junctions.The first part addresses an inefficiency in contemporary two-qubit gate compilation. Universal quantum computation requires only a single entangling two-qubit gate alongside single-qubit rotations, but this minimal gate set requires up to three additional two-qubit gates for every unsupported gate. I show how access to multiple inequivalent two-qubit gate classes overcomes this inefficiency. I experimentally realised an unsupported SWAP operation using one parametric CZ and one parametric iSWAP gate on a circuit-QED architecture. A Kraus-Cirac analysis shows that this combination belongs to the SWAP equivalency class, the fundamental reason for the reduction in two-qubit gates. The experiment demonstrates a rare case of simultaneous CZ and iSWAP support in the same quantum circuit, illustrating how access to multiple inequivalent gate classes can reduce compilation overhead on real hardware.The second part explores direct digital synthesis of microwave signals for interfacing with quantum processors. Conventional control uses heterodyne upconversion with IQ mixers, requiring compensation of LO leakage and IQ skew. I investigated a mixerless architecture based on high-speed DAC/ADC systems to generate and analyse the required microwave signals. CZ and iSWAP gate experiments subsequently verify that the platform is equivalent to conventional QPU setups.The third part investigates post-fabrication electrical tuning of Josephson junctions, in which voltage pulses modify junction resistance to correct fabrication-induced transmon-frequency variations. The speed of resistance change was found to depend exponentially on pulse amplitude. A novel stepwise protocol achieved a 270% resistance increase in an 11-month-old 11.5 kΩ junction, corresponding to a ~2 GHz reduction in transmon frequency, the largest reported selective resistance modification to date. Simulations show that resistance, charging-energy, and superconducting-gap uncertainties contribute equally to the uncertainty in the final qubit frequency. The results support a picture where electrical manipulation modifies the energy landscape, accelerating natural junction ageing.The thesis demonstrates that investigating gate-level compilation strategies, fully digital QPU control, and post-fabrication tuning, helps advance the understanding of how to approach scalable superconducting quantum processors.

•Oct 2, 2026•0 citations
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\unicodex2014\unicode{x2014}\unicodex2014the 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.
Variational quantum algorithms (VQAs) are the leading candidates for practical applications of noisy intermediate-scale quantum (NISQ) devices. Recently, pulse-based variational quantum algorithms (p-VQAs) have emerged as a compelling alternative to traditional gate-based VQAs. By optimizing continuous control fields directly on hardware-native Hamiltonians, pulse-based methods are easy to implement and can significantly reduce quantum resource overhead, thereby enhancing the overall performance of quantum algorithms on NISQ devices. In this review, we present a comprehensive survey over recent advances in p-VQAs, covering theory, algorithms, and hardware deployments across various quantum computing platforms. We also review applications of p-VQAs to variational quantum eigensolver in quantum chemistry, quantum approximate optimization algorithm for combinatorial optimization, and quantum machine learning tasks.
Quantum simulation is a promising near term application for quantum information processors with the potential to solve computationally intractable problems using just a few dozen interacting qubits. A range of experimental platforms have recently demonstrated the basic functionality of quantum simulation applied to quantum magnetism, quantum phase transitions and relativistic quantum mechanics. However, in all cases, the physics of the underlying hardware restricts the achievable inter-particle interactions and forms a serious constraint on the versatility of the simulators. To broaden the scope of these analog devices, we develop a suite of pulse sequences that permit a user to efficiently realize average Hamiltonians that are beyond the native interactions of the system. Specifically, this approach permits the generation of all symmetrically coupled translation-invariant two-body Hamiltonians with homogeneous on-site terms, a class which includes all spin- XYZ chains, but generalized to include long-range couplings. Our work builds on previous work proving that universal simulation is possible using both entangling gates and single-qubit unitaries. We show that determining the appropriate 'program' of unitary pulse sequences which implements an arbitrary Hamiltonian transformation can be formulated as a linear program over functions defined by those pulse sequences, running in polynomial time and scaling efficiently in hardware resources. Our analysis extends from circuit model quantum information to adiabatic quantum evolutions, representing an important and broad-based success in applying functional analysis to the field of quantum information.
Quantum computing utilizes quantum mechanics to perform computations with superconducting qubits being the more mature technology as of writing in realizing a quantum computer. In this thesis, we describe an implementation of a Quantum Processor Unit (QPU), which is used to execute instructions in the form of microwave pulses on a superconducting qubit device through the use of signal generators and to perform qubit readout. We further extend the QPU as a platform to perform qubit characterization tasks such as spectroscopy and decoherence measurements in order to determine and optimize the working parameters to perform quantum gate operations. We also demonstrate the use of the QPU in performing qubit experiments such as Gauss Sum Factorization in determining the factors of an integer and the Bell Inequality test in examining the entanglement strength between a pair of qubits. We bridge the divide of quantum computation and qubit hardware in the compilation of quantum circuits into microwave pulse sequences for the QPU to execute. The process of compilation, as well as hardware limitations and pre-compilation optimization procedures are discussed. Finally, we show an example of executing a variational quantum algorithm and break down this example in all layers from the quantum circuit provided by the user to the pulse sequence that will be executed on the QPU.
High-fidelity control of superconducting qubits requires carefully shaped microwave pulses to avoid several different kinds of error at once. This article is a pedagogical bridging text aimed at upper-level undergraduate and early graduate students who have completed an introductory quantum mechanics course and a first course in quantum computing or quantum information, but who have not yet encountered the physical implementation of qubit gates. We integrate physical intuition for pulse design, analytical gate-level descriptions, and practical hardware considerations into a single, derivation-driven narrative, with explicit learning objectives. We begin with simple pulse envelopes and their spectral properties, showing how finite bandwidth produces leakage outside the computational subspace. This motivates the derivative removal by adiabatic gate (DRAG) technique, which we derive explicitly using the Magnus expansion, obtaining a clear, order-by-order account of which physical error channel appears at which order and why DRAG's cancellation is necessarily incomplete. We discuss the practical hardware realities of control pulse generation, focusing on arbitrary waveform generators (AWG), local oscillators (LO), and IQ mixing. Finally, we extend the discussion to two-qubit operation via the cross-resonance gate, and interpret how driving the control qubit at the target qubit's transition frequency necessarily produces several unwanted interaction terms alongside the desired one, and how successive generations of pulse-engineering strategies have been designed to suppress them.
This review aims to provide researchers, experimentalists, and quantum engineers with an updated and technically grounded perspective on the implementation of quantum gates in superconducting NISQ devices. The goal is to establish a comprehensive bridge between theoretical quantum circuit synthesis and its practical, experimental implementation, focusing on superconducting quantum technologies. We systematically examine the diverse landscape of superconducting qubits and processor architectures, ranging from conventional transmons to alternative and unconventional designs, evaluating their unique design trade-offs, connectivity constraints, device physics, and materials impact. Moving from theory to actual implementation, we detail how single- and two-qubit operations are synthesized via microwave-driven and flux-activated pulses. We here present our pulse engineering, wave shaping, calibration workflows, demonstrating how to bridge the gap between abstract gate models and real-world hardware limitations in the direction of a hardware-software co-design framework. To validate these operations, we choose benchmarking methodologies with the purpose to get the more efficient metric for the specific evaluation aspect, including truth tables and quantum process tomography. Therefore, we both discuss the theoretical concepts behind the gate synthesis and show experimental implementation of most fundamental gates by proposing a practical workflow.
The thesis investigates three challenges in superconducting quantum computing: efficient quantum gate compilation, scalable microwave interfacing of quantum processors (QPUs), and electrical annealing of Josephson junctions.The first part addresses an inefficiency in contemporary two-qubit gate compilation. Universal quantum computation requires only a single entangling two-qubit gate alongside single-qubit rotations, but this minimal gate set requires up to three additional two-qubit gates for every unsupported gate. I show how access to multiple inequivalent two-qubit gate classes overcomes this inefficiency. I experimentally realised an unsupported SWAP operation using one parametric CZ and one parametric iSWAP gate on a circuit-QED architecture. A Kraus-Cirac analysis shows that this combination belongs to the SWAP equivalency class, the fundamental reason for the reduction in two-qubit gates. The experiment demonstrates a rare case of simultaneous CZ and iSWAP support in the same quantum circuit, illustrating how access to multiple inequivalent gate classes can reduce compilation overhead on real hardware.The second part explores direct digital synthesis of microwave signals for interfacing with quantum processors. Conventional control uses heterodyne upconversion with IQ mixers, requiring compensation of LO leakage and IQ skew. I investigated a mixerless architecture based on high-speed DAC/ADC systems to generate and analyse the required microwave signals. CZ and iSWAP gate experiments subsequently verify that the platform is equivalent to conventional QPU setups.The third part investigates post-fabrication electrical tuning of Josephson junctions, in which voltage pulses modify junction resistance to correct fabrication-induced transmon-frequency variations. The speed of resistance change was found to depend exponentially on pulse amplitude. A novel stepwise protocol achieved a 270% resistance increase in an 11-month-old 11.5 kΩ junction, corresponding to a ~2 GHz reduction in transmon frequency, the largest reported selective resistance modification to date. Simulations show that resistance, charging-energy, and superconducting-gap uncertainties contribute equally to the uncertainty in the final qubit frequency. The results support a picture where electrical manipulation modifies the energy landscape, accelerating natural junction ageing.The thesis demonstrates that investigating gate-level compilation strategies, fully digital QPU control, and post-fabrication tuning, helps advance the understanding of how to approach scalable superconducting quantum processors.