Improved real-space parallelizable matrix-product state compression and its application to unitary quantum dynamics simulation
arXiv:2312.02667 · doi:10.1103/PhysRevB.110.085149
Abstract
Towards the efficient simulation of near-term quantum devices using tensor network states, we introduce an improved real-space parallelizable matrix-product state (MPS) compression method. This method enables efficient compression of all virtual bonds in constant time, irrespective of the system size, with controlled accuracy, while it maintains the stability of the wavefunction norm without necessitating sequential renormalization procedures. In addition, we introduce a parallel regauging technique to partially restore the deviated canonical form, thereby improving the accuracy of the simulation in subsequent steps. We further apply this method to simulate unitary quantum dynamics and introduce an improved parallel time-evolving block-decimation (pTEBD) algorithm. We employ the improved pTEBD algorithm for extensive simulations of typical one- and two-dimensional quantum circuits, involving over 1000 qubits. The obtained numerical results unequivocally demonstrate that the improved pTEBD algorithm achieves the same level of simulation precision as the current state-of-the-art MPS algorithm but in polynomially shorter time, exhibiting nearly perfect weak scaling performance on a modern supercomputer.
21 pages, 13 figures
References in corpus (46)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Computation with Quantum Dots
- The density-matrix renormalization group in the age of matrix product states
- The density-matrix renormalization group
- Efficient classical simulation of slightly entangled quantum computations
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Efficient simulation of one-dimensional quantum many-body systems
- Quantum principal component analysis
- Characterizing Quantum Supremacy in Near-Term Devices
- Strong quantum computational advantage using a superconducting quantum processor
- The Variational Quantum Eigensolver: a review of methods and best practices
- Universal Quantum Computation with the Exchange Interaction
- Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
- Matrix product states represent ground states faithfully
- Towards Practical Quantum Variational Algorithms
- Time-evolution methods for matrix-product states
- Accurate determination of tensor network state of quantum lattice models in two dimensions
- The iTEBD algorithm beyond unitary evolution
- Tools for quantum simulation with ultracold atoms in optical lattices
- A compact ion-trap quantum computing demonstrator
- Two-qubit Gate of Combined Single Spin Rotation and Inter-dot Spin Exchange in a Double Quantum Dot
- What limits the simulation of quantum computers?
- Hyper-optimized tensor network contraction
- Solving the sampling problem of the Sycamore quantum circuits
- Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
- Perfect Sampling with Unitary Tensor Networks
- Massively parallel quantum computer simulator, eleven years later
- Real-Space Parallel Density Matrix Renormalization Group
- Symmetry-adapted variational quantum eigensolver
- Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
- Anisotropic Tensor Renormalization Group
- General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier
- A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity
- Optimized Decimation of Tensor Networks with Super-orthogonalization for Two-Dimensional Quantum Lattice Models
- Contracting Arbitrary Tensor Networks: General Approximate Algorithm and Applications in Graphical Models and Quantum Circuit Simulations
- Universal Quantum Computing with Arbitrary Continuous-Variable Encoding
- Fate of the cluster state on the square lattice in a magnetic field
- Parallel time-dependent variational principle algorithm for matrix product states
- Gauging tensor networks with belief propagation
- Tensor Networks contraction and the Belief Propagation algorithm
- Verifying Random Quantum Circuits with Arbitrary Geometry Using Tensor Network States Algorithm
- Hyper-optimized approximate contraction of tensor networks with arbitrary geometry
- Validating quantum-supremacy experiments with exact and fast tensor network contraction
- Efficient variational quantum circuit structure for correlated topological phases