Efficient tensor-network simulations of weakly-measured quantum circuits

• URL: http://arxiv.org/abs/2510.07211v1
• Date: Wed, 08 Oct 2025 16:46:47 GMT
• Title: Efficient tensor-network simulations of weakly-measured quantum circuits
• Authors: Darren Pereira, Leonardo Banchi,
• Abstract summary: We present a tensor-network-based method for simulating a weakly-measured quantum circuit.<n>In particular, we use a Markov chain to efficiently sample measurements and contract the tensor network, propagating their effect forward along the direction.<n> Applications of our algorithm include validating quantum computers in regimes of easy classical simulability, and studying generative-machine-learning applications.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a tensor-network-based method for simulating a weakly-measured quantum circuit. In particular, we use a Markov chain to efficiently sample measurements and contract the tensor network, propagating their effect forward along the spatial direction. Applications of our algorithm include validating quantum computers (capable of mid-circuit measurements) in regimes of easy classical simulability, and studying generative-machine-learning applications, where sampling from complex stochastic processes is the main task. As a demonstration of our algorithm, we consider a (1+1)-dimensional brickwall circuit of Haar-random unitaries, interspersed with generalized single-qubit measurements of variable strength. We simulate the dynamics for tens to hundreds of qubits if the circuit exhibits area-law entanglement (under strong measurements), and tens of qubits if it exhibits volume-law entanglement (under weak measurements). We observe signatures of a measurement-induced phase transition between the two regimes as a function of measurement strength.

Related papers

• Observation of Robust and Coherent Non-Abelian Hadron Dynamics on Noisy Quantum Processors [0.0]
  This study reports the quantum simulation of hadron dynamics within a $ (1+1)$-dimensional SU(2) lattice gauge theory using a 156-qubit IBM superconducting processor.<n>We successfully observe the continuum-cone propagation of a confined meson and internal oscillations indicative of early-time had breathing modes.<n>Results establish a scalable pathway for simulating non-Abelian dynamics on near-term quantum hardware.
  arXiv  Detail & Related papers  (2026-02-20T09:09:55Z)
• Classical Simulations of Low Magic Quantum Dynamics [0.1666604949258699]
  We develop algorithms for adaptive quantum circuits that produce states with low levels of magic.<n>These algorithms are particularly well-suited to circuits with high rates of Pauli measurements.<n>We study the dynamics of all-to-all monitored quantum circuits with a sub-extensive rate of $T$-gates per unit of circuit depth.
  arXiv  Detail & Related papers  (2025-08-27T20:17:15Z)
• Measurement-driven quantum advantages in shallow circuits [0.3683202928838613]
  Quantum advantage schemes probe the boundary between classically simulatable quantum systems and those that go beyond this realm.<n>Here, we introduce a constant-depth measurement-driven approach for efficiently sampling from a broad class of dense instantaneous quantum-time circuits.
  arXiv  Detail & Related papers  (2025-05-07T18:00:51Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response.<n>We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Quantum tensor network algorithms for evaluation of spectral functions on quantum computers [0.0]
  We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems.<n>We demonstrate algorithms to prepare ground and excited states on a quantum computer and apply them to molecular nanomagnets (MNMs) as a paradigmatic example.
  arXiv  Detail & Related papers  (2023-09-26T18:01:42Z)
• Observation of multiple steady states with engineered dissipation [19.94001756170236]
  We introduce engineered noise into a one-dimensional ten-qubit superconducting quantum processor to emulate a generic many-body open quantum system. We find that the information saved in the initial state maintains in the steady state driven by the continuous dissipation on a five-qubit chain.
  arXiv  Detail & Related papers  (2023-08-25T08:06:44Z)
• Applicability of Measurement-based Quantum Computation towards Physically-driven Variational Quantum Eigensolver [17.975555487972166]
  Variational quantum algorithms are considered one of the most promising methods for obtaining near-term quantum advantages. The roadblock to developing quantum algorithms with the measurement-based quantum computation scheme is resource cost. We propose an efficient measurement-based quantum algorithm for quantum many-body system simulation tasks, called measurement-based Hamiltonian variational ansatz (MBHVA)
  arXiv  Detail & Related papers  (2023-07-19T08:07:53Z)
• Tensor-network-assisted variational quantum algorithm [3.5995214208007944]
  We present a framework for tensor-network-assisted variational quantum algorithms. We show that our approach consistently outperforms conventional methods using shallow quantum circuits.
  arXiv  Detail & Related papers  (2022-12-20T16:59:54Z)
• Logical Abstractions for Noisy Variational Quantum Algorithm Simulation [25.515765956985188]
  Existing quantum circuit simulators do not address the common traits of variational algorithms. We present a quantum circuit simulation toolchain based on logical abstractions targeted for simulating variational algorithms.
  arXiv  Detail & Related papers  (2021-03-31T17:20:13Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.