Near-term Quantum Algorithms for Quantum Many-body Systems

There has been a good deal of work on algorithms to simulate quantum many-body systems with fault-tolerant quantum computers- those with full error correction. Fault-tolerant quantum computers of scale requisite to achieve computational advantage for these problems are likely over a decade away. Mor...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2019-10, Vol.1290 (1), p.12003
Main Author: Ritter, Mark B.
Format: Article
Language:English
Subjects:
Algorithms
Error correction
Fault tolerance
Mathematical analysis
Nuclear structure
Physics
Quantum computers
Quantum computing
Quantum phenomena
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:There has been a good deal of work on algorithms to simulate quantum many-body systems with fault-tolerant quantum computers- those with full error correction. Fault-tolerant quantum computers of scale requisite to achieve computational advantage for these problems are likely over a decade away. Moreover, devices that we can build in the near term, called Noisy Intermediate Scale Quantum computers (NISQ), have too much noise to implement the long circuits required by these algorithms. We review heuristic, short-depth quantum algorithms more suited to NISQ computers; specifically, their scaling properties when applied to electronic and nuclear structure calculations, including Hamiltonian complexity with particle number, ansatz state preparation, convergence, and noise. We will present examples of actual quantum structure calculations with NISQ computers, as well as a newly-developed error mitigation technique that significantly improves accuracy. We end with an outlook for "advantage" - when NISQ systems might excel conventional HPC approaches for comparable problems.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1290/1/012003