The Status of State Reduction by Steven Johnston The Status of State Reduction by Steven Johnston.

Slides:



Advertisements
Similar presentations
Geometry Chapter 2 Terms.
Advertisements

Conjectures aka: Theorems and Postulates. Conjectures: Postulates and Theorems Postulate: A statement that is accepted without proof. Usually these have.
Get Ready To Be Logical! 1. Books and notebooks out. 2. Supplies ready to go. 3. Answer the following: The sum of 2 positive integers is ___________ True.
Section 2.1 Notes Conditional Statements. Conditional Statement A type of logic statement that has two parts: a hypothesis and a conclusion We will write.
Probably Approximately Correct Learning Yongsub Lim Applied Algorithm Laboratory KAIST.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
Chapter 3 Propositional Logic
Chapter 2 Reasoning and Proofs. Chapter 2 Glossary Terms Conjecture Inductive Reasoning Counter Examples Statement Truth Value Negation Compound Statement.
2.6 – Proving Statements about Angles Definition: Theorem A true statement that follows as a result of other true statements.
Adapted from Discrete Math
IB Math Studies – Topic 3. IB Course Guide Description.
Methods of Proof & Proof Strategies
Axiomatic systems By Micah McKee. VOCAB: Axiomatic system Postulate/Axiom Theorem Axiomatic system Line segment Ray Point Line Plane.
Weak Values in Quantum Measurement Theory - Concepts and Applications - Yutaka Shikano 07M01099 Department of Physics, Tokyo Institute of Technology “Master.
CHAPTER 1: Points, Lines, Planes, and Angles
Properties of Equality
Logic Geometry Unit 11, Lesson 5 Mrs. Reed. Definition Statement – a sentence that is either true or false. Example: There are 30 desks in the room.
Honors Geometry Intro. to Deductive Reasoning. Reasoning based on observing patterns, as we did in the first section of Unit I, is called inductive reasoning.
Unreal Probabilities by Carlos C. Rodriguez Dept. of Mathematics The University at Albany
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
Section 2-2: Conditional Statements. Conditional A statement that can be written in If-then form symbol: If p —>, then q.
Logic and Reasoning Conditional Statements. Logic The use and study of valid reasoning. When studying mathematics it is important to have the ability.
Thinking Mathematically
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
Inductive and Deductive Reasoning. Definitions: Conditionals, Hypothesis, & Conclusions: A conditional statement is a logical statement that has two parts:
Deductive Structure Lesson 1.7. Deductive Structure: Conclusions are justified by means of previously assumed or provided statements.
© Copyright 2008 STI INNSBRUCK Intelligent Systems Propositional Logic.
Laws of Boolean Algebra Commutative Law Associative Law Distributive Law Identity Law De Morgan's Theorem.
Postulates and Theorems Relating Points, Lines, and Planes
Sum of Arithmetic Sequences. Definitions Sequence Series.
1.What is the difference between a paragraph proof and a column proof? 2.True or False: If a quadrilateral is a square, then all four sides are congruent.
Review Find a counter example for the conjecture Given: JK = KL = LM = MJ Conjecture: JKLM forms a square.
Expectation: You will: 1. Write proofs in “If, then…” form. 2. Write the negations of “all,” “every” “no” and “there exists” statements. 3/7/ :
Lesson 2.3 Drawing Conclusions Objective: After studying this section, you will be able to follow a five-step procedure to draw logical conclusions.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
 You will be able to use theorems and definitions to find the measures of angles.  You will be able to use theorems and definitions to write a formal.
Conditional Statements A conditional statement has two parts, the hypothesis and the conclusion. Written in if-then form: If it is Saturday, then it is.
A.P. STATISTICS EXAM REVIEW TOPIC #2 Tests of Significance and Confidence Intervals for Means and Proportions Chapters
Deductive Reasoning. Warm-up Objectives: 1) To use the Law of Detachment 2) To use the Law of Syllogism.
Section 2.1 Conditional Statements Standards #1&3 Wednesday, July 06, 2016Wednesday, July 06, 2016Wednesday, July 06, 2016Wednesday, July 06, 2016.
Simple Logic.
CENG 424-Logic for CS Introduction Based on the Lecture Notes of Konstantin Korovin, Valentin Goranko, Russel and Norvig, and Michael Genesereth.
1.3 Points, Lines, and Planes. Points _____________________________________ _____________________________________ It has no __________ Represented by.
Presented by: Tutorial Services The Math Center
Indirect Argument: Contradiction and Contraposition
POSTULATES AND PROOFS ★Postulates are statements that are assumed to be true without proof. ★ Postulates serve two purposes - to explain undefined terms,
Lecture 1 – Formal Logic.
Honors Geometry Chapter 1 Section 1.
Propositional Calculus: Boolean Algebra and Simplification
2.4 Deductive Reasoning.
1-5 Postulates and Theorems Relating Points, Lines and Planes
2.2 Square Root of a Function Square Root of the Linear Function
2.2 Analyze Conditional Statements
Two Column Proofs PROOF Geometry.
(1.4) An Introduction to Logic
Discrete Mathematics Lecture 2: Propositional Logic
Statements joined by “And” (Conjunctions)
MAT 3100 Introduction to Proof
Geometry.
Discrete Mathematics Lecture 2: Propositional Logic
Section 3-6 Inductive Reasoning.
This Lecture Substitution model
Vocabulary Indirect Proof
Chapter 2 Sets Active Learning Lecture Slides
Section 1.7 and 1.8- Deductive Structure / Statements of Logic
Propositional Logic 7) Not Copyright 2008, Scott Gray.
True or False True or False
Propositional Satisfiability
Presentation transcript:

The Status of State Reduction by Steven Johnston The Status of State Reduction by Steven Johnston

Single-time Quantum Logic Physical System Hilbert space Orthocomplemented lattice of propositions Orthocomplemented lattice of projection operators

Propositions All propositions can be broken down to statements of the form: “The observable has a value in the range ” Lattice Operations: MEET(AND) ORTHOCOMPLEMENT (NOT) JOIN(OR) ORDERING(IMPLICATION)

Projectors

Lattice Operations (for commuting projectors): MEET ORTHOCOMPLEMENT JOIN ORDERING

Probabilities We require: Gleason’s Theorem: If the Hilbert space has dimension greater than two, the only such is given by:

Special Cases Definite proposition Indefinite proposition Result 1:

State Reduction A non-unitary time-evolution of the system’s state. Postulated to occur in a measurement. Result 2: No state reduction occurs if a proposition is definite in the initial state: true: false:

Histories Single-time quantum logic is extended using the “…and then…” sequential conjunction. A homogeneous history is of the form: An inhomogeneous history can’t be written in this form. e.g.

Multiple-time Quantum Logic Physical System (Considered over time) Hilbert space ? Orthocomplemented lattice of propositions Orthocomplemented lattice of projection operators ? What’s the correct way to represent history propositions?

History Projection Operator Formalism (HPO) Example (Negation): History propositions are represented by a projection operators on a tensor product Hilbert space. Homogeneous histories are of the form:

States in the HPO formalism Homogeneous history: System in initial state: State at first time: The history is true if each proposition is true at each time. If the history is true then the first proposition must be true: But no state reduction occurs for true propositions so the state at the second time is just: Repeat for the other times…

States in the HPO formalism In general is true if and only if: More compactly: for Extending to inhomogeneous histories as well, we get: Result 3: A general history is true if and only if: A general history is false if and only if:

The Status of State Reduction The key to understanding state reduction is the condition for a history to be false in an initial state: A general history is false if and only if: If is homogeneous then this means for some time we have: Propositions at other times can be indefinite. The appropriate state to evaluate each proposition at each time is just the time-evolved state. No state reduction occurs! Even for indefinite propositions!

Probabilities for Histories Probabilities are usually assigned using decoherence functionals. Their form is motivated by state reduction. Without state reduction, what’s the appropriate probability assignment? Use Gleason’s theorem: for and homogeneous history we get:

Conclusions Don’t postulate state reduction. A new probability assignment for history propositions is given by: where Thanks for listening!