Validating Quantum-Classical Programming Models with Tensor Network Simulations

Abstract

The exploration of hybrid quantum-classical algorithms and programming models on noisy near-term quantum hardware has begun. As hybrid programs scale towards classical intractability, validation and benchmarking are critical to understanding the utility of the hybrid computational model. In this paper, we demonstrate a newly developed quantum circuit simulator based on tensor network theory that enables intermediate-scale verification and validation of hybrid quantum-classical computing frameworks and programming models. We present our tensor-network quantum virtual machine (TNQVM) simulator which stores a multi-qubit wavefunction in a compressed (factorized) form as a matrix product state, thus enabling single-node simulations of larger qubit registers, as compared to brute-force state-vector simulators. Our simulator is designed to be extensible in both the tensor network form and the classical hardware used to run the simulation (multicore, GPU, distributed). The extensibility of the TNQVM simulator with respect to the simulation hardware type is achieved via a pluggable interface for different numerical backends (e.g., ITensor and ExaTENSOR numerical libraries). We demonstrate the utility of our TNQVM quantum circuit simulator through the verification of randomized quantum circuits and the variational quantum eigensolver algorithm, both expressed within the eXtreme-scale ACCelerator (XACC) programming model.

References in corpus (33)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• The density-matrix renormalization group in the age of matrix product states
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• 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
• Improved Simulation of Stabilizer Circuits
• Characterizing Quantum Supremacy in Near-Term Devices
• Quantum algorithms: an overview
• A class of quantum many-body states that can be efficiently simulated
• Experimental Comparison of Two Quantum Computing Architectures
• ProjectQ: An Open Source Software Framework for Quantum Computing
• Cloud Quantum Computing of an Atomic Nucleus
• Quantum algorithms for algebraic problems
• Observation of Entangled States of a Fully Controlled 20-Qubit System
• Algorithms for entanglement renormalization
• Resource-Aware Quantum Programming with General Recursion and Quantum Control
• The computational complexity of PEPS
• Simulating Strongly Correlated Quantum Systems with Tree Tensor Networks
• Concrete Categorical Model of a Quantum Circuit Description Language with Measurement
• Unsupervised Machine Learning on a Hybrid Quantum Computer
• 0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit
• Efficient Tree Tensor Network States (TTNS) for Quantum Chemistry: Generalizations of the Density Matrix Renormalization Group Algorithm
• LIQUi|>: A Software Design Architecture and Domain-Specific Language for Quantum Computing
• Tensor Networks in a Nutshell
• Complete-Graph Tensor Network States: A New Fermionic Wave Function Ansatz for Molecules
• Numerical Optimization for Symmetric Tensor Decomposition
• qTorch: The Quantum Tensor Contraction Handler
• Optimising Matrix Product State Simulations of Shor's Algorithm
• An Integrated Programming and Development Environment for Adiabatic Quantum Optimization
• Tensor network ranks
• A tree tensor network approach to simulating Shor's algorithm
• $Q|SI⟩$: A Quantum Programming Environment

Cited by in corpus (18)

• Open source software in quantum computing
• Computational advantage of quantum random sampling
• Full-State Quantum Circuit Simulation by Using Data Compression
• Establishing the Quantum Supremacy Frontier with a 281 Pflop/s Simulation
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier
• Variational Quantum Circuits for Quantum State Tomography
• Benchmarking adaptive variational quantum eigensolvers
• Tensor networks for quantum machine learning
• Verifying Random Quantum Circuits with Arbitrary Geometry Using Tensor Network States Algorithm
• Improving the accuracy and efficiency of quantum connected moments expansions
• Q${}^2$Chemistry: A quantum computation platform for quantum chemistry
• Fully quantum algorithm for lattice Boltzmann methods with application to partial differential equations
• Simulation of Quantum Computing on Classical Supercomputers
• A backend-agnostic, quantum-classical framework for simulations of chemistry in C++
• Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor-networks
• Tensor Networks for Simulating Quantum Circuits on FPGAs
• Differentiable matrix product states for simulating variational quantum computational chemistry