An Introduction to Quantum Information and Applications
|
|
- Marilynn Sutton
- 6 years ago
- Views:
Transcription
1 An Introduction to Quantum Information and Applications Iordanis Kerenidis CNRS LIAFA-Univ Paris-Diderot
2 Quantum information and computation Quantum information and computation How is information encoded in nature? What is nature s computational power? Moore s law: quantum phenomena will appear by 2020 Rich Mathematical Theory Advances in Classical Computer Science Advances in Theoretical & Experimental Physics Advances in Information Theory
3 Quantum information and computation The power of Quantum Computing Quantum algorithm for Factoring and Discrete Logarithm [Shor 93] Unconditionally Secure Key Distribution [Bennett-Brassard 84] Quantum computers unlikely to solve NP-complete problems [Bernstein Bennett Brassard Vazirani 94]
4 Outline ) Introduction to the model Superdense Coding Teleportation 2) Basic algorithms Deutsch-Jozsa Ideas for Factoring 3) Cryptography Key Distribution 4) Communication Complexity Quantum fingerprints Exponential Separations
5 Quantum States Quantum bit is a unit vector in a 2-dim. Hilbert space " 0 = $ % # 0& ', = " $ 0% # ', & ( ) = 2 " $ % ', # & 2 0 ( ) = 2 " % $ ' # & A quantum state on logn qubits is a unit vector in Inner product:
6 Measurements on Quantum States A measurement of in an orthonormal basis is a projection onto the basis vectors and Pr[outcome is b i ] = Examples
7 Measurements on Quantum States A measurement of in an orthonormal basis is a projection onto the basis vectors and Pr[outcome is b i ] = Examples φ = a a, { ( ), 2 0 ( )} Prob[outcome ( )] = 2 a a Prob[outcome ( 2 0 )] = 2 a a 2 2 = 2 + a 0a = 2 a 0a
8 Measurements on Quantum States A measurement of in an orthonormal basis is a projection onto the basis vectors and Pr[outcome is b i ] = Examples Note that
9 Measurements on Quantum States A measurement of in an orthonormal basis is a projection onto the basis vectors and Pr[outcome is b i ] = IMPORTANT REMARK What is the final state after the measurement? The state changes to the basis state Hence, no more information in it about the a i s. If I repeat the measurement I always get the same basis vector.
10 Unitary Evolution Unitary matrix: inner product/length preserving, linear NOT gate X Phase Flip gate Z
11 Unitary Evolution cont. Hadamard Gate 0 H " ( ), H H " 2 0 ( ) Control NOT gate Example H 0 0 H on st ### ( ) 0 CNOT ## ( )
12 Superdense Coding Transmitting 2 bits with qubit Alice and Bob share the above state Alice wants to transmit the bits b b 2 to Bob ( ) Alice Z b X b2 Bob Let b b 2 =0 H M M ( ) CNOT "" Z if b= """ ( ) ( ) 2 0 ( ) 0 X if b 2= "" " H on st """ ( )
13 Teleportation Teleporting a qubit with 2 bits Alice and Bob share the state ( ) Alice wants to transmit an unknown qubit to Bob M Alice b 2 H M b Bob Z b X b2 ( a a ) ( CNOT ) ## ( 2 a a 0 + a a 0 ) H # 2 00 ( a a ) ( a 0 + a 0 ) ( a 0 0 a ) + 2 ( a 0 a 0 ) Z b X b 2 ### ( a a )
14 Outline ) Introduction to the model Superdense Coding Teleportation 2) Basic algorithms Deutsch-Jozsa Ideas for Factoring 3) Cryptography Key Distribution 4) Communication Complexity Quantum fingerprints Exponential Separations
15 Quantum Queries Let f: X -> Y Goal: Does f have a certain property? Classical Query: "What is the value of f(x)?" x O "" f f (x) Example: Is f linear or far from linear? 3 Queries u.a.r.: f(x),f(y),f(x+y). Check f(x)+f(y)=f(x+y) Quantum Query x b O "" f x b f (x) But, quantum operations are linear! H " x 2 n / 2 x {0,} n 0 O "" f x 2 n / 2 x {0,} n f (x)
16 Deutsch-Jozsa Algorithm Let f: {0,} n -> {0,} Goal: Is f identically zero or balanced? O Classical Query: x "" f f (x) deterministic: 2 n- + randomized: k queries, error probability 2 -k Quantum x b O "" f x b f (x) Z on 2nd """ H " H " x 0 2 n / 2 x {0,} n O "" f ( ) f (x) x f (x) 2 n / 2 x {0,} n ' if f = 0 ) ( a y y,with a 0 = 0, ) * y {0,} n x f (x) 2 n / 2 x {0,} n O "" f if f balanced ( ) f (x ) x 0 2 n / 2 x {0,} n
17 More Algorithms - Simon's problem Let f: {0,} n -> {0,} n Promise: f(x)=f(x+a) and f(x) f(y), y x+a (2-periodic) Goal: Find a Randomized: 2 n/2 Quantum: O(n), by finding each time a random y, st. y.a=0 - Period Finding [Shor94] Let f: Z N -> C Promise: f is periodic Goal: Find period Quantum: Easy algorithm, based on Fourier Transform Factoring = Period Finding! - Seach an unordered list: O( n) queries [Grover97]
18 2)Algorithms: Open Problems Find New Algorithms Graph Isomorphism? Lattice Problems? Hidden Subgroup Problems? other... Exponential speedup (possibly) Factoring, Discrete Log, Pell's Equality,... Quadratic speedup (provably) Grover's Search, Quantum walk-based algorithms,...
19 Outline ) Introduction to the model Superdense Coding Teleportation 2) Basic algorithms Deutsch-Jozsa Ideas for Unordered search and Factoring 3) Cryptography Key Distribution 4) Communication Complexity Quantum fingerprints Exponential Separations
20 3) Cryptography Current cryptography based on computational assumptions (e.g. hardness of factoring) Many such problems become insecure against a quantum adversary Can we use quantum interaction to achieve unconditionally secure cryptography?
21 Unconditional Key Distribution. Alice picks a secret key. She encodes each bit in one of two possible quantum ways and sends it to Bob. 2. Bob guesses the encoding and decodes each bit accordingly Remarks: - If Bob guesses correctly the encoding, then the decoding is perfect. If not, Bob gets a random bit. - Bob guesses correctly half the times.
22 Unconditional Key Distribution. Alice picks a secret key. She encodes each bit in one of two possible quantum ways and sends it to Bob. 2. Bob guesses the encoding and decodes each bit accordingly 3. Alice and Bob reveal publicly the encodings and keep only the bits on which they agree. (~ half) Remarks: - If there is no Eve, then they agree on the value of all these bits. - If Eve has got information about the key, then with high probability Alice and Bob will disagree on some bits.
23 Unconditional Key Distribution. Alice picks a secret key. She encodes each bit in one of two possible quantum ways and sends it to Bob. 2. Bob guesses the encoding and decodes each bit accordingly 3. Alice and Bob reveal publicly the encodings and keep only the bits on which they agree. (~ half) 4. Alice and Bob reveal publicly the values of half of the bits (/4 of the initial). - If they agree, they use the rest as the key (~ /4) - If they disagree in many bits, they throw it away
24 Unconditional Key Distribution Ψ 00 = 0, Ψ 0 =, Ψ 0 = ( ), Ψ = ( 2 0 ). Pick a,b {0,} n ( a: key b : encoding) Send each 2. Pick b {0,} n If b i =0 measure in If b i = measure in Denote outcome a i 3. Alice and Bob reveal publicly the encodings b,b. Keep the bits for which b i = b i (~ half) 4. Alice and Bob reveal publicly the values of a i = a i for half of the bits for which b i = b i - If they agree, they use the rest as the key (~ /4) - If they disagree in many bits, they throw it away
25 Unconditional Key Distribution Ψ 00 = 0, Ψ 0 =, Ψ 0 = ( ), Ψ = ( 2 0 ) Proof of Security (idea) Eve gets information, she disturbs the state (Heisenberg) Possible strategy: Eve picks encoding b E u.a.r and measures Alice's qubit. Let be the result. She sends it to Bob. Ψ a be If b A b B, Bob does not check, so Eve is not detected cheating If b A = b B and b E = b A, then Ψ a b E = Ψ a b A, so Eve is not detected If b A = b B and b E b A, then Alice Eve : measure in { 0, } Bob: measure in ( ) Ψ 0 = outcome 0, w.p./2, w.p./2 outcome { ( 2 0 ± )} +, w.p./2, w.p./2
26 Unconditional Key Distribution Ψ 00 = 0, Ψ 0 =, Ψ 0 = ( ), Ψ = ( 2 0 ) Proof of Security (idea) Eve gets information, she disturbs the state (Heisenberg) Possible strategy: Eve picks encoding b E u.a.r and measures Alice's qubit. Let be the result. She sends it to Bob. Ψ a be If b A b B, Bob does not check, so Eve is not detected cheating If b A = b B and b E = b A, then Ψ a b E = Ψ a b A, so Eve is not detected If b A = b B and b E b A and Alice and Bob check, then Alice Eve : measure in { 0, } Bob: measure in ( ) Ψ 0 = outcome 0, w.p./2, w.p./2 Overall, Pr[Eve is detected cheating]=/6 outcome { ( 2 0 ± )} +, w.p./2, w.p./2
27 Unconditional Key Distribution Ψ 00 = 0, Ψ 0 =, Ψ 0 = ( ), Ψ = ( 2 0 ) Proof of Security (continued) The optimal strategy of Eve is not much better than the one we described. (individual vs coherent attacks) The key is almost secure. We can distill a much stronger key by classical privacy amplification No assumptions on Eve s computational power!
28 3) Cryptography: Open Problems Other Cryptographic Primitives Oblivious Transfer Coin Flipping Bit Commitment Practical Quantum Cryptography Commercial systems for QKD Classical cryptography secure against quantum
29 Outline ) Introduction to the model Superdense Coding Teleportation 2) Basic algorithms Deutsch-Jozsa 3) Cryptography Key Distribution 4) Communication Complexity Quantum fingerprints Exponential Separations
30 4) Communication Complexity Input x Goal: Output P(x,y) (minimum communication) Input y Examples: Is x=y?, Find an i such that x i y i Applications of Communication Complexity VLSI design, Boolean circuits, Data structures, Automata, Formula size, Data streams, Secure Computation
31 Quantum Communication Complexity Classical vs. Quantum Input x Goal: Output P(x,y) (minimum communication) Input y Examples: Is x=y?, Find an i such that x i y i Applications of Communication Complexity VLSI design, Boolean circuits, Data structures, Automata, Formula size, Data streams, Secure Computation
32 Encoding Information with Quantum states We can encode a string with logn qubits. Holevo s bound We cannot compress information by using qubits. We need n qubits to transmit n classical bits. Quantum communication can still be useful since in many communication problems the information that needs to be transmitted is small. (e.g. Equality)
33 Equality in Simultaneous Messages Input x Referee Is x=y? Input y Randomized algorithm (Complexity ) Alice and Bob use an error correcting code C with constant distance and size O(n). They each send bits of their strings C(x), C(y) Referee outputs Yes if C(x) i = C(y) i
34 Equality in Simultaneous Messages Quantum algorithm : (Complexity O(log n)) [BCWdW0] Alice and Bob use an error correcting code C with constant distance. They send the states Referee measures the state in the symmetric and alternating subspace of If x=y, then the states are equal. If x y, then the states are almost orthogonal.
35 Exponential Separations Two-way communication [BCW98]: exponential separation for zero error. [Raz99]: exponential separation for bounded error. [Gav07, RK]: between q. One-way and rand. Two-way One-way communication [BJK04]: exponential separation for a relation [GKKRdW07]: exponential separation for a partial function Simultaneous Messages [BCWdW0]: equality via fingerprints [BJK04]: exponential separation for a relation
36 The Hidden Matching Problem Input: x {0,} 2n Output: Input: a matching M on [2n] eg. {(,5),(2,6),(3,7),(4,8)} Theorem There exists a one-way quantum protocol with compl. O(logn) Any randomized one-way protocol has complexity Ω( n) %
37 Quantum algorithm for HM 4 Let M = {(,3),(2,4)} be Bob s matching. Alice sends the state 2 (( )x + ( )x ( )x ( ) x 4 4 ) Bob measures in the basis B = { + 3, 3, 2 + 4, 2 4 } and outputs ((,3),0) if he measures ((,3),) " ((2,4),0) " ((2,4),) "
38 Quantum algorithm for HM 4 Alice sends the state 2 4 i= ( ) x i i = 2 (( )x + ( )x 3 3 ) + 2 (( )x ( )x 4 4 ) Bob measures in the basis B = { + 3, 3, 2 + 4, 2 4 } Pr[outcome + 3 ] = 8 (( )x + ( )x 3 )2 Pr[outcome 3 ] = 8 (( )x ( )x 3 )2 Bob can compute the XOR of a pair of the matching with probability.
39 4) Communication Complexity Open Problems Quantum communication complexity of total functions Power of entanglement in communication complexity Communication Complexity with super-quantum resources.
40 Conclusions Quantum Information can be very powerful Algorithms Factoring, Unordered Search Quantum Walks, etc Communication Complexity Many exponential separations Total Functions Cryptography Unconditional Key Distribution Impossibility of Bit Commitment, OT Interactions with Complexity Theory & Physics Ronald's talk
41 Why is Quantum Computation important? Further Conclusions Quantum Information and Computation Computational power of nature Quantum Mechanics as an theory of information Advances in classical Computer Science Practical Quantum Cryptography Advances in Experimental Physics
42 Simon's Algorithm Let f: {0,} n -> {0,} n Promise: f(x)=f(x+a) and f(x) f(y), y x+a (2-periodic) Goal: Find a Randomized: 2 n/2 Quantum: O(n), by finding each time a random y, st. y.a= measure f (x) """" amplitude of H onst """ x n/2 x {0,} n 2 x + 2 x + a H " O " f x f (x) 2 n/2 x {0,} n ( ) x y y + 2 n+/2 y {0,} n + ( ) (x+a) y y 2 n+/2 Hence, we only measure y, s.t. a.y=0 Repeat O(n) times to get n linear independent y's. y {0,} n y = 2 n+/2 ( )x y + 2 n+/2 ( )(x+a) y = 2 n+/2 ( )x y [+ ( ) a y ]
43 Period Finding Algorithm Let f:z N -> C Let f: Z N -> C Promise: f is periodic Goal: Find period Tool: Quantum Fourier Transform: x QFT " " N N ω x y y, ω = e y {0,} n 2π i /N measure f (x) """" QFT N onst """ N /r N /r j=0 N x Z N j r + l measure """ k N /r, k [ 0,r ] x QFT " " N O " f r r i=0 N x Z N i N /r x f (x) If gcd(k,r)=, then gcd(kn/r,n)=n/r REMARK: Factoring reduces classically to period finding!!!
Quantum Communication Complexity
Quantum Communication Complexity Ronald de Wolf Communication complexity has been studied extensively in the area of theoretical computer science and has deep connections with seemingly unrelated areas,
More informationQuantum Communication
Quantum Communication Harry Buhrman CWI & University of Amsterdam Physics and Computing Computing is physical Miniaturization quantum effects Quantum Computers ) Enables continuing miniaturization ) Fundamentally
More informationIntroduction to Quantum Information, Quantum Computation, and Its Application to Cryptography. D. J. Guan
Introduction to Quantum Information, Quantum Computation, and Its Application to Cryptography D. J. Guan Abstract The development of quantum algorithms and quantum information theory, as well as the design
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 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
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 informationQuantum Information Processing
Quantum Information Processing Harry Buhrman CWI & University of Amsterdam Physics and Computing Computing is physical Miniaturization quantum effects Quantum Computers 1) Enables continuing miniaturization
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 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 informationIntroduction 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
More informationLecture 21: Quantum communication complexity
CPSC 519/619: Quantum Computation John Watrous, University of Calgary Lecture 21: Quantum communication complexity April 6, 2006 In this lecture we will discuss how quantum information can allow for a
More informationQuantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits
Quantum Computing Bits and Qubits Quantum Computing Sushain Cherivirala Quantum Gates Measurement of Qubits More Quantum Gates Universal Computation Entangled States Superdense Coding Measurement Revisited
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 informationCryptography in a quantum world
T School of Informatics, University of Edinburgh 25th October 2016 E H U N I V E R S I T Y O H F R G E D I N B U Outline What is quantum computation Why should we care if quantum computers are constructed?
More informationHilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.
CS 94- Bell States Bell Inequalities 9//04 Fall 004 Lecture Hilbert Space Entanglement Quantum Gates Bell States Superdense Coding 1 One qubit: Recall that the state of a single qubit can be written as
More informationLecture 4: Elementary Quantum Algorithms
CS 880: Quantum Information Processing 9/13/010 Lecture 4: Elementary Quantum Algorithms Instructor: Dieter van Melkebeek Scribe: Kenneth Rudinger This lecture introduces several simple quantum algorithms.
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 informationQuantum Cryptography. Areas for Discussion. Quantum Cryptography. Photons. Photons. Photons. MSc Distributed Systems and Security
Areas for Discussion Joseph Spring Department of Computer Science MSc Distributed Systems and Security Introduction Photons Quantum Key Distribution Protocols BB84 A 4 state QKD Protocol B9 A state QKD
More informationAn Introduction to Quantum Information. By Aditya Jain. Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata
An Introduction to Quantum Information By Aditya Jain Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata 1. Introduction Quantum information is physical information that is held in the state of
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 informationUnconditional Security of the Bennett 1992 quantum key-distribution protocol over a lossy and noisy channel
Unconditional Security of the Bennett 1992 quantum key-distribution protocol over a lossy and noisy channel Kiyoshi Tamaki *Perimeter Institute for Theoretical Physics Collaboration with Masato Koashi
More informationLecture 4: Postulates of quantum mechanics
Lecture 4: Postulates of quantum mechanics Rajat Mittal IIT Kanpur The postulates of quantum mechanics provide us the mathematical formalism over which the physical theory is developed. For people studying
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 informationQuantum cryptography. Quantum cryptography has a potential to be cryptography of 21 st century. Part XIII
Quantum cryptography Part XIII Quantum cryptography Quantum cryptography has a potential to be cryptography of st century. An important new feature of quantum cryptography is that security of quantum cryptographic
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 informationAn Introduction. Dr Nick Papanikolaou. Seminar on The Future of Cryptography The British Computer Society 17 September 2009
An Dr Nick Papanikolaou Research Fellow, e-security Group International Digital Laboratory University of Warwick http://go.warwick.ac.uk/nikos Seminar on The Future of Cryptography The British Computer
More informationThe one-way communication complexity of the Boolean Hidden Matching Problem
The one-way communication complexity of the Boolean Hidden Matching Problem Iordanis Kerenidis CRS - LRI Université Paris-Sud jkeren@lri.fr Ran Raz Faculty of Mathematics Weizmann Institute ran.raz@weizmann.ac.il
More informationLecture 2: Quantum bit commitment and authentication
QIC 890/891 Selected advanced topics in quantum information Spring 2013 Topic: Topics in quantum cryptography Lecture 2: Quantum bit commitment and authentication Lecturer: Gus Gutoski This lecture is
More informationEPR paradox, Bell inequality, etc.
EPR paradox, Bell inequality, etc. Compatible and incompatible observables AA, BB = 0, then compatible, can measure simultaneously, can diagonalize in one basis commutator, AA, BB AAAA BBBB If we project
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 informationQuantum Cryptography
Quantum Cryptography Umesh V. Vazirani CS 161/194-1 November 28, 2005 Why Quantum Cryptography? Unconditional security - Quantum computers can solve certain tasks exponentially faster; including quantum
More informationEntanglement and Quantum Teleportation
Entanglement and Quantum Teleportation Stephen Bartlett Centre for Advanced Computing Algorithms and Cryptography Australian Centre of Excellence in Quantum Computer Technology Macquarie University, Sydney,
More informationQuantum Communication. Serge Massar Université Libre de Bruxelles
Quantum Communication Serge Massar Université Libre de Bruxelles Plan Why Quantum Communication? Prepare and Measure schemes QKD Using Entanglement Teleportation Communication Complexity And now what?
More informationBit-Commitment and Coin Flipping in a Device-Independent Setting
Bit-Commitment and Coin Flipping in a Device-Independent Setting J. Silman Université Libre de Bruxelles Joint work with: A. Chailloux & I. Kerenidis (LIAFA), N. Aharon (TAU), S. Pironio & S. Massar (ULB).
More informationarxiv: v7 [quant-ph] 20 Mar 2017
Quantum oblivious transfer and bit commitment protocols based on two non-orthogonal states coding arxiv:1306.5863v7 [quant-ph] 0 Mar 017 Li Yang State Key Laboratory of Information Security, Institute
More informationCryptography CS 555. Topic 25: Quantum Crpytography. CS555 Topic 25 1
Cryptography CS 555 Topic 25: Quantum Crpytography CS555 Topic 25 1 Outline and Readings Outline: What is Identity Based Encryption Quantum cryptography Readings: CS555 Topic 25 2 Identity Based Encryption
More informationQuantum Computing Lecture Notes, Extra Chapter. Hidden Subgroup Problem
Quantum Computing Lecture Notes, Extra Chapter Hidden Subgroup Problem Ronald de Wolf 1 Hidden Subgroup Problem 1.1 Group theory reminder A group G consists of a set of elements (which is usually denoted
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 informationUniversal Blind Quantum Computing
Universal Blind Quantum Computing Elham Kashefi Laboratoire d Informatique de Grenoble Joint work with Anne Broadbent Montreal Joe Fitzsimons Oxford Classical Blind Computing Fundamentally asymmetric unlike
More informationChapter 13: Photons for quantum information. Quantum only tasks. Teleportation. Superdense coding. Quantum key distribution
Chapter 13: Photons for quantum information Quantum only tasks Teleportation Superdense coding Quantum key distribution Quantum teleportation (Theory: Bennett et al. 1993; Experiments: many, by now) Teleportation
More informationCS 282A/MATH 209A: Foundations of Cryptography Prof. Rafail Ostrovsky. Lecture 10
CS 282A/MATH 209A: Foundations of Cryptography Prof. Rafail Ostrovsky Lecture 10 Lecture date: 14 and 16 of March, 2005 Scribe: Ruzan Shahinian, Tim Hu 1 Oblivious Transfer 1.1 Rabin Oblivious Transfer
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 informationEntanglement and information
Ph95a lecture notes for 0/29/0 Entanglement and information Lately we ve spent a lot of time examining properties of entangled states such as ab è 2 0 a b è Ý a 0 b è. We have learned that they exhibit
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 informationQuantum Gates, Circuits & Teleportation
Chapter 3 Quantum Gates, Circuits & Teleportation Unitary Operators The third postulate of quantum physics states that the evolution of a quantum system is necessarily unitary. Geometrically, a unitary
More informationLecture 1: Overview of quantum information
CPSC 59/69: Quantum Computation John Watrous, University of Calgary References Lecture : Overview of quantum information January 0, 006 Most of the material in these lecture notes is discussed in greater
More informationarxiv:quant-ph/ v1 13 Mar 2007
Quantum Key Distribution with Classical Bob Michel Boyer 1, Dan Kenigsberg 2 and Tal Mor 2 1. Département IRO, Université de Montréal Montréal (Québec) H3C 3J7 CANADA 2. Computer Science Department, Technion,
More informationFourier 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
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Petros Wallden Lecture 7: Complexity & Algorithms I 13th October 016 School of Informatics, University of Edinburgh Complexity - Computational Complexity: Classification
More informationPractical Quantum Coin Flipping
Practical Quantum Coin Flipping Anna Pappa, 1, André Chaillloux, 2, Eleni Diamanti, 1, and Iordanis Kerenidis 2, 1 LTCI, CNRS - Télécom ParisTech, Paris, France 2 LIAFA, CNRS - Université Paris 7, Paris,
More informationOther Topics in Quantum Information
p. 1/23 Other Topics in Quantum Information In a course like this there is only a limited time, and only a limited number of topics can be covered. Some additional topics will be covered in the class projects.
More informationA Genetic Algorithm to Analyze the Security of Quantum Cryptographic Protocols
A Genetic Algorithm to Analyze the Security of Quantum Cryptographic Protocols Walter O. Krawec walter.krawec@gmail.com Iona College Computer Science Department New Rochelle, NY USA IEEE WCCI July, 2016
More information9. Distance measures. 9.1 Classical information measures. Head Tail. How similar/close are two probability distributions? Trace distance.
9. Distance measures 9.1 Classical information measures How similar/close are two probability distributions? Trace distance Fidelity Example: Flipping two coins, one fair one biased Head Tail Trace distance
More informationLECTURE NOTES ON Quantum Cryptography
Department of Software The University of Babylon LECTURE NOTES ON Quantum Cryptography By Dr. Samaher Hussein Ali College of Information Technology, University of Babylon, Iraq Samaher@itnet.uobabylon.edu.iq
More informationLecture: Quantum Information
Lecture: Quantum Information Transcribed by: Crystal Noel and Da An (Chi Chi) November 10, 016 1 Final Proect Information Find an issue related to class you are interested in and either: read some papers
More informationQuantum Pseudo-Telepathy
Quantum Pseudo-Telepathy Michail Lampis mlambis@softlab.ntua.gr NTUA Quantum Pseudo-Telepathy p.1/24 Introduction In Multi-Party computations we are interested in measuring communication complexity. Communication
More informationIntroduction to Quantum Computing for Folks
Introduction to Quantum Computing for Folks Joint Advanced Student School 2009 Ing. Javier Enciso encisomo@in.tum.de Technische Universität München April 2, 2009 Table of Contents 1 Introduction 2 Quantum
More informationQuantum Teleportation Pt. 1
Quantum Teleportation Pt. 1 PHYS 500 - Southern Illinois University April 17, 2018 PHYS 500 - Southern Illinois University Quantum Teleportation Pt. 1 April 17, 2018 1 / 13 Types of Communication In the
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 Information Theory and Cryptography
Quantum Information Theory and Cryptography John Smolin, IBM Research IPAM Information Theory A Mathematical Theory of Communication, C.E. Shannon, 1948 Lies at the intersection of Electrical Engineering,
More informationQuantum Cryptography
Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam Centrum Wiskunde & Informatica Winter 17 QuantumDay@Portland
More informationLecture 3: Superdense coding, quantum circuits, and partial measurements
CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 3: Superdense coding, quantum circuits, and partial measurements Superdense Coding January 4, 006 Imagine a situation where two
More informationQuantum key distribution with 2-bit quantum codes
Quantum key distribution with -bit quantum codes Xiang-Bin Wang Imai Quantum Computation and Information project, ERATO, Japan Sci. and Tech. Corp. Daini Hongo White Bldg. 0, 5-8-3, Hongo, Bunkyo, Tokyo
More informationSimulation 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
More informationarxiv:quant-ph/ v2 17 Sep 2002
Proof of security of quantum key distribution with two-way classical communications arxiv:quant-ph/0105121 v2 17 Sep 2002 Daniel Gottesman EECS: Computer Science Division University of California Berkeley,
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 informationOptimal bounds for quantum bit commitment
Optimal bounds for quantum bit commitment André Chailloux LRI Université Paris-Sud andre.chailloux@gmail.fr Iordanis Kerenidis CNRS - LIAFA Université Paris 7 jkeren@liafa.jussieu.fr 1 Introduction Quantum
More information+ = OTP + QKD = QC. ψ = a. OTP One-Time Pad QKD Quantum Key Distribution QC Quantum Cryptography. θ = 135 o state 1
Quantum Cryptography Quantum Cryptography Presented by: Shubhra Mittal Instructor: Dr. Stefan Robila Intranet & Internet Security (CMPT-585-) Fall 28 Montclair State University, New Jersey Introduction
More informationRIVF 2006 Tutorial. Prof. Patrick Bellot PhD. Dang Minh Dung. ENST (Paris) & IFI (Hanoi) RIVF 2006 Tutorial. "Quantum Communications"
4th IEEE International Conference RIVF 2006 - p. 1 ENST (Paris) & IFI (Hanoi) 4th IEEE International Conference RIVF 2006 - p. 2 Outline 1 2 3 4 5 4th IEEE International Conference RIVF 2006 - p. 3 The
More informationQuantum Computing: Foundations to Frontier Fall Lecture 3
Quantum Computing: Foundations to Frontier Fall 018 Lecturer: Henry Yuen Lecture 3 Scribes: Seyed Sajjad Nezhadi, Angad Kalra Nora Hahn, David Wandler 1 Overview In Lecture 3, we started off talking about
More informationEntanglement. Michelle Victora Advisor: Paul G. Kwiat. Physics 403 talk: March 13, 2017
Entanglement Michelle Victora Advisor: Paul G. Kwiat Physics 403 talk: March 13, 2017 Introduction to entanglement Making entanglement in the lab Applications Quantum states describing more than one system
More informationQuantum Algorithms. 1. Definition of the Subject and Its Importance. 4. Factoring, Discrete Logarithms, and the Abelian Hidden Subgroup Problem
Quantum Algorithms Michele Mosca Institute for Quantum Computing and Dept. of Combinatorics & Optimization University of Waterloo and St. Jerome s University, and Perimeter Institute for Theoretical Physics
More informationIntroduction to Quantum Cryptography
Università degli Studi di Perugia September, 12th, 2011 BunnyTN 2011, Trento, Italy This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. Quantum Mechanics
More informationDiscrete Quantum Theories
Discrete Quantum Theories Andrew J. Hanson 1 Gerardo Ortiz 2 Amr Sabry 1 Yu-Tsung Tai 3 (1) School of Informatics and Computing (2) Department of Physics (3) Mathematics Department Indiana University July
More informationQuantum key distribution for the lazy and careless
Quantum key distribution for the lazy and careless Noisy preprocessing and twisted states Joseph M. Renes Theoretical Quantum Physics, Institut für Angewandte Physik Technische Universität Darmstadt Center
More informationReport on Conceptual Foundations and Foils for QIP at the Perimeter Institute, May 9 May
Report on Conceptual Foundations and Foils for QIP at the Perimeter Institute, May 9 May 13 2011 Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. May 19, 2011
More informationINTRODUCTION TO QUANTUM COMPUTING
INTRODUCTION TO QUANTUM COMPUTING Writen by: Eleanor Rieffel and Wolfgang Polak Presented by: Anthony Luaders OUTLINE: Introduction Notation Experiment Quantum Bit Quantum Key Distribution Multiple Qubits
More informationQuantum 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
More informationShort Course in Quantum Information Lecture 5
Short Course in Quantum Information Lecture 5 Quantum Algorithms Prof. Andrew Landahl University of New Mexico Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html
More informationIntroduction to Quantum Key Distribution
Fakultät für Physik Ludwig-Maximilians-Universität München January 2010 Overview Introduction Security Proof Introduction What is information? A mathematical concept describing knowledge. Basic unit is
More informationTeleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)
Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters) Rahul Jain U. Waterloo and Institute for Quantum Computing, rjain@cs.uwaterloo.ca entry editor: Andris Ambainis
More informationHigh Fidelity to Low Weight. Daniel Gottesman Perimeter Institute
High Fidelity to Low Weight Daniel Gottesman Perimeter Institute A Word From Our Sponsor... Quant-ph/0212066, Security of quantum key distribution with imperfect devices, D.G., H.-K. Lo, N. Lutkenhaus,
More informationA. Quantum Key Distribution
A. Quantum Key Distribution The purpose of QKD is to establish a string of random bits (the key ) shared by Alice and Bob, where Alice and Bob can be highly confident that eavesdropper Eve knows almost
More informationQuantum information and quantum computing
Middle East Technical University, Department of Physics January 7, 009 Outline Measurement 1 Measurement 3 Single qubit gates Multiple qubit gates 4 Distinguishability 5 What s measurement? Quantum measurement
More informationOn Quantum vs. Classical Communication Complexity
On Quantum vs. Classical Communication Complexity Dmitry Gavinsky Institute of Mathematics, Praha Czech Academy of Sciences Introduction Introduction The setting of communication complexity is one of the
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 informationMultiparty Quantum Secret Sharing Using Quantum Fourier Transform
Commun. Theor. Phys. (Beijing, China) 51 (2009) pp. 221 226 c Chinese Physical Society and IOP Publishing Ltd Vol. 51, No. 2, February 15, 2009 Multiparty Quantum Secret Sharing Using Quantum Fourier Transform
More informationSUPERDENSE CODING AND QUANTUM TELEPORTATION
SUPERDENSE CODING AND QUANTUM TELEPORTATION YAQIAO LI This note tries to rephrase mathematically superdense coding and quantum teleportation explained in [] Section.3 and.3.7, respectively (as if I understood
More informationPhysics ; CS 4812 Problem Set 4
Physics 4481-7681; CS 4812 Problem Set 4 Six problems (six pages), all short, covers lectures 11 15, due in class 25 Oct 2018 Problem 1: 1-qubit state tomography Consider a 1-qubit state ψ cos θ 2 0 +
More informationQuantum 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
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 Entanglement, Quantum Cryptography, Beyond Quantum Mechanics, and Why Quantum Mechanics Brad Christensen Advisor: Paul G.
Quantum Entanglement, Quantum Cryptography, Beyond Quantum Mechanics, and Why Quantum Mechanics Brad Christensen Advisor: Paul G. Kwiat Physics 403 talk: December 2, 2014 Entanglement is a feature of compound
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 informationPing Pong Protocol & Auto-compensation
Ping Pong Protocol & Auto-compensation Adam de la Zerda For QIP seminar Spring 2004 02.06.04 Outline Introduction to QKD protocols + motivation Ping-Pong protocol Security Analysis for Ping-Pong Protocol
More informationQuantum Cryptography. Marshall Roth March 9, 2007
Quantum Cryptography Marshall Roth March 9, 2007 Overview Current Cryptography Methods Quantum Solutions Quantum Cryptography Commercial Implementation Cryptography algorithms: Symmetric encrypting and
More informationC. QUANTUM INFORMATION 111
C. QUANTUM INFORMATION 111 C Quantum information C.1 Qubits C.1.a Single qubits 1. Qubit: Just as the bits 0 and 1 are represented by distinct physical states, so the quantum bits (or qubits) 0i and 1i
More informationResearch Article Novel Quantum Encryption Algorithm Based on Multiqubit Quantum Shift Register and Hill Cipher
Advances in High Energy Physics, Article ID 104325, 5 pages http://dx.doi.org/10.1155/2014/104325 Research Article Novel Quantum Encryption Algorithm Based on Multiqubit Quantum Shift Register and Hill
More informationLower bounds for Quantum Computation and Communication. Ashwin V. Nayak. B.Tech. (Indian Institute of Technology, Kanpur) 1995
Lower bounds for Quantum Computation and Communication by Ashwin V. Nayak B.Tech. (Indian Institute of Technology, Kanpur) 1995 A dissertation submitted in partial satisfaction of the requirements for
More informationQuantum Technologies for Cryptography
University of Sydney 11 July 2018 Quantum Technologies for Cryptography Mario Berta (Department of Computing) marioberta.info Quantum Information Science Understanding quantum systems (e.g., single atoms
More informationZero-Knowledge Against Quantum Attacks
Zero-Knowledge Against Quantum Attacks John Watrous Department of Computer Science University of Calgary Calgary, Alberta, Canada jwatrous@cpsc.ucalgary.ca ABSTRACT This paper proves that several interactive
More information