Variational preparation of normal matrix product states on quantum computers

• URL: http://arxiv.org/abs/2503.09683v3
• Date: Mon, 01 Sep 2025 09:32:37 GMT
• Title: Variational preparation of normal matrix product states on quantum computers
• Abstract summary: We show that matrix product states can be prepared with shallow circuits on quantum computers.<n>We use ADAPT-AQC, an adaptive-ansatz preparation algorithm, and introduce a generalised initialisation procedure for the existing AQC-Tensor algorithm.<n>Our results demonstrate how the integration of quantum and classical resources can push the boundary of what can be studied on quantum computers.
• Score: 0.3173119584173978
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Preparing matrix product states (MPSs) on quantum computers is an essential routine in the simulation of many-body physics. However, widely-used schemes based on staircase circuits are often too deep to execute on current hardware. Here we demonstrate that MPSs with short-range correlations can be prepared with shallow circuits by leveraging heuristics from approximate quantum compiling (AQC). We achieve this with ADAPT-AQC, an adaptive-ansatz preparation algorithm, and introduce a generalised initialisation procedure for the existing AQC-Tensor algorithm. We first compare these methods for the task of preparing a molecular electronic structure ground state. We then use them to prepare an antiferromagnetic (AFM) ground state of the 50-site Heisenberg XXZ spin chain near the AFM-XY phase boundary. Through the execution of circuits with up to 59 CZ depth and 1251 CZ gates, we perform a global quench and observe the relaxation of magnetic ordering in a parameter regime previously inaccessible due to deep ground state preparation circuits. Our results demonstrate how the integration of quantum and classical resources can push the boundary of what can be studied on quantum computers.

Related papers

• Shallow Electronic State Preparation for Quantum Chemistry with Quantum Monte Carlo Pre-Selection [0.0]
  Quantum computers hold great promise for molecular simulation, but noise remains a fundamental obstacle.<n>We introduce a Quantum Monte Carlo (QMC) pre-screening procedure that constructs compact, physically motivated Givens rotation anstze tailored to realistic quantum hardware.
  arXiv  Detail & Related papers  (2026-05-29T10:47:49Z)
• Preparing 100-qubit symmetry-protected topological order on a digital quantum computer [0.0]
  Demonstrating symmetry-protected quantum matter at scale is a key milestone in using quantum hardware to probe emergent many-body phenomena.<n>Here we use a tensor network based approximate quantum compiling (AQC) protocol to construct shallow quantum circuits.<n>The resulting states exhibit all defining signatures of SPT order including non-local string order for strings of up to length 20, characteristic degeneracies in the entanglement spectrum and clear evidence of symmetry-protected edge modes.
  arXiv  Detail & Related papers  (2026-03-06T14:27:20Z)
• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Preparation of initial states with open and periodic boundary conditions on quantum devices using matrix product states [1.2114406358819847]
  We present a framework for preparing quantum states from matrix product states (MPS) with open and periodic boundary conditions on quantum devices.<n>States with periodic boundary conditions (pbc) can be represented efficiently as quantum circuits using ancilla qubits and post-selection after measurement.<n>Our approach provides a scalable method for preparing states on a quantum device, enabling efficient simulations of strongly correlated systems on near-term quantum computers.
  arXiv  Detail & Related papers  (2025-10-08T15:19:33Z)
• Simulating quantum circuits with restricted quantum computers [0.0]
  This thesis is dedicated to the simulation of nonlocal quantum computation using local quantum operations. We characterize the optimal simulation overhead for a broad range of practically relevant nonlocal states and channels. We also investigate the utility of classical communication between the local parties.
  arXiv  Detail & Related papers  (2025-03-27T17:59:45Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Universal quantum computation using quantum annealing with the transverse-field Ising Hamiltonian [0.0]
  We present a practical method for implementing universal quantum computation using the transverse-field Ising Hamiltonian.<n>Our proposal is compatible with D-Wave devices, opening up possibilities for realizing large-scale gate-based quantum computers.
  arXiv  Detail & Related papers  (2024-02-29T12:47:29Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• 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)
• Scalable Quantum Ground State Preparation of the Heisenberg Model: A Variational Quantum Eigensolver Approach [0.0]
  Variational Quantumsolver (VQE) algorithm is a system composed of a quantum circuit and a classical Eigenational Quantumsolver. We present an ansatz capable of preparing the ground states for all possible values of the coupling, including the critical states for the anisotropic XXZ model.
  arXiv  Detail & Related papers  (2023-08-23T09:26:34Z)
• GASP -- A Genetic Algorithm for State Preparation [0.0]
  We present a genetic algorithm for state preparation (GASP) which generates relatively low-depth quantum circuits for initialising a quantum computer in a specified quantum state. GASP can produce more efficient circuits of a given accuracy with lower depth and gate counts than other methods.
  arXiv  Detail & Related papers  (2023-02-22T04:41:01Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Exploring the optimality of approximate state preparation quantum circuits with a genetic algorithm [0.0]
  We study the approximate state preparation problem on noisy intermediate-scale quantum (NISQ) computers. We apply a genetic algorithm to generate quantum circuits for state preparation. We find substantial improvements to the fidelity in preparing Haar random states with a limited number of CNOT gates.
  arXiv  Detail & Related papers  (2022-10-12T17:06:05Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Classical variational simulation of the Quantum Approximate Optimization Algorithm [0.0]
  We introduce a method to simulate layered quantum circuits consisting of parametrized gates. A neural-network parametrization of the many-qubit wave function is used. For the largest circuits simulated, we reach 54 qubits at 4 QAOA layers.
  arXiv  Detail & Related papers  (2020-09-03T15:55:27Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.