Sampling isometric tensor network states with monitored quantum circuits
- URL: http://arxiv.org/abs/2608.18511v1
- Date: Wed, 19 Aug 2026 03:57:05 GMT
- Title: Sampling isometric tensor network states with monitored quantum circuits
- Abstract summary: We parameterize two-dimensional quantum states using variational PEPS subject to constraints.<n>We map the resulting ansatz onto monitored quantum contraction circuits.<n>This approach provides a hybrid quantum-classical framework for two-dimensional quantum-body systems.
- Score: 1.137457877869062
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Projected entangled pair states (PEPS) provide an efficient variational ansatz for two-dimensional quantum phases, but computing observables remains challenging because PEPS contraction is generally costly. Here, we parameterize two-dimensional quantum states using variational PEPS subject to isometric constraints and map the resulting ansatz onto monitored quantum circuits, replacing tensor-network contraction with circuit sampling. For infinite cylinders, the transfer matrix defines a quantum channel on the virtual boundary. We use a fixed-point treatment and a monitored-circuit unraveling of this channel to evaluate observables efficiently. Using a constant number of variational parameters and a number of qubits that scales only with the cylinder width, our method yields a phase diagram for the $J_1$-$J_2$ model in qualitative agreement with DMRG results. Because the monitored circuits are compatible with near-term quantum hardware, this approach provides a hybrid quantum-classical framework for simulating two-dimensional quantum many-body systems.
Related papers
- Tangent Space Excitation Ansatz for Quantum Circuits [0.0]
We introduce a textittangent-space excitation ansatz for quantum circuits.<n>We show that a large number of low-energy states can be accurately captured.
arXiv Detail & Related papers (2025-07-10T11:22:13Z) - 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) - Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Simulating electronic structure on bosonic quantum computers [34.84696943963362]
We propose an approach to map the electronic Hamiltonian into a qumode bosonic problem that can be solved on bosonic quantum devices.<n>This work establishes a new pathway for simulating many-fermion systems, highlighting the potential of hybrid qubit-qumode quantum devices.
arXiv Detail & Related papers (2024-04-16T02:04:11Z) - Simulating 2D topological quantum phase transitions on a digital quantum computer [3.727382912998531]
Efficient preparation of many-body ground states is key to harnessing the power of quantum computers in studying quantum many-body systems.
We propose a simple method to design exact linear-depth parameterized quantum circuits which prepare a family of ground states across topological quantum phase transitions in 2D.
We show that the 2D isoTNS can also be efficiently simulated by a holographic quantum algorithm requiring only an 1D array of qubits.
arXiv Detail & Related papers (2023-12-08T15:01:44Z) - Mapping quantum circuits to shallow-depth measurement patterns based on
graph states [0.0]
We create a hybrid simulation technique for measurement-based quantum computing.
We show that groups of fully commuting operators can be implemented using fully-parallel, i.e., non-adaptive, measurements.
We discuss how such circuits can be implemented in constant quantum depths by employing quantum teleportation.
arXiv Detail & Related papers (2023-11-27T19:00:00Z) - 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) - Quantum Computation of Phase Transition in Interacting Scalar Quantum
Field Theory [0.0]
It has been demonstrated that the critical point of the phase transition in scalar quantum field theory can be approximated via a Gaussian Effective Potential (GEP)
We perform quantum computations with various lattice sizes and obtain evidence of a transition from a symmetric to a symmetry-broken phase.
We implement the ten-site case on IBM quantum hardware using the Variational Quantum Eigensolver (VQE) algorithm to minimize the GEP.
arXiv Detail & Related papers (2023-03-04T14:11:37Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Quantum algorithms for grid-based variational time evolution [36.136619420474766]
We propose a variational quantum algorithm for performing quantum dynamics in first quantization.
Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
arXiv Detail & Related papers (2022-03-04T19:00:45Z) - Quantum Statistical Complexity Measure as a Signalling of Correlation
Transitions [55.41644538483948]
We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions.
We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain.
We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
arXiv Detail & Related papers (2020-02-05T00:45:21Z)
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.