Combining non-parametric quantum states and MERA tensor networks for ground-state optimization

• URL: http://arxiv.org/abs/2605.21447v1
• Date: Wed, 20 May 2026 17:35:43 GMT
• Title: Combining non-parametric quantum states and MERA tensor networks for ground-state optimization
• Abstract summary: We introduce an alternative strategy that combines a non-parametric quantum state prepared through quantum annealing and a classical isometric tensor network.<n>We demonstrate the feasibility of this approach through extensive numerical simulations on the transverse-field Ising model.<n>Our results indicate that our newly proposed setup improves the accuracy of the obtained ground state approximation compared to the original quantum simulation.
• Score: 0.5833117322405447
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hybrid tensor networks offer a promising route to enhance the expressivity of classical tensor network methods by incorporating quantum states prepared on a quantum computer. Existing approaches are limited by the variational optimization of the quantum component of the tensor network. In this work, we introduce an alternative strategy that combines a non-parametric quantum state prepared through quantum annealing and a classical isometric tensor network. The latter is variationally optimized while the former is used as a fixed, boundary tensor resource in the form of classical shadows. We demonstrate the feasibility of this approach through extensive numerical simulations on the transverse-field Ising model, showing that the optimization procedure remains robust under statistical and hardware noise. Moreover, our results indicate that our newly proposed setup improves the accuracy of the obtained ground state approximation compared to the original quantum simulation, without increasing the depth of the applied quantum circuits. Therefore, this setup offers a practical route to scale variational quantum algorithms towards the quantum utility scale.

Related papers

• Pre-optimization of quantum circuits, barren plateaus and classical simulability: tensor networks to unlock the variational quantum eigensolver [0.0]
  Variational quantum algorithms are practical approaches to prepare ground states, but their potential for quantum advantage remains unclear.<n>We use differentiable 2D tensor networks (TN) to optimize parameterized quantum circuits that prepare the ground state of the transverse field Ising model (TFIM)<n>We show that TN pre-optimization can mitigate the barren plateau issue by giving access to enhanced gradient zones that do not shrink exponentially with system size.
  arXiv  Detail & Related papers  (2026-02-04T15:49:55Z)
• Optimizing two-dimensional isometric tensor networks with quantum computers [0.5437050212139087]
  We propose a hybrid quantum-classical algorithm for approximating the ground state of two-dimensional quantum systems.<n>Inspired by the density matrix renormalization group, we optimize tensors sequentially by diagonalizing a series of effective Hamiltonians.<n>We demonstrate our method on the two-dimensional (2D) transverse-field Ising model, achieving ground-state optimization on up to 25 qubits with modest quantum overhead.
  arXiv  Detail & Related papers  (2025-11-17T19:00:03Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Scalable Imaginary Time Evolution with Neural Network Quantum States [0.0]
  The representation of a quantum wave function as a neural network quantum state (NQS) provides a powerful variational ansatz for finding the ground states of many-body quantum systems. We introduce an approach that bypasses the computation of the metric tensor and instead relies exclusively on first-order descent with Euclidean metric. We make this method adaptive and stable by determining the optimal time step and keeping the target fixed until the energy of the NQS decreases.
  arXiv  Detail & Related papers  (2023-07-28T12:26:43Z)
• Tensor train optimization of parametrized quantum circuits [0.0]
  We consider parametrized quantum circuits composed of a low-depth hardware-efficient ansatz and Hamiltonian variational ansatz. We discuss on the advantage of using tensor train based optimization, especially in the presence of noise.
  arXiv  Detail & Related papers  (2023-06-03T06:50:00Z)
• 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)
• Evaluating the Convergence of Tabu Enhanced Hybrid Quantum Optimization [58.720142291102135]
  We introduce the Tabu Enhanced Hybrid Quantum Optimization metaheuristic approach useful for optimization problem solving on a quantum hardware. We address the theoretical convergence of the proposed scheme from the viewpoint of the collisions in the object which stores the tabu states, based on the Ising model.
  arXiv  Detail & Related papers  (2022-09-05T07:23:03Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Autoregressive Transformer Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation [5.668795025564699]
  We present an approach for tackling open quantum system dynamics. We compactly represent quantum states with autoregressive transformer neural networks. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator.
  arXiv  Detail & Related papers  (2020-09-11T18: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.