A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity

Abstract

We develop a density-matrix renormalization group (DMRG) algorithm for the simulation of quantum circuits. This algorithm can be seen as the extension of time-dependent DMRG from the usual situation of hermitian Hamiltonian matrices to quantum circuits defined by unitary matrices. For small circuit depths, the technique is exact and equivalent to other matrix product state (MPS) based techniques. For larger depths, it becomes approximate in exchange for an exponential speed up in computational time. Like an actual quantum computer, the quality of the DMRG results is characterized by a finite fidelity. However, unlike a quantum computer, the fidelity depends strongly on the quantum circuit considered. For the most difficult possible circuit for this technique, the so-called "quantum supremacy" benchmark of Google Inc. , we find that the DMRG algorithm can generate bit strings of the same quality as the seminal Google experiment on a single computing core. For a more structured circuit used for combinatorial optimization (Quantum Approximate Optimization Algorithm or QAOA), we find a drastic improvement of the DMRG results with error rates dropping by a factor of 100 compared with random quantum circuits. Our results suggest that the current bottleneck of quantum computers is their fidelities rather than the number of qubits.

25 pages, 13 figures. Review section updated

References in corpus (8)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• The density-matrix renormalization group in the age of matrix product states
• Quantum computational advantage using photons
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• Real time evolution using the density matrix renormalization group
• Strong quantum computational advantage using a superconducting quantum processor
• Minimally Entangled Typical Thermal State Algorithms
• Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm

Cited by in corpus (44)

• Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
• Phase transition in Random Circuit Sampling
• Is quantum computing green? An estimate for an energy-efficiency quantum advantage
• Gauging tensor networks with belief propagation
• The computational power of random quantum circuits in arbitrary geometries
• Quantum Magic and Multi-Partite Entanglement in the Structure of Nuclei
• Simulating (2+1)D SU(2) Yang-Mills Lattice Gauge Theory at finite density with tensor networks
• Simulating Noisy Variational Quantum Algorithms: A Polynomial Approach
• Tensor networks for quantum computing
• Efficient sampling of noisy shallow circuits via monitored unraveling
• Opening the Black Box Inside Grover's Algorithm
• Combining Matrix Product States and Noisy Quantum Computers for Quantum Simulation
• The Quantum House Of Cards
• Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer
• Controlling NMR spin systems for quantum computation
• Simulating quantum circuits using efficient tensor network contraction algorithms with subexponential upper bound
• Beyond MP2 initialization for unitary coupled cluster quantum circuits
• Quantum computing topological invariants of two-dimensional quantum matter
• Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor-networks
• Tensorized orbitals for computational chemistry
• Dynamics of disordered quantum systems with two- and three-dimensional tensor networks
• Loop Series Expansions for Tensor Networks
• Adaptive variational quantum dynamics simulations with compressed circuits and fewer measurements
• Improved real-space parallelizable matrix-product state compression and its application to unitary quantum dynamics simulation
• Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states
• Efficient and systematic calculation of arbitrary observables for the matrix product state excitation ansatz
• Solving the Gross-Pitaevskii equation on multiple different scales using the quantics tensor train representation
• Optimization via Quantum Preconditioning
• Quantum error mitigation in optimized circuits for particle-density correlations in real-time dynamics of the Schwinger model
• Prospects for NMR Spectral Prediction on Fault-Tolerant Quantum Computers
• Optimal Qubit Mapping Search for Encoding Classical Data into Matrix Product State Representation with Minimal Loss
• Analog simulation of noisy quantum circuits
• Scalable projected entangled-pair state representation of random quantum circuit states
• Equally entangled multiqubit states
• The Software Landscape for the Density Matrix Renormalization Group
• Simulating dynamics of the two-dimensional transverse-field Ising model: a comparative study of large-scale classical numerics
• Feasibility of performing quantum chemistry calculations on quantum computers
• Accelerating Quantum Eigensolver Algorithms With Machine Learning
• Simulating Quantum Circuits with Tree Tensor Networks using Density-Matrix Renormalization Group Algorithm
• Learning mixed quantum states in large-scale experiments
• Dynamical cluster-based strategy for improving tensor network algorithms in quantum circuit simulations
• Who can compete with quantum computers? Lecture notes on quantum inspired tensor networks computational techniques
• Variational matrix product states for combinatorial optimization
• Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits