Lectures 1-4

CIS 400: Introduction to Quantum Computation Lecture Notes

Class Overview and Syllabus

• Objectives:

  • Why do we want to use quantum computing?

  • How does quantum computing work on a technical level?

  • When would a quantum computer be practically useful, and at what point will we actually be using quantum computation to solve problems?

• Topics Covered:

  • Quantum basics

  • Quantum gates and circuits

  • Quantum simulation in Python

  • Quantum error correction

  • Quantum channels

• Grading and References:

  • Grading details and logistics outlined in the syllabus.

  • References include:

  • Quantum Computation and Quantum Information by Nielsen and Chuang

  • Scott Aronson’s lecture notes

  • Additional resources are provided in the syllabus.

Classical and Quantum Computation

• Classical Computing Definition:

  • Classical computation processes input data via a function: f(data) = output

  • Concerned about the implementation of f as the size of the data grows.

  • Church-Turing Thesis:

  • Any language or computer can do any computation, some may require infinite resources.

• Extended Church-Turing Thesis:

  • Any quantum computer can do any computation efficiently (meaning polynomial time overhead).

  • Known quantum algorithms demonstrating exponential or quadratic speedups exist, such as:

  • Grover’s algorithm for searching unstructured lists.

• Current Status:

  • Quantum computing is still in infancy; theoretical advantages are now driving innovation.

The Qubit

• Definition of a Qubit:

  • Generalization of a classical bit allowing for superpositions of classical states.

  • A classical bit can be either 0 or 1 with basic operations: identity and NOT.

• Geometric Representation of a Qubit:

  • A qubit can be represented as a vector written with respect to a chosen basis (e.g., extbf{x}, extbf{y}).

  • Basis choice allows for a gauge invariance where the qubit state remains unchanged under basis transformation.

• Vector Notation and Magnitude:

  • A qubit state extbf{00} can be represented as:

  • Conventional: extbf{00} = a extbf{x} + b extbf{y}

  • Column vector format: extbf{00} = egin{pmatrix} a \ b \ ext{where} \ a, b o ext{R};

• Magnitude Definition:

  • Magnitude of vector extbf{v} is defined as:

  • | extbf{v}| = extbf{v} ullet extbf{v} = extoverline{a}^2 + b^2;

  • If represented in column vector as extbf{v} = egin{pmatrix} a \ b \ ext{then \}

  • | extbf{v}|^2 = extbf{v}^T extbf{v};

• Complex Vector Magnitude:

  • For complex vectors, redefine magnitude as: | extbf{v}|^2 = extbf{v}^ ext{†} extbf{v};

  • Complex number representation and its conjugate are vital, e.g., if z o ext{C}.

Bra-Ket Notation

• Definitions:

  • A state vector represented as ket: |
    
    angle and its conjugate transpose as bra: ra
    | .

• Magnitude in Bra-Ket Notation:

  • Writing magnitude | extbf{v}|^2 in bra-ket as:

  • | extbf{v}|^2 = ra
    |
    
    angle

• Change of Basis:

  • Define vector projection through coefficients obtained from basis vector projections:

  • Projections: a = extbf{01} ullet extbf{v}

  • Projection matrix definition and properties.

  • Resolution of identity holds for all bases.

Measurement

• Measurement Process:

  • Information extracted from quantum state through measurement.

  • Governed by the Born Rule:

  • Probability of outcome k given by: P(k) = | ra k |
    angle |^2:

    • For state |
      
      angle = heta | 0
      angle +
      u | 1
      angle, yields:

    • P(0) = | heta|^2, P(1) = |
      u|^2;

    • Measurement probabilities must sum to 1, so: | heta|^2 + |
      u|^2 = 1.

• Qubit Definition Revisited:

  • A qubit is a quantum state of unit length.

  • Relative phase holds physical significance under measurement conditions.

Unitary Change of Basis and Actions on a Qubit

• Unitary Matrices Definition:

  • If U o ext{C}^{n imes n} is a unitary matrix:

  • Preserves the inner product: U^ ext{†} U = I .

• Eigenvalues and Diagonalizability:

  • All eigenvalues of unitary matrices hold unit modulus: | ext{e}^{i heta_k} | = 1.

• Action on a Qubit:

  • Unitary operators act on quantum states; e.g., |\uparrow
    angle and follow superposition principles enforceable by unitary operators like CNOT, Pauli gates.

Quantum Circuit and Notation

• Gates and Measurement:

  • Quantum circuit diagrams simplify representation of gates, unitary operations, and measurement; facilitating quantum computation design.

• Controlled Operations:

  • Generalization using controlled gates extends to various quantum operations, e.g., Controlled-Z or Controlled-NOT (CNOT).

Density Operators and Entanglement

• Density Operators Definition:

  • A density operator is a positive semidefinite operator with trace equal to 1 used to describe quantum states (especially mixed states).

  • 
    ho o ext{C}^n depends on individual state probabilities holding relationships to entangled states.

• Entangled States:

  • Definitions and examples of entangled states, e.g., Bell states which cannot be decomposed into product states of individual qubits.

Conclusion

• Comprehensive Understanding of Quantum Circuits and Measurements:

  • Understanding quantum states, operations, and systems through a rigorous mathematical framework enriches potential applications in quantum computing.

Notes: Further details on operations and examples can be clarified in upcoming lectures.