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

Exploiting the Weyl-Chamber Structure for Hardware-Aware Quantum Circuit Compression

Neel Misciasci, Isabel Nha Minh Le, Christian B. Mendl

quant-phSubmitted Oct 23, 2026• Announced Oct 26, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum circuit compression based on tensor networks enables long-time simulation of quantum many-body dynamics on near-term hardware. While Riemannian optimization has been successfully employed for this purpose, it typically optimizes over the manifold of generic two-qubit unitaries. Consequently, the resulting gates must still be synthesized into the hardware's native gate set via KAK decomposition, an overhead that partially negates the original compression gain. We show that Riemannian-optimized gates already exhibit a predictable Weyl structure: near-$R_{ZZ}$ for the Ising model and near-fSim for the Heisenberg XXZ model. Building on this insight, we investigate whether parameterized optimization directly over the native gate set can offer a beneficial trade-off between expressivity and circuit efficiency by reducing the circuit's dimensionality. When comparing the two approaches, we find that the small residual Weyl parameters neglected by the latter are essential for high compression of the Ising propagator, whereas for the Heisenberg propagator, the native XXZ structure can be exploited directly to build a more efficient compressed circuit.

AI Summary

The paper asks whether optimizing compressed time-evolution circuits directly in a hardware-native gate family improves accuracy at fixed native entangling depth compared with optimizing generic two-qubit unitaries and then synthesizing them. It compares these approaches numerically for nonintegrable Ising and transverse-field XXZ chains of $N=50$ qubits with open boundaries. Both methods use matrix-product-operator contractions to evaluate gradients against a reference propagator. The baseline uses Riemannian optimization over generic two-qubit unitaries; the hardware-aware method optimizes native $R_{ZZ}$ or fSim parameters while retaining Riemannian updates for single-qubit gates. KAK analysis finds that optimized Ising gates lie near the $R_{ZZ}$ family, while XXZ gates lie near an fSim-like family. Comparisons account for synthesis into three $R_{ZZ}$ gates or an fSim plus an $R_{ZZ}$ gate, respectively. For Ising, native optimization provides little improvement over its Trotter initialization, and generic-unitary optimization generally wins beyond approximately 26 native layers. The paper attributes this to small residual Weyl coordinates omitted by the native ansatz. For XXZ, native optimization achieves roughly half an order of magnitude lower loss through approximately 35 layers, attributed to better initialization and sufficient fSim expressivity. At five Ising Trotter repetitions, parameter counts are 1044 versus 4050. The native method nevertheless incurs additional tensor contractions. Its deeper-circuit training becomes harder, and the mechanisms behind optimization plateaus remain unresolved. The comparison is limited to these models and tested regimes; conserved-quantity-sensitive simulations and fermionic systems are left for future work.

Little sign of AI-generated textIncrementalUnclear noveltyUnclear writing

Central claim may not hold: The claim that residual Ising Weyl coordinates are essential is stronger than the evidence, which compares particular circuit layouts, initializations, and optimization procedures without isolating necessity. The Ising reference's stated cost of 603 R_ZZ gates is a layer count under the described synthesis, corresponding to 14,775 gates on the 50-qubit chain. The Weyl-chamber description excludes some SU(4) local-equivalence classes and incorrectly confines the entire fSim family to the ordered face alpha_x=alpha_y. The written open-chain Heisenberg RO initialization assigns only half the target transverse field to each endpoint, with no stated correction or evidence establishing whether this also affected the implementation.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
15 pages, 7 figures

Related papers

Riemannian quantum circuit optimization for Hamiltonian simulation

Ayse Kotil, Rahul Banerjee, Qunsheng Huang +1 more

Abstract Hamiltonian simulation, i.e. simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful approximation can lead to relatively deep circuits. Here we start from the insight that for translation invariant systems, the gates in such circuit topologies can be further optimized on classical computers to decrease the circuit depth and/or increase the accuracy. We employ tensor network techniques and devise a method based on the Riemannian trust-region algorithm on the unitary matrix manifold for this purpose. For the Ising and Heisenberg models on a one-dimensional lattice, we achieve orders of magnitude accuracy improvements compared to fourth-order splitting methods. The optimized circuits could also be of practical use for the time-evolving block decimation algorithm.

arXiv:2212.07556•Journal of Physics A Mathematical and Theoretical•Feb 27, 2024•18 citations

Low-depth simulations of fermionic systems on square-grid quantum hardware

Manuel G. Algaba, P. V. Sriluckshmy, Martin Leib +1 more

We present a general strategy for mapping fermionic systems to quantum hardware with square qubit connectivity which yields low-depth quantum circuits, counted in the number of native two-qubit fSIM gates. We achieve this by leveraging novel operator decomposition and circuit compression techniques paired with specifically chosen low-depth fermion-to-qubit mappings and allow for a high degree of gate cancellations and parallelism. Our mappings retain the flexibility to simultaneously optimize for qubit counts or qubit operator weights and can be used to investigate arbitrary fermionic lattice geometries. We showcase our approach by investigating the tight-binding model, the Fermi-Hubbard model as well as the multi-orbital Hubbard-Kanamori model. We report unprecedentedly low circuit depths per single Trotter layer with up to a 70% improvement upon previous state-of-the-art. Our compression technique also results in significant reduction of two-qubit gates. We find the lowest gate-counts when applying the XYZ-formalism to the DK mapping. Additionally, we show that our decomposition and compression formalism produces favourable circuits even when no native parameterized two-qubit gates are available.

arXiv:2302.01862•Quantum•Apr 30, 2024•25 citations

Efficient quantum circuit compilation for near-term quantum advantage

Yuchen Guo, Shuo Yang

Quantum noise in real-world devices poses a significant challenge in achieving practical quantum advantage, since accurately compiled and executed circuits are typically deep and highly susceptible to decoherence. To facilitate the implementation of complex quantum algorithms on noisy hardware, we propose an approximate method for compiling target quantum circuits into brick-wall layouts. This new circuit design consists of two-qubit CNOT gates that can be directly implemented on real quantum computers, in conjunction with optimized one-qubit gates, to approximate the essential dynamics of the original circuit while significantly reducing its depth. Our approach is evaluated through numerical simulations of time-evolution circuits for the critical Ising model, quantum Fourier transformation, and Haar-random quantum circuits, as well as experiments on IBM quantum platforms. By accounting for compilation error and circuit noise, we demonstrate that time evolution and quantum Fourier transformation circuits achieve high compression rates, while random quantum circuits are less compressible. The degree of compression is related to the rate of entanglement accumulation in the target circuit. In particular, experiments on IBM platforms achieve a compression rate of 12.5 for $N=12$ , significantly extending the application of current quantum devices. Furthermore, large-scale numerical simulations for system sizes up to $N=30$ reveal that the optimal depth $d_{\mathrm{max}}$ to achieve maximal overall fidelity is independent of system size N, suggesting the scalability of our method for large quantum devices in terms of quantum resources.

arXiv:2501.07387•EPJ Quantum Technology•Jun 10, 2025•19 citations

Hardware-Efficient Hamiltonian Simulation via Trotter-Initialized Variational Optimization with Native Placement

F. S. Luiz, P. N. Ferreira, M. C. de Oliveira

Compiling time-evolution operators of the form $U(t)=e^{-iHt}$ into hardware-native gate sequences is a central bottleneck for digital quantum simulation on noisy intermediate-scale quantum (NISQ) devices. Generic transpilation treats $U(t)$ as an arbitrary unitary, discarding the structure of Hamiltonian dynamics and producing circuits whose depth exceeds hardware coherence limits. We introduce a structure-aware compilation framework that treats product-formula decompositions as synthesis primitives rather than simulation approximations. The method combines (i) native placement of Hamiltonian terms onto the hardware coupling map, (ii) adaptive selection of Trotter blocks via a greedy discretization procedure, and (iii) variational refinement using a Trotter-initialized ansatz. Across Heisenberg, Ising, and XY models with $n=3$--$8$ qubits, the compiled circuits achieve fidelities $F>0.996$ with approximately linear scaling in the number of entangling gates, while generic synthesis produces circuits that are orders of magnitude deeper. On IBM Torino hardware, we observe a regime in which shorter approximate circuits outperform deeper exact decompositions: a 27-CX circuit achieves higher hardware fidelity ($F_{\mathrm{hw}}=0.987$) than a 187-CX exact circuit. These results demonstrate that, in the NISQ regime, structure-aware approximate compilation can outperform exact structure-agnostic synthesis, providing a practical pathway for executing Hamiltonian dynamics without requiring pulse-level control.

quant-pharXiv:2604.26663•Advanced Quantum Technologies•Apr 30, 2026•1 citation

Decomposition of multi-qutrit gates generated by Weyl-Heisenberg strings

Daniele Trisciani, Marco Cattaneo, Zoltán Zimborás

Decomposing unitary operations into native gates is an essential step for implementing quantum algorithms. For qubit-based devices, where native gates are typically single- and two-qubit operations, a range of decomposition techniques have been developed. In particular, efficient algorithms exist for decomposing exponentials of Pauli strings while taking hardware topology in account. Motivated by the growing interest in qutrit-based quantum computing, we develop analogous decomposition methods for qutrit systems. Specifically, we introduce an algorithm that decomposes the exponential of an arbitrary tensor product of Weyl-Heisenberg operators (plus their Hermitian conjugation) into single- and two-qutrit gates. We further extend this approach to unitaries generated by Gell-Mann string (i.e., a tensor product of Gell-Mann matrices). Since both Gell-Mann matrices and Weyl-Heisenberg operators form (together with identity) complete operator bases of qutrit operators, we can use this result also to decompose any multi-qutrit gate that is diagonal up to single-qutrit rotations. As a practical application, we use our method to decompose the layers of the quantum approximate optimization algorithm for qutrit-based implementations of the graph k-coloring problem. For values of $k$ well-suited to qutrit architectures (e.g., $k=3$ or in general $k=3^n$), our approach yields significantly shallower circuits compared to qubit-based implementations, an advantage that grows with problem size, while also requiring a smaller total Hilbert space dimension. Finally, we also address the routing challenge in qutrit architectures that arises due to the limited connectivity of the devices. In particular, we generalize the Steiner-Gauss method, originally developed to reduce CNOT counts in qubit circuit, to optimize gate routing in qutrit-based systems.

arXiv:2507.09781•Jul 13, 2025•3 citations

Lie Group Diffusion Models for Hardware-Aware Quantum Circuit Synthesis

Jyotirmai Singh

An important task in quantum computing is unitary circuit synthesis compatible with physical hardware constraints. This problem has a natural hybrid structure as local single-qubit gates are continuous variables on the Lie group $SU(2)$ while the entangling circuit structure is discrete and hardware-dependent. In this work, we use generative models to perform quantum circuit synthesis incorporating both the natural $SU(2)$ manifold geometry of quantum gates and hardware constraints that determine the overall circuit structure. Our model comprises two components: a circuit skeleton selector that chooses an entangling circuit and a diffusion model that generates quantum gates on the given circuit template by performing diffusion on the curved manifold $\mathrm{SU(2)} \simeq S^3$ itself. We demonstrate this approach with unitary compilation of physically motivated three-qubit Hamiltonian simulation targets such as the Transverse Field Ising Model and the Heisenberg-XXZ Model and show that Lie group diffusion outperforms comparable baselines. The synthesised circuits can also be customised subject to constraints, which we demonstrate by producing circuits with large and small gate rotation angles for the same target unitary evolution. We also investigate the fidelity-complexity frontier of the synthesised gates to demonstrate that the circuit selector learns to select circuits that balance fidelity with complexity rather than collapsing onto the most expansive entangling template. These results demonstrate that Lie group diffusion provides a natural generative framework for hardware-aware quantum circuit synthesis.

quant-pharXiv:2606.29636•Jun 30, 2026•1 citation
Quantum circuit compression based on tensor networks enables long-time simulation of quantum many-body dynamics on near-term hardware. While Riemannian optimization has been successfully employed for this purpose, it typically optimizes over the manifold of generic two-qubit unitaries. Consequently, the resulting gates must still be synthesized into the hardware's native gate set via KAK decomposition, an overhead that partially negates the original compression gain. We show that Riemannian-optimized gates already exhibit a predictable Weyl structure: near-RZZR_{ZZ}RZZ​ for the Ising model and near-fSim for the Heisenberg XXZ model. Building on this insight, we investigate whether parameterized optimization directly over the native gate set can offer a beneficial trade-off between expressivity and circuit efficiency by reducing the circuit's dimensionality. When comparing the two approaches, we find that the small residual Weyl parameters neglected by the latter are essential for high compression of the Ising propagator, whereas for the Heisenberg propagator, the native XXZ structure can be exploited directly to build a more efficient compressed circuit.
The paper asks whether optimizing compressed time-evolution circuits directly in a hardware-native gate family improves accuracy at fixed native entangling depth compared with optimizing generic two-qubit unitaries and then synthesizing them. It compares these approaches numerically for nonintegrable Ising and transverse-field XXZ chains of N=50N=50N=50 qubits with open boundaries.
Both methods use matrix-product-operator contractions to evaluate gradients against a reference propagator. The baseline uses Riemannian optimization over generic two-qubit unitaries; the hardware-aware method optimizes native RZZR_{ZZ}RZZ​ or fSim parameters while retaining Riemannian updates for single-qubit gates. KAK analysis finds that optimized Ising gates lie near the RZZR_{ZZ}RZZ​ family, while XXZ gates lie near an fSim-like family. Comparisons account for synthesis into three RZZR_{ZZ}RZZ​ gates or an fSim plus an RZZR_{ZZ}RZZ​ gate, respectively.
For Ising, native optimization provides little improvement over its Trotter initialization, and generic-unitary optimization generally wins beyond approximately 26 native layers. The paper attributes this to small residual Weyl coordinates omitted by the native ansatz. For XXZ, native optimization achieves roughly half an order of magnitude lower loss through approximately 35 layers, attributed to better initialization and sufficient fSim expressivity. At five Ising Trotter repetitions, parameter counts are 1044 versus 4050.
The native method nevertheless incurs additional tensor contractions. Its deeper-circuit training becomes harder, and the mechanisms behind optimization plateaus remain unresolved. The comparison is limited to these models and tested regimes; conserved-quantity-sensitive simulations and fermionic systems are left for future work.
Abstract Hamiltonian simulation, i.e. simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful approximation can lead to relatively deep circuits. Here we start from the insight that for translation invariant systems, the gates in such circuit topologies can be further optimized on classical computers to decrease the circuit depth and/or increase the accuracy. We employ tensor network techniques and devise a method based on the Riemannian trust-region algorithm on the unitary matrix manifold for this purpose. For the Ising and Heisenberg models on a one-dimensional lattice, we achieve orders of magnitude accuracy improvements compared to fourth-order splitting methods. The optimized circuits could also be of practical use for the time-evolving block decimation algorithm.
We present a general strategy for mapping fermionic systems to quantum hardware with square qubit connectivity which yields low-depth quantum circuits, counted in the number of native two-qubit fSIM gates. We achieve this by leveraging novel operator decomposition and circuit compression techniques paired with specifically chosen low-depth fermion-to-qubit mappings and allow for a high degree of gate cancellations and parallelism. Our mappings retain the flexibility to simultaneously optimize for qubit counts or qubit operator weights and can be used to investigate arbitrary fermionic lattice geometries. We showcase our approach by investigating the tight-binding model, the Fermi-Hubbard model as well as the multi-orbital Hubbard-Kanamori model. We report unprecedentedly low circuit depths per single Trotter layer with up to a 70% improvement upon previous state-of-the-art. Our compression technique also results in significant reduction of two-qubit gates. We find the lowest gate-counts when applying the XYZ-formalism to the DK mapping. Additionally, we show that our decomposition and compression formalism produces favourable circuits even when no native parameterized two-qubit gates are available.
Quantum noise in real-world devices poses a significant challenge in achieving practical quantum advantage, since accurately compiled and executed circuits are typically deep and highly susceptible to decoherence. To facilitate the implementation of complex quantum algorithms on noisy hardware, we propose an approximate method for compiling target quantum circuits into brick-wall layouts. This new circuit design consists of two-qubit CNOT gates that can be directly implemented on real quantum computers, in conjunction with optimized one-qubit gates, to approximate the essential dynamics of the original circuit while significantly reducing its depth. Our approach is evaluated through numerical simulations of time-evolution circuits for the critical Ising model, quantum Fourier transformation, and Haar-random quantum circuits, as well as experiments on IBM quantum platforms. By accounting for compilation error and circuit noise, we demonstrate that time evolution and quantum Fourier transformation circuits achieve high compression rates, while random quantum circuits are less compressible. The degree of compression is related to the rate of entanglement accumulation in the target circuit. In particular, experiments on IBM platforms achieve a compression rate of 12.5 for N=12N=12N=12 , significantly extending the application of current quantum devices. Furthermore, large-scale numerical simulations for system sizes up to N=30N=30N=30 reveal that the optimal depth dmaxd_{\mathrm{max}}dmax​ to achieve maximal overall fidelity is independent of system size N, suggesting the scalability of our method for large quantum devices in terms of quantum resources.
Compiling time-evolution operators of the form U(t)=e−iHtU(t)=e^{-iHt}U(t)=e−iHt into hardware-native gate sequences is a central bottleneck for digital quantum simulation on noisy intermediate-scale quantum (NISQ) devices. Generic transpilation treats U(t)U(t)U(t) as an arbitrary unitary, discarding the structure of Hamiltonian dynamics and producing circuits whose depth exceeds hardware coherence limits. We introduce a structure-aware compilation framework that treats product-formula decompositions as synthesis primitives rather than simulation approximations. The method combines (i) native placement of Hamiltonian terms onto the hardware coupling map, (ii) adaptive selection of Trotter blocks via a greedy discretization procedure, and (iii) variational refinement using a Trotter-initialized ansatz. Across Heisenberg, Ising, and XY models with n=3n=3n=3--888 qubits, the compiled circuits achieve fidelities F>0.996F>0.996F>0.996 with approximately linear scaling in the number of entangling gates, while generic synthesis produces circuits that are orders of magnitude deeper. On IBM Torino hardware, we observe a regime in which shorter approximate circuits outperform deeper exact decompositions: a 27-CX circuit achieves higher hardware fidelity (Fhw=0.987F_{\mathrm{hw}}=0.987Fhw​=0.987) than a 187-CX exact circuit. These results demonstrate that, in the NISQ regime, structure-aware approximate compilation can outperform exact structure-agnostic synthesis, providing a practical pathway for executing Hamiltonian dynamics without requiring pulse-level control.
Decomposing unitary operations into native gates is an essential step for implementing quantum algorithms. For qubit-based devices, where native gates are typically single- and two-qubit operations, a range of decomposition techniques have been developed. In particular, efficient algorithms exist for decomposing exponentials of Pauli strings while taking hardware topology in account. Motivated by the growing interest in qutrit-based quantum computing, we develop analogous decomposition methods for qutrit systems. Specifically, we introduce an algorithm that decomposes the exponential of an arbitrary tensor product of Weyl-Heisenberg operators (plus their Hermitian conjugation) into single- and two-qutrit gates. We further extend this approach to unitaries generated by Gell-Mann string (i.e., a tensor product of Gell-Mann matrices). Since both Gell-Mann matrices and Weyl-Heisenberg operators form (together with identity) complete operator bases of qutrit operators, we can use this result also to decompose any multi-qutrit gate that is diagonal up to single-qutrit rotations. As a practical application, we use our method to decompose the layers of the quantum approximate optimization algorithm for qutrit-based implementations of the graph k-coloring problem. For values of kkk well-suited to qutrit architectures (e.g., k=3k=3k=3 or in general k=3nk=3^nk=3n), our approach yields significantly shallower circuits compared to qubit-based implementations, an advantage that grows with problem size, while also requiring a smaller total Hilbert space dimension. Finally, we also address the routing challenge in qutrit architectures that arises due to the limited connectivity of the devices. In particular, we generalize the Steiner-Gauss method, originally developed to reduce CNOT counts in qubit circuit, to optimize gate routing in qutrit-based systems.
An important task in quantum computing is unitary circuit synthesis compatible with physical hardware constraints. This problem has a natural hybrid structure as local single-qubit gates are continuous variables on the Lie group SU(2)SU(2)SU(2) while the entangling circuit structure is discrete and hardware-dependent. In this work, we use generative models to perform quantum circuit synthesis incorporating both the natural SU(2)SU(2)SU(2) manifold geometry of quantum gates and hardware constraints that determine the overall circuit structure. Our model comprises two components: a circuit skeleton selector that chooses an entangling circuit and a diffusion model that generates quantum gates on the given circuit template by performing diffusion on the curved manifold SU(2)≃S3\mathrm{SU(2)} \simeq S^3SU(2)≃S3 itself. We demonstrate this approach with unitary compilation of physically motivated three-qubit Hamiltonian simulation targets such as the Transverse Field Ising Model and the Heisenberg-XXZ Model and show that Lie group diffusion outperforms comparable baselines. The synthesised circuits can also be customised subject to constraints, which we demonstrate by producing circuits with large and small gate rotation angles for the same target unitary evolution. We also investigate the fidelity-complexity frontier of the synthesised gates to demonstrate that the circuit selector learns to select circuits that balance fidelity with complexity rather than collapsing onto the most expansive entangling template. These results demonstrate that Lie group diffusion provides a natural generative framework for hardware-aware quantum circuit synthesis.