In Search of a Magic Bottle of Error-Be-Gone Dave Bacon Caltech Department of Physics Institute for Quantum Information Decoherence errosol.

Slides:



Advertisements
Similar presentations
Department of Computer Science & Engineering University of Washington
Advertisements

Q U RE: T HE Q UANTUM R ESOURCE E STIMATOR T OOLBOX Martin Suchara (IBM Research) October 9, 2013 In collaboration with: Arvin Faruque, Ching-Yi Lai, Gerardo.
Physics Information Day. Physics of Information Day.
The Threshold for Fault-Tolerant Quantum Computation Daniel Gottesman Perimeter Institute.
F AULT T OLERANT Q UANTUM C OMPUTATION December 21 st, 2009 Mirmojtaba Gharibi.
Quantum Error Correction Joshua Kretchmer Gautam Wilkins Eric Zhou.
A Universal Operator Theoretic Framework for Quantum Fault Tolerance Yaakov S. Weinstein MITRE Quantum Information Science Group MITRE Quantum Error Correction.
KEG PARTY!!!!!  Keg Party tomorrow night  Prof. Markov will give out extra credit to anyone who attends* *Note: This statement is a lie.
Chien Hsing James Wu David Gottesman Andrew Landahl.
Quantum Error Correction and Fault Tolerance Daniel Gottesman Perimeter Institute.
Quantum Error Correction Daniel Gottesman Perimeter Institute.
Ion Trap Quantum Computer. Two Level Atom as a qubit Electron on lower orbit Electron on higher orbit.
Quantum Computation and Error Correction Ali Soleimani.
5 Qubits Error Correcting Shor’s code uses 9 qubits to encode 1 qubit, but more efficient codes exist. Given our error model where errors can be any of.
CSEP 590tv: Quantum Computing Dave Bacon Aug 17, 2005 Today’s Menu Quantum Computing implementations Quantum Error Correction Quantum Cryptography Quantum.
Local Fault-tolerant Quantum Computation Krysta Svore Columbia University FTQC 29 August 2005 Collaborators: Barbara Terhal and David DiVincenzo, IBM quant-ph/
Beyond the DiVincenzo Criteria: Requirements and Desiderata for Fault-Tolerance Daniel Gottesman.
On the energy landscape of 3D spin Hamiltonians with topological order Sergey Bravyi (IBM) Jeongwan Haah (Caltech) FRG Workshop, Cambridge, MA May 18,
UNIVERSITY OF NOTRE DAME Xiangning Luo EE 698A Department of Electrical Engineering, University of Notre Dame Superconducting Devices for Quantum Computation.
Memory Hierarchies for Quantum Data Dean Copsey, Mark Oskin, Frederic T. Chong, Isaac Chaung and Khaled Abdel-Ghaffar Presented by Greg Gerou.
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
Threshold for Life MIT Media Laboratory Prof. Isaac Chuang.
Quantum Communication, Quantum Entanglement and All That Jazz Mark M. Wilde Communication Sciences Institute, Ming Hsieh Department of Electrical Engineering,
Quantum Information Processing
Superconducting Qubits Kyle Garton Physics C191 Fall 2009.
Requirements and Desiderata for Fault-Tolerant Quantum Computing Daniel Gottesman Perimeter Institute for Theoretical Physics Beyond the DiVincenzo Criteria.
Quantum Error Correction Jian-Wei Pan Lecture Note 9.
Quantum Error Correction and Fault-Tolerance Todd A. Brun, Daniel A. Lidar, Ben Reichardt, Paolo Zanardi University of Southern California.
From Bits to Qubits Wayne Viers and Josh Lamkins
Quantum Computers: Fundamentals, Applications and Implementation Ben Feldman, Harvard University Big Techday Conference June 14, 2013 Image: Introduction.
Quantum computation: Why, what, and how I.Qubitology and quantum circuits II.Quantum algorithms III. Physical implementations Carlton M. Caves University.
Quantum Computing Preethika Kumar
An Introduction to Quantum Phenomena and their Effect on Computing Peter Shoemaker MSCS Candidate March 7 th, 2003.
The Road to Quantum Computing: Boson Sampling Nate Kinsey ECE 695 Quantum Photonics Spring 2014.
Blake Morell Daniel Bowser Trenton Wood. Contents Background Experimental Design & Outcome Implications Future Applications.
Quantum Computing Paola Cappellaro
1 Dorit Aharonov Hebrew Univ. & UC Berkeley Adiabatic Quantum Computation.
Classical Control for Quantum Computers Mark Whitney, Nemanja Isailovic, Yatish Patel, John Kubiatowicz U.C. Berkeley.
A Study of Error-Correcting Codes for Quantum Adiabatic Computing Omid Etesami Daniel Preda CS252 – Spring 2007.
CENTER FOR EXOTIC QUANTUM SYSTEMS CEQS Preskill 1983 Kitaev 2002 Refael 2005 Motrunich 2006 Fisher 2009 Historically, Caltech physics has focused on the.
© 2015 AT&T Intellectual Property. All rights reserved. AT&T, the AT&T logo and all other AT&T marks contained herein are trademarks of AT&T Intellectual.
Quantum Convolutional Coding Techniques Mark M. Wilde Communication Sciences Institute, Ming Hsieh Department of Electrical Engineering, University of.
A simple nearest-neighbour two-body Hamiltonian system for which the ground state is a universal resource for quantum computation Stephen Bartlett Terry.
Quantum Mechanics(14/2) Hongki Lee BIOPHOTONICS ENGINEERING LABORATORY School of Electrical and Electronic Engineering, Yonsei University Quantum Computing.
Large scale quantum computing in silicon with imprecise qubit couplings ArXiv : (2015)
Capabilities and limitations of quantum computers Michele Mosca 1 November 1999 ECC ’99.
Fidelity of a Quantum ARQ Protocol Alexei Ashikhmin Bell Labs  Classical Automatic Repeat Request (ARQ) Protocol  Quantum Automatic Repeat Request (ARQ)
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
Adiabatic Quantum Computing Josh Ball with advisor Professor Harsh Mathur Problems which are classically difficult to solve may be solved much more quickly.
Suggestion for Optical Implementation of Hadamard Gate Amir Feizpour Physics Department Sharif University of Technology.
Quantum is Different, Part 1. Richard Feynman Caltech Course : Potentialities and Limitations of Computing Machines “Nature isn't classical, dammit,
Quantum Bits (qubit) 1 qubit probabilistically represents 2 states
QUANTUM COMPUTING: Quantum computing is an attempt to unite Quantum mechanics and information science together to achieve next generation computation.
sparse codes from quantum circuits
Linear Quantum Error Correction
Quantum Information and Everything.
A low cost quantum factoring algorithm
Algorithmic simulation of far-from- equilibrium dynamics using quantum computer Walter V. Pogosov 1,2,3 1 Dukhov Research Institute of Automatics (Rosatom),
Quantum Engineering & Control
2nd Lecture: QMA & The local Hamiltonian problem
Threshold for Life Prof. Isaac Chuang MIT Media Laboratory.
Reliability is a Fungible Resource
Quantum Computing Dorca Lee.
3rd Lecture: QMA & The local Hamiltonian problem (CNT’D)
Topological quantum computing ▬ Toric code
Guin-Dar Lin, Luming Duan University of Michigan 2009 DAMOP Meeting
Improving Quantum Circuit Dependability
Experimental Comparison of Two Quantum Computing Architectures
Quantum Computing Hakem Alazmi Jhilakshi Sharma Linda Vu.
Magic-State Functional Units
Presentation transcript:

In Search of a Magic Bottle of Error-Be-Gone Dave Bacon Caltech Department of Physics Institute for Quantum Information Decoherence errosol

The Future Visualize 2040: Experimentalists all just thought what will a quantum computer look like? Ion Traps Optical Lattices Josephson Junctions Linear Optics + a bit Electron Spins Quantum Architecture?

Fault Tolerant Quantum Architecture? At the lowest level we must perform quantum error correction and use fault-tolerant techniques. What is the “best” way to do this? Today’s talks on quantum error correction will drastically influence what a quantum computer looks like…

“Best?” Objection: BEST depends on strengths and weaknesses of particular physical implementations physical implementation gate speeds gate accuracies gate costs forms of decoherence decoherence times shuttling speeds shuttling accuracies cooling rates calibration errors degree of parallelism geometric constraints fabrication constraints theory brain trust quantum architecture specification plans suitable for founding qIntel

Two Paths even today TWO styles are emerging concatenation local codes

Concatenation 1 qubit n qubits qubits probability of failure p cp 2 n 2 qubits c(cp 2 ) 2 n k qubits (cp) /c 2k2k 1 2 k 0 level exponential decrease in # qubits if p<1/c=p thresh

A quantum circuit with k gates can be simulated with error probability e using O(k poly(log(k/e))) gates on hardware whose components fail with probability p less than some threshold p thresh under caveats A, B, C, D,… Threshold Theorem faulty components almost certainly not faulty

Concatenation and Locality Concatenation is hierarchical how to merge with local bare qubits? despite: moving or swapping qubits creates error rate proportional to distance moved THERE IS STILL A THRESHOLD THEOREM Daniel Gottesman, 1999

Are there non-hierarchical ways to do fault-tolerant quantum computation?

Kitaev’s Toric Codes qubits on links plaque operators vertex operators syndrome measurements involve only four qubit local measurements! 2 encoded qubits BUT: diagnosing error is not a local process. 1 encoded qubit

Local Codes Can we find a fully local code? syndrome + diagnosis and correction + fault-tolerant In 4 dimensions there is a fully local code (sit down silly string theorists)

Physics and Toric Codes qubits on links plaque operators vertex operators 2 encoded qubits ground state is the toric code! energy required to excite out of code: at low temperatures we can freeze out errors. error correction still needed

The Physics Guarantee What is the phase of matter corresponding to the computer? There are distinct PHYSICAL and DYNAMICAL reasons why robust classical computation is possible. not all physical systems are equally good for computation: there exist systems whose PHYSICS guarantees their ability to enact robust classical computation. Rant mode ON

In Practice Coding: majority vote of current Integrated CircuitHard Drive Error correction: amplification fault-tolerance guaranteed by conducting-insulating phase transition Coding: majority vote of magnetism Error correction: local energy minimization

The Physics Guarantee What is the phase of matter corresponding to the computer? There are distinct PHYSICAL and DYNAMICAL reasons why robust classical computation is possible. not all physical systems are equally good for computation: there exist systems whose PHYSICS guarantees their ability to enact robust classical computation. Rant mode ON Are there (or can we engineer) physical systems whose PHYSICS guarantees robust quantum computation? What is the phase of matter corresponding to the quantum computer?

The Quantum Hard Drive? Do there exist (or can we engineer) quantum systems whose physics guarantees fault-tolerant quantum computation? 1. Coherence preserving. 2. Accessible Fault-Tolerant Operations 3. Universality “self-correcting” Kitaev’s Codes hint that this is possible (in <4D!) Rant mode shutting down

What Will a QC Look Like? concatenation Engineering? local codes Physics? Rant mode OFF CuBits