Quantifying quantum coherence

Slides:



Advertisements
Similar presentations
Quantum Lower Bounds The Polynomial and Adversary Methods Scott Aaronson September 14, 2001 Prelim Exam Talk.
Advertisements

Transformations We want to be able to make changes to the image larger/smaller rotate move This can be efficiently achieved through mathematical operations.
Object Orie’d Data Analysis, Last Time Finished NCI 60 Data Started detailed look at PCA Reviewed linear algebra Today: More linear algebra Multivariate.
1cs542g-term Notes  In assignment 1, problem 2: smoothness = number of times differentiable.
1cs542g-term High Dimensional Data  So far we’ve considered scalar data values f i (or interpolated/approximated each component of vector values.
Sampling algorithms for l 2 regression and applications Michael W. Mahoney Yahoo Research (Joint work with P. Drineas.
Chapter 5 Orthogonality
Information Retrieval in Text Part III Reference: Michael W. Berry and Murray Browne. Understanding Search Engines: Mathematical Modeling and Text Retrieval.
Now Playing: My Mathematical Mind Spoon From Gimme Fiction Released May 10, 2005.
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.
Pablo A. Parrilo ETH Zürich Semialgebraic Relaxations and Semidefinite Programs Pablo A. Parrilo ETH Zürich control.ee.ethz.ch/~parrilo.
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 Linear functional Adjoint
Sequences Informally, a sequence is a set of elements written in a row. – This concept is represented in CS using one- dimensional arrays The goal of mathematics.
CHAPTER FIVE Orthogonality Why orthogonal? Least square problem Accuracy of Numerical computation.
TH EDITION Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 1 Equations and Inequalities Copyright © 2013, 2009, 2005 Pearson Education,
Representation of an arbitrary beam transfer matrix and solution of the beam matching problem using equally spaced thin-lens quadrupoles Sergey Orlov XFEL.
Information and Coding Theory Linear Block Codes. Basic definitions and some examples. Juris Viksna, 2015.
Simplex method (algebraic interpretation)
 What is Algebraic Expressions and how do I solve them?
AN ORTHOGONAL PROJECTION
Chapter 3 Solution of Algebraic Equations 1 ChE 401: Computational Techniques for Chemical Engineers Fall 2009/2010 DRAFT SLIDES.
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.
Rational Expressions – Sum & Difference 1 When fractions already have a common denominator, keep the denominator the same and add / subtract your numerators.
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
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 4. Least squares.
A Note on Rectangular Quotients By Achiya Dax Hydrological Service Jerusalem, Israel
1 Dorit Aharonov Hebrew Univ. & UC Berkeley Adiabatic Quantum Computation.
Support Vector Machines and Kernel Methods Machine Learning March 25, 2010.
E XACT MATRIX C OMPLETION VIA CONVEX OPTIMIZATION E MMANUEL J. C ANDES AND B ENJAMIN R ECHT M AY 2008 Presenter: Shujie Hou January, 28 th,2011 Department.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
Using Mental Math Subtraction. 2 This jacket costs $152. It is on sale for $17 off. Using mental math, how much will this jacket cost? $ $17 = ?
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.
By Josh Zimmer Department of Mathematics and Computer Science The set ℤ p = {0,1,...,p-1} forms a finite field. There are p ⁴ possible 2×2 matrices in.
Instructor: Mircea Nicolescu Lecture 8 CS 485 / 685 Computer Vision.
6 6.3 © 2016 Pearson Education, Inc. Orthogonality and Least Squares ORTHOGONAL PROJECTIONS.
C&O 355 Lecture 19 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A A A.
Mesh Segmentation via Spectral Embedding and Contour Analysis Speaker: Min Meng
The Matrix Equation A x = b (9/16/05) Definition. If A is an m  n matrix with columns a 1, a 2,…, a n and x is a vector in R n, then the product of A.
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
Singular Value Decomposition and its applications
Quantum Coherence and Quantum Entanglement
Twirling states to simplify separability
Hans Bodlaender, Marek Cygan and Stefan Kratsch
Using Mental Math Subtraction.
Polynomial Norms Amir Ali Ahmadi (Princeton University) Georgina Hall
Lecture 8:Eigenfaces and Shared Features
Fused Angles: A Representation of Body Orientation for Balance
Math 200 Week 2 - Monday Cross Product.
Quantum One.
Background: Lattices and the Learning-with-Errors problem
Copyright © Cengage Learning. All rights reserved.
SOS is not obviously automatizable,
Sparse and Redundant Representations and Their Applications in
Where did we stop? The Bayes decision rule guarantees an optimal classification… … But it requires the knowledge of P(ci|x) (or p(x|ci) and P(ci)) We.
Quantum One.
Singular Value Decomposition SVD
Sparse and Redundant Representations and Their Applications in
Copyright © 2017, 2013, 2009 Pearson Education, Inc.
= Magic Math (Checking)
Haitao Wang Utah State University WADS 2017, St. John’s, Canada
Rank-Sparsity Incoherence for Matrix Decomposition
Quantum Foundations Lecture 3
MATH 175: Numerical Analysis II
Row-equivalences again
Subject :- Applied Mathematics
Presentation transcript:

Quantifying quantum coherence Nathaniel Johnston – joint work with Jianxin Chen, Chi-Kwong Li, and Sarah Plosker Mount Allison University Sackville, New Brunswick, Canada

Overview What is Quantum Coherence? How Do We Measure Coherence? Coherence of Pure States

Overview What is Quantum Coherence? Measuring Coherence Physics: How “useful” a quantum state is Math #1: How far away from the standard basis a vector is Math #2: How far from diagonal a matrix is Measuring Coherence Coherence of Pure States

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? Measuring Coherence Many different methods have been proposed Different methods useful in different contexts Still very undeveloped Coherence of Pure States

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 becoming useless? Method 2: Robustness How much does ρ have to be mixed with another state before becoming useless? “C” stands for “coherence”, and the “R” refers to “robustness” – this measures how much noise/interference a state can tolerate before becoming useless Harder to compute. Nicer physical properties. Can be computed efficiently via semidefinite programming, but no analytic formula is known.

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

Measuring Coherence How far (geometrically) is ρ from a useless state? Method 3: 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. Nice physical properties. Again, can be computed efficiently via semidefinite programming, but no analytic formula is known.

Measuring Coherence Some nice mathematical properties include: Reminder: The trace distance of coherence is Some nice mathematical properties include: A simple formula when restricted to pure states? Wait a minute… If then What states give the largest value? formula for the ℓ1-norm and robustness of coherence

Overview What is Quantum Coherence? Measuring Coherence Coherence of Pure States “Almost” formula for trace distance of coherence Our method is fast Also answers which states maximize trace distance of coherence

Coherence of Pure States One of our results didn’t make the cut…

Coherence of Pure States Our main result is 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…

Coherence of Pure States 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!

Coherence of Pure States 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

Coherence of Pure States 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 and robustness of coherence was already known, but follows easily in just two lines from our work

Quantum Coherence Thanks for your attention! J. Chen, N. J., C.-K. Li, S. Plosker. Quantifying the coherence of pure quantum states. E-print: arXiv:1601.06269 [quant-ph]