Characterizing quantum supremacy in near-term devices

@article{Boixo2016CharacterizingQS,
  title={Characterizing quantum supremacy in near-term devices},
  author={S. Boixo and S. Isakov and V. Smelyanskiy and R. Babbush and N. Ding and Zhang Jiang and M. Bremner and J. Martinis and H. Neven},
  journal={Nature Physics},
  year={2016},
  volume={14},
  pages={595-600}
}
A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of supercomputers. Such a demonstration of what is referred to as quantum supremacy requires a reliable evaluation of the resources required to solve tasks with classical approaches. Here, we propose the task of sampling from the output distribution of random quantum circuits as a demonstration of quantum supremacy… Expand

Figures from this paper

QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
TLDR
To lower bound the size of quantum computers with practical utility, realistic simulations of the Quantum Approximate Optimization Algorithm are performed and it is concluded that quantum speedup will not be attainable, at least for a representative combinatorial problem, until several hundreds of qubits are available. Expand
Quantum supremacy with analog quantum processors for material science and machine learning
Quantum supremacy is the ability of quantum processors to outperform classical computers at certain tasks. In digital random quantum circuit approaches for supremacy, the output distribution producedExpand
Quantum Supremacy Is Both Closer and Farther than It Appears
TLDR
A massively-parallel simulation tool Rollright is developed that does not require inter-process communication (IPC) or proprietary hardware, and two ways to trade circuit fidelity for computational speedups are developed, so as to match the fidelity of a given quantum computer --- a task previously thought impossible. Expand
Establishing the Quantum Supremacy Frontier with a 281 Pflop/s Simulation
TLDR
HPC simulations of hard random quantum circuits (RQC), which have been recently used as a benchmark for the first experimental demonstration of Quantum Supremacy, sustaining an average performance of 281 Pflop/s on Summit, currently the fastest supercomputer in the World, are reported. Expand
Quantum optimization using variational algorithms on near-term quantum devices
TLDR
The quantum volume as a metric to compare the power of near-term quantum devices is discussed and simple error-mitigation schemes are introduced that could improve the accuracy of determining ground-state energies. Expand
Quantum supremacy using a programmable superconducting processor
TLDR
Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute. Expand
Quantum sampling problems, BosonSampling and quantum supremacy
TLDR
This paper will review sampling problems and the arguments that have been used to deduce when sampling problems are hard for classical computers to simulate, and two classes of quantum sampling problems that demonstrate the supremacy of quantum algorithms are BosonSampling and Instantaneous Quantum Polynomial-time Sampling. Expand
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
TLDR
General theoretical foundations are laid for how to use special-purpose quantum computers with 40--50 high-quality qubits to demonstrate "quantum supremacy": that is, a clear quantum speedup for some task, motivated by the goal of overturning the Extended Church-Turing Thesis as confidently as possible. Expand
Entanglement scaling in quantum advantage benchmarks
TLDR
An upperbound for the minimum random circuit depth needed to generate the maximal bipartite entanglement correlations between all problem variables (qubits) is derived and makes explicit a nuance implicit in other proposals with physical consequence. Expand
Variational quantum unsampling on a quantum photonic processor
A promising route towards the demonstration of near-term quantum advantage (or supremacy) over classical systems relies on running tailored quantum algorithms on noisy intermediate-scale quantumExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 118 REFERENCES
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
TLDR
General theoretical foundations are laid for how to use special-purpose quantum computers with 40--50 high-quality qubits to demonstrate "quantum supremacy": that is, a clear quantum speedup for some task, motivated by the goal of overturning the Extended Church-Turing Thesis as confidently as possible. Expand
Achieving quantum supremacy with sparse and noisy commuting quantum computations
The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-time) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. HereExpand
Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits
With the current rate of progress in quantum computing technologies, systems with more than 50 qubits will soon become reality. Computing ideal quantum state amplitudes for devices of such and largerExpand
Randomized Benchmarking of Quantum Gates
A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gateExpand
Large-scale simulations of error prone quantum computation devices
TLDR
This work assesses the power of error-prone quantum computation devices using largescale numerical simulations on parallel supercomputers and concludes that quantum error correction is especially well suited for the correction of operational imprecisions and systematic over-rotations. Expand
State preservation by repetitive error detection in a superconducting quantum circuit
TLDR
The protection of classical states from environmental bit-flip errors is reported and the suppression of these errors with increasing system size is demonstrated, motivating further research into the many challenges associated with building a large-scale superconducting quantum computer. Expand
Superconducting quantum circuits at the surface code threshold for fault tolerance
TLDR
The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits. Expand
Quantum computing and the entanglement frontier
Quantum information science explores the frontier of highly complex quantum states, the "entanglement frontier." This study is motivated by the observation (widely believed but unproven) thatExpand
Simulation of low-depth quantum circuits as complex undirected graphical models
Near term quantum computers with a high quantity (around 50) and quality (around 0.995 fidelity for two-qubit gates) of qubits will approximately sample from certain probability distributions beyondExpand
Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
TLDR
The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits. Expand
...
1
2
3
4
5
...