Pith. sign in

REVIEW 5 cited by

Variational preparation of normal matrix product states on quantum computers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.09683 v3 pith:DIHAECYB submitted 2025-03-12 quant-ph

Variational preparation of normal matrix product states on quantum computers

classification quant-ph
keywords quantumcircuitscomputersgroundpreparationstatealgorithmboundary
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Preparation Circuits for Matrix Product States by Classical Variational Disentanglement

    quant-ph 2025-04 unverdicted novelty 7.0

    A layer-by-layer classical variational disentanglement algorithm compiles preparation circuits for matrix product states by minimizing bipartite entanglement to reduce bond dimensions.

  2. Bowtie VarQTE: A Resource-Efficient Quantum State Preparation Primitive

    quant-ph 2026-05 unverdicted novelty 6.0

    Bowtie VarQTE is a hybrid classical-quantum variational time evolution method that exploits causal light-cones to reduce quantum resource use for state preparation while achieving fidelities comparable to approximate ...

  3. Variational Thermal State Preparation on Digital Quantum Processors Assisted by Matrix Product States

    quant-ph 2025-10 unverdicted novelty 6.0

    A variational framework assisted by matrix product states prepares approximate thermal Gibbs states for 1D lattices up to 30 sites and 2D lattices up to 6x6 using up to 44 qubits, with a demonstration on IBM Heron hardware.

  4. How Hard Is Quantum Advantage? A Cloud Microphysics Stress Test for Variational Quantum Models

    quant-ph 2026-07 conditional novelty 5.0

    Even after rich frequency encoding, classical post-processing, and extensive hyperparameter search, hybrid QNNs underperform simple FCNNs on cloud microphysics parameterization.

  5. Time-Efficient Quantum Many-Body State Synthesis and its Optimization via Warm Start Strategies

    quant-ph 2025-11 conditional novelty 5.0

    Short-time evolution under an optimized constant two-body solver Hamiltonian can prepare Heisenberg ground states with ~99.9% fidelity, provided warm starts are combined with incremental coupling ramps.