Skip to content

Further Reading and Sources

The papers behind the course

Several results in this book are quoted from the research literature. Only authors, year and topic are given here, so that you can find each paper by searching for them; read the originals for the exact statements and the conditions on each theorem.

Authors and year Topic in this book
Havlíček and co-authors, 2019 The ZZ feature map and quantum-kernel estimation; the argument that overlaps of such states are hard to estimate classically (Chapter 5)
Pérez-Salinas and co-authors, 2020, and a 2021 follow-up Data re-uploading; single-qubit universality (Chapter 5)
Schuld, Sweke and Meyer, 2021 The Fourier-series view of quantum models: the encoding fixes the frequencies (Chapter 5)
Thanasilp and co-authors, 2024 Exponential concentration of quantum kernels (Chapter 8)
Liu, Arunachalam and Temme, 2021 A provable separation for learning a discrete-logarithm concept class (Chapter 8)
Sim, Johnson and Aspuru-Guzik Expressibility and entangling capability of ansätze (Chapter 9)
McClean and co-authors, 2018 Barren plateaus for deep 2-design ansätze (Chapter 12)
Cerezo and co-authors, 2021 Cost-function locality and barren plateaus (Chapter 12)
Wang and co-authors, 2021 Noise-induced barren plateaus (Chapter 12)
Caro and co-authors, 2022 Generalisation bounds in terms of the number of trainable gates (Chapter 12)
Huang, Kueng and Preskill, 2020; Huang and co-authors, 2021 Classical shadows and classical surrogate learning (Chapter 12)
Tang, 2019 Sampling-based dequantisation (Chapter 12)
Pesah and co-authors, 2021 Absence of barren plateaus in QCNNs (Chapter 13)
Schuld and co-authors, 2017 The interference-based distance classifier (Chapter 13)

In this library

Two other books in the Pustakālaya library cover neighbouring ground. Quantum Machine Learning: the complete student field guide surveys the whole field in plain language, with analogies and a catalogue of algorithms, circuits, tools and papers; it is the natural companion for breadth. Quantum Computing and its Applications is the full course on quantum algorithms, from the fundamentals of quantum mechanics through quantum algorithms to cryptography; it is the natural companion for the quantum computing that this book assumes in only its barest form.

About the worked problems

The numerical results in the worked examples were reproduced exactly, and the programs are short enough to run on any computer with NumPy. Where an example quotes a finite-shot experiment, the counts are those of one random draw; a different draw gives different counts, scattered about the expected values as the standard error predicts. A useful exercise is to change the seeds, the number of shots and the data in each program, and to predict the effect before running it.