Noisy quantum circuit simulation with the tensor jump method
- URL: http://arxiv.org/abs/2607.01323v2
- Date: Fri, 03 Jul 2026 15:41:15 GMT
- Title: Noisy quantum circuit simulation with the tensor jump method
- Abstract summary: We introduce a variance-aware tensor network framework that combines the tensor jump method with local TDVP gate evolution on matrix product states and sparse Pauli-Lindblad hardware noise models.<n>We demonstrate accurate, scalable noisy-circuit simulation on a 25-qubit noisy XY quench and IBM's 127-qubit kicked-Ising benchmark with long-range depolarizing noise.
- Score: 4.323508970487569
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Classical simulation of noisy quantum circuits is essential for validating algorithms, benchmarking hardware, and assessing error-mitigation strategies, but remains limited by the exponential cost of density-matrix methods and the high variance of standard trajectory sampling. We introduce a variance-aware tensor network framework that combines the tensor jump method with local TDVP gate evolution on matrix product states and sparse Pauli-Lindblad hardware noise models. Gates are applied as short variational evolutions on the MPS manifold, while noise is sampled per circuit window from Pauli-Lindblad jump sets with state-independent hazards and dissipative contractions that reduce to irrelevant global factors after renormalization. The method supports correlated multi-qubit Lindblad noise consistent with hardware connectivity, including long-range operators on non-adjacent qubits, enabling direct simulation of crosstalk and other connectivity-induced errors beyond local noise models. We develop two unbiased variance-aware unravelings. An analog unitary-mixture unraveling matches the Lindblad generator exactly under symmetric Gaussian or two-point angle laws, while a projector-jump unraveling yields state-independent hazards and closed-form variance laws. Both retain the standard 1/sqrt(N) Monte Carlo convergence but with reduced prefactors. Empirically, projector sampling strongly reduces trajectory variance and bond-dimension growth across many circuit architectures, whereas analog sampling is most effective at weak noise. We demonstrate accurate, scalable noisy-circuit simulation on a 25-qubit noisy XY quench and IBM's 127-qubit kicked-Ising benchmark with long-range depolarizing noise, achieving reduced Monte Carlo variance and favorable MPS bond-dimension growth compared with standard Kraus-insertion baselines.
Related papers
- Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
arXiv Detail & Related papers (2026-08-25T15:07:11Z) - Closed-Form Spectral Regularization for Multi-Task Model Merging [96.82449201305234]
Model merging combines several independently fine-tuned experts into a single multi-task model without any training data.<n>State-of-the-art merging methods formulate merging as a layer-wise interference problem.<n>We propose SWUDI, a closed-form method that combines a soft exponential filter, which matches the gradient-flow trajectory of iterative descent.
arXiv Detail & Related papers (2026-06-05T14:00:47Z) - Hybrid Gaussian-exponential zero-noise extrapolation for periodic circuits [2.932287734903261]
We introduce a hybrid Gaussian-exponential extrapolation scheme tailored for quantum circuits with periodic structure.<n>For moderate to large circuit depths, the hybrid model yields measurable reductions in bias relative to previous extrapolation variants.
arXiv Detail & Related papers (2026-05-28T02:01:03Z) - Normalized Architectures are Natively 4-Bit [49.13186675123547]
nGPT, an architecture that constrains weights and hidden representations to the unit hypersphere, is inherently more robust to low-precision arithmetic.<n>We validate this approach on both a 1.2B dense model and hybrid (Mamba-Transformer) MoE models of up to 3B/30B parameters.
arXiv Detail & Related papers (2026-05-07T11:54:07Z) - Continuous Noise Model for Quantum Circuits [0.6335848702857038]
We study a continuous coherent noise model for quantum circuits and compare it with a discrete Pauli model.<n>The focus is on small coherent gate errors that build up across circuit depth.<n>Results show that continuous coherent noise can degrade logical performance more strongly than Pauli noise.
arXiv Detail & Related papers (2026-04-28T18:00:03Z) - Optimal and improved gate decompositions for accelerated classical simulation of near-Gaussian fermionic circuits [0.13764085113103217]
We derive analytic decompositions for key non-Gaussian gates and channels.<n>We show that Pauli noise can reduce the effective extent of non-Gaussian rotation gates, but that fermionic magic is substantially more robust to such noise than stabilizer magic.
arXiv Detail & Related papers (2026-03-19T13:13:41Z) - Agnostic Dynamical Decoupling for Single-Qubit Gates [0.0]
We introduce a method for designing smooth single-qubit control pulses that implement a desired gate.<n>Unlike dynamically corrected gate constructions that require prior knowledge of the noise model, the present approach is agnostic to the detailed form of the target-bath interaction.
arXiv Detail & Related papers (2026-03-13T18:00:09Z) - Accurate and Honest Approximation of Correlated Qubit Noise [39.58317527488534]
We propose an efficient systematic construction of approximate noise channels, where their accuracy can be enhanced by incorporating noise components with higher qubit-qubit correlation degree.<n>We find that, for realistic noise strength typical for fixed-frequency superconducting qubits, correlated noise beyond two-qubit correlation can significantly affect the code simulation accuracy.
arXiv Detail & Related papers (2023-11-15T19:00:34Z) - Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits.
For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
arXiv Detail & Related papers (2023-05-03T11:27:50Z) - Robust Control for Dynamical Systems With Non-Gaussian Noise via Formal
Abstractions [59.605246463200736]
We present a novel controller synthesis method that does not rely on any explicit representation of the noise distributions.
First, we abstract the continuous control system into a finite-state model that captures noise by probabilistic transitions between discrete states.
We use state-of-the-art verification techniques to provide guarantees on the interval Markov decision process and compute a controller for which these guarantees carry over to the original control system.
arXiv Detail & Related papers (2023-01-04T10:40:30Z) - Sampling-Based Robust Control of Autonomous Systems with Non-Gaussian
Noise [59.47042225257565]
We present a novel planning method that does not rely on any explicit representation of the noise distributions.
First, we abstract the continuous system into a discrete-state model that captures noise by probabilistic transitions between states.
We capture these bounds in the transition probability intervals of a so-called interval Markov decision process (iMDP)
arXiv Detail & Related papers (2021-10-25T06:18:55Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.