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...
Main Authors: | Alexander McCaskey, Eugene Dumitrescu, Mengsu Chen, Dmitry Lyakh, Travis Humble |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2018-01-01
|
Series: | PLoS ONE |
Online Access: | https://doi.org/10.1371/journal.pone.0206704 |
Similar Items
-
ExaTN: Scalable GPU-Accelerated High-Performance Processing of General Tensor Networks at Exascale
by: Dmitry I. Lyakh, et al.
Published: (2022-07-01) -
Benchmarking Adaptive Variational Quantum Eigensolvers
by: Daniel Claudino, et al.
Published: (2020-12-01) -
QuaSiMo: A composable library to program hybrid workflows for quantum simulation
by: Thien Nguyen, et al.
Published: (2021-12-01) -
Numerical simulations of noisy quantum circuits for computational chemistry
by: Jerimiah Wright, et al.
Published: (2022-09-01) -
Recall Performance for Content-Addressable Memory Using Adiabatic Quantum Optimization
by: Jonathan Schrock, et al.
Published: (2017-09-01)