The experimental logic of Moore and Mealy type automata is investigated. key words: automaton logic; partition logic; comparison to quantum logic; intrinsic measurements 1

I study the class of problems efficiently solvable by a quantum computer, given the ability to “postselect” on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or Probabilistic Polynomial-Time. Using this result, I show that several simple changes to the axioms of quantum mechanics would let us solve PP-complete problems efficiently. The result also implies, as an easy corollary, a celebrated theorem of Beigel, Reingold, and Spielman that PP is closed under intersection, as well as a generalization of that theorem due to Fortnow and Reingold. This illustrates that quantum computing can yield new and simpler proofs of major results about classical computation.

Only finite precision measurements are experimentally reasonable, and they cannot distinguish a dense subset from its closure. We show that the rational vectors, which are dense in S 2, can be colored so that the contradiction with hidden variable theories provided by Kochen-Specker constructions does not obtain. Thus, in contrast to violation of the Bell inequalities, no quantum-over-classical advantage for information processing can be derived from the Kochen-Specker theorem alone.

No physical measurement can be performed with infinite precision. This leaves a loophole in the standard no-go arguments against non-contextual hidden variables. All such arguments rely on choosing special sets of quantum-mechanical observables with measurement outcomes that cannot be simulated non-contextually. As a consequence, these arguments do not exclude the hypothesis that the class of physical measurements in fact corresponds to a dense subset of all theoretically possible measurements with outcomes and quantum probabilities that can be recovered from a noncontextual hidden variable model. We show here by explicit construction that there are indeed such non-contextual hidden variable models, both for projection valued and positive operator valued measurements.

Quantum information processing is at the crossroads of physics, mathematics and computer science. It is concerned with that we can and cannot do with quantum information that goes beyond the abilities of classical information processing devices. Communication complexity is an area of classical computer science that aims at quantifying the amount of communication necessary to solve distributed computational problems. Quantum communication complexity uses quantum mechanics to reduce the amount of communication that would be classically required. Pseudo-telepathy is a surprising application of quantum information processing to communication complexity. Thanks to entanglement, perhaps the most nonclassical manifestation of quantum mechanics, two or more quantum players can accomplish a distributed task with no need for communication whatsoever, which would be an impossible feat for classical players. After a detailed overview of the principle and purpose of pseudo-telepathy, we present a survey of recent and no-so-recent work on the subject. In particular, we describe and analyse all the pseudo-telepathy games currently known to the authors.

Abstract not found

We introduce a partial order on classical and quantum states which reveals that these sets are actually domains: Directed complete partially ordered sets with an intrinsic notion of approximation. The operational significance of the orders involved conclusively establishes that physical information has a natural domain theoretic structure. In the same

An extended analysis is given of the program, originally suggested by Deutsch, of solving the probability problem in the Everett interpretation by means of decision theory. Deutsch’s own proof is discussed, and alternatives are presented which are based upon different decision theories and upon Gleason’s Theorem. It is argued that decision theory gives Everettians most or all of what they need from ‘probability’. Contact is made with Lewis’s Principal Principle linking subjective credence with objective chance: an Everettian Principal Principle is formulated, and shown to be at least as defensible as the usual Principle. Some consequences of (Everettian) quantum mechanics for decision theory itself are also discussed.

The roles of decoherence and environment-induced superselection in the emergence of the classical from the quantum substrate are described. The stability of correlations between the einselected quantum pointer states and the environment allows them to exist almost as objectively as classical states were once thought to exist: there are ways of finding out what is the pointer state of the system which uses redundancy of its correlations with the environment, and which leave einselected states essentially unperturbed. This relatively objective existence of certain quantum states facilitates operational definition of probabilities in the quantum setting. Moreover, once there are states that ‘exist ’ and can be ‘found out’, a ‘collapse ’ in the traditional sense is no longer necessary—in effect, it has already happened. The role of the preferred states in the processing and storage of information is emphasized. The existential interpretation based on the relatively objective existence of stable correlations between the einselected states of observers ’ memory and in the outside universe is formulated and discussed.

We establish a link between symplectic topology and a recently emerged branch of functional analysis called the theory of quasi-states and quasi-measures (also known as topological measures). In the symplectic context quasi-states can be viewed as an algebraic way of packaging certain information contained in Floer theory, and in particular in spectral invariants of Hamiltonian diffeomorphisms introduced recently by Yong-Geun Oh. As a consequence we prove a number of new results on rigidity of intersections in symplectic manifolds. This work is a part of a joint project with Paul Biran.