The Variational Power of Quantum Circuit Tensor Networks

Abstract

We characterize the variational power of quantum circuit tensor networks in the representation of physical many-body ground-states. Such tensor networks are formed by replacing the dense block unitaries and isometries in standard tensor networks by local quantum circuits. We explore both quantum circuit matrix product states and the quantum circuit multi-scale entanglement renormalization ansatz, and introduce an adaptive method to optimize the resulting circuits to high fidelity with more than $10^4$ parameters. We benchmark their expressiveness against standard tensor networks, as well as other common circuit architectures, for the 1D/2D Heisenberg and 1D Fermi-Hubbard models. We find quantum circuit tensor networks to be substantially more expressive than other quantum circuits for these problems, and that they can even be more compact than standard tensor networks. Extrapolating to circuit depths which can no longer be emulated classically, this suggests a region of advantage in quantum expressiveness in the representation of physical ground-states.

13 pages, 13 figures

References in corpus (5)

• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• A class of quantum many-body states that can be efficiently simulated
• Criticality, the area law, and the computational power of PEPS
• Sequential Generation of Matrix-Product States in Cavity QED
• Variational Quantum Eigensolver for Frustrated Quantum Systems

Cited by in corpus (55)

• Preparation of matrix product states with log-depth quantum circuits
• Towards adiabatic quantum computing using compressed quantum circuits
• Data compression for quantum machine learning
• Constant-depth preparation of matrix product states with adaptive quantum circuits
• Noise-assisted digital quantum simulation of open systems
• Absence of barren plateaus in finite local-depth circuits with long-range entanglement
• Algebraic Bethe Circuits
• Optimal compression of quantum many-body time evolution operators into brickwall circuits
• Rapid initial state preparation for the quantum simulation of strongly correlated molecules
• Entanglement from tensor networks on a trapped-ion QCCD quantum computer
• Nonlinear dynamics as a ground-state solution on quantum computers
• Holographic simulation of correlated electrons on a trapped ion quantum processor
• Variational quantum algorithm for unconstrained black box binary optimization: Application to feature selection
• Tensor networks for interpretable and efficient quantum-inspired machine learning
• Dequantizing quantum machine learning models using tensor networks
• Isometric tensor network optimization for extensive Hamiltonians is free of barren plateaus
• Typical Correlation Length of Sequentially Generated Tensor Network States
• Quantum-classical eigensolver using multiscale entanglement renormalization
• Combining Matrix Product States and Noisy Quantum Computers for Quantum Simulation
• Scalable Quantum Simulations of Scattering in Scalar Field Theory on 120 Qubits
• Quantum Annealing for Neural Network optimization problems: a new approach via Tensor Network simulations
• Q${}^2$Chemistry: A quantum computation platform for quantum chemistry
• Automatic quantum circuit encoding of a given arbitrary quantum state
• Probing critical states of matter on a digital quantum computer
• Efficient MPS representations and quantum circuits from the Fourier modes of classical image data
• Universal structure of measurement-induced information in many-body ground states
• Time Evolution of Uniform Sequential Circuits
• Sequential optimal selection of a single-qubit gate and its relation to barren plateau in parameterized quantum circuits
• Holographic Weak Measurement
• NoRA: A Tensor Network Ansatz for Volume-Law Entangled Equilibrium States of Highly Connected Hamiltonians
• Optimal Parameter Configurations for Sequential Optimization of Variational Quantum Eigensolver
• Absence of barren plateaus and scaling of gradients in the energy optimization of isometric tensor network states
• Finite-depth scaling of infinite quantum circuits for quantum critical points
• Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems
• Maximising Quantum-Computing Expressive Power through Randomised Circuits
• All you need is spin: SU(2) equivariant variational quantum circuits based on spin networks
• Variational quantum eigensolver with embedded entanglement using a tensor-network ansatz
• Sequential quantum simulation of spin chains with a single circuit QED device
• Image Classification by Throwing Quantum Kitchen Sinks at Tensor Networks
• Variational Quantum Simulation of Valence-Bond Solids
• Optimal compression of constrained quantum time evolution
• QForte: an efficient state simulator and quantum algorithms library for molecular electronic structure
• Variational Quantum Imaginary Time Evolution for Matrix Product State Ansatz with Tests on Transcorrelated Hamiltonians
• Tensor-Programmable Quantum Circuits for Solving Differential Equations
• Efficient preparation of the AKLT State with Measurement-based Imaginary Time Evolution
• Two Dimensional Isometric Tensor Networks on an Infinite Strip
• Scaling of contraction costs for entanglement renormalization algorithms including tensor Trotterization and variational Monte Carlo
• Quantum tensor network algorithms for evaluation of spectral functions on quantum computers
• A recipe for local simulation of strongly-correlated fermionic matter on quantum computers: the 2D Fermi-Hubbard model
• QAS-QTNs: Curriculum Reinforcement Learning-Driven Quantum Architecture Search for Quantum Tensor Networks
• Expressiveness of Commutative Quantum Circuits: A Probabilistic Approach
• Pseudoentanglement from tensor networks
• Probabilistic Representation of Commutative Quantum Circuit Models
• Light Cone Cancellation for Variational Quantum Eigensolver in Solving Noisy Max-Cut
• Ground-State-Based Model Reduction with Unitary Circuits