Quantum-classical eigensolver using multiscale entanglement renormalization
arXiv:2108.13401 · doi:10.1103/PhysRevResearch.5.033141
Abstract
We propose a variational quantum eigensolver (VQE) for the simulation of strongly-correlated quantum matter based on a multi-scale entanglement renormalization ansatz (MERA) and gradient-based optimization. This MERA quantum eigensolver can have substantially lower computation costs than corresponding classical algorithms. Due to its narrow causal cone, the algorithm can be implemented on noisy intermediate-scale quantum (NISQ) devices and still describe large systems. It is particularly attractive for ion-trap devices with ion-shuttling capabilities. The number of required qubits is system-size independent, and increases only to a logarithmic scaling when using quantum amplitude estimation to speed up gradient evaluations. Translation invariance can be used to make computation costs square-logarithmic in the system size and describe the thermodynamic limit. We demonstrate the approach numerically for a MERA with Trotterized disentanglers and isometries. With a few Trotter steps, one recovers the accuracy of the full MERA.
14 pages, 9 figures; additional discussions of the computational complexity, layer-transition maps for homogeneous MERA, mid-circuit qubit resets, and data on the quantum advantage; further minor improvements; published version
References in corpus (16)
- The density-matrix renormalization group in the age of matrix product states
- Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
- A class of quantum many-body states that can be efficiently simulated
- Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
- Synthesis of Quantum Logic Circuits
- Criticality, the area law, and the computational power of PEPS
- Experimental Comparison of Two Quantum Computing Architectures
- Fast Reset and Suppressing Spontaneous Emission of a Superconducting Qubit
- Simulating Strongly Correlated Quantum Systems with Tree Tensor Networks
- Optimal Quantum Measurements of Expectation Values of Observables
- Spin nematic correlations in bilinear-biquadratic S=1 spin chains
- T-junction ion trap array for two-dimensional ion shuttling, storage and manipulation
- The Variational Power of Quantum Circuit Tensor Networks
- Holographic dynamics simulations with a trapped ion quantum computer
- Suppression of mid-circuit measurement crosstalk errors with micromotion
- On the closedness and geometry of tensor network state sets
Cited by in corpus (15)
- Absence of barren plateaus in finite local-depth circuits with long-range entanglement
- Quantum Magic and Multi-Partite Entanglement in the Structure of Nuclei
- Isometric tensor network optimization for extensive Hamiltonians is free of barren plateaus
- Combining Matrix Product States and Noisy Quantum Computers for Quantum Simulation
- Probing critical states of matter on a digital quantum computer
- Tailored and Externally Corrected Coupled Cluster with Quantum Inputs
- Quantum Computing for Energy Correlators
- Machine learning with tree tensor networks, CP rank constraints, and tensor dropout
- Equivalence of cost concentration and gradient vanishing for quantum circuits: An elementary proof in the Riemannian formulation
- Absence of barren plateaus and scaling of gradients in the energy optimization of isometric tensor network states
- Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems
- Double-bracket quantum algorithms for quantum imaginary-time evolution
- Efficient preparation of the AKLT State with Measurement-based Imaginary Time Evolution
- Scaling of contraction costs for entanglement renormalization algorithms including tensor Trotterization and variational Monte Carlo
- A quantum eigenvalue solver based on tensor networks