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

A Hamiltonian-Level Certificate for Network-Free Distributed Quantum Simulation: Exact Tensor-Separability Criterion and Approximate Residual Bounds

Kan He, Shusen Liu, Jinchuan Hou, Pascal J. Elahi, Huang, Yifei, Yu, Xinyuan, Varetto, Ugo

Published Jan 15, 2019• 0 citations
arXivHTMLPDF

Abstract

Circuit cutting allows quantum circuits to be evaluated on smaller devices at the cost of additional sampling and classical reconstruction. For Hamiltonian-simulation circuits, the target unitary $\exp[it\mathbf H]$ connects this decomposition problem to the structure of the generator. We develop a Hamiltonian-level certificate that assesses exact separability and the accuracy of independent module evolution before a gate decomposition is chosen. For a time-independent Hamiltonian and a fixed module partition, the Hilbert--Schmidt projection onto sums of module-local terms isolates a cross-module residual $H_{ns}$. Its vanishing is necessary and sufficient for product evolution at all times; for Pauli-list inputs, this condition is checked in one pass over the combined coefficients. When $H_{ns}\ne0$, the projected evolution has operator-norm error at most $|t| ||H_{ns}||_{op}$. Across a bipartition, an explicit first-order algebraic correction has the same operator-Schmidt rank as $H_{ns}$ and leaves a second-order residual. The same Hamiltonian residual connects this approximation to short-time entanglement, determining the leading state-space and operator-space entangling powers and, through its Schmidt spectrum, the leading Choi tripartite-information terms. Numerical experiments test these relations and demonstrate block-factorised simulation up to $20$ qubits.

DOI
10.48550/arxiv.1901.04629

Related papers

A Validated Quantum-Circuit Testbed for the Lattice Schwinger Model

Moein Sahraei

Abstract. We present a validated computational testbed for studying product-formula errorin a lattice gauge theory. For the lattice Schwinger model (1+1D QED, Kogut–Susskindstaggered fermions, gauge field eliminated via Gauss’s law) we construct three references —exact diagonalization, classical second-order Trotter evolution, and a gate-level Qiskit circuit— and cross-check them against each other and against published conventions. The firsttwo are independent; the second and third share the Hamiltonian construction and Paulidecomposition, so their agreement verifies the gate decomposition and circuit implementationrather than the physics, which is validated against the exact solution instead. The gate-levelcircuit reproduces the classical Trotter propagator to 7.6×10−14 after accumulated repetitions,so that the residual difference from exact evolution isolates the physical Trotter error cleanly;the Hamiltonian is verified term-by-term against Nguyen et al., and the Pauli decompositionagainst direct matrix construction, in both cases to machine precision.We then demonstrate the testbed on three questions from the existing literature. First, thecommutator-scaling bound of Childs et al. (2021), evaluated with prefactors derived numerically rather than assumed, overestimates the measured operator-norm error by a factor between1.5 and 6.8 across nine parameter points (median 2.0), rising with system size and coupling;at the reference point the ratio is 1.74, constant to three significant figures over the testedrange ∆t ∈ [1/512, 1/16]. Second, operator-norm, state, and observable errors all give fittedexponents statistically consistent with p = 2 but markedly different prefactors; we introduce anormalisation-independent gap factor G to quantify this, finding G numerically constant overthe tested ∆t range and increasing across the four accessible system sizes. We show that thisgrowth reflects the growth of the state error while the local-observable error stays constantto five significant figures — the local-versus-global robustness established by Heyl, Hauke andZoller (2019), for which we claim no priority. Third, the ordering heuristics of Tranter et al.(2019), established on 44 molecular Hamiltonians, reproduce all four of their reported trendsat the parameter point tested here — the fourth in sharpened form, the norm-based estimatorranking orderings slightly backwards (ρ = −0.292) rather than merely failing to rank them.The contribution is the validated testbed and its convention bookkeeping rather than newtheory: all three demonstrations are measurements of known results, and in the case of theobservable gap, a re-derivation of a known result in a different language. Reference [5] studiesthe same model with the same decomposition and initial state, using a first-order formula inthe long-time limit; the present work uses the second-order symmetric formula at short timeand compares against the 2021 commutator-scaling bound, which postdates that study. Codefor all reported figures and tables is provided.

•Aug 8, 2026•0 citations

Truncated hybrid tensor networks for distributed quantum simulation

Yong Liu, Guangyao Huang, Weixu Shi +4 more

Simulation of quantum many-body systems is a principal application of quantum computing, but available devices remain limited by the number of qubits and cannot accommodate systems of the desired size. One approach is to host a large evolution across several modest distributed systems that exchange classical information alone. Current protocols such as circuit knitting incur a quasi-probability sampling cost that grows exponentially with the number of remote gates across the cut, even when physical correlations across the cut are actually bounded. In this work, we present a truncated hybrid tensor network (THTN) framework in which a remote two-body gate is applied as a sum of local unitaries on the subsystems, linked by a classical connecting tensor, and an interface truncation retains Schmidt modes across the cut. Remote gates between the same subsystems can be merged on one connector, so non-one-dimensional models, such as layered partitions with strong intra-layer and weaker interlayer couplings, may be cast onto a one-dimensional cut. The retained non-negative Schmidt coefficients also define a sampling rule for local observables. We validate this distributed protocol by classical simulation against time-evolving block decimation (TEBD) at the same bond dimension. The truncated dynamics track the TEBD references on chains and ladders, with the clearest gain on a layered model.

quant-pharXiv:2609.16520•Sep 16, 2026•0 citations

Complexity of tensor network simulation for noisy quantum circuits

Yuguo Shao, Zishuo Zhao, Song Cheng +1 more

We aim to rigorously address how local noise affects classical simulability of quantum dynamics benchmarked by tensor-network methods. Using operator entanglement entropy (OEE), we prove the following: (1) For single-qubit depolarizing noise on arbitrary circuits, tensor networks with $\mathrm{poly}(n)$ bond dimension suffice for fixed absolute Hilbert-Schmidt error after $\order{1}$ depth, while relative error demands $\order{\log n}$ depth; and this bound is optimal. (2) For single-qubit depolarizing noise on 1D local circuits, the existence of whole-trajectory error-bounded matrix product operator (MPO) of $\mathrm{poly}(n)$ bond dimension at all depths. (3) For general single-qubit noise in 1D brickwall circuits, random two-design gates with contraction coefficient $c<1/3$ yield an $\order{1}$ OEE plateau with probability $1-Te^{-Ω(n)}$, while arbitrary gates with $c<1/48$ give $\order{\log n}$ OEE in the worst case. (4) In higher dimensions, these bounds yield uniform-in-depth $\mathrm{poly}(n)$ average boundary-bond dimensions for projected entangled pair operators~(PEPO) across every cut -- under depolarizing noise at either absolute or relative accuracy, and under general noise with strong contraction at absolute accuracy. Our results establish a rigorous connection between certain noise models, circuit types, and their classical simulability.

cond-mat.str-elCross-listedarXiv:2606.00474•Jun 2, 2026•2 citations

Entanglement-Dependent Error Bounds for Hamiltonian Simulation

Prateek P. Kulkarni

We establish tight connections between entanglement entropy and the approximation error in Trotter-Suzuki product formulas for Hamiltonian simulation. Product formulas remain the workhorse of quantum simulation on near-term devices, yet standard error analyses yield worst-case bounds that can vastly overestimate the resources required for structured problems. For systems governed by geometrically local Hamiltonians with maximum entanglement entropy $S_\text{max}$ across all bipartitions, we prove that the first-order Trotter error scales as $\mathcal{O}(t^2 S_\text{max} \operatorname{polylog}(n)/r)$ rather than the worst-case $\mathcal{O}(t^2 n/r)$, where $n$ is the system size and $r$ is the number of Trotter steps. This yields improvements of $\tildeΩ(n^2)$ for one-dimensional area-law systems and $\tildeΩ(n^{3/2})$ for two-dimensional systems. We extend these bounds to higher-order Suzuki formulas, where the improvement factor involves $2^{pS^*/2}$ for the $p$-th order formula. We further establish a separation result demonstrating that volume-law entangled systems fundamentally require $\tildeΩ(n)$ more Trotter steps than area-law systems to achieve the same precision. This separation is tight up to logarithmic factors. Our analysis combines Lieb-Robinson bounds for locality, tensor network representations for entanglement structure, and novel commutator-entropy inequalities that bound the expectation value of nested commutators by the Schmidt rank of the state. These results have immediate applications to quantum chemistry, condensed matter simulation, and resource estimation for fault-tolerant quantum computing.

quant-pharXiv:2602.00555•Feb 3, 2026•1 citation

Toward Optimal Circuit Depth for Geometrically Local Hamiltonian Simulation

Zheyu Shen, Yusen Wu, Penghui Yao +2 more

Understanding the dynamics of interacting quantum systems is a central goal of quantum simulation. For geometrically local Hamiltonians, locality suggests that digital simulation should retain much of the parallelism of the underlying dynamics. For a target accuracy $ε$, we construct a nearest-neighbor quantum circuit that simulates the dynamics of an $n$-qubit, time-independent, finite-range Hamiltonian with normalized local interaction strength on a fixed-dimensional lattice for time $T\ge1$, with circuit depth $O(T\log(nT/ε))$ and gate count $O(nT\log(nT/ε))$. This reduces the polylogarithmic overhead of Haah, Hastings, Kothari, and Low to a single logarithm. On logarithmic-scale blocks from the Lieb--Robinson decomposition, a shallow but highly accurate implementation is essential for reducing the circuit depth. Our key observation is that spatial localization also controls the cost of high precision. In each block, the error of a constant-order product formula is compensated for by a correction, yielding exponential accuracy. The correction can be implemented with depth proportional to the block diameter, introducing no additional asymptotic depth scale beyond that required by spatial localization. Furthermore, we prove an unconditional circuit-depth lower bound for uniform XXZ Hamiltonians: at fixed evolution time $T$ in the stated regime and sufficiently small fixed error $ε$, any nearest-neighbor quantum circuit simulating these dynamics requires depth $Ω(\log n/\log\log n)$. This matches our $O(\log n)$ upper bound up to a doubly logarithmic factor, establishing near-optimal circuit depth for lattice Hamiltonian simulation in this regime. Together, these results clarify the role of locality and precision in determining the circuit complexity of quantum dynamics and suggest broader principles for spatially constrained quantum computation.

quant-pharXiv:2610.01839•Oct 2, 2026•0 citations

Optimized Randomized Hamiltonian Simulation via Average-Error Analysis

Hayata Morisaki, Keisuke Fujii

Hamiltonian simulation is a central application of quantum computing. Randomized Hamiltonian simulation approximates the target dynamics by sampling quantum circuits and often allows simpler circuit implementations. We develop a framework for randomized Hamiltonian simulation in which Hamiltonian terms are sampled with arbitrary probabilities and the corresponding short-time evolutions are implemented sequentially. The leading channel error relative to ideal time evolution is governed by the variance of the sampled generators. Minimizing the variance-based upper bound on the worst-case error recovers qDRIFT, a leading randomized Hamiltonian simulation algorithm that samples terms in proportion to their operator norms. For typical input states, however, this sampling distribution need not be optimal. Minimizing Haar-averaged error bounds instead yields sampling probabilities proportional to the Hilbert-Schmidt norms of the terms. This choice can provide smaller average-error bounds than conventional qDRIFT. For Hamiltonians expressed as sums of Pauli strings, we combine this framework with commuting Pauli grouping to obtain smaller error bounds than conventional qDRIFT at fixed $R_z$ depth. Numerical benchmarks for the Sachdev-Ye-Kitaev model show error-bound improvement factors consistent with linear scaling in the number of qubits. For the 108-qubit FeMoco Hamiltonian, the error bounds are reduced by a factor of about 5.65. These results establish average-error optimization as a practical design principle for randomized Hamiltonian simulation.

quant-pharXiv:2609.36694•Sep 30, 2026•0 citations
Circuit cutting allows quantum circuits to be evaluated on smaller devices at the cost of additional sampling and classical reconstruction. For Hamiltonian-simulation circuits, the target unitary exp⁡[itH]\exp[it\mathbf H]exp[itH] connects this decomposition problem to the structure of the generator. We develop a Hamiltonian-level certificate that assesses exact separability and the accuracy of independent module evolution before a gate decomposition is chosen. For a time-independent Hamiltonian and a fixed module partition, the Hilbert--Schmidt projection onto sums of module-local terms isolates a cross-module residual HnsH_{ns}Hns​. Its vanishing is necessary and sufficient for product evolution at all times; for Pauli-list inputs, this condition is checked in one pass over the combined coefficients. When Hns≠0H_{ns}\ne0Hns​=0, the projected evolution has operator-norm error at most ∣t∣∣∣Hns∣∣op|t| ||H_{ns}||_{op}∣t∣∣∣Hns​∣∣op​. Across a bipartition, an explicit first-order algebraic correction has the same operator-Schmidt rank as HnsH_{ns}Hns​ and leaves a second-order residual. The same Hamiltonian residual connects this approximation to short-time entanglement, determining the leading state-space and operator-space entangling powers and, through its Schmidt spectrum, the leading Choi tripartite-information terms. Numerical experiments test these relations and demonstrate block-factorised simulation up to 202020 qubits.
Abstract. We present a validated computational testbed for studying product-formula errorin a lattice gauge theory. For the lattice Schwinger model (1+1D QED, Kogut–Susskindstaggered fermions, gauge field eliminated via Gauss’s law) we construct three references —exact diagonalization, classical second-order Trotter evolution, and a gate-level Qiskit circuit— and cross-check them against each other and against published conventions. The firsttwo are independent; the second and third share the Hamiltonian construction and Paulidecomposition, so their agreement verifies the gate decomposition and circuit implementationrather than the physics, which is validated against the exact solution instead. The gate-levelcircuit reproduces the classical Trotter propagator to 7.6×10−14 after accumulated repetitions,so that the residual difference from exact evolution isolates the physical Trotter error cleanly;the Hamiltonian is verified term-by-term against Nguyen et al., and the Pauli decompositionagainst direct matrix construction, in both cases to machine precision.We then demonstrate the testbed on three questions from the existing literature. First, thecommutator-scaling bound of Childs et al. (2021), evaluated with prefactors derived numerically rather than assumed, overestimates the measured operator-norm error by a factor between1.5 and 6.8 across nine parameter points (median 2.0), rising with system size and coupling;at the reference point the ratio is 1.74, constant to three significant figures over the testedrange ∆t ∈ [1/512, 1/16]. Second, operator-norm, state, and observable errors all give fittedexponents statistically consistent with p = 2 but markedly different prefactors; we introduce anormalisation-independent gap factor G to quantify this, finding G numerically constant overthe tested ∆t range and increasing across the four accessible system sizes. We show that thisgrowth reflects the growth of the state error while the local-observable error stays constantto five significant figures — the local-versus-global robustness established by Heyl, Hauke andZoller (2019), for which we claim no priority. Third, the ordering heuristics of Tranter et al.(2019), established on 44 molecular Hamiltonians, reproduce all four of their reported trendsat the parameter point tested here — the fourth in sharpened form, the norm-based estimatorranking orderings slightly backwards (ρ = −0.292) rather than merely failing to rank them.The contribution is the validated testbed and its convention bookkeeping rather than newtheory: all three demonstrations are measurements of known results, and in the case of theobservable gap, a re-derivation of a known result in a different language. Reference [5] studiesthe same model with the same decomposition and initial state, using a first-order formula inthe long-time limit; the present work uses the second-order symmetric formula at short timeand compares against the 2021 commutator-scaling bound, which postdates that study. Codefor all reported figures and tables is provided.
Simulation of quantum many-body systems is a principal application of quantum computing, but available devices remain limited by the number of qubits and cannot accommodate systems of the desired size. One approach is to host a large evolution across several modest distributed systems that exchange classical information alone. Current protocols such as circuit knitting incur a quasi-probability sampling cost that grows exponentially with the number of remote gates across the cut, even when physical correlations across the cut are actually bounded. In this work, we present a truncated hybrid tensor network (THTN) framework in which a remote two-body gate is applied as a sum of local unitaries on the subsystems, linked by a classical connecting tensor, and an interface truncation retains Schmidt modes across the cut. Remote gates between the same subsystems can be merged on one connector, so non-one-dimensional models, such as layered partitions with strong intra-layer and weaker interlayer couplings, may be cast onto a one-dimensional cut. The retained non-negative Schmidt coefficients also define a sampling rule for local observables. We validate this distributed protocol by classical simulation against time-evolving block decimation (TEBD) at the same bond dimension. The truncated dynamics track the TEBD references on chains and ladders, with the clearest gain on a layered model.
We aim to rigorously address how local noise affects classical simulability of quantum dynamics benchmarked by tensor-network methods. Using operator entanglement entropy (OEE), we prove the following: (1) For single-qubit depolarizing noise on arbitrary circuits, tensor networks with poly(n)\mathrm{poly}(n)poly(n) bond dimension suffice for fixed absolute Hilbert-Schmidt error after $\order{1}$ depth, while relative error demands $\order{\log n}$ depth; and this bound is optimal. (2) For single-qubit depolarizing noise on 1D local circuits, the existence of whole-trajectory error-bounded matrix product operator (MPO) of poly(n)\mathrm{poly}(n)poly(n) bond dimension at all depths. (3) For general single-qubit noise in 1D brickwall circuits, random two-design gates with contraction coefficient c<1/3c<1/3c<1/3 yield an $\order{1}$ OEE plateau with probability 1−Te−Ω(n)1-Te^{-Ω(n)}1−Te−Ω(n), while arbitrary gates with c<1/48c<1/48c<1/48 give $\order{\log n}$ OEE in the worst case. (4) In higher dimensions, these bounds yield uniform-in-depth poly(n)\mathrm{poly}(n)poly(n) average boundary-bond dimensions for projected entangled pair operators~(PEPO) across every cut -- under depolarizing noise at either absolute or relative accuracy, and under general noise with strong contraction at absolute accuracy. Our results establish a rigorous connection between certain noise models, circuit types, and their classical simulability.
We establish tight connections between entanglement entropy and the approximation error in Trotter-Suzuki product formulas for Hamiltonian simulation. Product formulas remain the workhorse of quantum simulation on near-term devices, yet standard error analyses yield worst-case bounds that can vastly overestimate the resources required for structured problems. For systems governed by geometrically local Hamiltonians with maximum entanglement entropy SmaxS_\text{max}Smax​ across all bipartitions, we prove that the first-order Trotter error scales as O(t2Smaxpolylog⁡(n)/r)\mathcal{O}(t^2 S_\text{max} \operatorname{polylog}(n)/r)O(t2Smax​polylog(n)/r) rather than the worst-case O(t2n/r)\mathcal{O}(t^2 n/r)O(t2n/r), where nnn is the system size and rrr is the number of Trotter steps. This yields improvements of Ω~(n2)\tildeΩ(n^2)Ω~(n2) for one-dimensional area-law systems and Ω~(n3/2)\tildeΩ(n^{3/2})Ω~(n3/2) for two-dimensional systems. We extend these bounds to higher-order Suzuki formulas, where the improvement factor involves 2pS∗/22^{pS^*/2}2pS∗/2 for the ppp-th order formula. We further establish a separation result demonstrating that volume-law entangled systems fundamentally require Ω~(n)\tildeΩ(n)Ω~(n) more Trotter steps than area-law systems to achieve the same precision. This separation is tight up to logarithmic factors. Our analysis combines Lieb-Robinson bounds for locality, tensor network representations for entanglement structure, and novel commutator-entropy inequalities that bound the expectation value of nested commutators by the Schmidt rank of the state. These results have immediate applications to quantum chemistry, condensed matter simulation, and resource estimation for fault-tolerant quantum computing.
Understanding the dynamics of interacting quantum systems is a central goal of quantum simulation. For geometrically local Hamiltonians, locality suggests that digital simulation should retain much of the parallelism of the underlying dynamics. For a target accuracy εεε, we construct a nearest-neighbor quantum circuit that simulates the dynamics of an nnn-qubit, time-independent, finite-range Hamiltonian with normalized local interaction strength on a fixed-dimensional lattice for time T≥1T\ge1T≥1, with circuit depth O(Tlog⁡(nT/ε))O(T\log(nT/ε))O(Tlog(nT/ε)) and gate count O(nTlog⁡(nT/ε))O(nT\log(nT/ε))O(nTlog(nT/ε)). This reduces the polylogarithmic overhead of Haah, Hastings, Kothari, and Low to a single logarithm. On logarithmic-scale blocks from the Lieb--Robinson decomposition, a shallow but highly accurate implementation is essential for reducing the circuit depth. Our key observation is that spatial localization also controls the cost of high precision. In each block, the error of a constant-order product formula is compensated for by a correction, yielding exponential accuracy. The correction can be implemented with depth proportional to the block diameter, introducing no additional asymptotic depth scale beyond that required by spatial localization. Furthermore, we prove an unconditional circuit-depth lower bound for uniform XXZ Hamiltonians: at fixed evolution time TTT in the stated regime and sufficiently small fixed error εεε, any nearest-neighbor quantum circuit simulating these dynamics requires depth Ω(log⁡n/log⁡log⁡n)Ω(\log n/\log\log n)Ω(logn/loglogn). This matches our O(log⁡n)O(\log n)O(logn) upper bound up to a doubly logarithmic factor, establishing near-optimal circuit depth for lattice Hamiltonian simulation in this regime. Together, these results clarify the role of locality and precision in determining the circuit complexity of quantum dynamics and suggest broader principles for spatially constrained quantum computation.
Hamiltonian simulation is a central application of quantum computing. Randomized Hamiltonian simulation approximates the target dynamics by sampling quantum circuits and often allows simpler circuit implementations. We develop a framework for randomized Hamiltonian simulation in which Hamiltonian terms are sampled with arbitrary probabilities and the corresponding short-time evolutions are implemented sequentially. The leading channel error relative to ideal time evolution is governed by the variance of the sampled generators. Minimizing the variance-based upper bound on the worst-case error recovers qDRIFT, a leading randomized Hamiltonian simulation algorithm that samples terms in proportion to their operator norms. For typical input states, however, this sampling distribution need not be optimal. Minimizing Haar-averaged error bounds instead yields sampling probabilities proportional to the Hilbert-Schmidt norms of the terms. This choice can provide smaller average-error bounds than conventional qDRIFT. For Hamiltonians expressed as sums of Pauli strings, we combine this framework with commuting Pauli grouping to obtain smaller error bounds than conventional qDRIFT at fixed RzR_zRz​ depth. Numerical benchmarks for the Sachdev-Ye-Kitaev model show error-bound improvement factors consistent with linear scaling in the number of qubits. For the 108-qubit FeMoco Hamiltonian, the error bounds are reduced by a factor of about 5.65. These results establish average-error optimization as a practical design principle for randomized Hamiltonian simulation.