Quantum Computing in the NISQ era and beyond

@article{Preskill2018QuantumCI,
  title={Quantum Computing in the NISQ era and beyond},
  author={John Preskill},
  journal={Quantum},
  year={2018},
  volume={2},
  pages={79},
  url={https://api.semanticscholar.org/CorpusID:44098998}
}
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future, and the 100-qubit quantum computer will not change the world right away - but it should be regarded as a significant step toward the more powerful quantum technologies of the future.
[PDF] Semantic Reader
7,525 Citations
Highly Influential Citations
334
Background Citations
3,015
Methods Citations
663
Results Citations
15

7,525 Citations

Quantum Computing: An Overview Across the System Stack

The quantum age appears to be arriving sooner rather than later as commercially useful small-to-medium sized machines have already been built, however, full-scale quantum computers, and the full- scale algorithms they would perform, remain out of reach for now.

Optimal quantum reservoir computing for the noisy intermediate-scale quantum era.

These findings demonstrate that they render better results than other commonly used models with significantly less gates and also provide insight on the theoretical gap between quantum reservoir computing and the theory of quantum states' complexity.

Beyond NISQ: The Megaquop Machine

Today’s Noisy Intermediate-Scale Quantum (NISQ) computers have scientific value, but quantum machines with broad practical value must be protected against noise using quantum error correction and…

Methods for parallel quantum circuit synthesis, fault-tolerant quantum RAM, and quantum state tomography

Improve circuit synthesis using large-scale parallelization; designing circuits for quantum random-access memories and analyzing various time/space tradeoffs; using the mathematical structure of discrete phase space to select subsets of tomographic measurements.

Experimenting quantum phenomena on NISQ computers using high level quantum programming

We execute the quantum eraser, the Elitzur–Vaidman bomb, and the Hardy’s paradox experiment using high-level programming language on a generic, gate-based superconducting quantum processor made…

The Coming Decades of Quantum Simulation

This Chapter presents a vision of the golden future of quantum simulators in the decades to come, where systems that, without necessarily simulating quantum dynamics of some physical systems, can generate massive, controllable, robust, entangled, and superposition states are allowed.

Quantum Computers and their Application in Future Era

This review explores the transformative potential of quantum computers across various domains, from cryptography to material science, envisioning a future where complex simulations and optimizations once deemed impractical become routine.

QAOA for Max-Cut requires hundreds of qubits for quantum speed-up

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.

Reproducing quantum experiments on NISQ computers using high level quantum programming

We execute the quantum eraser, the Elitzur-Vaidman bomb, and the Hardy’s paradox experiment using high-level programming language on a generic, gate-based superconducting quantum processor made…

Scalable Simulation of Quantum Measurement Process with Quantum Computers

This work proposes qubit models to emulate the quantum measurement process, in which the quantum information of a qubit is mapped to a collection of qubits acting as the measurement device, and one model is motivated by single-photon detection and the other by spin measurement.
...

75 References

The Steep Road Towards Robust and Universal Quantum Computation

This review compares the leading proposals for promoting a quantum memory to a quantum processor and discusses the several no-go results which hold for low-dimensional topological codes and the potential rewards of using high-dimensional quantum codes in modular architectures.

Roads towards fault-tolerant universal quantum computation

A practical quantum computer must not merely store information, but also process it, and to convert these quantum devices from memories to processors, it is necessary to specify how a universal set of gates is performed on them.

Quantum computational supremacy

This work presents the leading proposals to achieve quantum supremacy, and discusses how to reliably compare the power of a classical computer to thePower of a quantum computer.

Quantum computing and the entanglement frontier

This study is motivated by the observation (widely believed but unproven) that classical systems cannot simulate highly entangled quantum systems efficiently, and it hopes to hasten the day when well controlled quantum systems can perform tasks surpassing what can be done in the classical world.

Quantum sensing

"Quantum sensing"describes the use of a quantum system, quantum properties or quantum phenomena to perform a measurement of a physical quantity. Historical examples of quantum sensors include…

Characterizing quantum supremacy in near-term devices

The computational cost of relevant classical algorithms is studied and it is concluded that quantum supremacy can be achieved with circuits in a two-dimensional lattice of 7 × 7 qubits and around 40 clock cycles.

Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits

This study presents a new approach for this task that extends the boundaries of what can be computed on a classical system, and shows that it can simulate $7 \times 7$-qubit random circuits to arbitrary depth by leveraging secondary storage.

Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral

It is shown that deferring tensor contractions can extend the boundaries of what can be computed on classical systems and can be used to simulate $7 \times 7$-qubit random circuits to arbitrary depth by leveraging secondary storage.

Adiabatic Quantum Computing

The aim of this project is to give an introduction to the historic advances in classical and quantum computing and to explore the methods of AQC.

Noise tailoring for scalable quantum computation via randomized compiling

This work proposes a method for introducing independent random single-qubit gates into the logical circuit in such a way that the effective logical circuit remains unchanged and proves that this randomization tailors the noise into stochastic Pauli errors, which can dramatically reduce error rates while introducing little or no experimental overhead.
...