Explore the potential of quantum computing for factoring in this invited talk from Crypto 2017. Delve into Shor's Factoring Algorithm, digital quantum computing challenges, and error detection methods. Examine experimental results from a 9-qubit system demonstrating bit-flip error correction. Discuss goals for quantum supremacy, quantum-resistant classical cryptography, and advancements in quantum chemistry algorithms. Learn about Feynman's vision for quantum simulation and its implications for future applications.
Overview
Syllabus
Intro
Quantum Data
Shor's Factoring Algorithm
Digital Quantum Computing: Qubit Errors
Error Detection Math
Error Detection Basics
Misidentifying Qubit Errors
Size of Logical Qubits
Classical Factoring
Qubit Operation
Experiment: Linear Chain of 9 qubits
9 Qubit Data: Bit-Flip Error Correction Works!
Goals for Complexity & Quantum Supremacy
Detecting Fake News: A 2-D Horse Race
Quantum Resistant Classical Cryptography
Feynman's Killer App: Simulation of quantum systems
Huge Progress in Algorithms for Quantum Chemistry
Taught by
TheIACR
