Quantum state discrimination with post-measurement information!
|
|
- Peregrine Rodgers
- 6 years ago
- Views:
Transcription
1 Quantum state discrimination with post-measurement information! DEEPTHI GOPAL, CALTECH! STEPHANIE WEHNER, NATIONAL UNIVERSITY OF SINGAPORE!
2 Quantum states! A state is a mathematical object describing the parameters of a system.! If some experimental procedure prepares a system, the state describes the initial conditions.! Classically: observable dynamical variables. Quantum: normalised vector.! We cannot directly determine the state of a quantum system. However, it is often possible to gain partial information.! Thus, guessing the state of a system is the problem of state discrimination.!
3 Measurement In the context of quantum information, we consider the Positive Operator-Valued Measure (a general formulation of a measurement). Effectively: a set of Hermitian, positive semidefinite operators that together sum to the identity. This is a generalisation of the more familiar von Neumann measurement scheme. (Recall the decomposition of a Hilbert space into orthogonal projectors.) It can be shown that there are cases for which using the simpler projective measurement is insufficient.
4 Quantum state discrimination! As a simple game between two people:" Alice chooses a state for the system from a finite set of states.! She gives the system to Bob. He has to guess its state.! Bob knows the possible states with associated probabilities.! Bob performs some measurement, then makes a guess.! x! Alice! Bob! guess x! pick x! measurement!
5 Quantum state discrimination problems! A more formal description of the problem follows:! We are given a state i chosen from a finite set of states { 1, 2 n } with probabilities {p 1, p 2 p n }. To guess i, we measure the state. If the outcome is j, our guess is j. Consider a positive operator-valued measurement M, whose measurement operators M j (corresponding to j ) satisfy: M j 0 j M j = I The probability p k i that, for input i, the outcome is k, is Tr[M k i ]. Averaged probability of success: j p j Tr[M k i ]. We would like to maximise this!
6 Semidefinite programming This is a special case of convex optimisation. In terms of some variable X S n (where S n is the set of symmetric n x n matrices): maximize Tr[ C X ] subject to Tr[ A i X ] = b i, i = 1,..., p, and X 0 We solve this using Lagrangian duality: intuitively, we want to extend the objective function with a weighted sum of the constraints. Then, weights = dual variables; it is often then simple to optimise over the dual. This is useful later! (And can generally be solved in polynomial time.)
7 Semidefinite programming It is worth noting that in semidefinite program form, the usual case of state discrimination described above can schematically be written as (with N being probability/ normalisation): Maximise (N) x Tr[ x M x ] Subject to M x 0 x M x = I
8 Post-measurement information We address a state discrimination problem in which after the measurement, we are given extra information about the state. Extending the game described earlier: Bob is sent a state xy ; after measurement, Bob is given y.! x is taken from some set X which we call the input. y is taken from Y, the encoding. xy! Alice! Bob! guess x! pick x, y! measurement! y!
9 Post-measurement information A (simple!) classical example in which post-measurement information is relevant: x {0,1} is a classical bit; we have only one encoding, b {0,1}. Alice chooses x and b at random, sending Bob the bit x b = (x + b) mod 2. Bob therefore has a randomly chosen bit in his possession; without any information on the value of b, his probability of success is only ½. If he is given additionally the value of b, he can always correctly determine the value of x. In quantum situations, as before, we expect Bob to use a measurement, and it would be nice to determine the optimal one.
10 Post-measurement information It is possible for post-measurement information to be useless: if being given y does not increase the probability that we guess x correctly. When is it useful? It s possible to derive an absolute condition in two dimensions, and some information in higher dimensions. The obvious way to quantify this is by measuring the difference in success probability with and without PI. In fact, classically it is always useful (intuitively we can convince ourselves of this with the previous example).
11 Post-measurement information We would like more information about possible optimal measurements. (For now, we ll work with both x and y taking values 0 or 1.) Let s quickly derive an optimality condition: For convenience, let s write b 00 = , b 01 = , and so on. Then, our problem can be written as the semidefinite program Maximise xy Tr[b xy M xy ] (this is the success probability!) Subject to M xy 0, xy M xy = I (simply from definition) We solve by setting the optimal solution d* of the dual equal to the optimal solution p* of the primal. Solving, we obtain optimality conditions: b 00 M 0 + b 11 M 1 is Hermitian; b 00 M 0 + b 11 M 1 b ij
12 Two-dimensional case With two basis states, it is possible to cleanly represent states as vectors on the Bloch sphere.
13 Two-dimensional case It s in fact helpful here to briefly reduce our case to one without post-measurement information, so that we can write down the optimal measurement. Knowing this will tell us whether post-measurement information is useful! We can use * 0 = ½( ), * 1 = ½( ) this effectively removes the encoding from consideration. Previous results in the field (Helstrom 1976) tell us that projectors on the positive and negative eigenspace of * 0 - * 1 are the optimal measurement in this case.
14 Two-dimensional case If is the vector of the Pauli matrices, then it is possible for us to write in the form 00 = ½ (I + v 0. ), and so on. Note here that v 0 also represents the state on the Bloch sphere! Then we can show in this form that the optimal measurement to distinguish between * 0 and * 1 is given by: M 0 = ½ (I + m 0. ) M 1 = ½ (I + m 1. ) m 0 = - m 1 = (v 0 + v 1 ) / v 0 + v 1 This allows us to compare any result we describe for postmeasurement information to the success probability using these measurements.
15 Two-dimensional case To derive information about the post-measurement case, we recall the optimality condition for a measurement and retain the notation using Pauli matrices. b 00 = I + ½ (v 0 + v 1 ). and so on. Let s now suggest the measurement given as follows: M 00 = M 0, M 11 = M 1, M 10 = M 01 = 0, where M 0, M 1 are the optimal measurements given for the case without post-measurement information. Thus xy b xy M xy (measurements * states) = I (1 + ½ v 0 + v 1 ). Now recall the measurement optimality condition; we check b 01 = I + ½ (v 0 - v 1 ), and note that for b 00 M 0 + b 11 M 1 b ij to be true, v 0 + v 1 v 0 - v 1, which is true when the angle between states is π/2.
16 Two-dimensional case We have therefore shown that the optimal measurement for a case in which the states form an angle π/2 is simply the optimal measurement for the case without post-measurement information. This implies that post-measurement information is useless for π/2. We can in fact fairly simply derive the optimal measurement for > π/2: M 0 = ½ (I + m 0. ) M 1 = ½ (I + m 1. ) m 0 = - m 1 = (v 0 - v 1 ) / v 0 + v 1 M 01 = M 0, M 10 = M 1, M 11 = M 00 = 0
17 Two-dimensional case ρ 00 ρ 01 ρ 11 ρ 10 θ Post-measurement information is useless if the angle is less than π/2. The dashed line corresponds to the measurement we would expect using standard state discrimination; it represents the attempt to distinguish from , and thus we output the same bit irrespective of encoding information.
18 Two-dimensional case ρ 00 ρ 01 θ ρ 11 ρ 10 Post-measurement information is useful if the angle is greater than π/2. The dashed line corresponds to the measurement we derived using postmeasurement information; it represents the attempt to distinguish from , and our output depends on the postmeasurement information received by us.
19 Three or more states What about larger problems? Unfortunately, our Bloch sphere simplification is no longer so simple. Let s look at an example, in which there are three possible input states with two encodings. (This is mathematically simpler! We will attempt to generalise.) Considering the case of state discrimination without post-measurement information, we can slightly modify the semidefinite program: instead of requiring x M x = I, we require only x M x = ci, for some c.
20 Three or more states The optimal measurement operators in our new case can be quite simply shown to be c. the optimal measurement operators in the previous case. Then, we add in post-measurement information; and write: x 1 x 2 Tr[b x1 x 2 M x1 x 2 ]=p PI 1 Maximise 6 Subject to M x1 x 2 0 x 1 x 2 M x1 x 2 I
21 Three or more states In order to solve this, we simply split our problem into three separate subcases. (A partition was chosen at random.) Maximise 1 6 Subject to x Tr[b xxm (1) x M (1) x x ]=p 1 I Maximise 1 6 Subject to x Tr[b x(x+1)m (2) x M (2) x x ]=p 2 I Maximise 1 6 Subject to x Tr[b (x+1)xm (3) x M (3) x x ]=p 3 I
22 Three or more states Using our generalisation of the state-discrimination SDP, and noting that M xx c 1 I x x x M x(x+1) M (x+1)x c 2 I it is quite simple to show that the success probability with post-measurement information is bounded by the largest of the success probabilities of our three subcases. Thus, the optimal measurement with post-measurement information is the optimal measurement for some case selected from an even partition of the states in the problem. c 3 I
23 Three or more states We can in fact show that the previous case can be extended to an arbitrary number of states, with certain (fairly intuitive!) restrictions on the partitions chosen. It would be exciting to have a sharper bound! It would also be interesting to know how well certain generic measurements perform in this case. An example is the pretty good measurement, or square-root measurement, which is a measurement weighted by the square root of the probability associated with each state. It is, in fact, generally pretty good.
Lecture 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 informationIntroduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871
Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 9 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca http://math.uwaterloo.ca/~jyard/qic710 1 More state distinguishing
More informationIntroduction to Quantum Information Hermann Kampermann
Introduction to Quantum Information Hermann Kampermann Heinrich-Heine-Universität Düsseldorf Theoretische Physik III Summer school Bleubeuren July 014 Contents 1 Quantum Mechanics...........................
More informationIntroduction to quantum information processing
Introduction to quantum information processing Measurements and quantum probability Brad Lackey 25 October 2016 MEASUREMENTS AND QUANTUM PROBABILITY 1 of 22 OUTLINE 1 Probability 2 Density Operators 3
More informationMassachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms Friday, March 18, 2016 Ankur Moitra. Problem Set 6
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms Friday, March 18, 2016 Ankur Moitra Problem Set 6 Due: Wednesday, April 6, 2016 7 pm Dropbox Outside Stata G5 Collaboration policy:
More informationCS286.2 Lecture 15: Tsirelson s characterization of XOR games
CS86. Lecture 5: Tsirelson s characterization of XOR games Scribe: Zeyu Guo We first recall the notion of quantum multi-player games: a quantum k-player game involves a verifier V and k players P,...,
More informationCompression and entanglement, entanglement transformations
PHYSICS 491: Symmetry and Quantum Information April 27, 2017 Compression and entanglement, entanglement transformations Lecture 8 Michael Walter, Stanford University These lecture notes are not proof-read
More informationAQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013
AQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013 Lecturer: Dr. Mark Tame Introduction With the emergence of new types of information, in this case
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 informationIntroduction to Quantum Computing
Introduction to Quantum Computing Petros Wallden Lecture 3: Basic Quantum Mechanics 26th September 2016 School of Informatics, University of Edinburgh Resources 1. Quantum Computation and Quantum Information
More informationLecture 8: Semidefinite programs for fidelity and optimal measurements
CS 766/QIC 80 Theory of Quantum Information (Fall 0) Lecture 8: Semidefinite programs for fidelity and optimal measurements This lecture is devoted to two examples of semidefinite programs: one is for
More informationLecture notes for quantum semidefinite programming (SDP) solvers
CMSC 657, Intro to Quantum Information Processing Lecture on November 15 and 0, 018 Fall 018, University of Maryland Prepared by Tongyang Li, Xiaodi Wu Lecture notes for quantum semidefinite programming
More informationCS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games
CS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games Scribe: Zeyu Guo In the first lecture, we saw three equivalent variants of the classical PCP theorems in terms of CSP, proof checking,
More informationThe Adaptive Classical Capacity of a Quantum Channel,
The Adaptive Classical Capacity of a Quantum Channel, or Information Capacities of Three Symmetric Pure States in Three Dimensions Peter W. Shor 1 AT&T Labs Research Florham Park, NJ 07932 02139 1 Current
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 informationCS/Ph120 Homework 8 Solutions
CS/Ph0 Homework 8 Solutions December, 06 Problem : Thinking adversarially. Solution: (Due to De Huang) Attack to portocol : Assume that Eve has a quantum machine that can store arbitrary amount of quantum
More informationEntanglement Measures and Monotones
Entanglement Measures and Monotones PHYS 500 - Southern Illinois University March 30, 2017 PHYS 500 - Southern Illinois University Entanglement Measures and Monotones March 30, 2017 1 / 11 Quantifying
More information22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationWhy does nature like the square root of negative one? William K. Wootters Williams College
Why does nature like the square root of negative one? William K. Wootters Williams College A simple quantum experiment Computing probabilities in a sensible way (½)(½)+(½)(½) = ½ ½ ½ Computing probabilities
More informationChapter 2 The Density Matrix
Chapter 2 The Density Matrix We are going to require a more general description of a quantum state than that given by a state vector. The density matrix provides such a description. Its use is required
More informationIntroduction to Quantum Mechanics
Introduction to Quantum Mechanics R. J. Renka Department of Computer Science & Engineering University of North Texas 03/19/2018 Postulates of Quantum Mechanics The postulates (axioms) of quantum mechanics
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 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 informationLecture 18: Quantum Information Theory and Holevo s Bound
Quantum Computation (CMU 1-59BB, Fall 2015) Lecture 1: Quantum Information Theory and Holevo s Bound November 10, 2015 Lecturer: John Wright Scribe: Nicolas Resch 1 Question In today s lecture, we will
More informationLecture 11: Quantum Information III - Source Coding
CSCI5370 Quantum Computing November 25, 203 Lecture : Quantum Information III - Source Coding Lecturer: Shengyu Zhang Scribe: Hing Yin Tsang. Holevo s bound Suppose Alice has an information source X that
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 informationChapter 5. Density matrix formalism
Chapter 5 Density matrix formalism In chap we formulated quantum mechanics for isolated systems. In practice systems interect with their environnement and we need a description that takes this feature
More information1. Basic rules of quantum mechanics
1. Basic rules of quantum mechanics How to describe the states of an ideally controlled system? How to describe changes in an ideally controlled system? How to describe measurements on an ideally controlled
More information15-251: Great Theoretical Ideas In Computer Science Recitation 9 : Randomized Algorithms and Communication Complexity Solutions
15-251: Great Theoretical Ideas In Computer Science Recitation 9 : Randomized Algorithms and Communication Complexity Solutions Definitions We say a (deterministic) protocol P computes f if (x, y) {0,
More informationLecture 20: Bell inequalities and nonlocality
CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 0: Bell inequalities and nonlocality April 4, 006 So far in the course we have considered uses for quantum information in the
More informationAsymptotic Pure State Transformations
Asymptotic Pure State Transformations PHYS 500 - Southern Illinois University April 18, 2017 PHYS 500 - Southern Illinois University Asymptotic Pure State Transformations April 18, 2017 1 / 15 Entanglement
More informationRepeated Eigenvalues and Symmetric Matrices
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationSDP Relaxations for MAXCUT
SDP Relaxations for MAXCUT from Random Hyperplanes to Sum-of-Squares Certificates CATS @ UMD March 3, 2017 Ahmed Abdelkader MAXCUT SDP SOS March 3, 2017 1 / 27 Overview 1 MAXCUT, Hardness and UGC 2 LP
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 informationLecture Notes. edx Quantum Cryptography: Week 3
Lecture Notes edx Quantum Cryptography: Week 3 This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International Licence. Contents 3.1 When are two quantum states almost
More informationCS/Ph120 Homework 1 Solutions
CS/Ph0 Homework Solutions October, 06 Problem : State discrimination Suppose you are given two distinct states of a single qubit, ψ and ψ. a) Argue that if there is a ϕ such that ψ = e iϕ ψ then no measurement
More informationarxiv: v1 [quant-ph] 3 Jan 2008
A paradigm for entanglement theory based on quantum communication Jonathan Oppenheim 1 1 Department of Applied Mathematics and Theoretical Physics, University of Cambridge U.K. arxiv:0801.0458v1 [quant-ph]
More informationGrothendieck s Inequality
Grothendieck s Inequality Leqi Zhu 1 Introduction Let A = (A ij ) R m n be an m n matrix. Then A defines a linear operator between normed spaces (R m, p ) and (R n, q ), for 1 p, q. The (p q)-norm of A
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 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 Nonlocality Pt. 4: More on the CHSH Inequality
Quantum Nonlocality Pt. 4: More on the CHSH Inequality PHYS 500 - Southern Illinois University May 4, 2017 PHYS 500 - Southern Illinois University Quantum Nonlocality Pt. 4: More on the CHSH Inequality
More informationBy allowing randomization in the verification process, we obtain a class known as MA.
Lecture 2 Tel Aviv University, Spring 2006 Quantum Computation Witness-preserving Amplification of QMA Lecturer: Oded Regev Scribe: N. Aharon In the previous class, we have defined the class QMA, which
More informationQuantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras
Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras Lecture - 4 Postulates of Quantum Mechanics I In today s lecture I will essentially be talking
More informationarxiv: v2 [quant-ph] 21 Oct 2013
Genuine hidden quantum nonlocality Flavien Hirsch, 1 Marco Túlio Quintino, 1 Joseph Bowles, 1 and Nicolas Brunner 1, 1 Département de Physique Théorique, Université de Genève, 111 Genève, Switzerland H.H.
More informationEnsembles and incomplete information
p. 1/32 Ensembles and incomplete information So far in this course, we have described quantum systems by states that are normalized vectors in a complex Hilbert space. This works so long as (a) the system
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 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 informationCS120, Quantum Cryptography, Fall 2016
CS10, Quantum Cryptography, Fall 016 Homework # due: 10:9AM, October 18th, 016 Ground rules: Your homework should be submitted to the marked bins that will be by Annenberg 41. Please format your solutions
More information1 Quantum states and von Neumann entropy
Lecture 9: Quantum entropy maximization CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: February 15, 2016 1 Quantum states and von Neumann entropy Recall that S sym n n
More information6.1 Main properties of Shannon entropy. Let X be a random variable taking values x in some alphabet with probabilities.
Chapter 6 Quantum entropy There is a notion of entropy which quantifies the amount of uncertainty contained in an ensemble of Qbits. This is the von Neumann entropy that we introduce in this chapter. In
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 informationLecture 14: Quantum information revisited
CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 4: Quantum information revisited March 4, 006 So far, this course has focused almost entirely on quantum algorithms The next
More information8 Approximation Algorithms and Max-Cut
8 Approximation Algorithms and Max-Cut 8. The Max-Cut problem Unless the widely believed P N P conjecture is false, there is no polynomial algorithm that can solve all instances of an NP-hard problem.
More informationLogic: The Big Picture
Logic: The Big Picture A typical logic is described in terms of syntax: what are the legitimate formulas semantics: under what circumstances is a formula true proof theory/ axiomatization: rules for proving
More informationQuantum Data Compression
PHYS 476Q: An Introduction to Entanglement Theory (Spring 2018) Eric Chitambar Quantum Data Compression With the basic foundation of quantum mechanics in hand, we can now explore different applications.
More informationLecture 3: Semidefinite Programming
Lecture 3: Semidefinite Programming Lecture Outline Part I: Semidefinite programming, examples, canonical form, and duality Part II: Strong Duality Failure Examples Part III: Conditions for strong duality
More informationFidelity and trace norm
Fidelity and trace norm In this lecture we will see two simple examples of semidefinite programs for quantities that are interesting in the theory of quantum information: the first is the trace norm of
More informationLecture Notes. Quantum Cryptography Week 2: The Power of Entanglement
Lecture Notes Quantum Cryptography Week : The Power of Entanglement This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International Licence. Contents.1 Entanglement
More informationQuantum theory without predefined causal structure
Quantum theory without predefined causal structure Ognyan Oreshkov Centre for Quantum Information and Communication, niversité Libre de Bruxelles Based on work with Caslav Brukner, Nicolas Cerf, Fabio
More informationComputational Algebraic Topology Topic B Lecture III: Quantum Realizability
Computational Algebraic Topology Topic B Lecture III: Quantum Realizability Samson Abramsky Department of Computer Science The University of Oxford Samson Abramsky (Department of Computer ScienceThe Computational
More informationQuantum sampling of mixed states
Quantum sampling of mixed states Philippe Lamontagne January 7th Philippe Lamontagne Quantum sampling of mixed states January 7th 1 / 9 The setup Philippe Lamontagne Quantum sampling of mixed states January
More informationMIT Algebraic techniques and semidefinite optimization February 14, Lecture 3
MI 6.97 Algebraic techniques and semidefinite optimization February 4, 6 Lecture 3 Lecturer: Pablo A. Parrilo Scribe: Pablo A. Parrilo In this lecture, we will discuss one of the most important applications
More informationQuantum Noise. Michael A. Nielsen. University of Queensland
Quantum Noise Michael A. Nielsen University of Queensland Goals: 1. To introduce a tool the density matrix that is used to describe noise in quantum systems, and to give some examples. Density matrices
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 21: HSP via the Pretty Good Measurement
Quantum Computation (CMU 5-859BB, Fall 205) Lecture 2: HSP via the Pretty Good Measurement November 8, 205 Lecturer: John Wright Scribe: Joshua Brakensiek The Average-Case Model Recall from Lecture 20
More informationInformation quantique, calcul quantique :
Séminaire LARIS, 8 juillet 2014. Information quantique, calcul quantique : des rudiments à la recherche (en 45min!). François Chapeau-Blondeau LARIS, Université d Angers, France. 1/25 Motivations pour
More informationKapitza Fall 2017 NOISY QUANTUM MEASUREMENT
Kapitza Fall 2017 NOIY QUANTUM MEAUREMENT Ben altzman Q.I.T. TERM PAPER Professor arada Raeev December 10 th 2017 1 Introduction Not only does God play dice but... where they can t be seen. he sometimes
More informationconventions and notation
Ph95a lecture notes, //0 The Bloch Equations A quick review of spin- conventions and notation The quantum state of a spin- particle is represented by a vector in a two-dimensional complex Hilbert space
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 informationEntanglement Manipulation
Entanglement Manipulation Steven T. Flammia 1 1 Perimeter Institute for Theoretical Physics, Waterloo, Ontario, N2L 2Y5 Canada (Dated: 22 March 2010) These are notes for my RIT tutorial lecture at the
More informationDirect product theorem for discrepancy
Direct product theorem for discrepancy Troy Lee Rutgers University Joint work with: Robert Špalek Direct product theorems Knowing how to compute f, how can you compute f f f? Obvious upper bounds: If can
More informationQuantum state discrimination and selected applications
Journal of Physics: Conference Series Quantum state discrimination and selected applications To cite this article: János A Bergou 2007 J. Phys.: Conf. Ser. 84 012001 View the article online for updates
More informationShort proofs of the Quantum Substate Theorem
Short proofs of the Quantum Substate Theorem Rahul Jain CQT and NUS, Singapore Ashwin Nayak University of Waterloo Classic problem Given a biased coin c Pr(c = H) = 1 - e Pr(c = T) = e Can we generate
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 informationEstimating entanglement in a class of N-qudit states
Estimating entanglement in a class of N-qudit states Sumiyoshi Abe 1,2,3 1 Physics Division, College of Information Science and Engineering, Huaqiao University, Xiamen 361021, China 2 Department of Physical
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 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 informationQuantum and non-signalling graph isomorphisms
Quantum and non-signalling graph isomorphisms Albert Atserias 1, Laura Mančinska 2, David E. Roberson 3, Robert Šámal4, Simone Severini 5, and Antonios Varvitsiotis 6 1 Universitat Politècnica de Catalunya,
More informationSUPPLEMENTARY INFORMATION
SUPPLEMENTARY INFORMATION doi:1.138/nature1366 I. SUPPLEMENTARY DISCUSSION A. Success criterion We shall derive a success criterion for quantum teleportation applicable to the imperfect, heralded dual-rail
More informationQuantum decoherence. Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, Quantum decoherence p. 1/2
Quantum decoherence p. 1/2 Quantum decoherence Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, 2007 Quantum decoherence p. 2/2 Outline Quantum decoherence: 1. Basics of quantum
More informationSecurity Proofs for Quantum Key Distribution Protocols by Numerical Approaches
Security Proofs for Quantum Key Distribution Protocols by Numerical Approaches by Jie Lin A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master
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 informationQuantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar
Quantum Computing Lecture 3 Principles of Quantum Mechanics Anuj Dawar What is Quantum Mechanics? Quantum Mechanics is a framework for the development of physical theories. It is not itself a physical
More informationGaussian processes. Chuong B. Do (updated by Honglak Lee) November 22, 2008
Gaussian processes Chuong B Do (updated by Honglak Lee) November 22, 2008 Many of the classical machine learning algorithms that we talked about during the first half of this course fit the following pattern:
More informationLecture 10. Semidefinite Programs and the Max-Cut Problem Max Cut
Lecture 10 Semidefinite Programs and the Max-Cut Problem In this class we will finally introduce the content from the second half of the course title, Semidefinite Programs We will first motivate the discussion
More informationMachine Learning 4771
Machine Learning 477 Instructor: Tony Jebara Topic 5 Generalization Guarantees VC-Dimension Nearest Neighbor Classification (infinite VC dimension) Structural Risk Minimization Support Vector Machines
More informationprinceton univ. F 13 cos 521: Advanced Algorithm Design Lecture 17: Duality and MinMax Theorem Lecturer: Sanjeev Arora
princeton univ F 13 cos 521: Advanced Algorithm Design Lecture 17: Duality and MinMax Theorem Lecturer: Sanjeev Arora Scribe: Today we first see LP duality, which will then be explored a bit more in the
More informationLecture 15 - Zero Knowledge Proofs
Lecture 15 - Zero Knowledge Proofs Boaz Barak November 21, 2007 Zero knowledge for 3-coloring. We gave a ZK proof for the language QR of (x, n) such that x QR n. We ll now give a ZK proof (due to Goldreich,
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 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 informationProbabilistic exact cloning and probabilistic no-signalling. Abstract
Probabilistic exact cloning and probabilistic no-signalling Arun Kumar Pati Quantum Optics and Information Group, SEECS, Dean Street, University of Wales, Bangor LL 57 IUT, UK (August 5, 999) Abstract
More informationWinter 2011 Josh Benaloh Brian LaMacchia
Winter 2011 Josh Benaloh Brian LaMacchia Fun with Public-Key Tonight we ll Introduce some basic tools of public-key crypto Combine the tools to create more powerful tools Lay the ground work for substantial
More informationDECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS
DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS SCOTT HOTTOVY Abstract. Quantum networks are used to transmit and process information by using the phenomena of quantum mechanics.
More informationCS264: Beyond Worst-Case Analysis Lecture #11: LP Decoding
CS264: Beyond Worst-Case Analysis Lecture #11: LP Decoding Tim Roughgarden October 29, 2014 1 Preamble This lecture covers our final subtopic within the exact and approximate recovery part of the course.
More informationSecond Order Reed-Muller Decoding Algorithm in Quantum Computing
Second Order Reed-Muller Decoding Algorithm in Quantum Computing Minji Kim June 2, 2011 1 Contents 1 Introduction 2 1.1 How to identify the order...................... 2 2 First order Reed Muller Code
More informationToday: Linear Programming (con t.)
Today: Linear Programming (con t.) COSC 581, Algorithms April 10, 2014 Many of these slides are adapted from several online sources Reading Assignments Today s class: Chapter 29.4 Reading assignment for
More informationThe Fundamental Insight
The Fundamental Insight We will begin with a review of matrix multiplication which is needed for the development of the fundamental insight A matrix is simply an array of numbers If a given array has m
More informationDensity Operators and Ensembles
qitd422 Density Operators and Ensembles Robert B. Griffiths Version of 30 January 2014 Contents 1 Density Operators 1 1.1 Introduction.............................................. 1 1.2 Partial trace..............................................
More informationMutual Information in Conformal Field Theories in Higher Dimensions
Mutual Information in Conformal Field Theories in Higher Dimensions John Cardy University of Oxford Conference on Mathematical Statistical Physics Kyoto 2013 arxiv:1304.7985; J. Phys. : Math. Theor. 46
More informationPhysics 239/139 Spring 2018 Assignment 2 Solutions
University of California at San Diego Department of Physics Prof. John McGreevy Physics 39/139 Spring 018 Assignment Solutions Due 1:30pm Monday, April 16, 018 1. Classical circuits brain-warmer. (a) Show
More information