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:2007.09019 · Physical Review A

Local gradient optimization of leakage-suppressing entangling sequences

A. A. Setser, J. P. Kestner

Published Jan 26, 2021• 1 citation
arXivHTMLPDF

Abstract

We use a gradient-based optimization scheme to find single-qubit rotations to be interwoven between time steps of a noisy logical two-qubit entangling gate in order to suppress the effects of arbitrary logical and leakage noise in the two-qubit gate. We show how the sequence fidelity is affected by imperfections in the single-qubit operations, as well as by various relative strengths of the logical and leakage noise. Our approach is completely general and system-independent, allowing for application to any two-qubit system regardless of the experimental implementation details.

DOI
10.1103/physreva.103.012609

Related papers

Local gradient optimization of modular entangling sequences

A. A. Setser, Michael H. Goerz, J. P. Kestner

Implementation of logical entangling gates is an important step towards realizing a quantum computer. We use a gradient-based optimization approach to find single-qubit rotations which can be interleaved between applications of a noisy nonlocal gate to dramatically suppress arbitrary logical errors, while steering the evolution operator towards the perfectly entangling subset of $\text{SU}(4)$ gates. The modularity of the approach allows for application to any two-qubit system, regardless of the Hamiltonian or details of the experimental implementation. This approach is effective for both quasistatic and time-dependent $1/{f}^{\ensuremath{\alpha}}$ noise. We also show how the fidelity of the final operation depends on both the fidelity of the local rotations and the noise strength.

arXiv:1804.08783•Physical Review A•Jun 26, 2018•2 citations

Suppressing leakage and maintaining robustness in transmon qubits: Signatures of a trade-off relation

Pablo M. Poggi, Anthony Kiely

We study the problem of optimally generating quantum gates in a logical subspace embedded in a larger Hilbert space, where the dynamics is also affected by unknown static imperfections. This general problem is widespread across various emergent quantum technology architectures. We derive the fidelity susceptibility in the computational subspace as a measure of robustness to perturbations, and define a cost function that quantifies leakage out of the subspace. We tackle both effects using a two-stage optimization where two cost functions are minimized in series. Specifically, we apply this framework to the generation of single-qubit gates in a superconducting transmon system, and find high-fidelity solutions robust to detuning and amplitude errors across various parameter regimes. We also show control pulses which maximize fidelity while minimizing leakage at all times during the evolution. However, finding control solutions that address both effects simultaneously is shown to be much more challenging, indicating the presence of a trade-off relation.

arXiv:2509.26247•Control Engineering Practice•Mar 5, 2026•0 citations

Optimally Band-Limited Noise Filtering for Single-Qubit Gates

Yasuo Oda, Dennis G. Lucarelli, Kevin Schultz +2 more

We introduce a quantum control protocol that produces smooth, experimentally implementable control sequences optimized to combat temporally correlated noise for single-qubit systems. The control ansatz is specifically chosen to be a functional expansion of discrete prolate spheroidal sequences, a discrete time basis known to be optimally concentrated in time and frequency, and quite attractive when faced with experimental control hardware constraints. We leverage the filter function formalism to transform the control problem into a filter design problem, and show that the frequency response of a quantum system can be carefully tailored to avoid the most relevant dynamical contributions of noise processes. Using gradient ascent, we obtain optimized filter functions and exploit them to elucidate important details about the relationship between filter function design, control bandwidth, and noise characteristics. In particular, we identify regimes of optimal noise suppression and, in turn, optimal control bandwidth directly proportional to the size of the frequency bands where the noise power is large. In addition to providing guiding principles for filter design, our approach enables the development of controls that simultaneously yield robust noise filtering and high-fidelity single-qubit logic operations in a wide variety of complex noise environments.

arXiv:2206.03504•Physical Review Applied•Jan 23, 2023•8 citations

Pulse sequences for suppressing leakage in single-qubit gate operations

Joydip Ghosh, S. N. Coppersmith, Mark G. Friesen

Many realizations of solid-state qubits involve couplings to leakage states lying outside the computational subspace, posing a threat to high-fidelity quantum gate operations. Mitigating leakage errors is especially challenging when the coupling strength is unknown, e.g., when it is caused by noise. Here we show that simple pulse sequences can be used to strongly suppress leakage errors for a qubit embedded in a three-level system. As an example, we apply our scheme to the recently proposed charge quadrupole (CQ) qubit for quantum dots. These results provide a solution to a key challenge for fault-tolerant quantum computing with solid-state elements.

arXiv:1612.00568•Physical review. B./Physical review. B•Jun 29, 2017•22 citations

Dynamically Correcting a CNOT Gate for any Systematic Logical Error

F. A. Calderon-Vargas, J. P. Kestner

We derive a set of composite pulse sequences that generates cnot gates and correct all systematic errors within the logical subspace to arbitrary order. These sequences are applicable for any two-qubit interaction Hamiltonian and make no assumptions about the underlying noise mechanism except that it is constant on the time scale of the operation. We do assume access to high-fidelity single-qubit gates, so single-qubit gate imperfections eventually limit the achievable fidelity. However, since single-qubit gates generally have much higher fidelities than two-qubit gates in practice, these pulse sequences offer useful dynamical correction for a wide range of coupled qubit systems.

arXiv:1607.04638•Physical Review Letters•Apr 10, 2017•27 citations

Quantum Circuit Optimization through Iteratively Pre-Conditioned Gradient Descent

Dhruv Srinivasan, Kushal Chakrabarti, Nikhil Chopra +1 more

Gate-based quantum algorithms are typically implemented by circuits consisting of many single-qubit and multi-qubit gates operating on a quantum input state, followed by measurements of the output state. For certain quantum subroutines, such as initial state preparation and quantum Fourier transforms, explicit decompositions of the circuit in terms of single-qubit and two-qubit maximally entangling gates may exist. However, they often lead to large-depth circuits that are challenging for noisy intermediate-scale quantum (NISQ) hardware. Additionally, exact decompositions might only exist for some modular quantum circuits. Therefore, it is essential to find gate combinations that approximate these circuits to high fidelity with potentially low depth. Gradient-based optimization has been used to find such approximate decompositions. Still, these traditional optimizers often run into problems of slow convergence requiring many iterations, and performing poorly in the presence of noise, a factor that is especially relevant for NISQ hardware. Here we present iteratively preconditioned gradient descent (IPG) for optimizing quantum circuits and demonstrate performance speedups for state preparation and implementation of quantum algorithmic subroutines. IPG is a noise-resilient, higher-order algorithm that has shown promising gains in convergence speed for classical optimizations, converging locally at a linear rate for convex problems and superlinearly when the solution is unique. Specifically, we show an improvement in fidelity by a factor of 104for preparing a 4-qubit W state and a maximally entangled 5-qubit GHZ state with compared to other commonly used classical optimizers tuning the same ansatz. Such faster convergence with promise for noise-resilience could provide advantages for quantum algorithms on NISQ hardware, especially since the cost of running each iteration on a quantum computer is substantially higher than the classical optimizer step.

arXiv:2309.09957•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•2 citations
We use a gradient-based optimization scheme to find single-qubit rotations to be interwoven between time steps of a noisy logical two-qubit entangling gate in order to suppress the effects of arbitrary logical and leakage noise in the two-qubit gate. We show how the sequence fidelity is affected by imperfections in the single-qubit operations, as well as by various relative strengths of the logical and leakage noise. Our approach is completely general and system-independent, allowing for application to any two-qubit system regardless of the experimental implementation details.
Implementation of logical entangling gates is an important step towards realizing a quantum computer. We use a gradient-based optimization approach to find single-qubit rotations which can be interleaved between applications of a noisy nonlocal gate to dramatically suppress arbitrary logical errors, while steering the evolution operator towards the perfectly entangling subset of SU(4)\text{SU}(4)SU(4) gates. The modularity of the approach allows for application to any two-qubit system, regardless of the Hamiltonian or details of the experimental implementation. This approach is effective for both quasistatic and time-dependent $1/{f}^{\ensuremath{\alpha}}$ noise. We also show how the fidelity of the final operation depends on both the fidelity of the local rotations and the noise strength.
We study the problem of optimally generating quantum gates in a logical subspace embedded in a larger Hilbert space, where the dynamics is also affected by unknown static imperfections. This general problem is widespread across various emergent quantum technology architectures. We derive the fidelity susceptibility in the computational subspace as a measure of robustness to perturbations, and define a cost function that quantifies leakage out of the subspace. We tackle both effects using a two-stage optimization where two cost functions are minimized in series. Specifically, we apply this framework to the generation of single-qubit gates in a superconducting transmon system, and find high-fidelity solutions robust to detuning and amplitude errors across various parameter regimes. We also show control pulses which maximize fidelity while minimizing leakage at all times during the evolution. However, finding control solutions that address both effects simultaneously is shown to be much more challenging, indicating the presence of a trade-off relation.
We introduce a quantum control protocol that produces smooth, experimentally implementable control sequences optimized to combat temporally correlated noise for single-qubit systems. The control ansatz is specifically chosen to be a functional expansion of discrete prolate spheroidal sequences, a discrete time basis known to be optimally concentrated in time and frequency, and quite attractive when faced with experimental control hardware constraints. We leverage the filter function formalism to transform the control problem into a filter design problem, and show that the frequency response of a quantum system can be carefully tailored to avoid the most relevant dynamical contributions of noise processes. Using gradient ascent, we obtain optimized filter functions and exploit them to elucidate important details about the relationship between filter function design, control bandwidth, and noise characteristics. In particular, we identify regimes of optimal noise suppression and, in turn, optimal control bandwidth directly proportional to the size of the frequency bands where the noise power is large. In addition to providing guiding principles for filter design, our approach enables the development of controls that simultaneously yield robust noise filtering and high-fidelity single-qubit logic operations in a wide variety of complex noise environments.
Many realizations of solid-state qubits involve couplings to leakage states lying outside the computational subspace, posing a threat to high-fidelity quantum gate operations. Mitigating leakage errors is especially challenging when the coupling strength is unknown, e.g., when it is caused by noise. Here we show that simple pulse sequences can be used to strongly suppress leakage errors for a qubit embedded in a three-level system. As an example, we apply our scheme to the recently proposed charge quadrupole (CQ) qubit for quantum dots. These results provide a solution to a key challenge for fault-tolerant quantum computing with solid-state elements.
We derive a set of composite pulse sequences that generates cnot gates and correct all systematic errors within the logical subspace to arbitrary order. These sequences are applicable for any two-qubit interaction Hamiltonian and make no assumptions about the underlying noise mechanism except that it is constant on the time scale of the operation. We do assume access to high-fidelity single-qubit gates, so single-qubit gate imperfections eventually limit the achievable fidelity. However, since single-qubit gates generally have much higher fidelities than two-qubit gates in practice, these pulse sequences offer useful dynamical correction for a wide range of coupled qubit systems.
Gate-based quantum algorithms are typically implemented by circuits consisting of many single-qubit and multi-qubit gates operating on a quantum input state, followed by measurements of the output state. For certain quantum subroutines, such as initial state preparation and quantum Fourier transforms, explicit decompositions of the circuit in terms of single-qubit and two-qubit maximally entangling gates may exist. However, they often lead to large-depth circuits that are challenging for noisy intermediate-scale quantum (NISQ) hardware. Additionally, exact decompositions might only exist for some modular quantum circuits. Therefore, it is essential to find gate combinations that approximate these circuits to high fidelity with potentially low depth. Gradient-based optimization has been used to find such approximate decompositions. Still, these traditional optimizers often run into problems of slow convergence requiring many iterations, and performing poorly in the presence of noise, a factor that is especially relevant for NISQ hardware. Here we present iteratively preconditioned gradient descent (IPG) for optimizing quantum circuits and demonstrate performance speedups for state preparation and implementation of quantum algorithmic subroutines. IPG is a noise-resilient, higher-order algorithm that has shown promising gains in convergence speed for classical optimizations, converging locally at a linear rate for convex problems and superlinearly when the solution is unique. Specifically, we show an improvement in fidelity by a factor of 104for preparing a 4-qubit W state and a maximally entangled 5-qubit GHZ state with compared to other commonly used classical optimizers tuning the same ansatz. Such faster convergence with promise for noise-resilience could provide advantages for quantum algorithms on NISQ hardware, especially since the cost of running each iteration on a quantum computer is substantially higher than the classical optimizer step.