General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier
arXiv:1905.08394 · doi:10.1103/PhysRevLett.123.190501
Abstract
Recent advances on quantum computing hardware have pushed quantum computing to the verge of quantum supremacy. Random quantum circuits are outstanding candidates to demonstrate quantum supremacy, which could be implemented on a quantum device that supports nearest-neighbour gate operations on a two-dimensional configuration. Here we show that using the Projected Entangled-Pair States algorithm, a tool to study two-dimensional strongly interacting many-body quantum systems, we can realize an effective general-purpose simulator of quantum algorithms. This technique allows to quantify precisely the memory usage and the time requirements of random quantum circuits, thus showing the frontier of quantum supremacy. With this approach we can compute the full wave-function of the system, from which single amplitudes can be sampled with unit fidelity. Applying this general quantum circuit simulator we measured amplitudes for a lattice of qubits with depth and double-precision numbers in 31 minutes using less than TB memory on the Tianhe-2 supercomputer.
arXiv comment10 pages, 6 figures, 1 table
References in corpus (25)
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Characterizing Quantum Supremacy in Near-Term Devices
- Observation of a Many-Body Dynamical Phase Transition with a 53-Qubit Quantum Simulator
- Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
- Criticality, the area law, and the computational power of PEPS
- Accurate determination of tensor network state of quantum lattice models in two dimensions
- 18-qubit entanglement with photon's three degrees of freedom
- The computational complexity of PEPS
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Tensor-entanglement renormalization group approach to 2D quantum systems
- Variational study of hard-core bosons in a 2-D optical lattice using Projected Entangled Pair States (PEPS)
- Second Renormalization of Tensor-Network States
- Genuine 12-qubit entanglement on a superconducting quantum processor
- Quantum Sampling Problems, BosonSampling and Quantum Supremacy
- Instantaneous Quantum Computation
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- Exploring frustrated spin-systems using Projected Entangled Pair States (PEPS)
- 64-Qubit Quantum Circuit Simulation
- Unifying Projected Entangled Pair States contractions
- Experimental Blind Quantum Computing for a Classical Client
- Simulation of low-depth quantum circuits as complex undirected graphical models
- A Benchmark Test of Boson Sampling on Tianhe-2 Supercomputer
- Demonstration of Topological Data Analysis on a Quantum Processor
- Validating Quantum-Classical Programming Models with Tensor Network Simulations
- Quantum Supremacy Circuit Simulation on Sunway TaihuLight
Cited by in corpus (42)
- Strong quantum computational advantage using a superconducting quantum processor
- Hybrid Quantum-Classical Convolutional Neural Networks
- What limits the simulation of quantum computers?
- Hyper-optimized tensor network contraction
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- Computational advantage of quantum random sampling
- Solving the sampling problem of the Sycamore quantum circuits
- TensorCircuit: a Quantum Software Framework for the NISQ Era
- Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design
- Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
- Closing the "Quantum Supremacy" Gap: Achieving Real-Time Simulation of a Random Quantum Circuit Using a New Sunway Supercomputer
- Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
- Contracting Arbitrary Tensor Networks: General Approximate Algorithm and Applications in Graphical Models and Quantum Circuit Simulations
- Variational Quantum Circuits for Quantum State Tomography
- Variational quantum process tomography
- Verifying Random Quantum Circuits with Arbitrary Geometry Using Tensor Network States Algorithm
- A brief introduction to quantum algorithms
- Tensor networks for interpretable and efficient quantum-inspired machine learning
- Quantum AI simulator using a hybrid CPU-FPGA approach
- A quantum-inspired tensor network method for constrained combinatorial optimization problems
- Tensor networks for quantum computing
- QChemistry: A quantum computation platform for quantum chemistry
- Validating quantum-supremacy experiments with exact and fast tensor network contraction
- Simulating quantum circuits using efficient tensor network contraction algorithms with subexponential upper bound
- Simulation of Quantum Computing on Classical Supercomputers
- A quantum circuit simulator and its applications on Sunway TaihuLight supercomputer
- Identification of topological phases using classically-optimized variational quantum eigensolver
- General Quantum Bernoulli Factory: Framework Analysis and Experiments
- Feynman-path type simulation using stabilizer projector decomposition of unitaries
- Sample caching Markov chain Monte Carlo approach to boson sampling simulation
- On Stability of Tensor Networks and Canonical Forms
- Differentiable matrix product states for simulating variational quantum computational chemistry
- Improved real-space parallelizable matrix-product state compression and its application to unitary quantum dynamics simulation
- Survey on Computational Applications of Tensor Network Simulations
- Simulating quantum circuits using the multi-scale entanglement renormalization ansatz
- Positive bias makes tensor-network contraction tractable
- Scalable projected entangled-pair state representation of random quantum circuit states
- Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm
- Scalable tensor network algorithm for quantum impurity problems
- Efficient 2D Tensor Network Simulation of Quantum Systems
- Matrix Product State on a Quantum Computer
- Low Rank Approximation in Simulations of Quantum Algorithms