Quantum Coherence and Quantum Entanglement

Slides:



Advertisements
Similar presentations
CS 450: COMPUTER GRAPHICS LINEAR ALGEBRA REVIEW SPRING 2015 DR. MICHAEL J. REALE.
Advertisements

Linear Algebra Applications in Matlab ME 303. Special Characters and Matlab Functions.
Transformations We want to be able to make changes to the image larger/smaller rotate move This can be efficiently achieved through mathematical operations.
1cs542g-term High Dimensional Data  So far we’ve considered scalar data values f i (or interpolated/approximated each component of vector values.
Chapter 5 Orthogonality
Information Retrieval in Text Part III Reference: Michael W. Berry and Murray Browne. Understanding Search Engines: Mathematical Modeling and Text Retrieval.
The Terms that You Have to Know! Basis, Linear independent, Orthogonal Column space, Row space, Rank Linear combination Linear transformation Inner product.
CSci 6971: Image Registration Lecture 2: Vectors and Matrices January 16, 2004 Prof. Chuck Stewart, RPI Dr. Luis Ibanez, Kitware Prof. Chuck Stewart, RPI.
Orthogonality and Least Squares
6 6.3 © 2012 Pearson Education, Inc. Orthogonality and Least Squares ORTHOGONAL PROJECTIONS.
Orthogonal Sets (12/2/05) Recall that “orthogonal” matches the geometric idea of “perpendicular”. Definition. A set of vectors u 1,u 2,…,u p in R n is.
Dirac Notation and Spectral decomposition
1cs542g-term Notes  Extra class next week (Oct 12, not this Friday)  To submit your assignment: me the URL of a page containing (links to)
T he Separability Problem and its Variants in Quantum Entanglement Theory Nathaniel Johnston Institute for Quantum Computing University of Waterloo.
Matrices CS485/685 Computer Vision Dr. George Bebis.
राघव वर्मा Inner Product Spaces Physical properties of vectors  aka length and angles in case of arrows Lets use the dot product Length of Cosine of the.
Length and Dot Product in R n Notes: is called a unit vector. Notes: The length of a vector is also called its norm. Chapter 5 Inner Product Spaces.
Physics “Advanced Electronic Structure” Pseudopotentials Contents: 1. Plane Wave Representation 2. Solution for Weak Periodic Potential 3. Solution.
Linear Algebra Review 1 CS479/679 Pattern Recognition Dr. George Bebis.
1 February 24 Matrices 3.2 Matrices; Row reduction Standard form of a set of linear equations: Chapter 3 Linear Algebra Matrix of coefficients: Augmented.
CHAPTER FIVE Orthogonality Why orthogonal? Least square problem Accuracy of Numerical computation.
Digital Image Processing, 3rd ed. © 1992–2008 R. C. Gonzalez & R. E. Woods Gonzalez & Woods Matrices and Vectors Objective.
AN ORTHOGONAL PROJECTION
1 Chapter 5 – Orthogonality and Least Squares Outline 5.1 Orthonormal Bases and Orthogonal Projections 5.2 Gram-Schmidt Process and QR Factorization 5.3.
ME451 Kinematics and Dynamics of Machine Systems Review of Linear Algebra 2.1, 2.2, 2.3 September 06, 2013 Radu Serban University of Wisconsin-Madison.
Orthogonalization via Deflation By Achiya Dax Hydrological Service Jerusalem, Israel
Elementary Linear Algebra Anton & Rorres, 9th Edition
A Note on Rectangular Quotients By Achiya Dax Hydrological Service Jerusalem, Israel
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
Absolute Separability and the Possible Spectra of Entanglement Witnesses Nathaniel Johnston — joint work with S. Arunachalam and V. Russo Mount Allison.
1 Chapter 7 Numerical Methods for the Solution of Systems of Equations.
Instructor: Mircea Nicolescu Lecture 8 CS 485 / 685 Computer Vision.
6 6.3 © 2016 Pearson Education, Inc. Orthogonality and Least Squares ORTHOGONAL PROJECTIONS.
Chapter 61 Chapter 7 Review of Matrix Methods Including: Eigen Vectors, Eigen Values, Principle Components, Singular Value Decomposition.
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
1 SYSTEM OF LINEAR EQUATIONS BASE OF VECTOR SPACE.
EE611 Deterministic Systems Vector Spaces and Basis Changes Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
CSE 554 Lecture 8: Alignment
Quantifying quantum coherence
Singular Value Decomposition and its applications
MAT 322: LINEAR ALGEBRA.
Twirling states to simplify separability
CS479/679 Pattern Recognition Dr. George Bebis
Elementary Linear Algebra Anton & Rorres, 9th Edition
Chapter 7 Matrix Mathematics
Non-additive Security Games
Matrices and Vectors Review Objective
Math 200 Week 2 - Monday Cross Product.
Lecture 03: Linear Algebra
Quantum One.
Background: Lattices and the Learning-with-Errors problem
LSI, SVD and Data Management
Quantum Two.
Lecture on Linear Algebra
CS485/685 Computer Vision Dr. George Bebis
Derivative of scalar forms
Quantum One.
Chapter 3 Linear Algebra
Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors.
Support Vector Machines
Rank-Sparsity Incoherence for Matrix Decomposition
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 – 14, Tuesday 8th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR)
Elementary Linear Algebra Anton & Rorres, 9th Edition
Quantum Foundations Lecture 3
Linear Algebra Lecture 41.
Equations …. are mathematical sentences stating that two expressions are equivalent.
DETERMINANT MATH 80 - Linear Algebra.
The Elements of Linear Algebra
Subject :- Applied Mathematics
Computational approaches for quantum many-body systems
Presentation transcript:

Quantum Coherence and Quantum Entanglement Nathaniel Johnston – with Jianxin Chen, Shane Grogan, Chi-Kwong Li, and Sarah Plosker Mount Allison University Sackville, New Brunswick, Canada

Overview What is Quantum Coherence? How do we Measure Coherence? What is Quantum Entanglement? Measuring Entanglement via Coherence

Overview What is Quantum Coherence? How do we Measure Coherence? Physics: How “useful” a quantum state is (superpositions) Math: Linear combinations of vectors How do we Measure Coherence? What is Quantum Entanglement? Measuring Entanglement via Coherence

What is Quantum Coherence? Pure quantum state: with i.e., with Dual (row) vector: Inner product:

What is Quantum Coherence? A pure quantum state is “useless” if it is a standard basis vector: The farther a state is from these basis states, the more “useful” it is. close to (1,0)T – only a little “useful” far away from (1,0)T and (0,1)T – “most useful” state

What is Quantum Coherence? Mixed quantum state: Trace 1 Positive semidefinite equivalent Pure state (again): Rank 1 Trace 1 Positive semidefinite equivalent

What is Quantum Coherence? A mixed quantum state is “useless” if it is diagonal: Each of these pure states are “useless”, so the mixed state is too. The farther a state is from diagonal, the more “useful” it is. off-diagonal entries are small – only a little “useful” far from diagonal – “most useful” state

Overview What is Quantum Coherence? How do we Measure Coherence? Many different methods have been proposed Different methods useful in different contexts What is Quantum Entanglement? Measuring Entanglement via Coherence

Measuring Coherence Several ways of measuring coherence have been proposed. Method 1: The ℓ1-norm Just add up all of the off-diagonal entries of the mixed state ρ: “C” stands for “coherence”, and the “ℓ1” refers to how much this looks like the 1-norm of a vector Trivial to compute. Okay-ish physical properties.

Measuring Coherence Some nice mathematical properties include: Reminder: The ℓ1-norm of coherence is Some nice mathematical properties include: A simple formula when restricted to pure states: is maximized exactly when

Measuring Coherence How far (geometrically) is ρ from a useless state? Method 2: Trace Distance How far (geometrically) is ρ from a useless state? “C” stands for “coherence”, and the “tr” refers to the trace norm, which is typically the “right” norm to use on quantum states trace norm is the sum of singular values Harder to compute. Geometrically nice, physically maybe not. Can be computed efficiently via semidefinite programming, but no analytic formula is known.

Measuring Coherence Reminder: The trace distance of coherence is Much less is known about this measure. For example… Formula on pure states? Well, If then What states give the largest value? formula for the ℓ1-norm of coherence

Measuring Coherence We derive an “almost” formula for We give m different formulas, and determining the correct one is done by checking log2(m) inequalities. Each formula is nasty-looking, but simple to compute. Let’s get started…

Measuring Coherence Step 0: assume WLOG that each vi is real and v1 ≥ v2 ≥ … ≥ vm ≥ 0. Step 1: for ℓ = 1, 2, …, m, compute: Step 2: find the largest index k such that vk ≥ qk. Step 3: This can be done via binary search in log2(m) steps. Yay! Done!

Measuring Coherence Some notes are in order: Our method also tells us how to construct the (unique) closest diagonal state D such that Even though our method is not an explicit formula, it’s fast: Known SDP methods: 1.5 minutes for Our method: 0.5 seconds for formula for D is also ugly

Measuring Coherence Our method is also useful analytically, and has several straightforward corollaries: is maximized exactly when Easy to compute exact value of , whereas SDP methods just give a numerical approximation. In the m = 2 case, our method simplifies to an explicit formula: same condition as for the ℓ1-norm of coherence was already known, but follows easily in just two lines from our work

Measuring Coherence Methods 3+: Other Measures There are also numerous other proposed methods for measuring coherence, such as… …and many others.

Overview What is Quantum Coherence? How do we Measure Coherence? What is Quantum Entanglement? Physics: How “useful” a quantum state is (again) Math: Some matrices can have rank larger than 1 Measuring Entanglement via Coherence

What is Quantum Entanglement? A pure state is separable if it has the form Otherwise, it is called entangled. for some A mixed state is separable if it has the form Otherwise, it is called entangled. for some

Measuring Entanglement Again, we think of separable states as “useless”, and the farther a state is from the set of separable states, the more “useful” it is. How do we quantify this? Method 1: Trace Distance How far (geometrically) is ρ from a useless state? “E” stands for “entanglement” trace norm is the sum of singular values Very hard to compute No formula, semidefinite program, or any other reasonable computational method known

Overview What is Quantum Coherence? How do we Measure Coherence? What is Quantum Entanglement? Measuring Entanglement via Coherence Strong link between measures of entanglement and coherence Can use coherence results to solve entanglement problems

Entanglement via Coherence Measures of entanglement are hard to compute. However, coherence can help us for pure states. Recall the Schmidt decomposition − we can write every in the form: Where are orthonormal sets and are non-negative scalars called the Schmidt coefficients of

Entanglement via Coherence Theorem Let be a pure state with Schmidt coefficients , and define . Then Now we can quickly compute on pure states! Neat! The entanglement of a pure state equals the coherence of its Schmidt coefficients. (just leech off of our method of computing the trace distance of coherence)

Entanglement via Coherence The same result works for pretty much any “good” measure of entanglement: when restricted to pure states, entanglement measures are coherence measures. For example… The cross norm of entanglement (or projective tensor norm): reduces to the ℓ1-norm of coherence on pure states. The robustness of entanglement: reduces to the robustness of coherence on pure states.

Quantum Coherence/Entanglement Thanks for your attention! J. Chen, S. Grogan, N. J., C.-K. Li, S. Plosker. Quantifying the coherence of pure quantum states. Physical Review A 94:042313, 2016. E-print: arXiv:1601.06269 [quant-ph]