INTRODUCTORY NOTES ON QUANTUM COMPUTATION
|
|
- Imogene Sanders
- 5 years ago
- Views:
Transcription
1 INTRODUCTORY NOTES ON QUANTUM COMPUTATION Keith Hannabuss Balliol College, Oxford Hilary Term 2009 Notation. In these notes we shall often use the physicists bra-ket notation, writing ψ for a vector ψ in a complex inner product space H, and ψ for the dual vector in H which sends φ H to the inner product ψ φ. Definition. The linear operator sending a general vector ψ to ξ η ψ = η ψ ξ, is denoted by ξ η. The tensor product of vectors φ K and ψ H is denoted by φ ψ or φψ. In this notation the projection P j onto a normalised vector φ j, given by can be written as P j = φ j φ j. P j : ψ φ j ψ φ j = φ j φ j ψ, 1
2 1 Quantum Measurement 1.1. Introduction Over the last 50 years the processing power of computers has steadily increased following the 1965 observation enunciated by Gordon Moore (cofounder of Intel) that the number of transistors per device doubles every 2 years. This power has mainly be achieved by miniaturising the components, and they are now so small (32nm transistors) that they are the size of large molecules, and so reach the quantum scale. Of course quantum effects are already used in the semiconductor chips at the heart of the modern machines and in the lasers which read and write the CDs and DVDs, but the actual processing is done with classical currents. Twenty-five years ago various people suggested that it should be possible to build a quantum computer in which the actual processing was done quantum mechanically. The key idea is that ordinary computers use binary arithmetic or logic, reducing everything to strings of 0s and 1s. The quantum mechanical analogue would be a collection of systems each described by a two-dimensional space V = C 2, which one could imagine as having basis e 0 and e 1 or 0 and 1, corresponding to the classical 0 and 1. Just as a choice of 0 or 1 represents 1 bit (binary digit) of information, a choice of state vector in V would represent one qubit (quantum bit) of quantum information. (Similarly combinations of two such systems represented by states in the space V V = C 4 carry two qubits of information, states in V V V = C 8 carry three qubits, and so on.) Definition A qubit is represented by a non-zero vector in a two-dimensional inner product space V = C 2, spanned by orthonormal vectors 0 and 1 ; k qubits are represented by a non-zero vector in k V, (defined inductively by 1 V = V, k V = V ( k 1 V ). Remark: The two qubit space is spanned by the four vectors 0 0, 0 1, 1 0, 1 1. The power of the idea lies in the fact that where the classical bit is either a 0 or a 1, the quantum state can be in a superposition, or linear combination, of 0 and 1, and there are uncountably infinitely many such superpositions, vastly increasing the power of information processing machines. In effect, when a computer works with a non-trivial linear combination of 0 and 1 it is simultaneously working with 0 and 1, so that it can be vastly faster than ordinary computers. (One could similarly start with a three dimensional space V getting a qutrit, but we shall concentrate on the more usual case of qubits.) In the 1990s quantum algorithms were discovered which would run significantly faster than their classical analogues. Grover s algorithm will sort or search a list of N items in time of order N, rather than the classical N. The quantum Fourier Transform calculates Fourier transforms much faster than the classical methods. Shor s algorithm exploits this to factorise numbers faster than the classical methods, indeed fast enough to threaten the current public key encryption method which relies on our inability to factorise very large numbers fast. Fortunately quantum mechanics can also help with the solution, because observations in quantum theory change the state of the system, and this can be used as the basis of quantum communication channels where any attempt to eavesdrop is detectable. We shall discuss the quantum Fourier transform and Shor s algorithm in detail towards the end of the course. A quantum computer will need a method of processing information, some algorithms which exploit the quantum nature of the machine (otherwise one might as well use a classical computer, and a method of reading and writing data. One of the big problems is that interactions between the computer and the outside world tend to get rid of the details of superpositions on which it relies. This decoherence currently places strong limits on what can be done, so it is not yet known whether practical quantum 2
3 Quantum Measurement 3 computers can be built, but their superiority for certain kinds of calculation have encouraged a huge effort to develop one. There are many different lines of attack on the problem, but we shall concentrate on the main theoretical ideas. The main tools needed for quantum computing are 1. Methods of reading the output. 2. Algorithms which exploit the quantum nature of the machine, such as Shor s and Gorver s algorithms. 3. Processing units or logic gates which handle the qubits. We shall start by discussing how to read the output, because that links in to questions of measurement in quantum systems which have been discussed over a long period for other reasons. We shall then discuss the processing units, and finally give examples of some of the most efficient quantum algorithms Quantum Measurement Ideally the measurement of an observable A will give a precise result, with no dispersion. This is quite a strong requirement, as we recall from the following simple result: Theorem The dispersion of A vanishes in the state ψ if and only if Aψ = E ψ [A]ψ, that is ψ is an eigenvector of A with eigenvalue E ψ [A]. Proof. We simply note that (for normalised ψ) ψ [A] 2 = E ψ [(A E ψ [A]) 2 ] = ψ (A E ψ [A]) 2 ψ = (A E ψ [A])ψ (A E ψ [A])ψ = (A E ψ [A])ψ 2, from which the result immediately follows. This means that after the measurement one must have an eigenstate of A. Suppose that A has an orthonormal set of eigenvectors φ j, satisfying Aφ j = α j φ j with non-degenerate eigenvalues α j, and one starts with a state ψ = j c j φ j. (Taking the inner product with φ k gives φ k ψ = j c j φ k φ j = c k, and so determines the coefficients.) If a measurement of A yields the value α j, then the state afterwards must be φ j, and this happens with probability c j 2. It is convenient to break the process into two parts: first the measurement ψ c j φ j = φ j ψ φ j, and then normalisation taking one to φ j. The first step just gives the projection P j ψ = c j ψ j = φ j ψ φ j of ψ onto φ j. We also note that the probability of this is c j 2 = P j ψ 2. Postulate (von Neumann Lüders). After the measurement of an observable A the state ψ becomes P ψ, where P is the orthogonal projection onto the subspace of states compatible with the outcome of the measurement. The probability of that outcome is P ψ 2. This postulate encapsulates the above discussion for non-degenerate eigenvalues, and extends it to degenerate ones.
4 4 Quantum Measurement 1.3. Polarised light There is actually one classical system familiar from everyday life, which displays the same kind of projection: the polarisation of light. Light can be polarised vertically or horizontally, a fact exploited by polaroid sunglasses, and we can describe its polarisation states in a vector space spanned by the two vectors v, for vertically polarised, and h, for horizontally polarised light. In general the polarisation state of a photon is a superposition α v + β h. In particular there are the states associated with light polarised at an angle θ to the vertical θ = cos θ v + sin θ h. Malus discovered in 1809 that for two filters are at an angle θ only a proportion cos 2 θ of light transmitted by the first filter passes through the second filter If, for example, the first filter measures v and the second θ then a state v emeges form the vertical filter, and after passing through the second filter at an angle θ it is projected to θ v θ = cos θ θ, with coeficient squared cos 2 θ. In particular, when θ = π/2 a proportion cos 2 (π/2) = 0 is transmitted. However, by inserting a middle filter at an angle θ to the vertical, a proportion cos 2 θ passed through the second filter and a proportion sin 2 θ of that through the third, giving a total proportion of cos 2 θ sin 2 θ = sin 2 (θ)/4, which is non-zero for all θ (0, π/2). Polarised light provides a good introduction to some of the paradoxes of quantum mechanics. Polarisation is not just a macroscopic effect, but each individual photon in the light beam is polarised, and the quantum space describing the polarisation of an individual photon is also spanned by the two vectors v and h. In the photon picture the idea of the proportion of the light which is transmitted is the probability that a photon will pass through the filter, and it turns out that there this quantum probability behaves differently from classical probability. The usual explanation of a polaroid filter is that it cuts out light polarised in the wrong direction, but then inserting an extra filter should cut out even more light not enhance it. After the development of quantum mechanics, and, in particular, Born s probabilistic interpretation of the wave function, some physicists got on with exploring the new quantum world, but others including Einstein and Schrödinger, struggled with the question of whether the new theory was already complete or whether the puzzles were an indication that something was missing, some hidden variables which could explain the statistical aspects, much as happened in statistical mechanics. At that time it was impossible to test many of their ideas experimentally, but over the last 30 years that has changed, settling many of the questions with which they struggled The Fréchet Bell Inequalities Theorem (Fréchet 1919, Bell 1961) Suppose that A, B, and C are events in (that is subsets of) a space with probability measure P, so that P[A \ B] denotes the probability that A happens but B does not. Then one has the inequality P(A \ C) P(A \ B) + P(B \ C). Proof. One can show directly, or by consideration of a Venn diagram, that P(A \ B) + P(B \ C) P(A \ C) = P((A C) \ B) + P(B \ (A C)), from which the non-negativity of probabilities gives P(A \ C) P(A \ B) + P(B \ C).
5 The Fréchet Bell Inequalities 5 This is essentially what physicists know as Bell s inequality, after John Bell who rediscovered it in Bell s important contribution was to realise that this inequality, valid for all classical systems, breaks down for quantum systems. Let us consider three polaroid filters F A, F B, and F C, with angles γ between F A and F B, β between F A and F C and α between F B and F C. Let A be the event that a photon passes through the first filter, B that it passes through the second and C that it passes through the third. Then A \ B is the event that it passes through the first but not the second, which, according to our previous analysis is 1 cos 2 γ = sin 2 γ and similarly P(B \ C) = sin 2 α and P(A \ C) = sin 2 β. Now, the triangle with sides parallel to the filter directions has sides of length sin α, sin β and sin γ. If we have a right-angled triangle with β = π/2, then Pythagoras Theorem ensures that whilst for larger angles β so that sin 2 β = sin 2 α + sin 2 γ, sin 2 β > sin 2 α + sin 2 γ, P(A \ C) > P(A \ B) + P(B \ C), violating Bell s Inequality. Alternatively, we can use the cosine rule to see that sin 2 β = sin 2 α + sin 2 γ 2 sin α sin γ cos β, which violates Bell s Inequality when β > π/2 and cos β is negative. Before quantum theory there was no problem here. Fréchet s Inequality holds when we are measuring the probability of the same state or element of the probability space, but once the photon emerges from the second filter its state has been altered compared with the state in the first filter. More precisely, the photon enters the first filter in the sate ω Ω, and leaves it in the state ω A which then proceeds to the second filter, we are measuring P[ω A \ B], and P[ω A B \ C] rather than P[ω A \ B], and P[ω B \ C]. It was Einstein, Podolsky, and Rosen who put their finger on the underlying problem of quantum theory. (We give a modified version of their idea, based on a later suggestion of Bohm.) An atom can be induced to emit two photons in opposite directions and with identical polarisations, although we don t know what that polarisation may be. It is equally likely that both left and right moving photons are vertically polarised v v, or both horizontally polarised h h, so the overall state is ψ = 1 2 ( v v + h h ). Suppose we now let them travel some distance and then measure the polarisation of one of them with filter F A, and afterwards measure the polarisation of the other with filter F B. As soon as the first photon has gone through its filter measuring its vertical polarisation the state ψ must project to the 1 part consistent with that, 2 v v. But this produces exactly the same effect as if the other photon had been measured, and it will pass through F B with probability cos 2 θ, even if the filters were far enough apart that not even light could have travelled between them in time to let the second photon know the fate of the first. The answer is therefore exactly the same as for our discussion of a single photon going through successive filters. By repeating the experiment with various filters, we can find all the values needed in the Bell Fréchet inequality, and it is violated. Einstein, Podolsky and Rosen thought that the paradoxical elements of their thought experiment revealed the incompleteness of quantum theory, but in the 1980s Alain Aspect and his team did the experiments with polarised light and found that the Fréchet Inequality was indeed violated for polarised photons, even when the orientation of the polarisers was only determined whilst the photons were in flight. These results have subsequently been confirmed by numerous other experiments. It seems that
6 6 Quantum Measurement either there are no hidden variables or, if they do exist, they must themselves have many paradoxical features. We conclude by noting that the feature of the Einstein Podolsky Rosen paradox which made things work was the special state 1 2 ( v v + h h ), linking properties of the two photons. Schrödinger gave this the name entanglement.
INTRODUCTION 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 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 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 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 information1 1D Schrödinger equation: Particle in an infinite box
1 OF 5 1 1D Schrödinger equation: Particle in an infinite box Consider a particle of mass m confined to an infinite one-dimensional well of width L. The potential is given by V (x) = V 0 x L/2, V (x) =
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 informationQubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable,
Qubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable, A qubit: a sphere of values, which is spanned in projective sense by two quantum
More information1 1D Schrödinger equation: Particle in an infinite box
1 OF 5 NOTE: This problem set is to be handed in to my mail slot (SMITH) located in the Clarendon Laboratory by 5:00 PM (noon) Tuesday, 24 May. 1 1D Schrödinger equation: Particle in an infinite box Consider
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 informationThe Future. Currently state of the art chips have gates of length 35 nanometers.
Quantum Computing Moore s Law The Future Currently state of the art chips have gates of length 35 nanometers. The Future Currently state of the art chips have gates of length 35 nanometers. When gate lengths
More informationShort Course in Quantum Information Lecture 2
Short Course in Quantum Information Lecture Formal Structure of Quantum Mechanics Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html Syllabus Lecture
More information1 Measurements, Tensor Products, and Entanglement
Stanford University CS59Q: Quantum Computing Handout Luca Trevisan September 7, 0 Lecture In which we describe the quantum analogs of product distributions, independence, and conditional probability, and
More informationA review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels
JOURNAL OF CHEMISTRY 57 VOLUME NUMBER DECEMBER 8 005 A review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels Miri Shlomi
More informationEntanglement. arnoldzwicky.org. Presented by: Joseph Chapman. Created by: Gina Lorenz with adapted PHYS403 content from Paul Kwiat, Brad Christensen
Entanglement arnoldzwicky.org Presented by: Joseph Chapman. Created by: Gina Lorenz with adapted PHYS403 content from Paul Kwiat, Brad Christensen PHYS403, July 26, 2017 Entanglement A quantum object can
More information)j > Riley Tipton Perry University of New South Wales, Australia. World Scientific CHENNAI
Riley Tipton Perry University of New South Wales, Australia )j > World Scientific NEW JERSEY LONDON. SINGAPORE BEIJING SHANSHAI HONG K0N6 TAIPEI» CHENNAI Contents Acknowledgments xi 1. Introduction 1 1.1
More informationThe 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
More informationHonors 225 Physics Study Guide/Chapter Summaries for Final Exam; Roots Chapters 15-18
Honors 225 Physics Study Guide/Chapter Summaries for Final Exam; Roots Chapters 15-18 Chapter 15 Collapsing the Wave If a particle is in a quantum superposition state (that is, a superposition of eigenfunctions
More informationQUANTUM ENTANGLEMENT AND ITS ASPECTS. Dileep Dhakal Masters of Science in Nanomolecular Sciences
QUANTUM ENTANGLEMENT AND ITS ASPECTS Dileep Dhakal Masters of Science in Nanomolecular Sciences Jacobs University Bremen 26 th Nov 2010 Table of Contents: Quantum Superposition Schrödinger s Cat Pure vs.
More informationRichard Cleve David R. Cheriton School of Computer Science Institute for Quantum Computing University of Waterloo
CS 497 Frontiers of Computer Science Introduction to Quantum Computing Lecture of http://www.cs.uwaterloo.ca/~cleve/cs497-f7 Richard Cleve David R. Cheriton School of Computer Science Institute for Quantum
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 informationLecture 4. QUANTUM MECHANICS FOR MULTIPLE QUBIT SYSTEMS
Lecture 4. QUANTUM MECHANICS FOR MULTIPLE QUBIT SYSTEMS 4.1 Multiple Qubits Next we consider a system of two qubits. If these were two classical bits, then there would be four possible states,, 1, 1, and
More informationThe Einstein-Podolsky-Rosen thought experiment and Bell s theorem
PHYS419 Lecture 0 The Einstein-Podolsky-Rosen thought experiment and Bell s theorem 1 The Einstein-Podolsky-Rosen thought experiment and Bell s theorem As first shown by Bell (1964), the force of the arguments
More information1 Polarization of Light
J. Rothberg April, 014 Outline: Introduction to Quantum Mechanics 1 Polarization of Light 1.1 Classical Description Light polarized in the x direction has an electric field vector E = E 0 ˆx cos(kz ωt)
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 informationBasics on quantum information
Basics on quantum information Mika Hirvensalo Department of Mathematics and Statistics University of Turku mikhirve@utu.fi Thessaloniki, May 2016 Mika Hirvensalo Basics on quantum information 1 of 52 Brief
More informationQuantum Information Types
qitd181 Quantum Information Types Robert B. Griffiths Version of 6 February 2012 References: R. B. Griffiths, Types of Quantum Information, Phys. Rev. A 76 (2007) 062320; arxiv:0707.3752 Contents 1 Introduction
More information6.896 Quantum Complexity Theory September 9, Lecture 2
6.96 Quantum Complexity Theory September 9, 00 Lecturer: Scott Aaronson Lecture Quick Recap The central object of study in our class is BQP, which stands for Bounded error, Quantum, Polynomial time. Informally
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 informationSinglet State Correlations
Chapter 23 Singlet State Correlations 23.1 Introduction This and the following chapter can be thought of as a single unit devoted to discussing various issues raised by a famous paper published by Einstein,
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 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 informationThe Einstein-Podolsky-Rosen thought-experiment and Bell s theorem
PHYS419 Lecture 0 The Einstein-Podolsky-Rosen thought-experiment and Bell s theorem 1 The Einstein-Podolsky-Rosen thought-experiment and Bell s theorem As first shown by Bell (1964), the force of the arguments
More informationIntroduction to Bell s theorem: the theory that solidified quantum mechanics
Introduction to Bells theorem: the theory that solidified quantum mechanics Jia Wang Department of Chemistry, University of Michigan, 930 N. University Ave., Ann Arbor, MI 48109 (Received November 30,
More informationBasics on quantum information
Basics on quantum information Mika Hirvensalo Department of Mathematics and Statistics University of Turku mikhirve@utu.fi Thessaloniki, May 2014 Mika Hirvensalo Basics on quantum information 1 of 49 Brief
More informationThe controlled-not (CNOT) gate exors the first qubit into the second qubit ( a,b. a,a + b mod 2 ). Thus it permutes the four basis states as follows:
C/CS/Phys C9 Qubit gates, EPR, ell s inequality 9/8/05 Fall 005 Lecture 4 Two-qubit gate: COT The controlled-not (COT) gate exors the first qubit into the second qubit ( a,b a,a b = a,a + b mod ). Thus
More informationBasic concepts from quantum theory
B. BASIC CONCEPTS FROM QUANTUM THEORY 77 B Basic concepts from quantum theory B.1 Introduction B.1.a Bases In quantum mechanics certain physical quantities are quantized, such as the energy of an electron
More informationMaster Projects (EPFL) Philosophical perspectives on the exact sciences and their history
Master Projects (EPFL) Philosophical perspectives on the exact sciences and their history Some remarks on the measurement problem in quantum theory (Davide Romano) 1. An introduction to the quantum formalism
More informationIncompatibility Paradoxes
Chapter 22 Incompatibility Paradoxes 22.1 Simultaneous Values There is never any difficulty in supposing that a classical mechanical system possesses, at a particular instant of time, precise values of
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 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
More informationJ = L + S. to this ket and normalize it. In this way we get expressions for all the kets
Lecture 3 Relevant sections in text: 3.7, 3.9 Total Angular Momentum Eigenvectors How are the total angular momentum eigenvectors related to the original product eigenvectors (eigenvectors of L z and S
More information1 Algebra of State Vectors
J. Rothberg October 6, Introduction to Quantum Mechanics: Part Algebra of State Vectors What does the State Vector mean? A state vector is not a property of a physical system, but rather represents an
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 informationQuantum Mechanics II: Examples
Quantum Mechanics II: Examples Michael A. Nielsen University of Queensland Goals: 1. To apply the principles introduced in the last lecture to some illustrative examples: superdense coding, and quantum
More information10 - February, 2010 Jordan Myronuk
10 - February, 2010 Jordan Myronuk Classical Cryptography EPR Paradox] The need for QKD Quantum Bits and Entanglement No Cloning Theorem Polarization of Photons BB84 Protocol Probability of Qubit States
More information6.080/6.089 GITCS May 6-8, Lecture 22/23. α 0 + β 1. α 2 + β 2 = 1
6.080/6.089 GITCS May 6-8, 2008 Lecturer: Scott Aaronson Lecture 22/23 Scribe: Chris Granade 1 Quantum Mechanics 1.1 Quantum states of n qubits If you have an object that can be in two perfectly distinguishable
More informationContextuality and the Kochen-Specker Theorem. Interpretations of Quantum Mechanics
Contextuality and the Kochen-Specker Theorem Interpretations of Quantum Mechanics by Christoph Saulder 19. 12. 2007 Interpretations of quantum mechanics Copenhagen interpretation the wavefunction has no
More informationCosmology Lecture 2 Mr. Kiledjian
Cosmology Lecture 2 Mr. Kiledjian Lecture 2: Quantum Mechanics & Its Different Views and Interpretations a) The story of quantum mechanics begins in the 19 th century as the physicists of that day were
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 informationChapter 10. Quantum algorithms
Chapter 10. Quantum algorithms Complex numbers: a quick review Definition: C = { a + b i : a, b R } where i = 1. Polar form of z = a + b i is z = re iθ, where r = z = a 2 + b 2 and θ = tan 1 y x Alternatively,
More informationPh 219/CS 219. Exercises Due: Friday 3 November 2006
Ph 9/CS 9 Exercises Due: Friday 3 November 006. Fidelity We saw in Exercise. that the trace norm ρ ρ tr provides a useful measure of the distinguishability of the states ρ and ρ. Another useful measure
More informationNew schemes for manipulating quantum states using a Kerr cell. Istituto Elettrotecnico Nazionale Galileo Ferraris, Str. delle Cacce 91, I Torino
New schemes for manipulating quantum states using a Kerr cell Marco Genovese and C.Novero Istituto Elettrotecnico Nazionale Galileo Ferraris, Str. delle Cacce 91, I-10135 Torino Recently, Quantum Non Demolition
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 informationarxiv:quant-ph/ v2 19 Jan 2000
An Introduction to Quantum Computing for Non-Physicists arxiv:quant-ph/9809016 v 19 Jan 000 Eleanor Rieffel FX Palo Alto Labratory and Wolfgang Polak Consultant FX Palo Alto Laboratory, 3400 Hillview Avenue,
More informationQuantum Measurements: some technical background
Quantum Measurements: some technical background [From the projection postulate to density matrices & (introduction to) von Neumann measurements] (AKA: the boring lecture) First: One more example I wanted
More informationLecture 13B: Supplementary Notes on Advanced Topics. 1 Inner Products and Outer Products for Single Particle States
Lecture 13B: Supplementary Notes on Advanced Topics Outer Products, Operators, Density Matrices In order to explore the complexity of many particle systems a different way to represent multiparticle states
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 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 informationReview of Quantum Mechanics, cont.
Review of Quantum Mechanics, cont. 1 Probabilities In analogy to the development of a wave intensity from a wave amplitude, the probability of a particle with a wave packet amplitude, ψ, between x and
More informationEinstein-Podolsky-Rosen paradox and Bell s inequalities
Einstein-Podolsky-Rosen paradox and Bell s inequalities Jan Schütz November 27, 2005 Abstract Considering the Gedankenexperiment of Einstein, Podolsky, and Rosen as example the nonlocal character of quantum
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 informationLecture 3: Hilbert spaces, tensor products
CS903: Quantum computation and Information theory (Special Topics In TCS) Lecture 3: Hilbert spaces, tensor products This lecture will formalize many of the notions introduced informally in the second
More informationTimeline: Bohm (1951) EPR (1935) CHSH (1969) Bell (1964) Theory. Freedman Clauser (1972) Aspect (1982) Weihs (1998) Weinland (2001) Zeilinger (2010)
1.EPR paradox 2.Bohm s version of EPR with spin ½ particles 3.Entangled states and production 4.Derivation of CHSH inequality - S parameter for mixed and entangled state 5. Loopholes 6.Experiments confirming
More informationQuantum Entanglement. Chapter Introduction. 8.2 Entangled Two-Particle States
Chapter 8 Quantum Entanglement 8.1 Introduction In our final chapter on quantum mechanics we introduce the concept of entanglement. This is a feature of two-particle states (or multi-particle states) in
More informationQuantum Mechanics and Quantum Computing: an Introduction. Des Johnston, Notes by Bernd J. Schroers Heriot-Watt University
Quantum Mechanics and Quantum Computing: an Introduction Des Johnston, Notes by Bernd J. Schroers Heriot-Watt University Contents Preface page Introduction. Quantum mechanics (partly excerpted from Wikipedia).
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 informationHardy s Paradox. Chapter Introduction
Chapter 25 Hardy s Paradox 25.1 Introduction Hardy s paradox resembles the Bohm version of the Einstein-Podolsky-Rosen paradox, discussed in Chs. 23 and 24, in that it involves two correlated particles,
More informationThe act of measuring a particle fundamentally disturbs its state.
Chapter 1 Introduction Nature at the sub-atomic scale behaves totally differently from anything that our experience with the physical world prepares us for. Quantum mechanics is the name of the branch
More informationAn Introduction to Quantum Computing for Non-Physicists
An Introduction to Quantum Computing for Non-Physicists ELEANOR RIEFFEL FX Palo Alto Laboratory AND WOLFGANG POLAK Richard Feynman s observation that certain quantum mechanical effects cannot be simulated
More informationEPR Paradox Solved by Special Theory of Relativity
EPR Paradox Solved by Special Theory of Relativity Justin Lee June 20 th, 2013 Abstract This paper uses the special theory of relativity (SR) to introduce a novel solution to Einstein- Podolsky-Rosen (EPR)
More informationNON HILBERTIAN QUANTUM MECHANICS ON THE FINITE GALOIS FIELD
1 BAO HUYNH 12524847 PHYSICS 517 QUANTUM MECHANICS II SPRING 2013 TERM PAPER NON HILBERTIAN QUANTUM MECHANICS ON THE FINITE GALOIS FIELD 2 Index table Section Page 1. Introduction 3 2. Algebraic construction
More informationB. BASIC CONCEPTS FROM QUANTUM THEORY 93
B. BASIC CONCEPTS FROM QUANTUM THEORY 93 B.5 Superposition B.5.a Bases 1. In QM certain physical quantities are quantized, such as the energy of an electron in an atom. Therefore an atom might be in certain
More informationComplex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where
Chapter 0 Quantum algorithms Complex numbers: a quick review / 4 / 4 Definition: C = { a + b i : a, b R } where i = Polar form of z = a + b i is z = re iθ, where r = z = a + b and θ = tan y x Alternatively,
More informationQuantum Mechanics is Linear Algebra. Noah Graham Middlebury College February 25, 2014
Quantum Mechanics is Linear Algebra Noah Graham Middlebury College February 25, 24 Linear Algebra Cheat Sheet Column vector quantum state: v = v v 2. Row vector dual state: w = w w 2... Inner product:
More informationStochastic Quantum Dynamics I. Born Rule
Stochastic Quantum Dynamics I. Born Rule Robert B. Griffiths Version of 25 January 2010 Contents 1 Introduction 1 2 Born Rule 1 2.1 Statement of the Born Rule................................ 1 2.2 Incompatible
More informationCSCI 2570 Introduction to Nanocomputing. Discrete Quantum Computation
CSCI 2570 Introduction to Nanocomputing Discrete Quantum Computation John E Savage November 27, 2007 Lect 22 Quantum Computing c John E Savage What is Quantum Computation It is very different kind of computation
More informationModern Physics notes Spring 2007 Paul Fendley Lecture 27
Modern Physics notes Spring 2007 Paul Fendley fendley@virginia.edu Lecture 27 Angular momentum and positronium decay The EPR paradox Feynman, 8.3,.4 Blanton, http://math.ucr.edu/home/baez/physics/quantum/bells
More information1.1.1 Bell Inequality - Spin correlation
January 8, 015 Lecture IV 1.1.1 Bell Inequality - Spin correlation Consider the final spin singlet state of the decay η 0 µ + µ We suppose that the η 0 decays and the muon and µ + travel in opposite directions,
More informationUnitary Dynamics and Quantum Circuits
qitd323 Unitary Dynamics and Quantum Circuits Robert B. Griffiths Version of 20 January 2014 Contents 1 Unitary Dynamics 1 1.1 Time development operator T.................................... 1 1.2 Particular
More informationBell s inequalities and their uses
The Quantum Theory of Information and Computation http://www.comlab.ox.ac.uk/activities/quantum/course/ Bell s inequalities and their uses Mark Williamson mark.williamson@wofson.ox.ac.uk 10.06.10 Aims
More informationQuantum Measurement and Bell s Theorem
Chapter 7 Quantum Measurement and Bell s Theorem The combination of the facts that there is a probability amplitude that superimposes states a from adding of all paths, a wavelike property, and the interactions
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 informationQuantum 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
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 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 informationLecture 3. QUANTUM MECHANICS FOR SINGLE QUBIT SYSTEMS 1. Vectors and Operators in Quantum State Space
Lecture 3. QUANTUM MECHANICS FOR SINGLE QUBIT SYSTEMS 1. Vectors and Operators in Quantum State Space The principles of quantum mechanics and their application to the description of single and multiple
More informationSeminar 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
More informationLogical 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
More informationQuantum Entanglement and Cryptography. Deepthi Gopal, Caltech
+ Quantum Entanglement and Cryptography Deepthi Gopal, Caltech + Cryptography Concisely: to make information unreadable by anyone other than the intended recipient. The sender of a message scrambles/encrypts
More informationQuantum Computing 101. ( Everything you wanted to know about quantum computers but were afraid to ask. )
Quantum Computing 101 ( Everything you wanted to know about quantum computers but were afraid to ask. ) Copyright Chris Lomont, 2004 2 67 1 = 193707721 761838257287 Took American Mathematician Frank Nelson
More information226 My God, He Plays Dice! Entanglement. Chapter This chapter on the web informationphilosopher.com/problems/entanglement
226 My God, He Plays Dice! Entanglement Chapter 29 20 This chapter on the web informationphilosopher.com/problems/entanglement Entanglement 227 Entanglement Entanglement is a mysterious quantum phenomenon
More informationQuantum 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
More informationInterference, vector spaces
Interference, vector spaces Sourendu Gupta TIFR Graduate School Quantum Mechanics 1 August 6, 2008 Sourendu Gupta (TIFR Graduate School) Interference, vector spaces QM I 1 / 16 Outline 1 The double-slit
More informationBell s Theorem. Ben Dribus. June 8, Louisiana State University
Bell s Theorem Ben Dribus Louisiana State University June 8, 2012 Introduction. Quantum Theory makes predictions that challenge intuitive notions of physical reality. Einstein and others were sufficiently
More information2. Introduction to quantum mechanics
2. Introduction to quantum mechanics 2.1 Linear algebra Dirac notation Complex conjugate Vector/ket Dual vector/bra Inner product/bracket Tensor product Complex conj. matrix Transpose of matrix Hermitian
More information5. Communication resources
5. Communication resources Classical channel Quantum channel Entanglement How does the state evolve under LOCC? Properties of maximally entangled states Bell basis Quantum dense coding Quantum teleportation
More informationIntroduction into Quantum Computations Alexei Ashikhmin Bell Labs
Introduction into Quantum Computations Alexei Ashikhmin Bell Labs Workshop on Quantum Computing and its Application March 16, 2017 Qubits Unitary transformations Quantum Circuits Quantum Measurements Quantum
More informationVector Spaces in Quantum Mechanics
Chapter 8 Vector Spaces in Quantum Mechanics We have seen in the previous Chapter that there is a sense in which the state of a quantum system can be thought of as being made up of other possible states.
More informationPHYSICS 304 QUANTUM PHYSICS II (2005) Assignment 1 Solutions
PHYSICS 04 QUANTUM PHYSICS II 200 Assignment Solutions. The general state of a spin half particle with spin component S n = S n = be shown to be given by 2 h can S n = 2 h = cos 2 θ S z = 2 h + eiφ sin
More information