Quantum Coloring and related problems K. Svozil (ITP-TUW May 22nd, 2001)

Slides:



Advertisements
Similar presentations
10.4 Complex Vector Spaces.
Advertisements

Matrix Representation
Chapter 4 Euclidean Vector Spaces
Bell inequality & entanglement
Chapter 5 Orthogonality
Chapter 4 Probability.
Class 25: Question 1 Which of the following vectors is orthogonal to the row space of A?
6 6.3 © 2012 Pearson Education, Inc. Orthogonality and Least Squares ORTHOGONAL PROJECTIONS.
Boot Camp in Linear Algebra Joel Barajas Karla L Caballero University of California Silicon Valley Center October 8th, 2008.
Quantum correlations. Adam W. Majewski. Quantum entanglement. Ghhjhjj Quantum entanglement is a phenomenon that occurs when particles (subsystems) are.
Separate multivariate observations
5  Systems of Linear Equations: ✦ An Introduction ✦ Unique Solutions ✦ Underdetermined and Overdetermined Systems  Matrices  Multiplication of Matrices.
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka Virginia de Sa (UCSD) Cogsci 108F Linear.
IB Math Studies – Topic 3. IB Course Guide Description.
Systems and Matrices (Chapter5)
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.
Systems of Linear Equation and Matrices
Linear Algebra Chapter 4 Vector Spaces.
V. Space Curves Types of curves Explicit Implicit Parametric.
Linear Programming System of Linear Inequalities  The solution set of LP is described by Ax  b. Gauss showed how to solve a system of linear.
Matrices CHAPTER 8.1 ~ 8.8. Ch _2 Contents  8.1 Matrix Algebra 8.1 Matrix Algebra  8.2 Systems of Linear Algebra Equations 8.2 Systems of Linear.
Matrices. Definitions  A matrix is an m x n array of scalars, arranged conceptually as m rows and n columns.  m is referred to as the row dimension.
Quantum One: Lecture Representation Independent Properties of Linear Operators 3.
Chapter 5 Eigenvalues and Eigenvectors 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
Uniform discretizations: the continuum limit of consistent discretizations Jorge Pullin Horace Hearne Institute for Theoretical Physics Louisiana State.
Elementary Linear Algebra Anton & Rorres, 9th Edition
§1.4 Algorithms and complexity For a given (optimization) problem, Questions: 1)how hard is the problem. 2)does there exist an efficient solution algorithm?
Chap. 5 Inner Product Spaces 5.1 Length and Dot Product in R n 5.2 Inner Product Spaces 5.3 Orthonormal Bases: Gram-Schmidt Process 5.4 Mathematical Models.
Information and Coding Theory Cyclic codes Juris Viksna, 2015.
I.4 Polyhedral Theory 1. Integer Programming  Objective of Study: want to know how to describe the convex hull of the solution set to the IP problem.
Chapter SETS DEFINITION OF SET METHODS FOR SPECIFYING SET SUBSETS VENN DIAGRAM SET IDENTITIES SET OPERATIONS.
AGC DSP AGC DSP Professor A G Constantinides©1 Signal Spaces The purpose of this part of the course is to introduce the basic concepts behind generalised.
Copyright © 2014 by McGraw-Hill Higher Education. All rights reserved. Essentials of Business Statistics: Communicating with Numbers By Sanjiv Jaggia and.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
Quantum Two 1. 2 Angular Momentum and Rotations 3.
Copyright © Cengage Learning. All rights reserved. Fundamental Concepts of Algebra 1.1 Real Numbers.
Mathematical Tools of Quantum Mechanics
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
6 6.3 © 2016 Pearson Education, Inc. Orthogonality and Least Squares ORTHOGONAL PROJECTIONS.
A function is a rule f that associates with each element in a set A one and only one element in a set B. If f associates the element b with the element.
Linear Programming Chap 2. The Geometry of LP  In the text, polyhedron is defined as P = { x  R n : Ax  b }. So some of our earlier results should.
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
1 Copyright © Cengage Learning. All rights reserved. 7. Analytic Trigonometry Trigonometric Identities and Trigonometric Equations.
Quantum Two 1. 2 Angular Momentum and Rotations 3.
Systems of Identical Particles
MAT 322: LINEAR ALGEBRA.
Trigonometric Identities
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
Vector Spaces B.A./B.Sc. III: Mathematics (Paper II) 1 Vectors in Rn
CS479/679 Pattern Recognition Dr. George Bebis
Chapter 1 Linear Equations and Vectors
5 Systems of Linear Equations and Matrices
Postulates of Quantum Mechanics
(MTH 250) Calculus Lecture 22.
Quantum Two.
Quantum Two.
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Quantum One.
§1-3 Solution of a Dynamical Equation
Chapter 3 Linear Algebra
6 Systems of Linear Equations and Matrices
Quantum Two.
I.4 Polyhedral Theory (NW)
Quantum Foundations Lecture 3
Maths for Signals and Systems Linear Algebra in Engineering Lecture 6, Friday 21st October 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
I.4 Polyhedral Theory.
Linear Vector Space and Matrix Mechanics
Eigenvalues and Eigenvectors
Linear Vector Space and Matrix Mechanics
Presentation transcript:

Quantum Coloring and related problems K. Svozil (ITP-TUW May 22nd, 2001)

Consistent description of observables Three-coloring of the rational quantum sphere Hans Havlicek, Guenther Krenn, Johann Summhammer and KS, ``Coloring the rational quantum sphere and the Kochen-Specker theorem,'' J. Phys. A:Math. Gen. 34(14), (13 April 2001) Boole-Bell inequalities via Pitowsky polytopes Itamar Pitowsky and KS,``New optimal tests of quantum nonlocality,'' Phys. Rev. A, in print; Stefan Filipp and KS, quant-ph/ Haystack problem Niko Donath & KS

The quantum unit ball

Every point of the ball is a yes/no proposition (von Neumann, "Mathematische Grundlagen der Quantenmechanik,“ 1932) ``  To each property E we can assign a quantity which we define as follows: each measurement which distinguishes between the presence or absence of E is considered as a measurement of this quantity, such that its value is 1 if E is verified, and zero in the opposite case. This quantity which corresponds to E will also be denoted by E. Such quantities take only the values of 0 and 1, and conversely, each quantity R which is capable of these two values only, corresponds to a property E which is evidently this: ``the value of R is  0.'' The quantities E that correspond to the properties are therefore characterized by this behavior. That E takes on only the values 0,1 can also be formulated as follows: Substituting E into the polynomial F( ) =  2 makes it vanish identically. If E has the operator E, then F(E) has the operator F(E) = E  E 2, i.e., the condition is that E  E 2 = 0 or E = E 2. In other words: the operator E of E is a projection. The projections E therefore correspond to the properties E (through the agency of the corresponding quantities E which we just defined). If we introduce, along with the projections E, the closed linear manifold M, belonging to them (E = P M ), then the closed linear manifolds correspond equally to the properties of E.''

Kochen-Specker theorem Under certain „reasonable“ assumptions... there is no coloring of systems of orthogonal tripods in Hilbert spaces of Dimensions > 2. The existence of elements of physical reality independent of the „context“ is inconsistent. Scholastic futurabilities: does God know also things which could have happened but did not happen ?

2   2, 1  _

SURPRISE: Three coloring of the rational quantum sphere Consider rays from the origin which meet the rational unit sphere S 2  Q 3. The following statements on a triple (x,y,z)  Z 3 \{(0,0,0)} are equivalent: (i) The ray Sp(x,y,z) intersects the unit sphere at two rational points; i.e., it contains the rational points  ( x,y,z)/  [(x 2 +y 2 +z 2 )]  S 2  Q 3. (ii) The Pythagorean property holds, i.e., x 2 +y 2 +z 2 = n 2, n  N. This equivalence can be demonstrated as follows. All points on the rational unit sphere can be written as r = ([a/(a)],[b/(b)],[c/(c)] ) with a,b,c  Z, a,b,c  Z\{0}, and ([a/(a)]) 2 +([b/(b)]) 2 +([c/(c)]) 2 = 1. Multiplication of r with a 2 b 2 c 2 results in a vector of Z 3 satisfying (ii). Conversely, from x 2 +y 2 +z 2 =n 2, n  N, we obtain the rational unit vector ( x / n, y / n, z / n )  S 2  Q 3.

How-To? If x,y,z are chosen coprime then a necessary condition for x 2 +y 2 +z 2 being a non- zero square is that precisely one of x, y, and z is odd. This is a direct consequence of the observation that any square is congruent to 0 or 1, modulo 4, and from the fact that at least one of x, y, and z is odd. Hence our coloring of the rational rays induces the following coloring of the rational unit sphere with those three colors that are represented by the standard basis of Z 2 3 : color #1 if x is odd, y and z are even, color #2 if y is odd, z and x are even, color #3 if z is odd, x and y are even. All three colors occur, since the vectors of the standard basis of R 3 are colored differently. They are also dense on the unit sphere.

Problems Propositional structures not closed under NORs:  S 2  Q 3 but the cross product thereof is (12/25, -9/25,12/25)  S 2  Q 3. Arbitraryness of approximation

Boole-Bell type inequalities and Pitowsky correlation polytopes Truth table of events and their joint events Rows represent vectors All row vectors define a convex correlation polytope By the Minkowski-Weyl representation theorem, an equivalent representation is via the inequalities corresponding to the faces of the polytope (the „hull problem“).

Hull problem for 3-3 and : GHZ case: three particles at two angles: inequalities, e.g., 0  - P(A 1 B 1 C 1 ) - 2P(A 2 B 1 C 1 ) - 3P(A 1 B 2 C 1 ) - 3P(A 1 B 1 C 2 ) - P(A 2 B 2 C 1 ) - P(A 2 B 1 C 2 ) - P(A 1 B 2 C 2 ) + 4P(A 2 B 2 C 2 ), 3-3: two particles at three angles: 684 inequalies, e.g., 3  2P(A 1 ) + P(A 2 ) +P(B 2 ) +2P(B 3 ) - P(A 1 B 1 ) - P(A 1 B 2 ) - P(A 1 B 3 ) + P(A 2 B 1 ) - P(A 2 B 2 ) - P(A 2 B 3 ) + P(A 3 B 2 ) - P(A 3 B 3 )

Parameter studies 2-2-2

Parameter studies 3-3

Haystack problem... to single out a particular state among 2 n orthogonal pure states. As it turns out, in general the optimal strategy is not to measure the particles separately, but to consider joint properties of the n-particle system. The required number of propositions is n. There exist 2 n ! equivalent operational procedures to do so. We enumerate some configurations for three particles, in particular the Greenberger-Horne- Zeilinger (GHZ)- and W-states, which are specific cases of a unitary transformation...

Instead of a summary: the generalized urn puzzle