Preparation Circuits for Matrix Product States by Classical Variational Disentanglement
arXiv:2504.21298 · doi:10.1103/7x2g-twkl
Abstract
We study the classical compilation of quantum circuits for the preparation of matrix product states (MPS), which are quantum states of low entanglement with an efficient classical description. Our algorithm represents a near-term alternative to previous sequential approaches by reverse application of a disentangler, which can be found by minimizing bipartite entanglement measures after the application of a layer of parameterized disentangling gates. Since a successful disentangler is expected to decrease the bond dimension on average, such a layer-by-layer optimization remains classically efficient even for deep circuits. Additionally, as the Schmidt coefficients of all bonds are locally accessible through the canonical - form of an MPS, the optimization algorithm can be heavily parallelized. We discuss guarantees and limitations to trainability and show numerical results for ground states of one-dimensional, local Hamiltonians as well as artificially spread out entanglement among multiple qubits using error correcting codes.
10+6 pages, 5+1 Figures, version essentially identical to the one published in PRA
References in corpus (32)
- The density-matrix renormalization group in the age of matrix product states
- Efficient classical simulation of slightly entangled quantum computations
- Barren plateaus in quantum neural network training landscapes
- An Area Law for One Dimensional Quantum Systems
- The ITensor Software Library for Tensor Network Calculations
- Matrix product states represent ground states faithfully
- Entropy scaling and simulability by Matrix Product States
- Sequential generation of entangled multi-qubit states
- Variational quantum algorithms for nonlinear problems
- Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory
- Strategies for solving the Fermi-Hubbard model on near-term quantum computers
- Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
- On entropy growth and the hardness of simulating time evolution
- Preparation of matrix product states with log-depth quantum circuits
- Classically optimized Hamiltonian simulation
- Does provable absence of barren plateaus imply classical simulability?
- Towards adiabatic quantum computing using compressed quantum circuits
- Constant-depth preparation of matrix product states with adaptive quantum circuits
- Error propagation in NISQ devices for solving classical optimization problems
- Variational Hamiltonian simulation for translational invariant systems via classical pre-processing
- High-fidelity realization of the AKLT state on a NISQ-era quantum processor
- Probing the Kitaev honeycomb model on a neutral-atom quantum computer
- Multi-sliced Gausslet Basis Sets for Electronic Structure
- Approximate encoding of quantum states using shallow circuits
- Probing non-equilibrium topological order on a quantum processor
- Problem specific classical optimization of Hamiltonian simulation
- Efficient MPS representations and quantum circuits from the Fourier modes of classical image data
- Approximate Quantum Compiling for Quantum Simulation: A Tensor Network based approach
- Quantum Tensor Product Decomposition from Choi State Tomography
- Efficient Quantum Cooling Algorithm for Fermionic Systems
- Block encoding of matrix product operators
- Efficient preparation of the AKLT State with Measurement-based Imaginary Time Evolution