Lectures & Tutorials
Projection Noise
Part of the series Intro to Quantum Noise (QGSS 2021); cited as one entry below.
Introduces the standard projective measurement and treats each single-shot outcome as a Bernoulli coin toss whose parameter is set by the quantum algorithm. From there it builds up sampling error over N repeated shots, enumerating the possible outcome sequences, with a fuller calculation left to a bonus section.
- von Neumann measurement: efficient, strong, projective
- Single-shot outcomes as a Bernoulli distribution
- Projection noise and sampling error over a finite number of shots
- Counting outcome sequences (e.g. 2^3 for three samples)
Summary and key points drafted by a language model from the slides, not yet reviewed by me. The slides are the source.
Cite
@misc{minev2021quantumnoiseqgss,
author = {Zlatko K. Minev},
title = {{Intro to Quantum Noise (QGSS 2021)}},
howpublished = {Lecture series, Qiskit Global Summer School},
year = {2021},
url = {https://zlatko-minev.github.io/zlatko-minev-quantum-repository/series/intro-to-quantum-noise-qgss-2021/},
note = {Slides, 6 decks}
}Reuse
Unless a deck says otherwise, the slides and notes here are © Zlatko K. Minev and shared under CC BY-NC-ND 4.0: you're welcome to read, download and share them, unchanged and non-commercially, with credit and a link back. Commercial use or a reworked slide or figure in your own talk, course or paper needs permission; please ask, the answer is usually yes. If you use something in teaching or a publication, I'd love a short note telling me where.
Some slides include figures, photos, logos or excerpts from other people and institutions, credited where they appear. Those aren't mine to license, so please ask the original source. Spotted a missing credit? Tell me and I'll fix it.
