liveBook · Manning

Noisy intermediate-scale quantum era

As explained in Quantum Programming in Depth

The stage of quantum-computing development characterized by devices with imperfect qubits that are not fully fault tolerant or broadly useful for computation.

The noisy intermediate-scale quantum era (NISQ) describes quantum devices large enough to evade classical simulation but too small and noisy for practical, broadly useful computation. Their limitations make hardware development, software, and algorithm design inseparable. section 1.10 section 1.3.2

NISQ systems are characterized by:

  • Imperfect qubits and insufficient fault tolerance for long computations. section 1.3.2
  • A gap between experimental computational scale and useful problem-solving capability. section 1.10
  • A software stack that executes algorithms on hardware, exposes quantum systems through the cloud, and informs hardware requirements. section 1.10
  • Active hardware approaches including superconducting circuits, trapped ions, neutral atoms, and photons. section 1.3.2

From demonstrations to fault tolerance

Early nuclear magnetic resonance devices demonstrated small algorithms such as Deutsch, Deutsch–Jozsa, and Grover’s search. The next major target is a fault-tolerant machine capable of long computations, followed by practical problems beyond classical reach. section 1.3.2 section 1.8

Figure 1.2 The major milestones of quantum hardware development. The first two, showing the use of quantum mechanics to perform a computation and having a quantum computer solve an artificial problem that a classical computer cannot, have already been achieved. The next milestone, building a fault-tolerant quantum computer that can run long computations, is the current focus. The final goal is to build a quantum computer that can solve practical problems that a classical computer cannot.
figure

Use the hardware-milestones figure to distinguish achieved demonstrations from the current fault-tolerance goal and the eventual practical-advantage goal. section 1.3.2

How Quantum Programming in Depth covers it

How deep it goes
Defines scale, noise, simulation limits, and missing fault tolerance, but does not detail device engineering or error-correction mechanisms.
Examples
Uses nuclear magnetic resonance implementations of Deutsch, Deutsch–Jozsa, and Grover’s search as early experimental examples.
What you can do after
Evaluate quantum-computing claims by separating experimental scale from fault-tolerant capability and practical quantum advantage.
How it connects
Connects quantum hardware with quantum algorithms, classical simulation, fault-tolerant quantum computing, and the software stack.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Quantum Programming in Depth. The section links point to the parts of the book it draws on.