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

Qutrit circuits and algebraic relations: A pathway to efficient spin-1 Hamiltonian simulation

Oluwadara Ogunkoya, Joonho Kim, Bo Peng, A. Barış Özgüler, Yuri Alexeev

Published Jan 22, 2024• 11 citations
arXivHTMLPDF

Abstract

Quantum information processing has witnessed significant advancements through the application of qubit-based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to $d$-dimensional quantum units or qudits has opened new avenues for improving computational efficiency. This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits due to increased complexity. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation, which may enable circuit compression and optimization. The paper introduces the turnover relation for the three-qutrit time propagator and its potential use in reducing circuit depth. We further investigate whether this relation can be generalized for higher-dimensional quantum circuits, including a focused study on the one-dimensional spin-1 Heisenberg model. Our paper outlines both rigorous and numerically efficient approaches to potentially achieve this generalization, providing a foundation for further explorations in the field of qudit-based quantum computing.

DOI
10.1103/physreva.109.012426

Related papers

Qutrit Circuits and Algebraic Relations: A Pathway to Efficient Spin-1 Hamiltonian Simulation

Oluwadara Ogunkoya, Joonho Kim, Bo Peng +2 more

Quantum information processing has witnessed significant advancements through the application of qubit- based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to d-dimensional quantum units or qudits has opened new avenues for improving computational efficiency. This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits due to increased complexity. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation, which may enable circuit compression and optimization. The paper introduces the turnover relation for the three-qutrit time propagator and its potential use in reducing circuit depth. We further investigate whether this relation can be generalized for higher-dimensional quantum circuits, including a focused study on the one-dimensional spin-1 Heisenberg model. Our paper outlines both rigorous and numerically efficient approaches to potentially achieve this generalization, providing a foundation for further explorations in the field of qudit-based quantum computing.

•Aug 5, 2024•0 citations

Asymptotic improvements to quantum circuits via qutrits

Pranav Gokhale, Jonathan M. Baker, Casey Duckering +3 more

Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qutrits. Past work with qutrits has demonstrated only constant factor improvements, owing to the log2(3) binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic depth (runtime) decomposition of the Generalized Toffoli gate using no ancilla-a significant improvement over linear depth for the best qubit-only equivalent. Our circuit construction also features a 70x improvement in two-qudit gate count over the qubit-only equivalent decomposition. This results in circuit cost reductions for important algorithms like quantum neurons and Grover search. We develop an open-source circuit simulator for qutrits, along with realistic near-term noise models which account for the cost of operating qutrits. Simulation results for these noise models indicate over 90% mean reliability (fidelity) for our circuit construction, versus under 30% for the qubit-only baseline. These results suggest that qutrits offer a promising path towards scaling quantum computation.

arXiv:1905.10481•Proceedings - International Symposium on Computer Architecture/Proceedings•Jun 14, 2019•140 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•14 citations

Quantum time dynamics employing the Yang-Baxter equation for circuit compression

Bo Peng, Sahil Gulania, Yuri Alexeev +1 more

Quantum time dynamics (QTD) is considered a promising problem for quantum supremacy on near-term quantum computers. However, QTD quantum circuits grow with increasing time simulations. This study focuses on simulating the time dynamics of one-dimensional (1D) integrable spin chains with nearest-neighbor interactions. We have proved the existence of a reflection symmetry in the quantum circuit employed for simulating the time evolution of certain classes of 1D Heisenberg model Hamiltonians by virtue of the quantum Yang-Baxter equation, and how this symmetry can be exploited to compress and produce a shallow quantum circuit. With this compression scheme, the depth of the quantum circuit becomes independent of step size and only depends on the number of spins. We show that the depth of the compressed circuit is rigorously a linear function of the system size for the studied Heisenberg model Hamiltonians in the present work. As a consequence, the number of CNOT gates in the compressed circuit only scales quadratically with the system size, which allows for the simulations of time dynamics of very large 1D spin chains. We derive the compressed circuit representations for different special cases of the Heisenberg Hamiltonian. We compare and demonstrate the effectiveness of this approach by performing simulations on quantum computers.

arXiv:2112.01690•Physical Review A•Jul 8, 2022•32 citations

Beyond Qubits: Qudits for Quantum Computing and Many-Body Simulation in Superconducting Circuits

Noah Goss

Quantum processors based on superconducting circuitry have reached the scale of hundreds of qubits and demonstrated computational capabilities that challenge state-of-the-art classical methods for carefully designed problems. Despite these advances, fundamental questions persist over how to best improve and scale the computational power of this emerging technology. Most transmon-based quantum processors encode information in two-level systems, or qubits, leaving the rich multilevel structure of the transmon largely unexploited. In this thesis, we demonstrate how the capabilities of these devices can be meaningfully extended by harnessing this intrinsic multilevel structure to encode qudits — d-level quantum systems that access a larger and more connected Hilbert space than their qubit counterparts. We begin by demonstrating universal single-qudit operation before turning to microwave-activated entanglement to realize scalable two-qudit gates. We present a high-fidelity, fully entangling two-qutrit CZ gate based on a novel tunable cross-Kerr mechanism. We further explore two-qudit gates that selectively entangle subspaces of the full Hilbert space via two-photon multipartite Raman transitions, employing these operations to generate large entangled states across a transmon array. To address the noisy nature of near-term qudit computation, we introduce and characterize error suppression techniques for qudit circuits, including dynamical decoupling and quantum error mitigation. We then synthesize these directions by exploring simulations of quantum systems that have innate multilevel interactions and are therefore well tailored to qudit operation. First we investigate digital quantum simulations of collective neutrino oscillations and the spin-1 truncated Abelian Higgs model, finding error mitigation methods critical for improving circuit performance. Finally, out of equilibrium --- or Floquet --- spin-1 systems are realized using an array of 15 superconducting qutrits to probe a novel Z3 discrete time crystalline (DTC) phase of matter with intrinsically chiral interactions. This DTC result demonstrates that native qudit hardware provides powerful access to non-equilibrium phases rooted in higher discrete symmetries, opening a route to a broader landscape of dynamical orders beyond the Z2 Ising paradigm.

•May 1, 2026•0 citations

Fixed Depth Hamiltonian Simulation via Cartan Decomposition

Efekan Kökcü, Thomas Steckmann, Yan Wang +3 more

Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize limited quantum resources remains an open problem. We tackle this problem by presenting a constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, which generates quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one-dimensional transverse field XY model, where O(n^{2})-gate circuits naturally emerge. Compared to product formulas with significantly larger gate counts, our algorithm drastically improves simulation precision. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.

arXiv:2104.00728•Physical Review Letters•Aug 9, 2022•79 citations
Quantum information processing has witnessed significant advancements through the application of qubit-based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to ddd-dimensional quantum units or qudits has opened new avenues for improving computational efficiency. This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits due to increased complexity. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation, which may enable circuit compression and optimization. The paper introduces the turnover relation for the three-qutrit time propagator and its potential use in reducing circuit depth. We further investigate whether this relation can be generalized for higher-dimensional quantum circuits, including a focused study on the one-dimensional spin-1 Heisenberg model. Our paper outlines both rigorous and numerically efficient approaches to potentially achieve this generalization, providing a foundation for further explorations in the field of qudit-based quantum computing.
Quantum information processing has witnessed significant advancements through the application of qubit- based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to d-dimensional quantum units or qudits has opened new avenues for improving computational efficiency. This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits due to increased complexity. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation, which may enable circuit compression and optimization. The paper introduces the turnover relation for the three-qutrit time propagator and its potential use in reducing circuit depth. We further investigate whether this relation can be generalized for higher-dimensional quantum circuits, including a focused study on the one-dimensional spin-1 Heisenberg model. Our paper outlines both rigorous and numerically efficient approaches to potentially achieve this generalization, providing a foundation for further explorations in the field of qudit-based quantum computing.
Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qutrits. Past work with qutrits has demonstrated only constant factor improvements, owing to the log2(3) binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic depth (runtime) decomposition of the Generalized Toffoli gate using no ancilla-a significant improvement over linear depth for the best qubit-only equivalent. Our circuit construction also features a 70x improvement in two-qudit gate count over the qubit-only equivalent decomposition. This results in circuit cost reductions for important algorithms like quantum neurons and Grover search. We develop an open-source circuit simulator for qutrits, along with realistic near-term noise models which account for the cost of operating qutrits. Simulation results for these noise models indicate over 90% mean reliability (fidelity) for our circuit construction, versus under 30% for the qubit-only baseline. These results suggest that qutrits offer a promising path towards scaling quantum computation.
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.
Quantum time dynamics (QTD) is considered a promising problem for quantum supremacy on near-term quantum computers. However, QTD quantum circuits grow with increasing time simulations. This study focuses on simulating the time dynamics of one-dimensional (1D) integrable spin chains with nearest-neighbor interactions. We have proved the existence of a reflection symmetry in the quantum circuit employed for simulating the time evolution of certain classes of 1D Heisenberg model Hamiltonians by virtue of the quantum Yang-Baxter equation, and how this symmetry can be exploited to compress and produce a shallow quantum circuit. With this compression scheme, the depth of the quantum circuit becomes independent of step size and only depends on the number of spins. We show that the depth of the compressed circuit is rigorously a linear function of the system size for the studied Heisenberg model Hamiltonians in the present work. As a consequence, the number of CNOT gates in the compressed circuit only scales quadratically with the system size, which allows for the simulations of time dynamics of very large 1D spin chains. We derive the compressed circuit representations for different special cases of the Heisenberg Hamiltonian. We compare and demonstrate the effectiveness of this approach by performing simulations on quantum computers.
Quantum processors based on superconducting circuitry have reached the scale of hundreds of qubits and demonstrated computational capabilities that challenge state-of-the-art classical methods for carefully designed problems. Despite these advances, fundamental questions persist over how to best improve and scale the computational power of this emerging technology. Most transmon-based quantum processors encode information in two-level systems, or qubits, leaving the rich multilevel structure of the transmon largely unexploited. In this thesis, we demonstrate how the capabilities of these devices can be meaningfully extended by harnessing this intrinsic multilevel structure to encode qudits — d-level quantum systems that access a larger and more connected Hilbert space than their qubit counterparts. We begin by demonstrating universal single-qudit operation before turning to microwave-activated entanglement to realize scalable two-qudit gates. We present a high-fidelity, fully entangling two-qutrit CZ gate based on a novel tunable cross-Kerr mechanism. We further explore two-qudit gates that selectively entangle subspaces of the full Hilbert space via two-photon multipartite Raman transitions, employing these operations to generate large entangled states across a transmon array. To address the noisy nature of near-term qudit computation, we introduce and characterize error suppression techniques for qudit circuits, including dynamical decoupling and quantum error mitigation. We then synthesize these directions by exploring simulations of quantum systems that have innate multilevel interactions and are therefore well tailored to qudit operation. First we investigate digital quantum simulations of collective neutrino oscillations and the spin-1 truncated Abelian Higgs model, finding error mitigation methods critical for improving circuit performance. Finally, out of equilibrium --- or Floquet --- spin-1 systems are realized using an array of 15 superconducting qutrits to probe a novel Z3 discrete time crystalline (DTC) phase of matter with intrinsically chiral interactions. This DTC result demonstrates that native qudit hardware provides powerful access to non-equilibrium phases rooted in higher discrete symmetries, opening a route to a broader landscape of dynamical orders beyond the Z2 Ising paradigm.
Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize limited quantum resources remains an open problem. We tackle this problem by presenting a constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, which generates quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one-dimensional transverse field XY model, where O(n^{2})-gate circuits naturally emerge. Compared to product formulas with significantly larger gate counts, our algorithm drastically improves simulation precision. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.