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.14125

Hamiltonian-Dependent Compressibility and Physical Preservation in Approximate Quantum Compilation using Tensor Networks

Dohyun Kim, Namshik Han

quant-phSubmitted Oct 9, 2026• Announced Oct 12, 2026• 0 citations• Revised Oct 31, 2026 (v2)
v1 · Oct 9, 2026v2 · Oct 31, 2026
arXivHTMLPDF

Abstract

Approximate quantum compilation (AQC) using tensor networks provides a promising route to reducing the circuit resources required for quantum simulation. However, the factors governing the compressibility of many-body dynamics and the extent to which compressed circuits retain physically relevant information on quantum hardware remain poorly understood. We investigate these questions using AQCtensor for an 80-qubit one-dimensional anisotropic XYZ Heisenberg chain initialized in a N'eel state. By varying the exchange anisotropy and external magnetic field, we find that compression performance changes systematically with the anisotropic coupling configuration and field orientation. These variations are strongly associated with a nested-commutator measure related to second-order Trotter error, with corresponding directional trends also reflected in the target-state MPS bond dimension. For an 80-qubit quantum-hardware evaluation, AQCtensor compresses a 10-repetition target evolution to 5 repetitions while retaining a target-state fidelity of 0.995474, reducing the total circuit depth by 45.9% and the two-qubit gate count by 47.6%. The compressed circuit exhibits comparable behavior across magnetization, nearest-neighbor correlation, and Hamiltonian expectation measurements, while process-level diagnostics and local reduced-state tomography provide complementary characterization beyond these observables. Together, these results link AQCtensor compressibility to Hamiltonian commutator structure and target-state complexity and demonstrate substantial circuit reduction while retaining physically relevant features in an 80-qubit quantum-hardware experiment.

AI Summary

The paper examines how Hamiltonian structure affects tensor-network-based approximate quantum compilation (AQCtensor), and what physical information compressed circuits retain on hardware. It studies an 80-qubit open XYZ chain initialized in a Néel state, using MPS-based optimization of shallow Trotter ansätze against deeper target states. A parameter sweep varies anisotropic couplings and field strength and orientation at $t=0.30$, using 20-step second-order Suzuki–Trotter targets. Compression is measured by the minimum repetitions achieving $F\geq0.99$ and optimized infidelity at four repetitions. An aggregate nested-commutator measure correlates with fixed-depth infidelity (Pearson $r=0.887$, Spearman $\rho=0.900$); correlations remain positive within fixed-field-strength subsets. Its correlation with target-state MPS bond dimension is weaker ($r=0.744$). These are empirical associations, not compressibility bounds. For a separate hardware configuration on IBM Heron, a 10-repetition target is compressed to five repetitions with classically evaluated target-state fidelity $0.995474$. Transpiled depth falls from 294 to 159 and two-qubit gates from 2,487 to 1,302. Magnetization, nearest-neighbor correlations, and energy measurements compare original and compressed circuits. Four-qubit tomography gives mean hardware reduced-state fidelity $0.647$ between them. Auxiliary, shallower relative-circuit process diagnostics reach the estimation boundary at 60–80 qubits. Stated limitations include one hardware Hamiltonian and evolution time, selected local subsystems, noise-limited process characterization, restricted Hamiltonians and ansätze, and finite-budget optimization. Mitigation settings are selected separately against known reference values, making the hardware comparisons reference-guided rather than independent mitigation benchmarks. Generalization beyond these one-dimensional, short-time settings remains untested.

Little sign of AI-generated textIncrementalMissing comparisonOverclaimsPossible error

Error found: The stated self-mirror circuits U†U must have noiseless references <Z>=1, C_ZZ=1 and <X>=0, contradicting the substantially different Pauli-propagation references used in the mirror benchmarks. The mitigated observable estimates were selected for agreement with known reference values separately for each circuit and observable, so that agreement cannot serve as an independent validation of hardware preservation.

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

Comments
20 pages, 9 figures, 5 tables; includes supplementary material

Related papers

Approximate Quantum Compiling for Quantum Simulation: A Tensor Network Based Approach

Niall Robertson, Albert Akhriev, Jiří Vala +1 more

We introduce AQCtensor , a novel algorithm to produce short-depth quantum circuits from Matrix Product States (MPS). Our approach is specifically tailored to the preparation of quantum states generated from the time evolution of quantum many-body Hamiltonians. This tailored approach has two clear advantages over previous algorithms that were designed to map a generic MPS to a quantum circuit. First, we optimise all parameters of a parametric circuit at once using Approximate Quantum Compiling (AQC)—this is to be contrasted with other approaches based on locally optimizing a subset of circuit parameters and “sweeping” across the system. We introduce an optimisation scheme to avoid the so-called “orthogonality catastrophe”—i.e., the fact that the fidelity of two arbitrary quantum states decays exponentially with the number of qubits—that would otherwise render a global optimisation of the circuit impractical. Second, the depth of our parametric circuit is constant in the number of qubits for a fixed simulation time and fixed error tolerance. This is to be contrasted with the linear circuit Ansatz used in generic algorithms whose depth scales linearly in the number of qubits. For simulation problems on 100 qubits, we show that AQCtensor thus achieves at least an order of magnitude reduction in the depth of the resulting optimized circuit, as compared with the best generic MPS to quantum circuit algorithms. We demonstrate our approach on simulation problems on Heisenberg-like Hamiltonians on up to 100 qubits and find optimized quantum circuits that have signficantly reduced depth as compared with standard Trotterized circuits.

arXiv:2301.08609•ACM Transactions on Quantum Computing•Apr 18, 2025•26 citations

Deep Circuit Compression for Quantum Dynamics via Tensor Networks

Joe Gibbs, Łukasz Cincio

Dynamic quantum simulation is a leading application for achieving quantum advantage. However, high circuit depths remain a limiting factor on near-term quantum hardware. We present a compilation algorithm based on Matrix Product Operators for generating compressed circuits enabling real-time simulation on digital quantum computers, that for a given depth are more accurate than all Trotterizations of the same depth. By the efficient use of environment tensors, the algorithm is scalable in depth far beyond prior work, and we present circuit compilations of up to 64 layers of SU(4) gates. Surpassing only 1D circuits, our approach can flexibly target a particular quasi-2D gate topology. We demonstrate this by compiling a 52-qubit 2D Transverse-Field Ising propagator onto the IBM Heavy-Hex topology. For all circuit depths and widths tested, we produce circuits with smaller errors than all equivalent depth Trotter unitaries, corresponding to reductions in error by up to 4 orders of magnitude and circuit depth compressions with a factor of over 6.

arXiv:2409.16361•Quantum•Jul 9, 2025•16 citations

Matrix Product Operators In The Age of Block Encoding

Eugene Dumitrescu

We develop a block-encoding compiler that treats matrix product operators as compressed, virtual-path linear combination of unitaries programs. The compiler constructs conditional PREP and local SELECT stages directly from a parent matrix product operator, establishing tensor networks as structured quantum intermediate representations that can be efficiently compiled to block-encoded circuits. We apply the construction to real-time evolution in the Heisenberg chain and two perturbed Heisenberg-family models. Across the regimes studied, the compressed, approximately unitary propagator MPOs retain mild bond dimension and LCU normalization. Relative to an LCU that explicitly lists the $\mathcal{O}(N^K)$ Pauli-product branches of an order-K truncated Taylor polynomial, our virtual-transition implementation replaces combinatorial branch enumeration by a circuit complexity scaling as $\mathcal{O}(α_{\rm MPO}Nχ^2)$, approaching $\mathcal{O}(Nχ^2)$ when $α_{\rm MPO}$ remains mild. We numerically characterize how truncation order, bond-dimension budget, and system size affect approximation error, normalization, and compiler cost. These results demonstrate how classically compressed tensor-network representations can serve as quantum compiler intermediate representations for block encoding and opens new avenues to accelerate quantum algorithms.

quant-pharXiv:2606.19083•Jun 18, 2026•2 citations

Hardware-Efficient Quantum Optimization for Transportation Networks via Compressed Adiabatic Evolution

Talha Azfar, Ruimin Ke, Sean He +2 more

Transportation systems such as urban logistics, vehicle routing, and infrastructure planning require solving large-scale combinatorial optimization problems under complex constraints. Problems such as the vehicle routing problem (VRP), traveling salesman problem (TSP), and facility location problem (FLP) involve large discrete search spaces and the need to generate multiple feasible solutions in real time. In this work, we develop a hardware-grounded hybrid quantum optimization framework that uses Approximate Quantum Compilation (AQC) to compress early segments of digitized adiabatic evolution into shallow circuits. The compressed prefix is combined with variational layers, enabling a systematic study of how initialization, circuit depth, and expressivity interact on near-term quantum hardware. All experiments are performed on an IBM gate-based quantum computer, and circuits are evaluated as stochastic generators of candidate transportation plans. Results show that moderate prefix compression reduces two-qubit gate depth while maintaining or improving feasible solution discovery, particularly for routing problems. These benefits depend on compatibility between the compressed prefix and the variational ansatz: while standard QAOA effectively leverages AQC initialization, linear-chain QAOA shows limited improvement. Overall, this work demonstrates that hybrid AQC-QAOA methods provide a practical pathway for hardware-efficient quantum optimization, positioning quantum algorithms as candidate generators within transportation decision-making workflows.

quant-pharXiv:2604.26175•Apr 30, 2026•2 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
Approximate quantum compilation (AQC) using tensor networks provides a promising route to reducing the circuit resources required for quantum simulation. However, the factors governing the compressibility of many-body dynamics and the extent to which compressed circuits retain physically relevant information on quantum hardware remain poorly understood. We investigate these questions using AQCtensor for an 80-qubit one-dimensional anisotropic XYZ Heisenberg chain initialized in a N'eel state. By varying the exchange anisotropy and external magnetic field, we find that compression performance changes systematically with the anisotropic coupling configuration and field orientation. These variations are strongly associated with a nested-commutator measure related to second-order Trotter error, with corresponding directional trends also reflected in the target-state MPS bond dimension. For an 80-qubit quantum-hardware evaluation, AQCtensor compresses a 10-repetition target evolution to 5 repetitions while retaining a target-state fidelity of 0.995474, reducing the total circuit depth by 45.9% and the two-qubit gate count by 47.6%. The compressed circuit exhibits comparable behavior across magnetization, nearest-neighbor correlation, and Hamiltonian expectation measurements, while process-level diagnostics and local reduced-state tomography provide complementary characterization beyond these observables. Together, these results link AQCtensor compressibility to Hamiltonian commutator structure and target-state complexity and demonstrate substantial circuit reduction while retaining physically relevant features in an 80-qubit quantum-hardware experiment.
The paper examines how Hamiltonian structure affects tensor-network-based approximate quantum compilation (AQCtensor), and what physical information compressed circuits retain on hardware. It studies an 80-qubit open XYZ chain initialized in a Néel state, using MPS-based optimization of shallow Trotter ansätze against deeper target states.
A parameter sweep varies anisotropic couplings and field strength and orientation at t=0.30t=0.30t=0.30, using 20-step second-order Suzuki–Trotter targets. Compression is measured by the minimum repetitions achieving F≥0.99F\geq0.99F≥0.99 and optimized infidelity at four repetitions. An aggregate nested-commutator measure correlates with fixed-depth infidelity (Pearson r=0.887r=0.887r=0.887, Spearman ρ=0.900\rho=0.900ρ=0.900); correlations remain positive within fixed-field-strength subsets. Its correlation with target-state MPS bond dimension is weaker (r=0.744r=0.744r=0.744). These are empirical associations, not compressibility bounds.
For a separate hardware configuration on IBM Heron, a 10-repetition target is compressed to five repetitions with classically evaluated target-state fidelity 0.9954740.9954740.995474. Transpiled depth falls from 294 to 159 and two-qubit gates from 2,487 to 1,302. Magnetization, nearest-neighbor correlations, and energy measurements compare original and compressed circuits. Four-qubit tomography gives mean hardware reduced-state fidelity 0.6470.6470.647 between them. Auxiliary, shallower relative-circuit process diagnostics reach the estimation boundary at 60–80 qubits.
Stated limitations include one hardware Hamiltonian and evolution time, selected local subsystems, noise-limited process characterization, restricted Hamiltonians and ansätze, and finite-budget optimization. Mitigation settings are selected separately against known reference values, making the hardware comparisons reference-guided rather than independent mitigation benchmarks. Generalization beyond these one-dimensional, short-time settings remains untested.
We introduce AQCtensor , a novel algorithm to produce short-depth quantum circuits from Matrix Product States (MPS). Our approach is specifically tailored to the preparation of quantum states generated from the time evolution of quantum many-body Hamiltonians. This tailored approach has two clear advantages over previous algorithms that were designed to map a generic MPS to a quantum circuit. First, we optimise all parameters of a parametric circuit at once using Approximate Quantum Compiling (AQC)—this is to be contrasted with other approaches based on locally optimizing a subset of circuit parameters and “sweeping” across the system. We introduce an optimisation scheme to avoid the so-called “orthogonality catastrophe”—i.e., the fact that the fidelity of two arbitrary quantum states decays exponentially with the number of qubits—that would otherwise render a global optimisation of the circuit impractical. Second, the depth of our parametric circuit is constant in the number of qubits for a fixed simulation time and fixed error tolerance. This is to be contrasted with the linear circuit Ansatz used in generic algorithms whose depth scales linearly in the number of qubits. For simulation problems on 100 qubits, we show that AQCtensor thus achieves at least an order of magnitude reduction in the depth of the resulting optimized circuit, as compared with the best generic MPS to quantum circuit algorithms. We demonstrate our approach on simulation problems on Heisenberg-like Hamiltonians on up to 100 qubits and find optimized quantum circuits that have signficantly reduced depth as compared with standard Trotterized circuits.
Dynamic quantum simulation is a leading application for achieving quantum advantage. However, high circuit depths remain a limiting factor on near-term quantum hardware. We present a compilation algorithm based on Matrix Product Operators for generating compressed circuits enabling real-time simulation on digital quantum computers, that for a given depth are more accurate than all Trotterizations of the same depth. By the efficient use of environment tensors, the algorithm is scalable in depth far beyond prior work, and we present circuit compilations of up to 64 layers of SU(4) gates. Surpassing only 1D circuits, our approach can flexibly target a particular quasi-2D gate topology. We demonstrate this by compiling a 52-qubit 2D Transverse-Field Ising propagator onto the IBM Heavy-Hex topology. For all circuit depths and widths tested, we produce circuits with smaller errors than all equivalent depth Trotter unitaries, corresponding to reductions in error by up to 4 orders of magnitude and circuit depth compressions with a factor of over 6.
We develop a block-encoding compiler that treats matrix product operators as compressed, virtual-path linear combination of unitaries programs. The compiler constructs conditional PREP and local SELECT stages directly from a parent matrix product operator, establishing tensor networks as structured quantum intermediate representations that can be efficiently compiled to block-encoded circuits. We apply the construction to real-time evolution in the Heisenberg chain and two perturbed Heisenberg-family models. Across the regimes studied, the compressed, approximately unitary propagator MPOs retain mild bond dimension and LCU normalization. Relative to an LCU that explicitly lists the O(NK)\mathcal{O}(N^K)O(NK) Pauli-product branches of an order-K truncated Taylor polynomial, our virtual-transition implementation replaces combinatorial branch enumeration by a circuit complexity scaling as O(αMPONχ2)\mathcal{O}(α_{\rm MPO}Nχ^2)O(αMPO​Nχ2), approaching O(Nχ2)\mathcal{O}(Nχ^2)O(Nχ2) when αMPOα_{\rm MPO}αMPO​ remains mild. We numerically characterize how truncation order, bond-dimension budget, and system size affect approximation error, normalization, and compiler cost. These results demonstrate how classically compressed tensor-network representations can serve as quantum compiler intermediate representations for block encoding and opens new avenues to accelerate quantum algorithms.
Transportation systems such as urban logistics, vehicle routing, and infrastructure planning require solving large-scale combinatorial optimization problems under complex constraints. Problems such as the vehicle routing problem (VRP), traveling salesman problem (TSP), and facility location problem (FLP) involve large discrete search spaces and the need to generate multiple feasible solutions in real time. In this work, we develop a hardware-grounded hybrid quantum optimization framework that uses Approximate Quantum Compilation (AQC) to compress early segments of digitized adiabatic evolution into shallow circuits. The compressed prefix is combined with variational layers, enabling a systematic study of how initialization, circuit depth, and expressivity interact on near-term quantum hardware. All experiments are performed on an IBM gate-based quantum computer, and circuits are evaluated as stochastic generators of candidate transportation plans. Results show that moderate prefix compression reduces two-qubit gate depth while maintaining or improving feasible solution discovery, particularly for routing problems. These benefits depend on compatibility between the compressed prefix and the variational ansatz: while standard QAOA effectively leverages AQC initialization, linear-chain QAOA shows limited improvement. Overall, this work demonstrates that hybrid AQC-QAOA methods provide a practical pathway for hardware-efficient quantum optimization, positioning quantum algorithms as candidate generators within transportation decision-making workflows.
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.