Validating quantum-classical programming models with tensor network simulations

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 pap...

Full description

Saved in:
Bibliographic Details
Published in:PloS one 2018-12, Vol.13 (12), p.e0206704-e0206704
Main Authors: McCaskey, Alexander, Dumitrescu, Eugene, Chen, Mengsu, Lyakh, Dmitry, Humble, Travis
Format: Article
Language:English
Subjects:
Algorithms
Analysis
Backup software
Benchmarking
Circuits
Computer and Information Sciences
Computer applications
Computer engineering
Computer simulation
Extensibility
Hardware
Integrated circuits
Laboratories
Mathematical analysis
Mathematical models
Mathematical programming
MATHEMATICS AND COMPUTING
Models, Theoretical
Neural Networks, Computer
Physical Sciences
Physics
Program verification (computers)
Programming
Programming Languages
Quantum theory
Qubits (quantum computing)
R&D
Research & development
Research and Analysis Methods
Science & Technology - Other Topics
Simulation
Simulators
State vectors
Tensors
Virtual environments
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1932-6203
1932-6203
DOI:10.1371/journal.pone.0206704