Quantum Computing Lecture 8 Anuj Dawar Quantum Automata and Complexity

By Anuj Dawar et al

Read the original document by opening this link in a new tab.

Table of Contents

Models of Computation Shor’s algorithm Quantum parallelism and nondeterminism Quantum model of computation Finite State Systems DFAs and Matrices Nondeterministic Automata NFAs and Matrices Probabilistic Automata Language Accepted Quantum Automata Acceptance Probabilities Interference Turing Machines Configurations and Computations Nondeterministic Turing Machines Probabilistic Machines BPP Quantum Turing Machines BQP Complexity Classes

Summary

The lecture covers topics such as Shor’s algorithm, quantum parallelism, quantum model of computation, finite state systems, DFAs and matrices, nondeterministic automata, probabilistic automata, quantum automata, acceptance probabilities, interference, Turing machines, configurations and computations, nondeterministic Turing machines, probabilistic machines, BPP, quantum Turing machines, BQP, and complexity classes.