liveBook · Manning

Quantum supremacy

As explained in Building Quantum Software with Python

Quantum advantage is a performance improvement on a computational task that a quantum computer achieves over available classical approaches.

Quantum supremacy denotes a performance improvement on a computational task over available classical approaches; the treatment frames this benefit as quantum advantage. It matters only for specific problems where quantum resources improve speed, scalability, or feasibility. section 1.0 section 1.1

The practical mental model is a probability distribution over possible outcomes. Quantum computation changes outcome probabilities in parallel, then measurement samples an outcome; repeating the computation reveals the distribution. section 1.3 section 1.6

Quantum advantage is associated with several reusable computational patterns:

  • Quantum parallelism changes pairs of amplitudes simultaneously, using a butterfly-style computational pattern. section 1.6
  • Measurement selects outcomes according to their probabilities rather than exposing every possible state directly. section 1.3
  • Entanglement enables conditional transformations by linking qubit states that cannot always be described independently. section 1.3
  • Useful targets include sampling probability distributions, searching for optimal values, estimating outcome probabilities, and simulating physical processes. section 1.3 section 1.6
Figure 1.1 Comparison of the increase in computational complexity relative to the input size for computing (fast) Fourier transforms with classical and quantum computers
figure

Compare how computational complexity grows with input size for classical fast Fourier transforms and quantum Fourier transforms. section 1.0

How Building Quantum Software with Python covers it

How deep it goes
Explains probability states, parallel amplitude changes, measurement, and entanglement, while deferring detailed physics and implementation.
Examples
Uses Fourier-transform complexity, eight outcome–probability pairs, and physical-process simulation as concrete examples.
What it assumes
Assumes basic computational reasoning while teaching outcome probabilities and quantum-computing characteristics at a high level.
What you can do after
Evaluate quantum, classical, and hybrid approaches for problems involving transforms, sampling, optimization, estimation, or simulation.
How it connects
Connects quantum parallelism and measurement with superposition, entanglement, Fourier transforms, sampling, optimization, and hybrid quantum–classical computing.

Also explained in

Compare how 2 books explain quantum supremacy →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Building Quantum Software with Python. The section links point to the parts of the book it draws on.