Skip to content

CSCI3350

Introduction to Quantum Computing

Qubits and quantum circuits, measurement and interference, quantum algorithms, error correction and stabilizer simulation, quantum cryptography and quantum complexity.

9 chapters · 28 sectionsEN · 繁 · 简
My course notes

Your progress

0/ 28 sections marked complete

Next section: Qubits, entanglement, and teleportation

Completion marks are saved in this browser.

This course in the web

In the CSCI3350 notes

Theorem cards
87
Definitions
62
Counterexamples
32
Concept lenses
11
Histories of ideas
1
Proof X-rays
30

Sections with a history of an idea

None of these is on the timeline yet.

No concept lens from this course is recorded in the web yet.

Open this course in the knowledge map

Counts cover the 28 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.

In the webTheorem cards 87 · Definitions 62 · Counterexamples 32 · Concept lenses 11 · Histories of ideas 1 · Proof X-rays 30

None of these is on the timeline yet.

No concept lens from this course is recorded in the web yet.

Open this course in the knowledge map

Counts cover the 28 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.

Chapter 1 · 10 sections

Quantum information

Quantum information

Theorems 33 · Definitions 24Counterexamples 11Lenses 3Proof X-rays 11

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 1.1

    Qubits, entanglement, and teleportation

    Build quantum states and measurement from linear algebra, then follow the information flow in teleportation.

  2. 1.2

    The Bloch ball and distinguishing quantum states

    Represent qubit density matrices geometrically and derive the optimal binary discrimination rule.

  3. 1.3

    Schmidt decomposition and pure-state entanglement

    Use a matrix singular-value decomposition to understand bipartite pure states and their reduced states.

  4. 1.4

    Superdense coding and its resource count

    Derive the Bell-state encoding and decoding circuit, prove the no-signaling marginal, and distinguish exact discrimination from unrestricted capacity claims.

  5. 1.5

    Quantum noise channels and complete positivity

    Build Kraus maps, calculate qubit noise, and test positivity on an entangled reference.

  6. 1.6

    The SWAP test and quantum-state overlap

    Derive the SWAP-test outcome from controlled exchange and distinguish overlap from equality.

  7. 1.7

    Zero-noise extrapolation and its cost

    Derive first-order noise cancellation and examine residual bias, sampling variance and readout errors.

  8. 1.8

    CHSH correlations and the Tsirelson bound

    Prove the optimal quantum CHSH value, including binary POVMs, and compare it with no-signaling correlations.

  9. 1.9

    Density matrices and the partial trace

    Develop mixed states, reduced states and no-signaling using finite-dimensional linear algebra.

  10. 1.10

    Trace distance and data processing

    Optimize binary discrimination with unequal priors and prove that channels cannot increase trace distance.

Chapter 2 · 8 sections

Quantum algorithms

Quantum algorithms

Theorems 21 · Definitions 17Counterexamples 9Lenses 3History 1Proof X-rays 8

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 2.1

    Deutsch–Jozsa, phase kickback and oracle promises

    Derive the one-query promise algorithm, compare deterministic and randomized classical queries, and recover a hidden binary string.

  2. 2.2

    Quantum Fourier transform, phase estimation, and search

    Derive Fourier unitarity, estimate an eigenphase, and analyze amplitude amplification by reflections.

  3. 2.3

    The quantum Fourier transform as a circuit

    Derive the product form, controlled rotations, bit reversal, and an approximate-circuit error bound.

  4. 2.4

    Phase estimation beyond exact binary phases

    Derive the measurement distribution, nearest-grid guarantee, and behavior on a superposition of eigenstates.

  5. 2.5

    Simon’s algorithm, Bell correlations, and error correction

    Use parity interference, derive a Bell inequality, and diagnose single-qubit bit flips without measuring the encoded state.

  6. 2.6

    Why a random base helps Shor's factoring reduction

    Use the Chinese remainder theorem to bound the chance that an exact order reveals factors.

  7. 2.7

    Order finding and rational reconstruction

    Connect phase-estimation samples to continued fractions, verified periods, and factoring.

  8. 2.8

    Amplitude amplification beyond uniform search

    Derive the two-reflection rotation, account for state-preparation cost, and analyze overshoot.

Chapter 3 · 2 sections

Quantum error correction

Quantum error correction

Theorems 4 · Definitions 4Counterexamples 2Lenses 2Proof X-rays 2

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 3.1

    Quantum error correction beyond bit flips

    Use phase-flip codes and stabilizer syndromes to understand correction of arbitrary errors on one qubit.

  2. 3.2

    CSS quantum codes from nested binary codes

    Build stabilizers and logical states from two classical codes and identify the two kinds of distance.

Chapter 4 · 1 section

Stabilizer simulation

Stabilizer simulation

Theorems 4 · Definitions 3Counterexamples 2Lenses 1Proof X-rays 1

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 4.1

    Clifford gates and exact stabilizer simulation

    Derive binary Pauli multiplication, phase-correct gate updates and measurement branches, then prove a polynomial-time simulator for a precisely specified ideal circuit model.

Chapter 5 · 1 section

Quantum cryptography

Quantum cryptography

Theorems 3 · Definitions 2Counterexamples 1Lenses 1Proof X-rays 1

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 5.1

    BB84: key distribution and information disturbance

    Derive basis sifting, analyze intercept–resend, and distinguish an ideal attack calculation from a security proof.

Chapter 6 · 1 section

Quantum complexity

Quantum complexity

Theorems 3 · Definitions 3Counterexamples 1Proof X-rays 1

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 6.1

    BQP, QMA and quantum verification

    Define uniform bounded-error quantum computation and quantum witnesses, prove basic containments, and distinguish amplification from unproved separations.

Chapter 7 · 1 section

Measurement circuits

Coherent records and classical feed-forward.

Theorems 2 · Definitions 1Counterexamples 1Proof X-rays 1

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 7.1

    Deferred measurement and classical feed-forward

    Construct a coherent record for a computational-basis measurement and prove which outcome statistics it preserves.

Chapter 8 · 1 section

Qubit phase and interference

Distinguish global phase, relative phase and measurement.

Theorems 3 · Definitions 2Counterexamples 1Lenses 1Proof X-rays 2

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 8.1

    Qubit phase: global factors, relative phase and Hadamard interference

    Derive a one-qubit interference experiment from complex amplitudes, prove global-phase invariance, and distinguish coherent evolution from measurement and classical mixtures.

Chapter 9 · 3 sections

Quantum circuits

Universal gate sets, reversible computation and uncomputation.

Theorems 14 · Definitions 6Counterexamples 4Proof X-rays 3

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 9.1

    Single-qubit universality: exact rotations and a finite gate set

    Derive Euler rotations, prove density of H and T, and separate approximation from efficient synthesis.

  2. 9.2

    Exact two-qubit synthesis from single-qubit gates and CNOT

    A self-contained, phase-exact proof that every two-qubit unitary is a finite product of arbitrary single-qubit U(2) gates and CNOT gates, with no ancillas. The proof proceeds by two-level elimination, Hamming-path relabeling, controlled-phase and controlled-U(2) constructions, and diagonal synthesis, and ends with an error analysis for finite gate sets.

  3. 9.3

    Reversible oracles and uncomputation

    Build a coherent Boolean oracle from reversible gates and remove its workspace.

Vercel visit statistics and public-page performance measurements each require separate consent. Neither is needed to use the website.

Website function storage (used when needed)

Security, sign-in and your chosen preferences use storage when needed. This is separate from optional statistics.

Withdrawing stops future statistics. The page reloads if analytics code needs unloading. It does not delete data already sent.

Read Cookie and storage details