QCQI - Chapter 1: Overview & Postulates
Learning Objectives¶
Why quantum computation? Key resources: superposition, interference, entanglement.
Four postulates (finite-dimensional) + density operators and POVMs.
Composition & reduced states; Bell states as a running example.
Big Picture¶
Quantum algorithms engineer interference so that correct answers add and incorrect answers cancel.
Eureka! Interference is the computational “workhorse”: amplitudes carry phase information that algorithms program.
Postulate I: States¶
Pure states or density operators , .
Mixed states capture ignorance/noise.
Eureka! Density matrices unify classical randomness and quantum coherence.
Postulate II: Evolution¶
Closed: ; Open: with .
Eureka! Unitary + environment + trace-out Kraus form (Stinespring).
Postulate IV: Composition¶
; reduces via partial trace.
Bell state: , with .
Eureka! Purity can be global but not local.
Hands-on Notebook¶
Companion notebook (multi-backend): L01
Set backend in the first cell to cirq, pennylane, braket, pyquil, or qiskit.
Mini-Lab¶
Compare Hadamard statistics across two frameworks.
Program a 2-outcome POVM and verify total probability.
Build a Bell pair and compute reduced density matrices.
Takeaways¶
Postulates define the rules of the game.
Density operators and POVMs generalize states and measurements.
Entanglement = nonclassical correlations revealed by reduced states.