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:2604.26663 · Advanced Quantum Technologies

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

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

quant-phSubmitted Apr 29, 2026• Announced Apr 30, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

Comments
20 pages, 11 figures

Related papers

Variational compilation of native gates for efficient trapped-ion Hamiltonian simulation

Peng Wang, C Z Li, Hao Shi +1 more

Abstract Quantum simulation on noisy intermediate-scale quantum (NISQ) hardware is limited by short coherence time and gate errors. We present a universal variational compilation optimization method (VCOM) that directly leverages the native gate set of trapped-ion processors, namely single-qubit rotations and global Ising-type XX interactions, to construct shallow circuits for simulating molecular Hamiltonians. Specifically, VCOM employs a hybrid optimization strategy combining genetic algorithms with gradient-based refinement to compile Pauli string evolution operators e −i Pt , thereby substantially reducing circuit depth and multi-qubit gate overhead in Hamiltonian simulation. Applied to hydrogen chains, the compiled circuits achieve fidelities comparable to standard decompositions while reducing the proportion of two-qubit operations to only 1.9%–4.6% of the total native gates, a significant improvement over the standard second-order Trotter–Suzuki product formula. Under experimentally motivated laser-intensity and phase-noise models, the proposed scheme maintains high fidelity and exhibits significantly slower degradation than direct native gate decompositions of conventional circuits. These results establish native-gate-based variational compilation as a scalable and practical approach for digital quantum simulation on trapped-ion platforms, with potential extensions to strongly correlated systems and non-equilibrium dynamics.

Chinese Physics B•May 11, 2026•0 citations

Beyond Trotterization: Variational Product Formulas for Quantum Simulation

Ibsal Assi, Michael Vogl, Meenu Kumari +1 more

We propose a variational alternative to the Trotter-Suzuki decomposition that provides greater control over errors while preserving the unitary structure of time evolution. The variational parameters in our ansatz are derived from a global action principle, where Euler-Lagrange equations govern their optimal dynamics. Unlike conventional wavefunction-based variational methods, our approach specifically targets the time evolution operation and this allows a single set of optimized parameters to be applied to any initial state for a fixed Hamiltonian avoiding costly optimization procedures. Our method outperforms the standard Trotter-Suzuki formulas, typically achieving higher accuracy than higher-order Suzuki schemes. This translates directly to quantum computing applications, where it enables the design of quantum circuits with fewer gates which reduces noise and improves precision. Although we focus on quantum dynamics, the method is broadly applicable to problems involving general time-evolution operators. Applied to various model Hamiltonians, our approach reduces errors by factors of 2 to 5 compared to Trotter-Suzuki decompositions, demonstrating its promise for accurate quantum simulation with improved efficiency. In certain cases, the variational ansatz achieves higher accuracy than more complex higher-order Suzuki formulas while reducing the gate count by nearly half within a single circuit layer. Furthermore, we derive approximate analytical expressions for the variational parameters up to cubic order in time, valid for generic Hamiltonians. These approximations enable long-time quantum simulations with improved accuracy over equivalent Suzuki decompositions, providing ready-to-use evolution formulas that match Suzuki's gate complexity while delivering better performance.

quant-pharXiv:2511.15124•Physical review. B./Physical review. B•Nov 20, 2025•1 citation

Late Breaking Results: Hardware-Aware Compilation Reshapes Trainability in Variational Quantum Circuits

Muhammad Kashif, Muhammad Shafique

Variational quantum circuits (VQCs) are typically evaluated at the logical design level when analyzing trainability. However, execution on real quantum devices requires hardware-aware compilation (transpilation) to satisfy qubit connectivity and native gate-set constraints. In this paper, we examine how transpilation can alter the gradient statistics. Using parameter-shift differentiation and gradient variance estimation, we compare logical and transpiled circuits across three representative ansatz families: EfficientSU2 (dense entanglement), TTN (tree tensor network), and RealAmplitudes (linear entanglement). We observe architecture-dependent trainability shifts where densely entangling circuits exhibit pronounced gradient reshaping in shallow regimes, structured tensor-network circuits remain comparatively robust, and linear architectures show mixed behavior. Deep circuits across all families display minimal sensitivity to hardware-aware compilation. These findings demonstrate that transpilation acts as an implicit structural transformation of the optimization landscape, motivating compilation-aware analysis and co-design for VQCs.

quant-pharXiv:2604.16527•ACM/IEEE Design Automation Conference (DAC)•Apr 17, 2026•2 citations

Quantum simulation of many-body dynamics with noise-robust Trotter decomposition based on symmetric structures

Bo Yang, Naoki Negishi

The Suzuki–Trotter decomposition, which digitalizes quantum time evolution, provides a promising framework for simulating quantum dynamics on quantum hardware and exploring quantum advantage over classical computation. However, conventional Trotter circuits require a large number of non-local gates, lowering their faithfulness to the ideal dynamics when implemented on current noisy quantum hardware. While most previous studies have focused on circuit optimization, we instead propose a new Trotter decomposition that is intrinsically circuit-efficient for simulating quantum dynamics on near-term devices. Our method substantially reduces both the residual error by Trotter decomposition and the number of CNOT operations compared to conventional Trotter decompositions by exploiting the symmetry of the target model to construct an effective Hamiltonian with fewer two-qubit gates. We demonstrate the noise robustness of the proposed approach through numerical simulations of a nine-site Heisenberg model under realistic noise and further validate its experimental practicality on the IBM superconducting device, achieving a state fidelity exceeding 0.98 when combined with quantum error mitigation in the three-site case. The proposed circuit design is also compatible with existing circuit optimization techniques. Our results establish a practical route toward noise-resilient quantum simulation in many-body dynamics.

arXiv:2505.04552•AVS Quantum Science•Feb 9, 2026•2 citations

Design Automation of Quantum Circuits for Engineering Systems: Gate Optimization and Noise-Aware Compilation in NISQ-Aware Hardware

Erim Engin

The rapid advancement of Noisy Intermediate-Scale Quantum (NISQ) devices has driven the need for efficient design automation tools that can translate complex engineering models into executable quantum circuits. This study explores the development of automated quantum circuit design frameworks focused on gate optimization and noise-aware compilation, enabling practical quantum computation for engineering applications such as optimization, simulation, and control systems. Traditional circuit design methods often fail to account for hardware constraints, decoherence, and gate infidelity, which significantly affect computational accuracy on NISQ devices. To address these challenges, this research introduces a hybrid automation approach combining quantum transpilation, variational circuit pruning, and error-aware synthesis algorithms to enhance circuit reliability and scalability. The framework integrates quantum-classical co-design principles to optimize both logical and physical circuit layers, leveraging hardware-specific calibration data to adapt compilation strategies dynamically. Through simulations and benchmark analysis, the proposed system demonstrates significant improvements in quantum resource utilization, error mitigation, and gate depth reduction compared to conventional compilation methods. This work underscores the growing importance of design automation in quantum engineering, where algorithmic efficiency must be harmonized with physical constraints to realize functional and scalable quantum workflows. By establishing a methodology for gate-level optimization and noise-adaptive design, the study contributes to bridging the gap between theoretical quantum algorithms and real-world engineering implementations within the NISQ computing era.

Next generation.•Nov 13, 2025•0 citations

Architecture-aware Unitary Synthesis

Frans Perkkola, Arianne Meijer-van de Griend, Jukka K. Nurminen

We present a novel architecture-aware transpilation method for exact general unitary gate synthesis on superconducting quantum hardware. Our approach is tightly integrated with the optimized block-ZXZ decomposition, exploiting its recursive structure to make hardware-aware decisions at each level of the recursion rather than treating transpilation as an independent post-processing step. The method introduces three key techniques: a greedy qubit mapping strategy that minimizes pairwise distances between physical qubits, an adaptive Gray code selection combined with qubit swapping that optimizes the construction of uniformly controlled Rz gates for the target topology, and a heuristic for reducing CNOT gates by exploiting the structure of long-range CNOT ladders. We benchmark our method against TKet, Qiskit, and Pennylane on the 20-qubit IQM Garnet (square lattice) and the 156-qubit IBM Marrakesh (heavy-hex) architectures with qubit counts ranging from 3 to 11. Our method achieves CNOT count reductions of up to 36 percent on the IQM Garnet and up to 34 percent on the IBM Marrakesh compared to the best competing transpiler, while simultaneously achieving transpilation speedups of up to 553x. Furthermore, our method is the only one capable of transpiling circuits beyond 10 qubits within a 30-minute time limit across both architectures.

quant-pharXiv:2604.23777•Apr 28, 2026•0 citations
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.
Abstract Quantum simulation on noisy intermediate-scale quantum (NISQ) hardware is limited by short coherence time and gate errors. We present a universal variational compilation optimization method (VCOM) that directly leverages the native gate set of trapped-ion processors, namely single-qubit rotations and global Ising-type XX interactions, to construct shallow circuits for simulating molecular Hamiltonians. Specifically, VCOM employs a hybrid optimization strategy combining genetic algorithms with gradient-based refinement to compile Pauli string evolution operators e −i Pt , thereby substantially reducing circuit depth and multi-qubit gate overhead in Hamiltonian simulation. Applied to hydrogen chains, the compiled circuits achieve fidelities comparable to standard decompositions while reducing the proportion of two-qubit operations to only 1.9%–4.6% of the total native gates, a significant improvement over the standard second-order Trotter–Suzuki product formula. Under experimentally motivated laser-intensity and phase-noise models, the proposed scheme maintains high fidelity and exhibits significantly slower degradation than direct native gate decompositions of conventional circuits. These results establish native-gate-based variational compilation as a scalable and practical approach for digital quantum simulation on trapped-ion platforms, with potential extensions to strongly correlated systems and non-equilibrium dynamics.
We propose a variational alternative to the Trotter-Suzuki decomposition that provides greater control over errors while preserving the unitary structure of time evolution. The variational parameters in our ansatz are derived from a global action principle, where Euler-Lagrange equations govern their optimal dynamics. Unlike conventional wavefunction-based variational methods, our approach specifically targets the time evolution operation and this allows a single set of optimized parameters to be applied to any initial state for a fixed Hamiltonian avoiding costly optimization procedures. Our method outperforms the standard Trotter-Suzuki formulas, typically achieving higher accuracy than higher-order Suzuki schemes. This translates directly to quantum computing applications, where it enables the design of quantum circuits with fewer gates which reduces noise and improves precision. Although we focus on quantum dynamics, the method is broadly applicable to problems involving general time-evolution operators. Applied to various model Hamiltonians, our approach reduces errors by factors of 2 to 5 compared to Trotter-Suzuki decompositions, demonstrating its promise for accurate quantum simulation with improved efficiency. In certain cases, the variational ansatz achieves higher accuracy than more complex higher-order Suzuki formulas while reducing the gate count by nearly half within a single circuit layer. Furthermore, we derive approximate analytical expressions for the variational parameters up to cubic order in time, valid for generic Hamiltonians. These approximations enable long-time quantum simulations with improved accuracy over equivalent Suzuki decompositions, providing ready-to-use evolution formulas that match Suzuki's gate complexity while delivering better performance.
Variational quantum circuits (VQCs) are typically evaluated at the logical design level when analyzing trainability. However, execution on real quantum devices requires hardware-aware compilation (transpilation) to satisfy qubit connectivity and native gate-set constraints. In this paper, we examine how transpilation can alter the gradient statistics. Using parameter-shift differentiation and gradient variance estimation, we compare logical and transpiled circuits across three representative ansatz families: EfficientSU2 (dense entanglement), TTN (tree tensor network), and RealAmplitudes (linear entanglement). We observe architecture-dependent trainability shifts where densely entangling circuits exhibit pronounced gradient reshaping in shallow regimes, structured tensor-network circuits remain comparatively robust, and linear architectures show mixed behavior. Deep circuits across all families display minimal sensitivity to hardware-aware compilation. These findings demonstrate that transpilation acts as an implicit structural transformation of the optimization landscape, motivating compilation-aware analysis and co-design for VQCs.
The Suzuki–Trotter decomposition, which digitalizes quantum time evolution, provides a promising framework for simulating quantum dynamics on quantum hardware and exploring quantum advantage over classical computation. However, conventional Trotter circuits require a large number of non-local gates, lowering their faithfulness to the ideal dynamics when implemented on current noisy quantum hardware. While most previous studies have focused on circuit optimization, we instead propose a new Trotter decomposition that is intrinsically circuit-efficient for simulating quantum dynamics on near-term devices. Our method substantially reduces both the residual error by Trotter decomposition and the number of CNOT operations compared to conventional Trotter decompositions by exploiting the symmetry of the target model to construct an effective Hamiltonian with fewer two-qubit gates. We demonstrate the noise robustness of the proposed approach through numerical simulations of a nine-site Heisenberg model under realistic noise and further validate its experimental practicality on the IBM superconducting device, achieving a state fidelity exceeding 0.98 when combined with quantum error mitigation in the three-site case. The proposed circuit design is also compatible with existing circuit optimization techniques. Our results establish a practical route toward noise-resilient quantum simulation in many-body dynamics.
The rapid advancement of Noisy Intermediate-Scale Quantum (NISQ) devices has driven the need for efficient design automation tools that can translate complex engineering models into executable quantum circuits. This study explores the development of automated quantum circuit design frameworks focused on gate optimization and noise-aware compilation, enabling practical quantum computation for engineering applications such as optimization, simulation, and control systems. Traditional circuit design methods often fail to account for hardware constraints, decoherence, and gate infidelity, which significantly affect computational accuracy on NISQ devices. To address these challenges, this research introduces a hybrid automation approach combining quantum transpilation, variational circuit pruning, and error-aware synthesis algorithms to enhance circuit reliability and scalability. The framework integrates quantum-classical co-design principles to optimize both logical and physical circuit layers, leveraging hardware-specific calibration data to adapt compilation strategies dynamically. Through simulations and benchmark analysis, the proposed system demonstrates significant improvements in quantum resource utilization, error mitigation, and gate depth reduction compared to conventional compilation methods. This work underscores the growing importance of design automation in quantum engineering, where algorithmic efficiency must be harmonized with physical constraints to realize functional and scalable quantum workflows. By establishing a methodology for gate-level optimization and noise-adaptive design, the study contributes to bridging the gap between theoretical quantum algorithms and real-world engineering implementations within the NISQ computing era.
We present a novel architecture-aware transpilation method for exact general unitary gate synthesis on superconducting quantum hardware. Our approach is tightly integrated with the optimized block-ZXZ decomposition, exploiting its recursive structure to make hardware-aware decisions at each level of the recursion rather than treating transpilation as an independent post-processing step. The method introduces three key techniques: a greedy qubit mapping strategy that minimizes pairwise distances between physical qubits, an adaptive Gray code selection combined with qubit swapping that optimizes the construction of uniformly controlled Rz gates for the target topology, and a heuristic for reducing CNOT gates by exploiting the structure of long-range CNOT ladders. We benchmark our method against TKet, Qiskit, and Pennylane on the 20-qubit IQM Garnet (square lattice) and the 156-qubit IBM Marrakesh (heavy-hex) architectures with qubit counts ranging from 3 to 11. Our method achieves CNOT count reductions of up to 36 percent on the IQM Garnet and up to 34 percent on the IBM Marrakesh compared to the best competing transpiler, while simultaneously achieving transpilation speedups of up to 553x. Furthermore, our method is the only one capable of transpiling circuits beyond 10 qubits within a 30-minute time limit across both architectures.