Quantum Information Science

3.

Quantum Computing

3.1.

Models of Quantum Computation

3.1.1.

3.1.1.1.

Quantum Circuits and Gates

3.1.1.2.

Circuit Depth and Width

3.1.1.3.

Parallel Computation

3.1.1.4.

Circuit Families and Uniformity

3.1.2.

Adiabatic Quantum Computing

3.1.2.1.

Adiabatic Theorem

3.1.2.2.

Problem Encoding in Hamiltonians

3.1.2.3.

Quantum Annealing

3.1.2.4.

Adiabatic vs Gate Model

3.1.3.

Measurement-Based Quantum Computing

3.1.3.1.

One-Way Quantum Computer

3.1.3.2.

3.1.3.2.1.

3.1.3.2.2.

Preparation Methods

3.1.3.3.

Measurement Patterns

3.1.3.4.

Teleportation-Based Computation

3.1.4.

Topological Quantum Computing

3.1.4.1.

Anyons and Braiding

3.1.4.2.

Topological Protection

3.1.4.3.

Fibonacci Anyons

3.1.4.4.

Majorana Fermions

3.1.5.

3.1.5.1.

Quantum Cellular Automata

3.1.5.2.

Continuous Variable Systems

3.1.5.3.

3.2.

Quantum Algorithms

3.2.1.

Early Quantum Algorithms

3.2.1.1.

Deutsch Algorithm

3.2.1.1.1.

Problem Statement

3.2.1.1.2.

Quantum Solution

3.2.1.1.3.

Exponential Speedup

3.2.1.2.

Deutsch-Jozsa Algorithm

3.2.1.2.1.

Generalization of Deutsch

3.2.1.2.2.

3.2.1.2.3.

Query Complexity

3.2.1.3.

Bernstein-Vazirani Algorithm

3.2.1.4.

Simon's Algorithm

3.2.1.4.1.

Period Finding Problem

3.2.1.4.2.

Exponential Separation

3.2.2.

Quantum Fourier Transform

3.2.2.1.

Definition and Properties

3.2.2.2.

Quantum Implementation

3.2.2.3.

Circuit Construction

3.2.3.

Shor's Factoring Algorithm

3.2.3.1.

Integer Factorization Problem

3.2.3.2.

Order Finding Reduction

3.2.3.3.

Period Finding Subroutine

3.2.3.4.

Quantum Fourier Transform Application

3.2.3.5.

Classical Post-Processing

3.2.3.6.

Cryptographic Implications

3.2.4.

Grover's Search Algorithm

3.2.4.1.

Unstructured Search Problem

3.2.4.2.

3.2.4.3.

Amplitude Amplification

3.2.4.4.

Optimal Search Bound

3.2.4.5.

Generalizations and Applications

3.2.5.

Quantum Phase Estimation

3.2.5.1.

Problem Statement

3.2.5.2.

Algorithm Description

3.2.5.3.

Precision and Success Probability

3.2.5.4.

Applications to Other Algorithms

3.2.6.

Variational Quantum Algorithms

3.2.6.1.

Variational Quantum Eigensolver (VQE)

3.2.6.1.1.

Hybrid Classical-Quantum Approach

3.2.6.1.2.

3.2.6.1.3.

Parameter Optimization

3.2.6.1.4.

Applications to Chemistry

3.2.6.2.

Quantum Approximate Optimization Algorithm (QAOA)

3.2.6.2.1.

Combinatorial Optimization

3.2.6.2.2.

Problem Mapping

3.2.6.2.3.

Parameter Landscapes

3.2.6.2.4.

Performance Analysis

3.2.6.3.

Variational Quantum Factoring

3.2.6.4.

Quantum Machine Learning Algorithms

3.2.7.

Quantum Simulation Algorithms

3.2.7.1.

Hamiltonian Simulation

3.2.7.2.

Trotter-Suzuki Decomposition

3.2.7.3.

Linear Combination of Unitaries

3.2.7.4.

Quantum Signal Processing

3.3.

Quantum Complexity Theory

3.3.1.

Quantum Complexity Classes

3.3.1.1.

BQP (Bounded-Error Quantum Polynomial Time)

3.3.1.2.

QMA (Quantum Merlin-Arthur)

3.3.1.3.

QIP (Quantum Interactive Proofs)

3.3.1.4.

3.3.2.

Relationships Between Classes

3.3.2.1.

Classical vs Quantum Classes

3.3.2.2.

Inclusion Relationships

3.3.2.3.

Oracle Separations

3.3.3.

Lower Bounds and Limitations

3.3.3.1.

Query Complexity

3.3.3.2.

Communication Complexity

3.3.3.3.

Quantum Advantage Limitations

3.4.

Quantum Error Correction and Fault Tolerance

3.4.1.

Quantum Noise and Decoherence

3.4.1.1.

Sources of Decoherence

3.4.1.1.1.

Environmental Coupling

3.4.1.1.2.

Imperfect Control

3.4.1.1.3.

Measurement Errors

3.4.1.2.

3.4.1.2.1.

Bit-Flip Errors

3.4.1.2.2.

Phase-Flip Errors

3.4.1.2.3.

Depolarizing Channel

3.4.1.2.4.

Amplitude Damping

3.4.1.2.5.

3.4.2.

Principles of Quantum Error Correction

3.4.2.1.

Classical vs Quantum Error Correction

3.4.2.2.

Redundancy in Quantum Systems

3.4.2.3.

Syndrome Measurement

3.4.2.4.

Error Recovery Operations

3.4.3.

Quantum Error-Correcting Codes

3.4.3.1.

3.4.3.1.1.

Three-Qubit Bit-Flip Code

3.4.3.1.2.

Three-Qubit Phase-Flip Code

3.4.3.1.3.

Shor's Nine-Qubit Code

3.4.3.2.

3.4.3.2.1.

Calderbank-Shor-Steane Construction

3.4.3.2.2.

3.4.3.2.3.

Quantum Reed-Muller Codes

3.4.3.3.

Stabilizer Codes

3.4.3.3.1.

Stabilizer Formalism

3.4.3.3.2.

Pauli Group and Stabilizers

3.4.3.3.3.

Error Syndromes

3.4.3.3.4.

Decoding Algorithms

3.4.3.4.

Topological Codes

3.4.3.4.1.

3.4.3.4.2.

3.4.3.4.3.

3.4.4.

Fault-Tolerant Quantum Computation

3.4.4.1.

Fault-Tolerance Criteria

3.4.4.2.

Threshold Theorem

3.4.4.2.1.

Error Threshold

3.4.4.2.2.

Concatenated Codes

3.4.4.2.3.

Implications for Scalability

3.4.4.3.

Fault-Tolerant Gate Sets

3.4.4.3.1.

Transversal Gates

3.4.4.3.2.

Magic State Distillation

3.4.4.3.3.

Gate Teleportation

3.4.4.4.

Fault-Tolerant Protocols

3.4.4.4.1.

Error Correction Circuits

3.4.4.4.2.

Syndrome Extraction

3.4.4.4.3.

Logical Operations

3.5.

Physical Implementations

3.5.1.

Superconducting Qubits

3.5.1.1.

Josephson Junctions

3.5.1.2.

3.5.1.3.

Transmon Qubits

3.5.1.4.

3.5.1.5.

Coherence Times and Control

3.5.2.

Trapped Ion Systems

3.5.2.1.

Ion Trapping Techniques

3.5.2.2.

Laser Cooling and Control

3.5.2.3.

Collective Modes

3.5.2.4.

Gate Operations

3.5.2.5.

Scalability Challenges

3.5.3.

Photonic Quantum Computing

3.5.3.1.

Single-Photon Sources

3.5.3.2.

Linear Optical Quantum Computing

3.5.3.3.

Photonic Cluster States

3.5.3.4.

Integrated Photonics

3.5.4.

3.5.4.1.

Optical Lattices

3.5.4.2.

Rydberg Interactions

3.5.4.3.

Quantum Control Techniques

3.5.4.4.

Many-Body Physics

3.5.5.

Solid-State Systems

3.5.5.1.

3.5.5.1.1.

Semiconductor Nanostructures

3.5.5.1.2.

3.5.5.1.3.

3.5.5.2.

Nitrogen-Vacancy Centers

3.5.5.2.1.

Spin Properties

3.5.5.2.2.

Optical Initialization and Readout

3.5.5.2.3.

Room Temperature Operation

3.5.5.3.

Silicon-Based Qubits

3.5.5.3.1.

3.5.5.3.2.

3.5.6.

Comparison of Platforms

3.5.6.1.

Coherence Times

3.5.6.2.

Gate Fidelities

3.5.6.3.

Scalability Prospects

3.5.6.4.

Control Requirements

Previous

2. Core Concepts of Quantum Information

Go to top

Next

4. Quantum Communication