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

Qudit Gate Decomposition Dependence for Lattice Gauge Theories

Dog̃a Murat Kürkçüog̃lu, Henry Lamm, Andrea Maestri

Published Oct 21, 2024• 1 citation
arXivHTMLPDF

Abstract

In this work, we investigate the effect of decomposition basis on primitive qudit gates on superconducting radio-frequency cavity-based quantum computers with applications to lattice gauge theory. Three approaches are tested: SNAP & Displacement gates, ECD & single-qubit rotations $R(θ,ϕ)$, and optimal pulse control. For all three decompositions, implementing the necessary sequence of rotations concurrently rather then sequentially can reduce the primitive gate run time. The number of blocks required for the faster ECD & $R_p(θ)$ is found to scale $\mathcal{O}(d^2)$, while slower SNAP & Displacement set scales at worst $\mathcal{O}(d)$. For qudits with $d<10$, the resulting gate times for the decompositions is similar, but strongly-dependent on experimental design choices. Optimal control can outperforms both decompositions for small $d$ by a factor of 2-12 at the cost of higher classical resources. Lastly, we find that SNAP & Displacement are slightly more robust to a simplified noise model.

DOI
10.48550/arxiv.2410.16414

Related papers

Efficient, direct compilation of SU(N) operations into SNAP & Displacement gates

Joshua Job

We present a function which connects the parameter of a previously published short sequence of selective number-dependent arbitrary phase (SNAP) and displacement gates acting on a qudit encoded into the Fock states of a superconducting cavity, $V_k(α)=D(α)R_π(k)D(-2α)R_π(k)D(α)$ to the angle of the Givens rotation $G(θ)$ on levels $|k\rangle,|k+1\rangle$ that sequence approximates, namely $α=Φ(θ) = \fracθ{4\sqrt{k+1}}$. Previous publications left the determination of an appropriate $α$ to numerical optimization at compile time. The map $Φ$ gives us the ability to compile directly any $d$-dimensional unitary into a sequence of SNAP and displacement gates in $O(d^3)$ complex floating point operations with low constant prefactor, avoiding the need for numerical optimization. Numerical studies demonstrate that the infidelity of the generated gate sequence $V_k$ per Givens rotation $G$ scales as approximately $O(θ^6)$. We find numerically that the error on compiled circuits can be made arbitrarily small by breaking each rotation into $m$ $θ/m$ rotations, with the full $d\times d$ unitary infidelity scaling as approximately $O(m^{-4})$. This represents a significant reduction in the computational effort to compile qudit unitaries either to SNAP and displacement gates or to generate them via direct low-level pulse optimization via optimal control.

arXiv:2307.11900•Jul 21, 2023•1 citation

Non-Abelian dynamics on a cube: Improving quantum compilation through qudit-based simulations

Jacky Jiang, Natalie Klco, Olivia Di Matteo

Recent developments in mapping lattice gauge theories relevant to the Standard Model onto digital quantum computers identify scalable paths with well-defined quantum compilation challenges toward the continuum. As an entry point to these challenges, we address the simulation of SU(2) lattice gauge theory. Using qudit registers to encode the digitized gauge field, we provide quantum resource estimates, in terms of elementary qudit gates, for arbitrarily high local gauge field truncations. We then demonstrate an end-to-end simulation of real-time, qutrit-digitized SU(2) dynamics on a cube. Through optimizing the simulation, we improved circuit decompositions for uniformly controlled qudit rotations, an algorithmic primitive for general applications of quantum computing. The decompositions also apply to mixed-dimensional qudit systems, which we found advantageous for compiling lattice gauge theory simulations. Furthermore, we parallelize the evolution of opposite faces in anticipation of similar opportunities arising in three-dimensional lattice volumes. This work details an ambitious executable for future qudit hardware and attests to the value of codesign strategies between lattice gauge theory simulation and quantum compilation.

arXiv:2506.10945•Physical review. D/Physical review. D.•Sep 9, 2025•4 citations

Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits

Yujin Cho, Kristin M. Beck, Alessandro R. Castelli +4 more

Advanced simulations and calculations on quantum computers require high-fidelity implementations of quantum operations. The universal gateset approach builds complex unitaries from a small set of primitive gates, often resulting in a long gate sequence, which is typically a leading factor in the total accumulated error. Compiling a complex unitary for processors with higher-dimensional logical elements, such as qutrits, exacerbates the accumulated error per unitary, since an even longer gate sequence is required. Optimal control methods promise time- and resource-efficient compact gate sequences and, therefore, higher fidelity. These methods generate pulses that can directly implement any complex unitary on a quantum device. In this work, we demonstrate that any arbitrary qubit and qutrit gate can be realized with high fidelity, which can significantly reduce the length of a gate sequence. We generate and test pulses for a large set of randomly selected arbitrary unitaries on several quantum processing units (QPUs): the Lawrence Livermore National Laboratory Quantum Device and Integration Testbed's (QuDIT's) standard QPU and three of Rigetti's QPUs: Ankaa-2, Ankaa-9Q-1, and Aspen-M-3. On the QuDIT platform's standard QPU, the average fidelity of random qutrit gates is $97.9\ifmmode\pm\else\textpm\fi{}0.5\mathrm{%}$ measured with conventional QPT and $98.8\ifmmode\pm\else\textpm\fi{}0.6\mathrm{%}$ from QPT with gate folding. Rigetti's Ankaa-2 achieves random qubit gates with an average fidelity of $98.4\ifmmode\pm\else\textpm\fi{}0.5\mathrm{%}$ (conventional QPT) and $99.7\ifmmode\pm\else\textpm\fi{}0.1\mathrm{%}$ (QPT with gate folding). On Ankaa-9Q-1 and Aspen-M-3, the average fidelities with conventional qubit QPT measurements were higher than 99% (see Appendix). We show that optimal control gates are robust to drift for at least 3 h and that the same calibration parameters can be used for all implemented gates. Our work promises that the calibration overheads for optimal control gates can be made small enough to enable efficient quantum circuits based on this technique.

arXiv:2303.04261•Physical Review Applied•Sep 27, 2024•7 citations

Efficient cavity control with SNAP gates

Thomas Fösel, Stefan Krastanov, Florian Marquardt +1 more

Microwave cavities coupled to superconducting qubits have been demonstrated to be a promising platform for quantum information processing. A major challenge in this setup is to realize universal control over the cavity. A promising approach are selective number-dependent arbitrary phase (SNAP) gates combined with cavity displacements. It has been proven that this is a universal gate set, but a central question remained open so far: how can a given target operation be realized efficiently with a sequence of these operations. In this work, we present a practical scheme to address this problem. It involves a hierarchical strategy to insert new gates into a sequence, followed by a co-optimization of the control parameters, which generates short high-fidelity sequences. For a broad range of experimentally relevant applications, we find that they can be implemented with 3 to 4 SNAP gates, compared to up to 50 with previously known techniques.

arXiv:2004.14256•Apr 29, 2020•10 citations

Dynamics of qudit gates and effects of spectator modes on optimal control pulses

A. Barış Özgüler, Joshua Job

Qudit gates for high-dimensional quantum computing can be synthesized with high precision using numerical quantum optimal control techniques. Large circuits are broken down into modules and the tailored pulses for each module can be used as primitives for a qudit compiler. Application of the pulses of each module in the presence of extra modes may decrease their effectiveness due to crosstalk. In this paper, we address this problem by simulating qudit dynamics for circuit quantum electrodynamics systems. As a test case, we take pulses for single-qudit swap gates optimized in isolation and then apply them in the presence of spectator modes each of which are in Fock states. We provide an experimentally relevant scaling formula that can be used as a bound on the fidelity decay. Our results show that frequency shift from spectator mode populations has to be $\ensuremath{\lesssim}0.1%$ of the qudit's nonlinearity in order for high-fidelity single-qudit gates to be useful in the presence of occupied spectator modes.

arXiv:2207.14006•Physical Review A•May 1, 2024•4 citations

Efficient Qudit Circuit for Quench Dynamics of $2+1$D Quantum Link Electrodynamics

Rohan Joshi, M. Meth, Jan C. Louw +4 more

A major challenge in the burgeoning field of quantum simulation for high-energy physics is the realization of scalable $2+1$D lattice gauge theories on state-of-the-art quantum hardware, which is an essential step towards the overarching goal of probing $3+1$D quantum chromodynamics on a quantum computer. Despite great progress, current experimental implementations of $2+1$D lattice gauge theories are mostly restricted to relatively small system sizes and two-level representations of the gauge and electric fields. Here, we propose a resource-efficient method for quantum simulating $2+1$D spin-$S$ $\mathrm{U}(1)$ quantum link lattice gauge theories with dynamical matter using qudit-based quantum processors. By integrating out the matter fields through Gauss's law, we reformulate the quantum link model in a purely spin picture compatible with qudit encoding across arbitrary spatial dimensions, eliminating the need for ancillary qubits and reducing resource overhead. Focusing first on the spin-$1/2$ case, we construct explicit circuits for the full Hamiltonian and demonstrate through numerical simulations that the first-order Trotterized circuits accurately capture the quench dynamics even in the presence of realistic noise levels. Additionally, we introduce a general method for constructing coupling-term circuits for higher-spin representations $S>1/2$. Compared to conventional qubit encodings, our framework significantly reduces the number of quantum resources and gate count. Our approach significantly enhances scalability and fidelity for probing nonequilibrium phenomena in higher-dimensional lattice gauge theories, and is readily amenable to implementation on state-of-the-art qudit platforms.

arXiv:2507.12589•Jul 16, 2025•0 citations
In this work, we investigate the effect of decomposition basis on primitive qudit gates on superconducting radio-frequency cavity-based quantum computers with applications to lattice gauge theory. Three approaches are tested: SNAP & Displacement gates, ECD & single-qubit rotations R(θ,ϕ)R(θ,ϕ)R(θ,ϕ), and optimal pulse control. For all three decompositions, implementing the necessary sequence of rotations concurrently rather then sequentially can reduce the primitive gate run time. The number of blocks required for the faster ECD & Rp(θ)R_p(θ)Rp​(θ) is found to scale O(d2)\mathcal{O}(d^2)O(d2), while slower SNAP & Displacement set scales at worst O(d)\mathcal{O}(d)O(d). For qudits with d<10d<10d<10, the resulting gate times for the decompositions is similar, but strongly-dependent on experimental design choices. Optimal control can outperforms both decompositions for small ddd by a factor of 2-12 at the cost of higher classical resources. Lastly, we find that SNAP & Displacement are slightly more robust to a simplified noise model.
We present a function which connects the parameter of a previously published short sequence of selective number-dependent arbitrary phase (SNAP) and displacement gates acting on a qudit encoded into the Fock states of a superconducting cavity, Vk(α)=D(α)Rπ(k)D(−2α)Rπ(k)D(α)V_k(α)=D(α)R_π(k)D(-2α)R_π(k)D(α)Vk​(α)=D(α)Rπ​(k)D(−2α)Rπ​(k)D(α) to the angle of the Givens rotation G(θ)G(θ)G(θ) on levels ∣k⟩,∣k+1⟩|k\rangle,|k+1\rangle∣k⟩,∣k+1⟩ that sequence approximates, namely α=Φ(θ)=θ4k+1α=Φ(θ) = \fracθ{4\sqrt{k+1}}α=Φ(θ)=4k+1​θ​. Previous publications left the determination of an appropriate ααα to numerical optimization at compile time. The map ΦΦΦ gives us the ability to compile directly any ddd-dimensional unitary into a sequence of SNAP and displacement gates in O(d3)O(d^3)O(d3) complex floating point operations with low constant prefactor, avoiding the need for numerical optimization. Numerical studies demonstrate that the infidelity of the generated gate sequence VkV_kVk​ per Givens rotation GGG scales as approximately O(θ6)O(θ^6)O(θ6). We find numerically that the error on compiled circuits can be made arbitrarily small by breaking each rotation into mmm θ/mθ/mθ/m rotations, with the full d×dd\times dd×d unitary infidelity scaling as approximately O(m−4)O(m^{-4})O(m−4). This represents a significant reduction in the computational effort to compile qudit unitaries either to SNAP and displacement gates or to generate them via direct low-level pulse optimization via optimal control.
Recent developments in mapping lattice gauge theories relevant to the Standard Model onto digital quantum computers identify scalable paths with well-defined quantum compilation challenges toward the continuum. As an entry point to these challenges, we address the simulation of SU(2) lattice gauge theory. Using qudit registers to encode the digitized gauge field, we provide quantum resource estimates, in terms of elementary qudit gates, for arbitrarily high local gauge field truncations. We then demonstrate an end-to-end simulation of real-time, qutrit-digitized SU(2) dynamics on a cube. Through optimizing the simulation, we improved circuit decompositions for uniformly controlled qudit rotations, an algorithmic primitive for general applications of quantum computing. The decompositions also apply to mixed-dimensional qudit systems, which we found advantageous for compiling lattice gauge theory simulations. Furthermore, we parallelize the evolution of opposite faces in anticipation of similar opportunities arising in three-dimensional lattice volumes. This work details an ambitious executable for future qudit hardware and attests to the value of codesign strategies between lattice gauge theory simulation and quantum compilation.
Advanced simulations and calculations on quantum computers require high-fidelity implementations of quantum operations. The universal gateset approach builds complex unitaries from a small set of primitive gates, often resulting in a long gate sequence, which is typically a leading factor in the total accumulated error. Compiling a complex unitary for processors with higher-dimensional logical elements, such as qutrits, exacerbates the accumulated error per unitary, since an even longer gate sequence is required. Optimal control methods promise time- and resource-efficient compact gate sequences and, therefore, higher fidelity. These methods generate pulses that can directly implement any complex unitary on a quantum device. In this work, we demonstrate that any arbitrary qubit and qutrit gate can be realized with high fidelity, which can significantly reduce the length of a gate sequence. We generate and test pulses for a large set of randomly selected arbitrary unitaries on several quantum processing units (QPUs): the Lawrence Livermore National Laboratory Quantum Device and Integration Testbed's (QuDIT's) standard QPU and three of Rigetti's QPUs: Ankaa-2, Ankaa-9Q-1, and Aspen-M-3. On the QuDIT platform's standard QPU, the average fidelity of random qutrit gates is $97.9\ifmmode\pm\else\textpm\fi{}0.5\mathrm{%}$ measured with conventional QPT and $98.8\ifmmode\pm\else\textpm\fi{}0.6\mathrm{%}$ from QPT with gate folding. Rigetti's Ankaa-2 achieves random qubit gates with an average fidelity of $98.4\ifmmode\pm\else\textpm\fi{}0.5\mathrm{%}$ (conventional QPT) and $99.7\ifmmode\pm\else\textpm\fi{}0.1\mathrm{%}$ (QPT with gate folding). On Ankaa-9Q-1 and Aspen-M-3, the average fidelities with conventional qubit QPT measurements were higher than 99% (see Appendix). We show that optimal control gates are robust to drift for at least 3 h and that the same calibration parameters can be used for all implemented gates. Our work promises that the calibration overheads for optimal control gates can be made small enough to enable efficient quantum circuits based on this technique.
Microwave cavities coupled to superconducting qubits have been demonstrated to be a promising platform for quantum information processing. A major challenge in this setup is to realize universal control over the cavity. A promising approach are selective number-dependent arbitrary phase (SNAP) gates combined with cavity displacements. It has been proven that this is a universal gate set, but a central question remained open so far: how can a given target operation be realized efficiently with a sequence of these operations. In this work, we present a practical scheme to address this problem. It involves a hierarchical strategy to insert new gates into a sequence, followed by a co-optimization of the control parameters, which generates short high-fidelity sequences. For a broad range of experimentally relevant applications, we find that they can be implemented with 3 to 4 SNAP gates, compared to up to 50 with previously known techniques.
Qudit gates for high-dimensional quantum computing can be synthesized with high precision using numerical quantum optimal control techniques. Large circuits are broken down into modules and the tailored pulses for each module can be used as primitives for a qudit compiler. Application of the pulses of each module in the presence of extra modes may decrease their effectiveness due to crosstalk. In this paper, we address this problem by simulating qudit dynamics for circuit quantum electrodynamics systems. As a test case, we take pulses for single-qudit swap gates optimized in isolation and then apply them in the presence of spectator modes each of which are in Fock states. We provide an experimentally relevant scaling formula that can be used as a bound on the fidelity decay. Our results show that frequency shift from spectator mode populations has to be $\ensuremath{\lesssim}0.1%$ of the qudit's nonlinearity in order for high-fidelity single-qudit gates to be useful in the presence of occupied spectator modes.
Efficient Qudit Circuit for Quench Dynamics of 2+12+12+1D Quantum Link Electrodynamics
A major challenge in the burgeoning field of quantum simulation for high-energy physics is the realization of scalable 2+12+12+1D lattice gauge theories on state-of-the-art quantum hardware, which is an essential step towards the overarching goal of probing 3+13+13+1D quantum chromodynamics on a quantum computer. Despite great progress, current experimental implementations of 2+12+12+1D lattice gauge theories are mostly restricted to relatively small system sizes and two-level representations of the gauge and electric fields. Here, we propose a resource-efficient method for quantum simulating 2+12+12+1D spin-SSS U(1)\mathrm{U}(1)U(1) quantum link lattice gauge theories with dynamical matter using qudit-based quantum processors. By integrating out the matter fields through Gauss's law, we reformulate the quantum link model in a purely spin picture compatible with qudit encoding across arbitrary spatial dimensions, eliminating the need for ancillary qubits and reducing resource overhead. Focusing first on the spin-1/21/21/2 case, we construct explicit circuits for the full Hamiltonian and demonstrate through numerical simulations that the first-order Trotterized circuits accurately capture the quench dynamics even in the presence of realistic noise levels. Additionally, we introduce a general method for constructing coupling-term circuits for higher-spin representations S>1/2S>1/2S>1/2. Compared to conventional qubit encodings, our framework significantly reduces the number of quantum resources and gate count. Our approach significantly enhances scalability and fidelity for probing nonequilibrium phenomena in higher-dimensional lattice gauge theories, and is readily amenable to implementation on state-of-the-art qudit platforms.