Also known as gate optimization · unitary synthesis · entangling gates · two-qubit gates · qudit gates · qutrit · crosstalk
Gate synthesis designs the controls that make a quantum device implement a target unitary — a single-qubit
rotation, an entangling two-qubit gate, a multi-qubit or qudit operation — with an error small enough for
computation. The fault-tolerance threshold of the surface code is about 1% error per operation
[1], and practical overheads need errors well below it. Gate synthesis is the most common task in quantum optimal control and the main driver of
its methods.
The problem
Objective. The standard figure of merit compares the achieved evolution with the target, ignoring a global
phase, \(F = |\mathrm{Tr}(U_\mathrm{target}^\dagger U(T))|^2/d^2\) [2]. Average gate fidelities
follow from it [3, 4]. When the device has more levels than the
computational space, \(U(T)\) is projected onto that space, so population lost from it lowers \(F\). With dissipation,
the objective is defined on the dynamical map [5]. See Problem formulation & figures of merit.
Targets up to local operations. For entangling gates, often only the nonlocal part matters. Two-qubit gates up
to single-qubit operations form a tetrahedron (the Weyl chamber), and exactly half of the nonlocal gates are
perfect entanglers [6]. One can optimize for any perfect entangler rather than a specific gate
[7].
Existence and time.Controllability guarantees that a solution exists for long enough
times. Speed limits and Geometric & time-optimal control set how short it can be. Building blocks of
quantum algorithms can be synthesized directly, which can be faster than a decomposition into elementary gates
[8]. Globally optimal solutions can be certified with
QCPOP & polynomial optimization[9].
The errors control must handle
Leakage. Weakly anharmonic qubits such as transmons leak into higher levels when driven fast. DRAG removes
leakage and phase errors to leading order [10]. Leakage can be measured and suppressed
[11], and numerically optimized pulses reduce it further in fast gates [12].
Virtual \(Z\) gates, implemented as phase changes of later drives, correct rotation errors at no cost in time
[13]. See DRAG & leakage suppression.
Crosstalk. Crosstalk covers many physical effects that make an operation on some qubits depend on others. It
can be defined rigorously and detected operationally [14]. Control can address it: analytic
pulses drive simultaneous gates in frequency-crowded systems [15], an extra drive tone cancels
unwanted terms of the cross-resonance interaction [16], and coupler controls designed
beyond the dispersive approximation remove leakage to the coupler and parasitic \(ZZ\) terms [17].
Decoherence. Shorter gates lose less coherence, which is why time-optimal solutions matter. Open-system
optimization takes the loss into account directly; see Control of open quantum systems.
Superconducting qubits. The cross-resonance gate entangles fixed-frequency qubits with microwaves alone
[20]. Its fidelity rose above 99% once its full Hamiltonian was calibrated and the unwanted
terms cancelled [16]. Alternatives include parametrically activated gates
[21] and tunable couplers, which reached 99.76% for CZ and 99.87% for iSWAP [17].
See Superconducting circuits.
Trapped ions. The Mølmer–Sørensen gate works even with ions in thermal motion [22]. In
long chains, many motional modes take part, and optimally shaped, segmented pulses control the coupling to all of
them [23]. Laser-driven gates have reached 99.9% for two qubits and single-qubit errors of a few
\(10^{-5}\) [24, 25]. See Trapped ions.
Neutral atoms. The Rydberg blockade gives fast entangling gates [26]. A CZ gate driven by a
global laser pulse avoids single-site addressing [27]. Optimal control found time-optimal CZ and
CCZ pulses with only a few parameters [28]. Single-pulse gates of this kind reached 99.5%
fidelity on up to 60 atoms in parallel [29]. See Neutral atoms & Rydberg arrays.
Qudits. Using more than two levels per carrier, a trapped-ion processor achieved universal control of qudits
with up to seven levels [30].
Measuring success
Gate errors near \(10^{-4}\) cannot be resolved by process tomography, which is itself limited by state-preparation
and measurement errors. Randomized benchmarking measures the average error of long random sequences instead
[31, 32]. Gate set tomography gives a self-consistent model of all the
operations [33]. See System identification for control.
Limitations
An isolated gate’s fidelity is not its performance in a circuit. Crosstalk, spectator qubits, drift and
non-Markovian noise appear only in context.
Pulses that exploit fine details of a model can be fragile, so robustness has to be traded against speed.
Calibration drifts, and keeping many optimized pulses calibrated on a large device is an engineering problem in
its own right. See Pulse-level compilation.
Key papers
José P. Palao and Ronnie KosloffOptimal control theory for unitary transformationsPhys. Rev. A68, 062308 (2003)doi
Optimal control for unitary transformations — the phase-insensitive gate objective used ever since.
Jun Zhang, Jiri Vala, Shankar Sastry and K. Birgitta WhaleyGeometric theory of nonlocal two-qubit operationsPhys. Rev. A67, 042313 (2003)doi
The geometry of two-qubit gates up to local operations (the Weyl chamber) and a criterion for perfect entanglers.
F. Motzoi, J. M. Gambetta, P. Rebentrost and F. K. WilhelmSimple Pulses for Elimination of Leakage in Weakly Nonlinear QubitsPhys. Rev. Lett.103, 110501 (2009)doi
DRAG — pulse shaping that suppresses leakage and phase errors in weakly anharmonic qubits.
Klaus Mølmer and Anders SørensenMultiparticle Entanglement of Hot Trapped IonsPhys. Rev. Lett.82, 1835-1838 (1999)doi
The Mølmer–Sørensen gate, which entangles trapped ions without full control of their motion.
Sven Jandura and Guido PupilloTime-Optimal Two- and Three-Qubit Gates for Rydberg AtomsQuantum6, 712 (2022)doi
Time-optimal CZ and CCZ gates for Rydberg atoms, found by optimal control; the basis of later record-fidelity experiments.
J. Kelly, R. Barends, B. Campbell, Y. Chen, Z. Chen, et al.Optimal Quantum Control Using Randomized BenchmarkingPhys. Rev. Lett.112, 240504 (2014)doi
Closed-loop gate optimization with randomized benchmarking as the cost function.
References
R. Barends, J. Kelly, A. Megrant, A. Veitia, D. Sank, et al.Superconducting quantum circuits at the surface code threshold for fault toleranceNature508, 500-503 (2014)doi
José P. Palao and Ronnie KosloffOptimal control theory for unitary transformationsPhys. Rev. A68, 062308 (2003)doi
Michael A NielsenA simple formula for the average gate fidelity of a quantum dynamical operationPhysics Letters A303, 249-252 (2002)doi
Line Hjortshøj Pedersen, Niels Martin Møller and Klaus MølmerFidelity of quantum operationsPhysics Letters A367, 47-51 (2007)doi
Michael H Goerz, Daniel M Reich and Christiane P KochOptimal control theory for a unitary operation under dissipative evolutionNew J. Phys.16, 055012 (2014)doi
Jun Zhang, Jiri Vala, Shankar Sastry and K. Birgitta WhaleyGeometric theory of nonlocal two-qubit operationsPhys. Rev. A67, 042313 (2003)doi
Paul Watts, Jiří Vala, Matthias M. Müller, Tommaso Calarco, K. Birgitta Whaley, et al.Optimizing for an arbitrary perfect entangler. I. FunctionalsPhys. Rev. A91, 062306 (2015)doi
T. Schulte-Herbrüggen, A. Spörl, N. Khaneja and S. J. GlaserOptimal control-based efficient synthesis of building blocks of quantum algorithms: A perspective from network complexity towards time complexityPhys. Rev. A72, 042331 (2005)doi
Llorenç Balada Gaggioli, Denys I. Bondar, Jiri Vala, Roman Ovsiannikov and Jakub MarečekUnitary Gate Synthesis via Polynomial Optimizationpreprint (2025)arXiv:2508.01356
F. Motzoi, J. M. Gambetta, P. Rebentrost and F. K. WilhelmSimple Pulses for Elimination of Leakage in Weakly Nonlinear QubitsPhys. Rev. Lett.103, 110501 (2009)doi
Zijun Chen, Julian Kelly, Chris Quintana, R. Barends, B. Campbell, et al.Measuring and Suppressing Quantum State Leakage in a Superconducting QubitPhys. Rev. Lett.116, 020501 (2016)doi
M. Werninghaus, D. J. Egger, F. Roy, S. Machnes, F. K. Wilhelm and S. FilippLeakage reduction in fast superconducting qubit gates via optimal controlnpj Quantum Inf7, 14 (2021)doi
David C. McKay, Christopher J. Wood, Sarah Sheldon, Jerry M. Chow and Jay M. GambettaEfficient Z gates for quantum computingPhys. Rev. A96, 022330 (2017)doi
Mohan Sarovar, Timothy Proctor, Kenneth Rudinger, Kevin Young, Erik Nielsen and Robin Blume-KohoutDetecting crosstalk errors in quantum information processorsQuantum4, 321 (2020)doi
L. S. Theis, F. Motzoi and F. K. WilhelmSimultaneous gates in frequency-crowded multilevel systems using fast, robust, analytic control shapesPhys. Rev. A93, 012324 (2016)doi
Sarah Sheldon, Easwar Magesan, Jerry M. Chow and Jay M. GambettaProcedure for systematically tuning up cross-talk in the cross-resonance gatePhys. Rev. A93, 060302 (2016)doi
Youngkyu Sung, Leon Ding, Jochen Braumüller, Antti Vepsäläinen, Bharath Kannan, et al.Realization of High-Fidelity CZ and Z Z -Free iSWAP Gates with a Tunable CouplerPhys. Rev. X11, 021058 (2021)doi
J. Kelly, R. Barends, B. Campbell, Y. Chen, Z. Chen, et al.Optimal Quantum Control Using Randomized BenchmarkingPhys. Rev. Lett.112, 240504 (2014)doi
D. J. Egger and F. K. WilhelmAdaptive Hybrid Optimal Quantum Control for Imprecisely Characterized SystemsPhys. Rev. Lett.112, 240503 (2014)doi
Chad Rigetti and Michel DevoretFully microwave-tunable universal gates in superconducting qubits with linear couplings and fixed transition frequenciesPhys. Rev. B81, 134507 (2010)doi
Matthew Reagor, Christopher B. Osborn, Nikolas Tezak, Alexa Staley, Guenevere Prawiroatmodjo, et al.Demonstration of universal parametric entangling gates on a multi-qubit latticeSci. Adv.4, eaao3603 (2018)doi
Klaus Mølmer and Anders SørensenMultiparticle Entanglement of Hot Trapped IonsPhys. Rev. Lett.82, 1835-1838 (1999)doi
T. Choi, S. Debnath, T. A. Manning, C. Figgatt, Z.-X. Gong, et al.Optimal Quantum Control of Multimode Couplings between Trapped Ion Qubits for Scalable EntanglementPhys. Rev. Lett.112, 190502 (2014)doi
C. J. Ballance, T. P. Harty, N. M. Linke, M. A. Sepiol and D. M. LucasHigh-Fidelity Quantum Logic Gates Using Trapped-Ion Hyperfine QubitsPhys. Rev. Lett.117, 060504 (2016)doi
J. P. Gaebler, T. R. Tan, Y. Lin, Y. Wan, R. Bowler, et al.High-Fidelity Universal Gate Set for Be 9 + Ion QubitsPhys. Rev. Lett.117, 060505 (2016)doi
D. Jaksch, J. I. Cirac, P. Zoller, S. L. Rolston, R. Côté and M. D. LukinFast Quantum Gates for Neutral AtomsPhys. Rev. Lett.85, 2208-2211 (2000)doi
Harry Levine, Alexander Keesling, Giulia Semeghini, Ahmed Omran, Tout T. Wang, et al.Parallel Implementation of High-Fidelity Multiqubit Gates with Neutral AtomsPhys. Rev. Lett.123, 170503 (2019)doi
Sven Jandura and Guido PupilloTime-Optimal Two- and Three-Qubit Gates for Rydberg AtomsQuantum6, 712 (2022)doi
Simon J. Evered, Dolev Bluvstein, Marcin Kalinowski, Sepehr Ebadi, Tom Manovitz, et al.High-fidelity parallel entangling gates on a neutral-atom quantum computerNature622, 268-272 (2023)doi
Martin Ringbauer, Michael Meth, Lukas Postler, Roman Stricker, Rainer Blatt, et al.A universal qudit quantum processor with trapped ionsNat. Phys.18, 1053-1057 (2022)doi
E. Knill, D. Leibfried, R. Reichle, J. Britton, R. B. Blakestad, et al.Randomized benchmarking of quantum gatesPhys. Rev. A77, 012307 (2008)doi
Easwar Magesan, J. M. Gambetta and Joseph EmersonScalable and Robust Randomized Benchmarking of Quantum ProcessesPhys. Rev. Lett.106, 180504 (2011)doi
Robin Blume-Kohout, John King Gamble, Erik Nielsen, Kenneth Rudinger, Jonathan Mizrahi, et al.Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomographyNat Commun8, 14485 (2017)doi
Recent papers
923 tracked papers since 2000 are classified
under this topic. See all ·
Feed
Fault tolerant quantum computers greatly benefit from having both high fidelity entangling gates and a non-local qubit connectivity. However, most entangling gates for neutral atoms are local, requiring separated atoms to be moved using optical tweezers to yield entanglement between them. Here, we design a high fidelity Mølmer Sørensen-like entangling gate between neutral atoms coupled to a photonic cavity, enabling a programmable all-to-all connectivity through the shared cavity coupling. The gate is both robust to changes in cavity photon number, and enables selective entanglement between any subset of separated atoms through local laser addressing. This eliminates the need to physically move atoms to perform the gate, and therefore motional errors and erasure are suppressed. Using experimentally realistic parameters we demonstrate gate fidelities exceeding $F > 0.99$, with higher fidelities achievable through optimal control of the pump amplitudes.
The use of reinforcement learning (RL) in the design of quantum control strategies for pulse level control of NISQ era quantum devices is attracting growing interest. Model-free RL, not requiring preexisting knowledge of the physical system, acts as a black-box optimization tool well suited for noisy devices. In this work, we provide a simulation-based analysis of the performance of model-free RL for state preparation and qubit gate design in a challenging setup: indirect control of NV nuclear spins in a spin-bath. In particular, the spin-bath is modeled via the generalized cluster correlation expansion accounting for magnetic impurities and intra-bath interactions. We analyze the performance of the RL agents by performing simulations with minimally observable environments and noisy, sparse rewards as introduced in (Phys. Rev. X 12, 011059), and compare them to other state-of-the-art black-box optimization tools.
Preparing quantum states in bosonic qudits with SNAP--Displacement sequences requires both optimizing the gate parameters and deciding which Fock levels should be controlled by each SNAP gate. A fully parameterized ansatz assigns an independent phase to every Fock level in every gate, leading to a number of phases that grows steeply. This constitutes a problem for short to medium term systems as controlling many phases requires complex control pulses which are subject to increased control errors. Previous work reduced this cost by restricting the trainable phases to predefined sparse patterns, such as a diagonal or a grid, which however may not be optimal for a specific target state. In this work, we address this limitation by introducing a method that learns which phases are needed together with their values, using a differentiable mask. A sparsity penalty encourages the removal of unnecessary phases, while temperature annealing gradually turns the masks into binary decisions. We compare the proposed method with fully parameterized and predefined sparse ansatzes on Fourier and Haar-random target states. The evaluation considers both the minimum number of phases required to reach different infidelity thresholds and the overall trade-off between fidelity and phases required, measured through Pareto frontiers and hypervolume. The results show that learning the location of the phases together with their values provides competitive or improved fidelity--resource trade-offs, although the advantage depends on the target state and qudit dimension.
Encoding quantum information in $d$-dimensional systems (qudits) with $d>2$ offers appealing new directions for resource-efficient quantum computing. However, protecting the coherence of nonclassical qudit resource states remains an open challenge. Dynamical decoupling (DD) is a well-established technique for extending coherence, but its application to qudits is hindered by the quadratic scaling of the decoupling sequence overhead with the dimension $d$. As a result, demonstrations of qudit DD have so far been limited to low-dimensional qudits. Here, we show that noise-biased qudits enable a nontrivial reduction of this overhead, for example, from quadratic to linear. We perform qudit DD on a model $d=8$ qudit, the nuclear spin of an antimony donor in silicon. We benchmark DD performance on highly nonclassical states such as uniform superpositions, cat states, and Haar random states and measure coherence improvements up to a factor $5$ to $10$. For a spin-cat error correction code, continuous DD extends the coherence time of the logical superposition $|+\rangle_L$ to $225$~ms, compared to $19$~ms under free evolution and $85$~ms with a Hahn echo. This improvement shows that DD sequences tailored to a system's noise bias can significantly enhance the lifetime of encoded logical qubits.
Learning the Hamiltonian of a many-body system from its dynamics is a central task in quantum science, yet the algorithms with the strongest provable guarantees assume some level of quantum control--fast, arbitrary single-qubit gates interleaved with time evolution, and measurements in arbitrary bases--that is beyond the capabilities of near-term analog quantum simulators. Motivated by analog atom- and ion-based platforms, we study Hamiltonian learning under minimal access models. Uniform state preparation and measurements: We first consider the setting where in every experiment, one can rotate each qubit to the same state, perform short-time evolution, and measure every qubit in the same basis. Surprisingly, we show that for generic 2-local Hamiltonians on any interaction graph, all of the parameters can be reconstructed from such experiments. Computational basis state preparation and measurements: We then consider a similarly constrained setting, but where state preparation and measurement are restricted to the computational basis. For nearest-neighbor Hamiltonians with only Pauli $X/Z$ interactions, a class which captures contemporary Rydberg atom platforms, we show that over 1D and 2D rectangular lattices, all of the parameters can be reconstructed from such experiments up to unavoidable gauges. Our protocols introduce new techniques for solving structured polynomial systems over an extensive number of parameters. Taken together, our results suggest that one can learn a great deal from the dynamics of quantum many-body systems even under the most stringent experimental constraints.