Quantum Computation 650 Spring 2009 Lectures The World of Quantum Information. Quantum Information: fundamental principles
|
|
- Kristopher Brent Parsons
- 5 years ago
- Views:
Transcription
1 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 (and how it is different from the classical one). Bits & Qubits Quantum weirdness: entanglement, superposition & measurement Logic gates & Quantum circuits Cryptography & quantum information A brief introduction to quantum computing Real world: what do we need to build a quantum computer/quantum network? Current status & future roadmap 1
2 Why quantum information? Information is physical! Any processing of information is always performed by physical means Bits of information obey laws of classical physics. Why quantum information? Information is physical! Any processing of information is always performed by physical means Bits of information obey laws of classical physics. 2
3 Why Quantum Computers? Computer technology is making devices smaller and smaller reaching a point where classical physics is no longer a suitable model for the laws of physics. Bits & Qubits Fundamental building blocks of classical computers: BITS STATE: Definitely 0 or 1 Fundamental building blocks of quantum computers: Basis states: Quantum bits or QUBITS 0 and 1 Superposition: ψ = α 0 + β 1 3
4 Bits & Qubits Fundamental building blocks of classical computers: BITS Fundamental building blocks of quantum computers: Quantum bits or QUBITS STATE: Definitely 0 or 1 Basis states: 0 and 1 Qubit: any suitable two-level quantum system 4
5 Bits & Qubits: primary differences Superposition ψ = α 0 + β 1 Bits & Qubits: primary differences Measurement Classical bit: we can find out if it is in state 0 or 1 and the measurement will not change the state of the bit. Qubit: Quantum calculation: number of parallel processes due to superposition QO FR 5
6 Bits & Qubits: primary differences Superposition Measurement ψ = α 0 + β 1 Classical bit: we can find out if it is in state 0 or 1 and the measurement will not change the state of the bit. Qubit: we cannot just measure α and β and thus determine its state! We get either 0 or 1 with corresponding probabilities α 2 and β 2. α β = 1 The measurement changes the state of the qubit! Multiple qubits Hilbert space is a big place! - Carlton Caves 6
7 Multiple qubits Hilbert space is a big place! Two bits with states 0 and 1 form four definite states 00, 01, 10, and 11. Two qubits: can be in superposition of four computational basis set states. ψ = α 00 + β 01 + γ 10 + δ 11 - Carlton Caves 2 qubits 4 amplitudes 3 qubits 8 amplitudes 10 qubits 1024 amplitudes 20 qubits amplitudes 30 qubits amplitudes 500 qubits More amplitudes than our estimate of number of atoms in the Universe!!! Entanglement ψ = Results of the measurement First qubit 0 1 Second qubit 0 1 ψ α β Entangled states 7
8 Quantum cryptography Classical cryptography Scytale - the first known mechanical device to implement permutation of characters for cryptographic purposes 8
9 Classical cryptography Private key cryptography How to securely transmit a private key? Key distribution A central problem in cryptography: the key distribution problem. 1) Mathematics solution: public key cryptography. 2) Physics solution: quantum cryptography. Public-key cryptography relies on the computational difficulty of certain hard mathematical problems (computational security) Quantum cryptography relies on the laws of quantum mechanics (information-theoretical security). 9
10 Quantum key distribution A quantum communication channel: physical system capable delivering quantum systems more or less intact from one place to another. Quantum mechanics: quantum bits cannot be copied or monitored. Any attempt to do so will result in altering it that can not be corrected. Problems Authentication Noisy channels Quantum logic gates 10
11 Logic gates Classical NOT gate Quantum NOT gate (X gate) A NOT A α 0 + β 1 X α 1 + β 0 A N O T A Matrix form representation X = 1 0 The only non-trivial single bit gate α β X = β α More single qubit gates Any unitary matrix U will produce a quantum gate! Z 1 0 = 0 1 α 0 + β 1 α 0 β 1 Z Hadamard gate: H = α 0 + β 1 H α + β
12 Single qubit gates,two-qubit gates, three-qubit gates How many gates do we need to make? Do we need three-qubit and four-qubit gates? Where do we find such physical interactions? Coming up with one suitable controlled interaction for physical system is already a problem! Universality: classical computation Only one classical gate (NAND) is needed to compute any function on bits! A B A A B A AND B NOT A A NAND B A B A AND B A NAND B
13 Universality: quantum computation How many quantum gates do we need to build any quantum gate? Any n-qubit gate can be made from 2-qubit gates. (Since any unitary n x n matrix can be decomposed to product of two-level matrices.) Only one two-qubit gate is needed! Example: CNOT gate Quantum parallelism I can look at both sides of my coin at a single glance 13
14 Quantum parallelism ( ) : { 0,1} { 0,1} f x x, y x, y f ( x) U f Superposition x y U f x f(x) 0, f (0) + 1, f (1) 2 Single circuit just evaluated f(x) for both x=0 and 1 simultaneously! Quantum parallelism: a major problem So we can evaluate functions for all values of x at the same time using just one circuit! Need only n+1 qubits to evaluate 2 n values of x. But we still get only one answer when we measure the result: it collapses to x,f(x)!!! QO FR 14
15 Quantum parallelism: a major problem So we can evaluate functions for all values of x at the same time using just one circuit! Need only n+1 qubits to evaluate 2 n values of x. But we still get only one answer when we measure the result: it collapses to x,f(x)!!! We can t read out the result for specific value of x! With one qubit we get either f(0) or f(1) and we don t know which one in advance. This is why we need quantum algorithms! Quantum algorithms Unique features of quantum computation Superposition: n qubits can represent 2 n integers. Problem: if we read the outcome we lose the superposition and we can t know with certainty which one of the values we will obtain. Entanglement: measurements of states of different qubits may be highly correlated. 15
16 Quantum algorithms Strategy: Use superposition to calculate 2 n values of function simultaneously and do not read out the result until a useful result is expected with reasonably high probability. Use entanglement Current advantages of quantum computation Shor's quantum Fourier transform provides exponential speedup over known classical algorithms. Applications: solving discrete logarithm and factoring problems which enables a quantum computer to break public key cryptosystems such as RSA. Quantum searching (Grover's algorithm) allows quadratic speedup over classical computers. Simulations of quantum systems. 16
17 How to factor 15? Pick a number less then 15: 7 Calculate 7 n mod 15: Calculate n 7 n 15 A 7 n mod R / 2 { ± } gcd 7 1,15 { } { } gcd 48,15 = 3, gcd 50,15 = 5 R=4 Shor s algorithm for N=15 Choose n such as 2 n <15: n=4 Choose y: y=7 Initialize two four-qubit register Create a superposition of states of the first register Compute the function f(k)=7 k mod 15 on the second register. Operate on the first register by a Fourier transform Measure the state of the first register: u=0, 4, 8, 12 are only non-zero results. ψ 0 = Two cases give period R=4, therefore the procedure succeeds with probability 1/2 after one run. 17
18 Back to the real world: What do we need to build a quantum computer? Qubits which retain their properties. Scalable array of qubits. Initialization: ability to prepare one certain state repeatedly on demand. Need continuous supply of 0. Universal set of quantum gates. A system in which qubits can be made to evolve as desired. Long relevant decoherence times. Ability to efficiently read out the result. Real world strategy If X is very hard it can be substituted with more of Y. Of course, in many cases both X and Y are beyond the present experimental state of the art David P. DiVincenzo The physical implementation of quantum computation. 18
19 Quantum Computer (Innsbruck) P 1/2 D 5/2 quantum bit S 1/2 Courtesy of the R. Blatt s Innsbruck group Experimental proposals Liquid state NMR Trapped ions Cavity QED Trapped atoms Solid state schemes And other ones 19
20 The DiVincenzo criteria Quantum Information Processing with Neutral Atoms Quantum computing with neutral atoms 20
21 1. A scalable physical system with well characterized qubits: memory (a) Internal atomic state qubits: ground hyperfine states of neutral trapped atoms well characterized Very long lived! F=2 5s 1/2 6.8 GHz F=1 1 0 M F =-2,-1,0,1,2 87 Rb: Nuclear spin I=3/2 M F =-1,0,1 1. A scalable physical system with well characterized qubits: memory (b) Motional qubits : quantized levels in the trapping potential also well characterized 21
22 1. A scalable physical system with well characterized qubits: memory (a)internal atomic state qubits (b) Motional qubits Advantages: very long decoherence times! Internal states are well understood: atomic spectroscopy & atomic clocks. 1. A scalable physical system with well characterized qubits Optical lattices: loading of one atom per site may be achieved using Mott insulator transition. Scalability: the properties of optical lattice system do not change in the principal way when the size of the system is increased. Designer lattices may be created (for example with every third site loaded). Advantages: inherent scalability and parallelism. Potential problems: individual addressing. 22
23 2: Initialization Internal state preparation: putting atoms in the ground hyperfine state Very well understood (optical pumping technique is in use since 1950) Very reliable (> population may be achieved) Motional states may be cooled to motional ground states (>95%) Loading with one atom per site: Mott insulator transition and other schemes. Zero s may be supplied during the computation (providing individual or array addressing). 3: A universal set of quantum gates 1. Single-qubit rotations: well understood and had been carried out in atomic spectroscopy since 1940 s. 2. Two-qubit gates: none currently implemented (conditional logic was demonstrated) Proposed interactions for two-qubit gates: (a) Electric-dipole interactions between atoms (b) Ground-state elastic collisions (c) Magnetic dipole interactions Only one gate proposal does not involve moving atoms (Rydberg gate). Advantages: possible parallel operations Disadvantages: decoherence issues during gate operations 23
24 Rydberg gate scheme Gate operations are mediated by excitation of Rydberg states Jaksch et al., Phys. Rev. Lett. 85, 2208 (2000) Why Rydberg gate? Rydberg gate scheme Gate operations are mediated by excitation of Rydberg states Jaksch et al., Phys. Rev. Lett. 85, 2208 (2000) Do not need to move atoms! FAST! 24
25 Local blockade of Rydberg excitations Excitations to Rydberg states are suppressed due to a dipole-dipole interaction or van der Waals interaction Rydberg gate scheme Rb 40p FAST! R Apply a series of laser pulses to realize the following logic gate: 1 5s Jaksch et al., Phys. Rev. Lett. 85, 2208 (2000)
26 Rydberg gate scheme Rb 5s R p 1 2 [ 1] 2 [ 2] [ 1] π π π R0 R R1 R Long relevant decoherence times F=2 Memory: long-lived states. 5s 1/2 6.8 GHz F=1 0 1 Fundamental decoherence mechanism for optically trapped qubits: photon scattering. Decoherence during gate operations: a serious issue. 5: Reading out a result Quantum jump method via cycling transitions. Advantages: standard atomic physics technique, well understood and reliable. 26
27 Experimental status All five requirements for quantum computations are implemented. Specifically two-qubit gates are demonstrated in several implementations. Several-qubit systems and search algorithm with toy data are demonstrated with NMR. Decoherence-free subspaces, noiseless subsystems, and active control are demonstrated. 27
28 Future Whatever is the future of the Quantum computation it is certainly a fascinating new field for human creativity, ingenuity and Our strive to learn more about the Universe. 28
Quantum Computation with Neutral Atoms Lectures 14-15
Quantum Computation with Neutral Atoms Lectures 14-15 15 Marianna Safronova Department of Physics and Astronomy Back to the real world: What do we need to build a quantum computer? Qubits which retain
More informationLogic 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
More informationQuantum Computation with Neutral Atoms
Quantum Computation with Neutral Atoms Marianna Safronova Department of Physics and Astronomy Why quantum information? Information is physical! Any processing of information is always performed by physical
More informationA central problem in cryptography: the key distribution problem.
Scientific American 314, 48-55 (2016) A central problem in cryptography: the key distribution problem. Mathematics solution: public key cryptography. Public-key cryptography relies on the computational
More informationQUANTUM 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
More informationQuantum 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
More informationquantum mechanics is a hugely successful theory... QSIT08.V01 Page 1
1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation What is quantum mechanics good for? traditional historical perspective: beginning of 20th century: classical physics fails
More information1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation
QSIT09.V01 Page 1 1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation What is quantum mechanics good for? traditional historical perspective: beginning of 20th century: classical
More informationShort Course in Quantum Information Lecture 8 Physical Implementations
Short Course in Quantum Information Lecture 8 Physical Implementations Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html Syllabus Lecture : Intro
More informationSome Introductory Notes on Quantum Computing
Some Introductory Notes on Quantum Computing Markus G. Kuhn http://www.cl.cam.ac.uk/~mgk25/ Computer Laboratory University of Cambridge 2000-04-07 1 Quantum Computing Notation Quantum Computing is best
More informationShor 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
More informationLecture note 8: Quantum Algorithms
Lecture note 8: Quantum Algorithms Jian-Wei Pan Physikalisches Institut der Universität Heidelberg Philosophenweg 12, 69120 Heidelberg, Germany Outline Quantum Parallelism Shor s quantum factoring algorithm
More informationIntroduction 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
More information2.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).
More informationSecrets 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
More informationExperimental 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
More informationSemiconductors: Applications in spintronics and quantum computation. Tatiana G. Rappoport Advanced Summer School Cinvestav 2005
Semiconductors: Applications in spintronics and quantum computation Advanced Summer School 1 I. Background II. Spintronics Spin generation (magnetic semiconductors) Spin detection III. Spintronics - electron
More informationQuantum 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
More informationQUANTUM 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
More informationCMSC 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
More information*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
More informationExperimental Realization of Shor s Quantum Factoring Algorithm
Experimental Realization of Shor s Quantum Factoring Algorithm M. Steffen1,2,3, L.M.K. Vandersypen1,2, G. Breyta1, C.S. Yannoni1, M. Sherwood1, I.L.Chuang1,3 1 IBM Almaden Research Center, San Jose, CA
More informationQuantum Computing ~ Algorithms. HIO) 0 HIO) 010) = ~(l000) ) ) ))
Quantum Computing 2. Algorithms C S Vijay and Vishal Gupta Introduction C S Vijay is in the final year of a dual degree program in microelectronics at the Department of Electrical Engineering at lit Mumbai.
More informationThe 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
More informationQuantum 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
More informationAdvanced Cryptography Quantum Algorithms Christophe Petit
The threat of quantum computers Advanced Cryptography Quantum Algorithms Christophe Petit University of Oxford Christophe Petit -Advanced Cryptography 1 Christophe Petit -Advanced Cryptography 2 The threat
More informationQuantum 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
More informationQuantum Information Processing and Diagrams of States
Quantum Information and Diagrams of States September 17th 2009, AFSecurity Sara Felloni sara@unik.no / sara.felloni@iet.ntnu.no Quantum Hacking Group: http://www.iet.ntnu.no/groups/optics/qcr/ UNIK University
More informationTutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction
Tutorial on Quantum Computing Vwani P. Roychowdhury Lecture 1: Introduction 1 & ) &! # Fundamentals Qubits A single qubit is a two state system, such as a two level atom we denote two orthogonal states
More informationQuantum Information Science (QIS)
Quantum Information Science (QIS) combination of three different fields: Quantum Physics QIS Computer Science Information Theory Lecture 1 - Outline 1. Quantum Mechanics 2. Computer Science History 3.
More informationAtom trifft Photon. Rydberg blockade. July 10th 2013 Michael Rips
Atom trifft Photon Rydberg blockade Michael Rips 1. Introduction Atom in Rydberg state Highly excited principal quantum number n up to 500 Diameter of atom can reach ~1μm Long life time (~µs ~ns for low
More informationQuantum Information Processing with Trapped Ions. Experimental implementation of quantum information processing with trapped ions
Quantum Information Processing with Trapped Ions Overview: Experimental implementation of quantum information processing with trapped ions 1. Implementation concepts of QIP with trapped ions 2. Quantum
More informationOptimal Controlled Phasegates for Trapped Neutral Atoms at the Quantum Speed Limit
with Ultracold Trapped Atoms at the Quantum Speed Limit Michael Goerz May 31, 2011 with Ultracold Trapped Atoms Prologue: with Ultracold Trapped Atoms Classical Computing: 4-Bit Full Adder Inside the CPU:
More informationIntroduction 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
More informationQuantum computing and quantum communication with atoms. 1 Introduction. 2 Universal Quantum Simulator with Cold Atoms in Optical Lattices
Quantum computing and quantum communication with atoms L.-M. Duan 1,2, W. Dür 1,3, J.I. Cirac 1,3 D. Jaksch 1, G. Vidal 1,2, P. Zoller 1 1 Institute for Theoretical Physics, University of Innsbruck, A-6020
More informationImage 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
More informationIntroduction 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
More informationQuantum computing hardware
Quantum computing hardware aka Experimental Aspects of Quantum Computation PHYS 576 Class format 1 st hour: introduction by BB 2 nd and 3 rd hour: two student presentations, about 40 minutes each followed
More informationThe 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
More informationExploring the quantum dynamics of atoms and photons in cavities. Serge Haroche, ENS and Collège de France, Paris
Exploring the quantum dynamics of atoms and photons in cavities Serge Haroche, ENS and Collège de France, Paris Experiments in which single atoms and photons are manipulated in high Q cavities are modern
More informationCS257 Discrete Quantum Computation
CS57 Discrete Quantum Computation John E Savage April 30, 007 Lect 11 Quantum Computing c John E Savage Classical Computation State is a vector of reals; e.g. Booleans, positions, velocities, or momenta.
More informationphys4.20 Page 1 - the ac Josephson effect relates the voltage V across a Junction to the temporal change of the phase difference
Josephson Effect - the Josephson effect describes tunneling of Cooper pairs through a barrier - a Josephson junction is a contact between two superconductors separated from each other by a thin (< 2 nm)
More informationLecture 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
More informationIBM 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
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Petros Wallden Lecture 1: Introduction 18th September 2017 School of Informatics, University of Edinburgh Resources 1. Quantum Computation and Quantum Information by Michael
More informationShor s Algorithm. Polynomial-time Prime Factorization with Quantum Computing. Sourabh Kulkarni October 13th, 2017
Shor s Algorithm Polynomial-time Prime Factorization with Quantum Computing Sourabh Kulkarni October 13th, 2017 Content Church Thesis Prime Numbers and Cryptography Overview of Shor s Algorithm Implementation
More informationQuantum 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.
More informationQuantum 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
More informationQuantum computing. Jan Černý, FIT, Czech Technical University in Prague. České vysoké učení technické v Praze. Fakulta informačních technologií
České vysoké učení technické v Praze Fakulta informačních technologií Katedra teoretické informatiky Evropský sociální fond Praha & EU: Investujeme do vaší budoucnosti MI-MVI Methods of Computational Intelligence(2010/2011)
More informationQuantum computation with trapped ions
Abstract Since the first preparation of a single trapped, laser-cooled ion by Neuhauser et el. in 198, a continuously increasing degree of control over the of single ions has been achieved, such that what
More informationPromise of Quantum Computation
Quantum Computation, and Epilog: The Future of Computing 1 Promise of Quantum Computation Classical computers have their limitations: Factoring large numbers takes exponential time. No faster algorithm
More informationSuperconducting Qubits Lecture 4
Superconducting Qubits Lecture 4 Non-Resonant Coupling for Qubit Readout A. Blais, R.-S. Huang, A. Wallraff, S. M. Girvin, and R. J. Schoelkopf, PRA 69, 062320 (2004) Measurement Technique Dispersive Shift
More information1500 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,
More informationReversible and Quantum computing. Fisica dell Energia - a.a. 2015/2016
Reversible and Quantum computing Fisica dell Energia - a.a. 2015/2016 Reversible computing A process is said to be logically reversible if the transition function that maps old computational states to
More informationSecurity Implications of Quantum Technologies
Security Implications of Quantum Technologies Jim Alves-Foss Center for Secure and Dependable Software Department of Computer Science University of Idaho Moscow, ID 83844-1010 email: jimaf@cs.uidaho.edu
More informationα x x 0 α x x f(x) α x x α x ( 1) f(x) x f(x) x f(x) α x = α x x 2
Quadratic speedup for unstructured search - Grover s Al- CS 94- gorithm /8/07 Spring 007 Lecture 11 01 Unstructured Search Here s the problem: You are given an efficient boolean function f : {1,,} {0,1},
More informationD.5 Quantum error correction
D. QUANTUM ALGORITHMS 157 Figure III.34: E ects of decoherence on a qubit. On the left is a qubit yi that is mostly isoloated from its environment i. Ontheright,aweakinteraction between the qubit and the
More informationPhysical implementations of quantum computing
Physical implementations of quantum computing Andrew Daley Department of Physics and Astronomy University of Pittsburgh Overview Introduction DiVincenzo Criteria Characterising coherence times Survey of
More informationQuantum 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
More informationIntroduction to Superconductivity. Superconductivity was discovered in 1911 by Kamerlingh Onnes. Zero electrical resistance
Introduction to Superconductivity Superconductivity was discovered in 1911 by Kamerlingh Onnes. Zero electrical resistance Meissner Effect Magnetic field expelled. Superconducting surface current ensures
More informationBuilding Blocks for Quantum Computing Part V Operation of the Trapped Ion Quantum Computer
Building Blocks for Quantum Computing Part V Operation of the Trapped Ion Quantum Computer CSC801 Seminar on Quantum Computing Spring 2018 1 Goal Is To Understand The Principles And Operation of the Trapped
More informationCompute 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
More informationIBM Systems for Cognitive Solutions
IBM Q Quantum Computing IBM Systems for Cognitive Solutions Ehningen 12 th of July 2017 Albert Frisch, PhD - albert.frisch@de.ibm.com 2017 IBM 1 st wave of Quantum Revolution lasers atomic clocks GPS sensors
More informationIon crystallisation. computing
Ion crystallisation and application to quantum computing Cooling with incrased laser power: (a) reduced Doppler width (b) Kink in the line profile (b) P=0.2 mw P=0.5 mw Excitation spectra of an ion cloud
More informationAn 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
More informationLinear-optical quantum information processing: A few experiments
Linear-optical quantum information processing: A few experiments Miloslav Dušek Lucie Čelechovská, Karel Lemr, Michal Mičuda, Antonín Černoch, Jaromír Fiurášek, Miroslav Ježek, ek, Jan Soubusta, Radim
More informationPhysics is becoming too difficult for physicists. David Hilbert (mathematician)
Physics is becoming too difficult for physicists. David Hilbert (mathematician) Simple Harmonic Oscillator Credit: R. Nave (HyperPhysics) Particle 2 X 2-Particle wave functions 2 Particles, each moving
More informationQuantum Computing with neutral atoms and artificial ions
Quantum Computing with neutral atoms and artificial ions NIST, Gaithersburg: Carl Williams Paul Julienne T. C. Quantum Optics Group, Innsbruck: Peter Zoller Andrew Daley Uwe Dorner Peter Fedichev Peter
More informationEntanglement creation and characterization in a trapped-ion quantum simulator
Time Entanglement creation and characterization in a trapped-ion quantum simulator Christian Roos Institute for Quantum Optics and Quantum Information Innsbruck, Austria Outline: Highly entangled state
More informationQuantum computer: basics, gates, algorithms
Quantum computer: basics, gates, algorithms single qubit gate various two qubit gates baby-steps shown so far with ion quantum processors and how to reach a scalable device in future Ulm, Germany: 40 Ca
More informationParallelization 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
More informationP 3/2 P 1/2 F = -1.5 F S 1/2. n=3. n=3. n=0. optical dipole force is state dependent. n=0
(two-qubit gate): tools: optical dipole force P 3/2 P 1/2 F = -1.5 F n=3 n=3 n=0 S 1/2 n=0 optical dipole force is state dependent tools: optical dipole force (e.g two qubits) ω 2 k1 d ω 1 optical dipole
More informationA Gentle Introduction to Quantum Computing
A Gentle Introduction to Quantum Computing Abdullah Khalid 01-10-0168 School of Science and Engineering Lahore University of Management Sciences Friday 3 rd June, 011 Contents 1 Introduction to Quantum
More informationRequirements 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
More informationQuantum Technology 101: Overview of Quantum Computing and Quantum Cybersecurity
Quantum Technology 0: Overview of Quantum Computing and Quantum Cybersecurity Warner A. Miller* Department of Physics & Center for Cryptography and Information Security Florida Atlantic University NSF
More informationCryptography in the Quantum Era. Tomas Rosa and Jiri Pavlu Cryptology and Biometrics Competence Centre, Raiffeisen BANK International
Cryptography in the Quantum Era Tomas Rosa and Jiri Pavlu Cryptology and Biometrics Competence Centre, Raiffeisen BANK International Postulate #1: Qubit state belongs to Hilbert space of dimension 2 ψ
More informationDriving Qubit Transitions in J-C Hamiltonian
Qubit Control Driving Qubit Transitions in J-C Hamiltonian Hamiltonian for microwave drive Unitary transform with and Results in dispersive approximation up to 2 nd order in g Drive induces Rabi oscillations
More informationChallenges in Quantum Information Science. Umesh V. Vazirani U. C. Berkeley
Challenges in Quantum Information Science Umesh V. Vazirani U. C. Berkeley 1 st quantum revolution - Understanding physical world: periodic table, chemical reactions electronic wavefunctions underlying
More informationSingle qubit + CNOT gates
Lecture 6 Universal quantum gates Single qubit + CNOT gates Single qubit and CNOT gates together can be used to implement an arbitrary twolevel unitary operation on the state space of n qubits. Suppose
More informationQuantum 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
More informationQuantum computation and quantum information
Quantum computation and quantum information Chapter 7 - Physical Realizations - Part 2 First: sign up for the lab! do hand-ins and project! Ch. 7 Physical Realizations Deviate from the book 2 lectures,
More informationTowards quantum metrology with N00N states enabled by ensemble-cavity interaction. Massachusetts Institute of Technology
Towards quantum metrology with N00N states enabled by ensemble-cavity interaction Hao Zhang Monika Schleier-Smith Robert McConnell Jiazhong Hu Vladan Vuletic Massachusetts Institute of Technology MIT-Harvard
More informationIntroduction 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
More informationQuantum 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
More informationQuantum Information Transfer and Processing Miloslav Dušek
Quantum Information Transfer and Processing Miloslav Dušek Department of Optics, Faculty of Science Palacký University, Olomouc Quantum theory Quantum theory At the beginning of 20 th century about the
More informationAncilla-driven universal quantum computing
Ancilla-driven universal quantum computing Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. September 30, 2010 Vlad Gheorghiu (CMU) Ancilla-driven universal
More informationAn introduction to Quantum Computing using Trapped cold Ions
An introduction to Quantum Computing using Trapped cold Ions March 10, 011 Contents 1 Introduction 1 Qubits 3 Operations in Quantum Computing 3.1 Quantum Operators.........................................
More informationTensor network simulations of strongly correlated quantum systems
CENTRE FOR QUANTUM TECHNOLOGIES NATIONAL UNIVERSITY OF SINGAPORE AND CLARENDON LABORATORY UNIVERSITY OF OXFORD Tensor network simulations of strongly correlated quantum systems Stephen Clark LXXT[[[GSQPEFS\EGYOEGXMZMXMIWUYERXYQGSYVWI
More informationQuantum Computer. Jaewan Kim School of Computational Sciences Korea Institute for Advanced Study
Quantum Computer Jaewan Kim jaewan@kias.re.kr School of Computational Sciences Korea Institute for Advanced Study KIAS (Korea Institute for Advanced Study) Established in 1996 Located in Seoul, Korea Pure
More informationQuantum error correction on a hybrid spin system. Christoph Fischer, Andrea Rocchetto
Quantum error correction on a hybrid spin system Christoph Fischer, Andrea Rocchetto Christoph Fischer, Andrea Rocchetto 17/05/14 1 Outline Error correction: why we need it, how it works Experimental realization
More informationQuantum Simulation with Rydberg Atoms
Hendrik Weimer Institute for Theoretical Physics, Leibniz University Hannover Blaubeuren, 23 July 2014 Outline Dissipative quantum state engineering Rydberg atoms Mesoscopic Rydberg gates A Rydberg Quantum
More informationQuantum 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),
More informationQUANTUM COMPUTATION. Exercise sheet 1. Ashley Montanaro, University of Bristol H Z U = 1 2
School of Mathematics Spring 017 QUANTUM COMPUTATION Exercise sheet 1 Ashley Montanaro, University of Bristol ashley.montanaro@bristol.ac.uk 1. The quantum circuit model. (a) Consider the following quantum
More informationsimulations of the Polarization dependence of the light Potential equation in quantum ComPUting
simulations of the Polarization dependence of the light Potential equation in quantum ComPUting bert david Copsey, student author dr. Katharina gillen, research advisor abstract Many methods of quantum
More informationQOT - Quantum Optical Technologies
Coordinating unit: Teaching unit: Academic year: Degree: ECTS credits: 2018 230 - ETSETB - Barcelona School of Telecommunications Engineering 739 - TSC - Department of Signal Theory and Communications
More informationIntroduction to Cavity QED: fundamental tests and application to quantum information Serge Haroche July 2004
Introduction to Cavity QED: fundamental tests and application to quantum information Serge Haroche July 2004 A very active research field: Code information in simple systems (atoms, photons..) and use
More informationQuantum Information & Quantum Computation
CS90A, Spring 005: Quantum Information & Quantum Computation Wim van Dam Engineering, Room 509 vandam@cs http://www.cs.ucsb.edu/~vandam/teaching/cs90/ Administrative The Final Examination will be: Monday
More informationAPPLYING QUANTUM COMPUTER FOR THE REALIZATION OF SPSA ALGORITHM Oleg Granichin, Alexey Wladimirovich
APPLYING QUANTUM COMPUTER FOR THE REALIZATION OF SPSA ALGORITHM Oleg Granichin, Alexey Wladimirovich Department of Mathematics and Mechanics St. Petersburg State University Abstract The estimates of the
More informationUnitary evolution: this axiom governs how the state of the quantum system evolves in time.
CS 94- Introduction Axioms Bell Inequalities /7/7 Spring 7 Lecture Why Quantum Computation? Quantum computers are the only model of computation that escape the limitations on computation imposed by the
More informationLecture 1: Introduction to Quantum Computing
Lecture 1: Introduction to Quantum Computing Rajat Mittal IIT Kanpur Whenever the word Quantum Computing is uttered in public, there are many reactions. The first one is of surprise, mostly pleasant, and
More information