Quantum Computation. Dr Austin Fowler Centre for Quantum Computer Technology. New Scientist, 10/11/07
|
|
|
- Malcolm Bell
- 5 years ago
- Views:
Transcription
1 Quantum Computation Dr Austin Fowler Centre for Quantum Computer Technology New Scientist, 10/11/07
2 Overview what is a quantum computer? bits vs qubits superpositions and measurement implementations why quantum compute? existing computers are great, however... quantum parallelism and factoring other promising quantum algorithms quantum cryptography primary challenge: quantum errors correction techniques open problems conclusion: we need you! dilution refrigerator capable of cooling samples to a hundredth of a degree above absolute zero
3 What is a quantum computer? first: what is a classical computer? NAND A B Q definition 1: device capable of executing NAND NAND is universal, right?
4 What is a classical computer? much more in the figure initialisation fanout internal memory transport readout NAND full computer also has clock external memory program controller
5 What is a quantum computer? introducing CNOT introducing U A B C D
6 What is a quantum computer? above circuit has special name: Toffoli implies quantum computing contains classical computing
7 What is a quantum computer? superpositions: measurements no classical equivalents
8 What is a quantum computer? implementations: ion traps qubit: electron excited/not CNOT: collide atoms U: lasers initialisation/readout: lasers + sensitive optical detectors fanout: impossible transport: electromagnetic shuttling internal memory: seconds clock, external memory, program controller: all classical
9 What is a quantum computer? flux qubits liquid NMR optical lattices phosphorus in silicon
10 What is a quantum computer? linear optics on-chip optics quantum dots diamond
11 What is a quantum computer? ultimately, implementation is someone else s problem re-introducing CNOT re-introducing U A B C D also: initialisation, readout, memory, transport everything hard to implement, at least one error rate 10%+
12 Why quantum compute? classical computers are pretty awesome! stats of the Cray Jaguar (world s most powerful computer): 1.75 petaflops 10 petabytes of storage 180,000 processing cores 578 TB/s memory bandwidth 360 terabytes of RAM 284 GB/s I/O bandwidth surely that s enough for anything?
13 Why quantum compute? not enough for factoring a 2048 bit number! N N 1 N 2 inefficient on a classical computer transform to f(x) = m x mod N = f(x+x p ) x p fire up quantum computer! calculate measure Quantum Fourier Transform (QFT) x p N N 1 N 2 efficient on a quantum computer!
14 Why quantum compute? full dynamics of materials every atom contains many quantum d.o.f. need at least 2 d.o.f. space to represent quantum properties even 10 petabytes is at most only 60 d.o.f. meaningful simulations of HTSC impossible quantum chemistry, materials design, particle physics
15 Why quantum compute? code breaking particle physics quantum key distribution random walks materials simulation BQP = NP? early universe quantum chemistry knot theory group theory
16 Primary challenge: quantum errors initialisation, memory (I), unitary (U), CNOT, measurement at least one 10%+ error rate operation in existing implementations intolerable... using existing quantum error correction (QEC) techniques
17 Quantum error correction what is a quantum error? hard to correct! much easier if errors discrete bit-flip phase-flip Peter Shor noted: arbitrary error just superposition of X and Z! need to define stabilisers to proceed
18 Stabilisers
19 Surface code most powerful QEC code invented to date requires 2D lattice of qubits only requires nearest neighbor interactions circuits capable of measuring the sign of a stabiliser
20 Quantum error correction
21 Quantum error correction Record time and position of changed syndromes Match closest pairs Apply corrective operations to spacelike edges Works very well, threshold error rate ~1%
22 The story so far... a quantum computer will be a 2D lattice of qubits optical lattices superconducters ion traps many others current experimental error rates 10%+ robust computation via the surface code current maximum tolerable error rate ~1%
23 Open problems make the classical processing much faster O(n 3 ) parallelise and localise the classical processing raise the maximum tolerable error rate! lower overhead
24 Faster classical processing minimum weight perfect matching algorithm O(n 3 ) time on n nodes basic idea: chose unmatched node O(n) check each edge of tree to see if tight O(n) grow tree using tight edges till another unmatched node found O(n) augment
25 Faster classical processing (nearly) complete weighted graph takes O(n 2 ) time just to input unnecessary! Viewed from any node, every nearest neighbour casts a shadow only need constant number of edges to obtain optimal solution
26 Faster classical processing given tree consisting of n t nodes each with m edges on average, need O(n t m) time to calculate tightest edge unnecessary! Store edges of each node in Fibonacci heaps prioritised by tightness can merge n h heaps in O(n h ) time can find tightest edge in O(1) time
27 Faster classical processing as more nodes are matched, remaining nodes become isolated requiring larger trees unnecessary! Match nodes systematically in space and time and grow trees preferentially in the direction of unmatched nodes none of these ideas have been implemented despite O(n 3 ) O(n) advantage
28 Parallelise and localise basic idea: not implemented
29 Tolerate more error currently, X/Z errors corrected independently an error means one of X, Z, XZ if we know X error present, 50% chance Z error present not implemented
30 Lower overhead details beyond the scope of this talk highly nontrivial to pack circuits open problems discussed here are just the tip of the iceberg
31 Summary quantum computers can solve more problems efficiently than classical computers quantum computers are technologically exotic and error prone controlling quantum errors could be done much better with help from computer science quantum computing needs you! Interested? Austin Fowler: Adrian Pearce:
*WILEY- Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co.
Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition *WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Contents Preface XIII 1 Introduction
Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. KGaA
Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Preface XIII 1 Introduction and
Overview of Topological Cluster-State Quantum Computation on 2D Cluster-State
Overview of Topological Cluster-State Quantum Computation on 2D Cluster-State based on High-threshold universal quantum computation on the surface code -Austin G. Fowler, Ashley M. Stephens, and Peter
Quantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139
Quantum Error Correcting Codes and Quantum Cryptography Peter Shor M.I.T. Cambridge, MA 02139 1 We start out with two processes which are fundamentally quantum: superdense coding and teleportation. Superdense
Simon s algorithm (1994)
Simon s algorithm (1994) Given a classical circuit C f (of polynomial size, in n) for an f : {0, 1} n {0, 1} n, such that for a certain s {0, 1} n \{0 n }: x, y {0, 1} n (x y) : f (x) = f (y) x y = s with
Quantum Computation 650 Spring 2009 Lectures The World of Quantum Information. Quantum Information: fundamental principles
Quantum Computation 650 Spring 2009 Lectures 1-21 The World of Quantum Information Marianna Safronova Department of Physics and Astronomy February 10, 2009 Outline Quantum Information: fundamental principles
QUANTUM CRYPTOGRAPHY QUANTUM COMPUTING. Philippe Grangier, Institut d'optique, Orsay. from basic principles to practical realizations.
QUANTUM CRYPTOGRAPHY QUANTUM COMPUTING Philippe Grangier, Institut d'optique, Orsay 1. Quantum cryptography : from basic principles to practical realizations. 2. Quantum computing : a conceptual revolution
Quantum Computation. Michael A. Nielsen. University of Queensland
Quantum Computation Michael A. Nielsen University of Queensland Goals: 1. To eplain the quantum circuit model of computation. 2. To eplain Deutsch s algorithm. 3. To eplain an alternate model of quantum
Algorithms for quantum computers. Andrew Childs Department of Combinatorics & Optimization and Institute for Quantum Computing University of Waterloo
Algorithms for quantum computers Andrew Childs Department of Combinatorics & Optimization and Institute for Quantum Computing University of Waterloo What is a computer? A means for performing calculations
Quantum Computation and Communication
Tom Lake tswsl1989@sucs.org 16/02/2012 quan tum me chan ics: The branch of mechanics that deals with the mathematical description of the motion and interaction of subatomic particles - OED quan tum me
Introduction to Quantum Information Processing
Introduction to Quantum Information Processing Lecture 6 Richard Cleve Overview of Lecture 6 Continuation of teleportation Computation and some basic complexity classes Simple quantum algorithms in the
Quantum Computing. Separating the 'hope' from the 'hype' Suzanne Gildert (D-Wave Systems, Inc) 4th September :00am PST, Teleplace
Quantum Computing Separating the 'hope' from the 'hype' Suzanne Gildert (D-Wave Systems, Inc) 4th September 2010 10:00am PST, Teleplace The Hope All computing is constrained by the laws of Physics and
Shor s Prime Factorization Algorithm
Shor s Prime Factorization Algorithm Bay Area Quantum Computing Meetup - 08/17/2017 Harley Patton Outline Why is factorization important? Shor s Algorithm Reduction to Order Finding Order Finding Algorithm
Autonomous Quantum Error Correction. Joachim Cohen QUANTIC
Autonomous Quantum Error Correction Joachim Cohen QUANTIC Outline I. Why quantum information processing? II. Classical bits vs. Quantum bits III. Quantum Error Correction WHY QUANTUM INFORMATION PROCESSING?
arxiv: v3 [quant-ph] 21 Feb 2013
![arxiv: v3 [quant-ph] 21 Feb 2013](/thumbs/90/104320469.jpg "arxiv: v3 [quant-ph] 21 Feb 2013")
Surface code quantum computing by lattice surgery arxiv:1111.4022v3 [quant-ph] 21 Feb 2013 Clare Horsman 1, Austin G. Fowler 2, Simon Devitt 3 and Rodney Van Meter 4 1 Keio University Shonan Fujisawa Campus,
The Quantum Supremacy Experiment
The Quantum Supremacy Experiment John Martinis, Google & UCSB New tests of QM: Does QM work for 10 15 Hilbert space? Does digitized error model also work? Demonstrate exponential computing power: Check
The Deutsch-Josza Algorithm in NMR
December 20, 2010 Matteo Biondi, Thomas Hasler Introduction Algorithm presented in 1992 by Deutsch and Josza First implementation in 1998 on NMR system: - Jones, JA; Mosca M; et al. of a quantum algorithm
high thresholds in two dimensions
Fault-tolerant quantum computation - high thresholds in two dimensions Robert Raussendorf, University of British Columbia QEC11, University of Southern California December 5, 2011 Outline Motivation Topological
Seminar 1. Introduction to Quantum Computing
Seminar 1 Introduction to Quantum Computing Before going in I am also a beginner in this field If you are interested, you can search more using: Quantum Computing since Democritus (Scott Aaronson) Quantum
Quantum computers still work with 25% of their qubits missing
Quantum computers still work with 25% of their qubits missing Sean Barrett Tom Stace (UQ) Phys. Rev. Lett. 102, 200501(2009) Phys. Rev. A 81, 022317 (2010) Phys. Rev. Lett. 105, 200502 (2010) Outline Loss/leakage
A Quantum von Neumann Architecture for Large-Scale Quantum Computing
A Quantum von Neumann Architecture for Large-Scale Quantum Computing Matthias F. Brandl Institut für Experimentalphysik, Universität Innsbruck, Technikerstraße 25, A-6020 Innsbruck, Austria November 15,
Short introduction to Quantum Computing
November 7, 2017 Short introduction to Quantum Computing Joris Kattemölle QuSoft, CWI, Science Park 123, Amsterdam, The Netherlands Institute for Theoretical Physics, University of Amsterdam, Science Park
Compute the Fourier transform on the first register to get x {0,1} n x 0.
CS 94 Recursive Fourier Sampling, Simon s Algorithm /5/009 Spring 009 Lecture 3 1 Review Recall that we can write any classical circuit x f(x) as a reversible circuit R f. We can view R f as a unitary
!. 2) 3. '45 ( !"#!$%!&&' 9,.. : Cavity QED . / 3., /*. Ion trap 6..,%, Magnetic resonance Superconductor
0 1!"#!$%!&&' ()*+,-! 2) 3 '45 ( 0 9, : 3, * 6,%, -73 35 8 Cavity QED Magnetic resonance Ion trap Superconductor 7 : ) :; 1 ( 6 7? 2 + ' - < 75 @ *6 97
Introduction to Quantum Computing
Introduction to Quantum Computing Part II Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 13, 2011 Overview Outline Grover s Algorithm Quantum search A worked example Simon s algorithm
Topological Quantum Computation. Zhenghan Wang Microsoft Station Q & UC Sana Barbara Texas, March 26, 2015
Topological Quantum Computation Zhenghan Wang Microsoft Station Q & UC Sana Barbara Texas, March 26, 2015 Classical Physics Turing Model Quantum Mechanics Quantum Computing Quantum Field Theory??? String
C/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9
C/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9 1 Readings Benenti, Casati, and Strini: Quantum Gates Ch. 3.2-3.4 Universality Ch. 3.5-3.6 2 Quantum Gates Continuing
Logic gates. Quantum logic gates. α β 0 1 X = 1 0. Quantum NOT gate (X gate) Classical NOT gate NOT A. Matrix form representation
Quantum logic gates Logic gates Classical NOT gate Quantum NOT gate (X gate) A NOT A α 0 + β 1 X α 1 + β 0 A N O T A 0 1 1 0 Matrix form representation 0 1 X = 1 0 The only non-trivial single bit gate
Quantum Computing. Thorsten Altenkirch
Quantum Computing Thorsten Altenkirch Is Computation universal? Alonzo Church - calculus Alan Turing Turing machines computable functions The Church-Turing thesis All computational formalisms define the
Quantum Computers. Peter Shor MIT
Quantum Computers Peter Shor MIT 1 What is the difference between a computer and a physics experiment? 2 One answer: A computer answers mathematical questions. A physics experiment answers physical questions.
Experimental Quantum Computing: A technology overview
Experimental Quantum Computing: A technology overview Dr. Suzanne Gildert Condensed Matter Physics Research (Quantum Devices Group) University of Birmingham, UK 15/02/10 Models of quantum computation Implementations
Automatic Parallelisation of Quantum Circuits Using the Measurement Based Quantum Computing Model
Automatic Parallelisation of Quantum Circuits Using the Measurement Based Quantum Computing Model Einar Pius August 26, 2010 MSc in High Performance Computing The University of Edinburgh Year of Presentation:
More advanced codes 0 1 ( , 1 1 (
p. 1/24 More advanced codes The Shor code was the first general-purpose quantum error-correcting code, but since then many others have been discovered. An important example, discovered independently of
Quantum Computing. Richard Jozsa Centre for Quantum Information and Foundations DAMTP University of Cambridge
Quantum Computing Richard Jozsa Centre for Quantum Information and Foundations DAMTP University of Cambridge Physics and Computation A key question: what is computation....fundamentally? What makes it
Topological quantum error correction and quantum algorithm simulations
Topological quantum error correction and quantum algorithm simulations David Wang Submitted in total fulfilment of the requirements of the degree of Doctor of Philosophy August 2011 School of Physics The
Requirements for scaleable QIP
p. 1/25 Requirements for scaleable QIP These requirements were presented in a very influential paper by David Divincenzo, and are widely used to determine if a particular physical system could potentially
The quantum threat to cryptography
The quantum threat to cryptography Ashley Montanaro School of Mathematics, University of Bristol 20 October 2016 Quantum computers University of Bristol IBM UCSB / Google University of Oxford Experimental
CMSC 33001: Novel Computing Architectures and Technologies. Lecture 06: Trapped Ion Quantum Computing. October 8, 2018
CMSC 33001: Novel Computing Architectures and Technologies Lecturer: Kevin Gui Scribe: Kevin Gui Lecture 06: Trapped Ion Quantum Computing October 8, 2018 1 Introduction Trapped ion is one of the physical
Quantum Computing: From Circuit To Architecture
POLITECNICO DI MILANO Dipartimento di Elettronica, Informazione e Bioingegneria Quantum Computing: From Circuit To Architecture Nicholas Mainardi Email: nicholas.mainardi@polimi.it home.deib.polimi.it/nmainardi
Introduction to Quantum Computing
Introduction to Quantum Computing Stephen Casey NASA Slide template creator Krysta Svore Bloch Sphere Hadamard basis θ φ Quantum Hardware Technologies Quantum dots Superconductors Ion traps Nitrogen
becomes at most η th ( η ) 2t. As a result, it requires only O(log log T ) levels of concatenation to achieve sucient accuracy (η effective 1 T
SURVEY ON THE BOUNDS OF THE QUANTUM FAULT-TOLERANCE THRESHOLD CHRISTOPHER GRAVES 1. Introduction I rst briey summarize the threshold theorem and describe the motivations for tightening the bounds on the
2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information
QSIT09.L03 Page 1 2.0 Basic Elements of a Quantum Information Processor 2.1 Classical information processing 2.1.1 The carrier of information - binary representation of information as bits (Binary digits).
Grover s algorithm. We want to find aa. Search in an unordered database. QC oracle (as usual) Usual trick
Grover s algorithm Search in an unordered database Example: phonebook, need to find a person from a phone number Actually, something else, like hard (e.g., NP-complete) problem 0, xx aa Black box ff xx
Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 1: Quantum circuits and the abelian QFT
Quantum algorithms (CO 78, Winter 008) Prof. Andrew Childs, University of Waterloo LECTURE : Quantum circuits and the abelian QFT This is a course on quantum algorithms. It is intended for graduate students
ION TRAPS STATE OF THE ART QUANTUM GATES
ION TRAPS STATE OF THE ART QUANTUM GATES Silvio Marx & Tristan Petit ION TRAPS STATE OF THE ART QUANTUM GATES I. Fault-tolerant computing & the Mølmer- Sørensen gate with ion traps II. Quantum Toffoli
Quantum Computing. 6. Quantum Computer Architecture 7. Quantum Computers and Complexity
Quantum Computing 1. Quantum States and Quantum Gates 2. Multiple Qubits and Entangled States 3. Quantum Gate Arrays 4. Quantum Parallelism 5. Examples of Quantum Algorithms 1. Grover s Unstructured Search
1. Introduction : 1.2 New properties:
Nanodevices In Electronics Rakesh Kasaraneni(PID : 4672248) Department of Electrical Engineering EEL 5425 Introduction to Nanotechnology Florida International University Abstract : This paper describes
Introduction to Quantum Computing
Introduction to Quantum Computing Part I Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 12, 2011 Overview Outline What is quantum computing? Background Caveats Fundamental differences
Parallelization of the QC-lib Quantum Computer Simulator Library
Parallelization of the QC-lib Quantum Computer Simulator Library Ian Glendinning and Bernhard Ömer VCPC European Centre for Parallel Computing at Vienna Liechtensteinstraße 22, A-19 Vienna, Austria http://www.vcpc.univie.ac.at/qc/
Quantum Computing Professor Andrew M. Steane Oxford University
Quantum Computing The Laws of ature, or How everything works Professor Andrew M. teane Oxford University Computers and how they work Popular Mechanics magazine, March 1949: "Where a calculator on the Eniac
Fourier Sampling & Simon s Algorithm
Chapter 4 Fourier Sampling & Simon s Algorithm 4.1 Reversible Computation A quantum circuit acting on n qubits is described by an n n unitary operator U. Since U is unitary, UU = U U = I. This implies
Global Quantum Computation: Error Correction and Fault Tolerance
Global Quantum Computation: Error Correction and Fault Tolerance Jason Twamley Centre for Quantum Computer Technology, Macquarie University, Sydney, Australia Joseph Fitzsimons Department of Materials,
2.2 Classical circuit model of computation
Chapter 2 Classical Circuit Models for Computation 2. Introduction A computation is ultimately performed by a physical device. Thus it is a natural question to ask what are the fundamental limitations
Lectures on Fault-Tolerant Quantum Computation
Lectures on Fault-Tolerant Quantum Computation B.M. Terhal, IBM Research I. Descriptions of Noise and Quantum States II. Quantum Coding and Error-Correction III. Fault-Tolerant Error-Correction. Surface
Large-Scale Quantum Architectures
Large-Scale Quantum Architectures Fred Chong Director of Computer Engineering Professor of Computer Science University of California at Santa Barbara With Daniel Kudrow, Tzvetan Metodi, Darshan Thaker,
Efficient Distributed Quantum Computing
Efficient Distributed Quantum Computing Steve Brierley Heilbronn Institute, Dept. Mathematics, University of Bristol October 2013 Work with Robert Beals, Oliver Gray, Aram Harrow, Samuel Kutin, Noah Linden,
Introduction to Quantum Computing. Lecture 1
Introduction to Quantum Computing Lecture 1 1 OUTLINE Why Quantum Computing? What is Quantum Computing? History Quantum Weirdness Quantum Properties Quantum Computation 2 Why Quantum Computing? 3 Transistors
Parallelization of the QC-lib Quantum Computer Simulator Library
Parallelization of the QC-lib Quantum Computer Simulator Library Ian Glendinning and Bernhard Ömer September 9, 23 PPAM 23 1 Ian Glendinning / September 9, 23 Outline Introduction Quantum Bits, Registers
Introduction to Quantum Computing
Introduction to Quantum Computing Toni Bluher Math Research Group, NSA 2018 Women and Mathematics Program Disclaimer: The opinions expressed are those of the writer and not necessarily those of NSA/CSS,
The Reality of Quantum Computing
The Reality of Quantum Computing Now and in the Future @qant Christoph Lameter Jump Trading LLC Great Expectations But the current state: Wild West Funding: Governments see a chance to win
Performance Requirements of a Quantum Computer Using Surface Code Error Correction
Performance Requirements of a Quantum Computer Using Surface Code Error Correction Cody Jones, Stanford University Rodney Van Meter, Austin Fowler, Peter McMahon, James Whitfield, Man-Hong Yung, Thaddeus
Quantum Computing. The Future of Advanced (Secure) Computing. Dr. Eric Dauler. MIT Lincoln Laboratory 5 March 2018
The Future of Advanced (Secure) Computing Quantum Computing This material is based upon work supported by the Assistant Secretary of Defense for Research and Engineering and the Office of the Director
NP-Completeness I. Lecture Overview Introduction: Reduction and Expressiveness
Lecture 19 NP-Completeness I 19.1 Overview In the past few lectures we have looked at increasingly more expressive problems that we were able to solve using efficient algorithms. In this lecture we introduce
An Introduction to Quantum Information and Applications
An Introduction to Quantum Information and Applications Iordanis Kerenidis CNRS LIAFA-Univ Paris-Diderot Quantum information and computation Quantum information and computation How is information encoded
Shallow Donors in Silicon as Electron and Nuclear Spin Qubits Johan van Tol National High Magnetic Field Lab Florida State University
Shallow Donors in Silicon as Electron and Nuclear Spin Qubits Johan van Tol National High Magnetic Field Lab Florida State University Overview Electronics The end of Moore s law? Quantum computing Spin
Post Von Neumann Computing
Post Von Neumann Computing Matthias Kaiserswerth Hasler Stiftung (formerly IBM Research) 1 2014 IBM Corporation Foundation Purpose Support information and communication technologies (ICT) to advance Switzerland
Quantum Computer Architecture
Quantum Computer Architecture Scalable and Reliable Quantum Computers Greg Byrd (ECE) CSC 801 - Feb 13, 2018 Overview 1 Sources 2 Key Concepts Quantum Computer 3 Outline 4 Ion Trap Operation The ion can
Introduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm
Part I: Quantum Gates and Simon s Algorithm Martin Rötteler NEC Laboratories America, Inc. 4 Independence Way, Suite 00 Princeton, NJ 08540, U.S.A. International Summer School on Quantum Information, Max-Planck-Institut
An Architectural Framework For Quantum Algorithms Processing Unit (QAPU)
An Architectural Framework For Quantum s Processing Unit (QAPU) Mohammad Reza Soltan Aghaei, Zuriati Ahmad Zukarnain, Ali Mamat, and ishamuddin Zainuddin Abstract- The focus of this study is developing
Measuring progress in Shor s factoring algorithm
Measuring progress in Shor s factoring algorithm Thomas Lawson Télécom ParisTech, Paris, France 1 / 58 Shor s factoring algorithm What do small factoring experiments show? Do they represent progress? 2
1500 AMD Opteron processor (2.2 GHz with 2 GB RAM)
NICT 2019 2019 2 7 1 RSA RSA 2 3 (1) exp $ 64/9 + *(1) (ln 0) 1/2 (ln ln 0) 3/2 (2) 2009 12 768 (232 ) 1500 AMD Opteron processor (2.2 GHz with 2 GB RAM) 4 (3) 18 2 (1) (2) (3) 5 CRYPTREC 1. 2. 3. 1024,
What is a quantum computer? Quantum Architecture. Quantum Mechanics. Quantum Superposition. Quantum Entanglement. What is a Quantum Computer (contd.
What is a quantum computer? Quantum Architecture by Murat Birben A quantum computer is a device designed to take advantage of distincly quantum phenomena in carrying out a computational task. A quantum
Quiz 1 Solutions. Problem 2. Asymptotics & Recurrences [20 points] (3 parts)
![Quiz 1 Solutions. Problem 2. Asymptotics & Recurrences [20 points] (3 parts)](/thumbs/87/95581149.jpg "Quiz 1 Solutions. Problem 2. Asymptotics & Recurrences [20 points] (3 parts)")
Introduction to Algorithms October 13, 2010 Massachusetts Institute of Technology 6.006 Fall 2010 Professors Konstantinos Daskalakis and Patrick Jaillet Quiz 1 Solutions Quiz 1 Solutions Problem 1. We
Image courtesy of Keith Schwab http://www.lbl.gov/science-articles/archive/afrd Articles/Archive/AFRD-quantum-logic.html http://www.wmi.badw.de/sfb631/tps/dqd2.gif http://qist.lanl.gov/qcomp_map.shtml
Example: sending one bit of information across noisy channel. Effects of the noise: flip the bit with probability p.
Lecture 20 Page 1 Lecture 20 Quantum error correction Classical error correction Modern computers: failure rate is below one error in 10 17 operations Data transmission and storage (file transfers, cell
Logical Quantum Computing. Sarah Sheldon, IBM T.J. Watson Research Center
Logical Quantum Computing Sarah Sheldon, IBM T.J. Watson Research Center Quantum computing has the potential to revolutionize a wide array of industries, from pharmaceuticals and materials research to
Quantum Information Processing with Liquid-State NMR
Quantum Information Processing with Liquid-State NMR Pranjal Vachaspati, Sabrina Pasterski MIT Department of Physics (Dated: May 8, 23) We demonstrate the use of a Bruker Avance 2 NMR Spectrometer for
Simulation of quantum computers with probabilistic models
Simulation of quantum computers with probabilistic models Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. April 6, 2010 Vlad Gheorghiu (CMU) Simulation of quantum
The Nobel Prize in Physics 2012
The Nobel Prize in Physics 2012 Serge Haroche Collège de France and École Normale Supérieure, Paris, France David J. Wineland National Institute of Standards and Technology (NIST) and University of Colorado
Simulating classical circuits with quantum circuits. The complexity class Reversible-P. Universal gate set for reversible circuits P = Reversible-P
Quantum Circuits Based on notes by John Watrous and also Sco8 Aaronson: www.sco8aaronson.com/democritus/ John Preskill: www.theory.caltech.edu/people/preskill/ph229 Outline Simulating classical circuits
Quantum Information Processing
Quantum Information Processing Jonathan Jones http://nmr.physics.ox.ac.uk/teaching The Information Age Communication Shannon Computation Turing Current approaches are essentially classical which is wrong
Introduction to Quantum Computing
Introduction to Quantum Computing The lecture notes were prepared according to Peter Shor s papers Quantum Computing and Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a
Quantum Computing An Overview
Quantum Computing An Overview NAS Division NASA Ames Research Center TR Govindan Program Manager, QIS U.S. Army Research Office Outline Motivation Essentials of the Quantum Computing (QC) model Challenges
Volume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies
Volume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com
Towards Large-Scale Quantum Computation
Towards Large-Scale Quantum Computation Austin Greig Fowler Submitted in total fulfilment of the requirements of the degree of Doctor of Philosophy March 25 School of Physics The University of Melbourne
Lecture 1: Introduction to Quantum Computing
Lecture : Introduction to Quantum Computing Rajat Mittal IIT Kanpur What is quantum computing? This course is about the theory of quantum computation, i.e., to do computation using quantum systems. These
Quantum Computation CMU BB, Fall Week 6 work: Oct. 11 Oct hour week Obligatory problems are marked with [ ]
![Quantum Computation CMU BB, Fall Week 6 work: Oct. 11 Oct hour week Obligatory problems are marked with [ ]](/thumbs/93/117982721.jpg "Quantum Computation CMU BB, Fall Week 6 work: Oct. 11 Oct hour week Obligatory problems are marked with [ ]")
Quantum Computation CMU 15-859BB, Fall 2018 Week 6 work: Oct. 11 Oct. 18 12-hour week Obligatory problems are marked with [ ] 1. [CCNOT.] In class we showed how to simulate classical AND, OR, NOT, and
Measurement-based quantum error correction
Measurement-based quantum error correction Janna Hinchliff University of Bristol, Quantum Engineering Centre for Doctoral Training Introduction Measurement-based (or one-way) quantum error correction (MBQEC)
Quantum Optics. Manipulation of «simple» quantum systems
Quantum Optics Manipulation of «simple» quantum systems Antoine Browaeys Institut d Optique, Palaiseau, France Quantum optics = interaction atom + quantum field e g ~ 1960: R. Glauber (P. Nobel. 2005),
Quantum Computing. Vraj Parikh B.E.-G.H.Patel College of Engineering & Technology, Anand (Affiliated with GTU) Abstract HISTORY OF QUANTUM COMPUTING-
Quantum Computing Vraj Parikh B.E.-G.H.Patel College of Engineering & Technology, Anand (Affiliated with GTU) Abstract Formerly, Turing Machines were the exemplar by which computability and efficiency
QUANTUM COMPUTING. Part II. Jean V. Bellissard. Georgia Institute of Technology & Institut Universitaire de France
QUANTUM COMPUTING Part II Jean V. Bellissard Georgia Institute of Technology & Institut Universitaire de France QUANTUM GATES: a reminder Quantum gates: 1-qubit gates x> U U x> U is unitary in M 2 ( C
Quantum Circuits and Algorithms
Quantum Circuits and Algorithms Modular Arithmetic, XOR Reversible Computation revisited Quantum Gates revisited A taste of quantum algorithms: Deutsch algorithm Other algorithms, general overviews Measurements
Secrets of Quantum Information Science
Secrets of Quantum Information Science Todd A. Brun Communication Sciences Institute USC Quantum computers are in the news Quantum computers represent a new paradigm for computing devices: computers whose
Quantum theory has opened to us the microscopic world of particles, atoms and photons..and has given us the keys of modern technologies
Power and strangeness of the quantum Quantum theory has opened to us the microscopic world of particles, atoms and photons.and has given us the keys of modern technologies This is a theory whose logics
IBM quantum experience: Experimental implementations, scope, and limitations
IBM quantum experience: Experimental implementations, scope, and limitations Plan of the talk IBM Quantum Experience Introduction IBM GUI Building blocks for IBM quantum computing Implementations of various
Quantum Computers. Todd A. Brun Communication Sciences Institute USC
Quantum Computers Todd A. Brun Communication Sciences Institute USC Quantum computers are in the news Quantum computers represent a new paradigm for computing devices: computers whose components are individual
- Why aren t there more quantum algorithms? - Quantum Programming Languages. By : Amanda Cieslak and Ahmana Tarin
- Why aren t there more quantum algorithms? - Quantum Programming Languages By : Amanda Cieslak and Ahmana Tarin Why aren t there more quantum algorithms? there are only a few problems for which quantum
Quantum Compiler Optimizations
Quantum Compiler Optimizations Jeff Booth boothjmx@cs.washington.edu December 16, 2013 arxiv:1206.3348v1 [quant-ph] 14 Jun 2012 Abstract A quantum computer consists of a set of quantum bits upon which
Logical AND. Logical XOR
Logical AND 00 0 01 0 10 0 11 1 Logical XOR 00 0 01 1 10 1 11 0 00 00 01 00 10 00 11 01 Using the classical gate analog doesn t work, since there are three equivalent output states with different input
Quantum Phase Estimation using Multivalued Logic
Quantum Phase Estimation using Multivalued Logic Agenda Importance of Quantum Phase Estimation (QPE) QPE using binary logic QPE using MVL Performance Requirements Salient features Conclusion Introduction