arXiv:0812.3072

Quantum Logic and Quantum Computation

Mladen Pavičić, Norman D. Megill

Published Dec 16, 2008• 0 citations

Abstract

We use classes of Hilbert lattice equations for an alternative representation of Hilbert lattices and Hilbert spaces of arbitrary quantum systems that might enable a direct introduction of the states of the systems into quantum computers. More specifically, we look for a way to feed a quantum computer with algebraic equations of n-th order underlying an infinite dimensional Hilbert space description of quantum systems. A number of new results on states defined on Hilbert lattices are presented and discussed and a number of recently obtained results in the field of Hilbert space equations are reviewed.

DOI: 10.48550/arxiv.0812.3072

Related papers

Algebraic modelling of quantum mechanical equations in the finite- and infinite-dimensional Hilbert spaces

Norman D. Megill

The Hilbert space of quantum mechanics has a dual representation in lattice theory, called the Hilbert lattice. In addition to offering the potential for new insights, the lattice-theoretical approach may be computationally efficient for certain kinds of quantum mechanics problems, particularly if, in the future, we are able to exploit what may be a “natural” fit with quantum computation. The equations that hold in the Hilbert space lattice representation are not completely known and are poorly understood, although much progress has been made in the last several years. This work contributes to the development of these equations, with special attention to the so-called generalized orthoarguesian equations. Many new results that do not appear in the literature are given, along with their detailed proofs. In addition, possible approaches for work towards answering some remaining open questions are discussed.

Dec 14, 20110 citations

Quantum logic for genuine quantum simulators

Mladen Pavičić

Recently we proved that there are two non-isomorphic models of the calculus of quantum logic corresponding to an infinite-dimensional Hilbert space representation: an orthomodular lattice and a weakly orthomodular lattice. We also discovered that there are two non-isomorphic models of the calculus of classical logic: a distributive lattice (Boolean algebra) and a weakly distributive lattice. In this work we consider implications of these results to a quantum simulator which should mimic quantum systems by giving precise instructions on how to produce input state, how to evolve them, and how to read off the final states. We analyze which conditions quantum states of a quantum computer currently obey and which they should obey in order to enable full quantum computing, i.e., proper quantum mathematics. In particular we find several new conditions which lattices of Hilbert space subspaces must satisfy.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIEJul 13, 20000 citations

Quantum logic as motivated by quantum computing

Jon Michael Dunn, Tobias Hagge, Lawrence S. Moss +1 more

§1. Introduction. Our understanding of Nature comes in layers, so should the development of logic. Classic logic is an indispensable part of our knowledge, and its interactions with computer science have recently dramatically changed our life. A new layer of logic has been developing ever since the discovery of quantum mechanics. G. D. Birkhoff and von Neumann introduced quantum logic in a seminal paper in 1936 [1]. But the definition of quantum logic varies among authors (see [2]). How to capture the logic structure inherent in quantum mechanics is very interesting and challenging. Given the close connection between classical logic and theoretical computer science as exemplified by the coincidence of computable functions through Turing machines, recursive function theory, and λ-calculus, we are interested in how to gain some insights about quantum logic from quantum computing. In this note we make some observations about quantum logic as motivated by quantum computing (see [5]) and hope more people will explore this connection. The quantum logic as envisioned by Birkhoff and von Neumann is based on the lattice of closed subspaces of a Hilbert space, usually an infinite dimensional one. The quantum logic of a fixed Hilbert space ℍ in this note is the variety of all the true equations with finitely many variables using the connectives meet, join and negation. Quantum computing is theoretically based on quantum systems with finite dimensional Hilbert spaces, especially the states space of a qubit ℂ2. (Actually the qubit is merely a convenience.

arXiv:math/0412144Journal of Symbolic LogicJun 1, 200526 citations

Quantum Computers, Discrete Space, and Entanglement

Mladen Pavičić

We consider algebras underlying Hilbert spaces used by quantum information algorithms. We show how one can arrive at equations on such algebras which define n-dimensional Hilbert space subspaces which in turn can simulate quantum systems on a quantum system. In doing so we use MMP diagrams and linear algorithms. MMP diagrams are tractable since an n-block of an MMP diagram has n elements while an n-block of a standard lattice diagram has 2^n elements. An immediate test for such an approach is a generation of minimal and arbitrary Kochen-Specker vectors and we present a minimal state-independent Kochen-Specker set of seven vectors from a Hilbert space with more than four dimensions.

arXiv:quant-ph/0207003Jun 30, 20024 citations

Equations and State and Lattice Properties That Hold in Infinite Dimensional Hilbert Space

Norman D. Megill, Mladen Pavičić

Abstract. We provide several new results on quantum state space, on lattice of subspaces of an infinite dimensional Hilbert space, and on infinite dimensional Hilbert space equations as well as on connections between them. In particular we obtain an n-variable generalized orthoarguesian equation which holds in any infinite dimensional Hilbert space. Then we strengthen Godowski’s result by showing that in an ortholattice on which strong states are defined Godowski’s equations as well as the orthomodularity hold. We also prove that all 6- and 4-variable orthoarguesian equations presented in the literature can be reduced to new 4- and 3-variable ones, respectively and that Mayet’s examples follow from Godowski’s equations. To make a breakthrough in testing these massive equations we designed several novel algorithms for generating Greechie diagrams with an arbitrary number of blocks and atoms (currently testing with up to 50) and for automated checking of equations on them. A way of obtaining complex infinite dimensional Hilbert space from the Hilbert lattice equipped with several additional conditions and without invoking the notion of state is presented. Possible repercussions of the results to quantum computing problems are discussed.

Jan 1, 20002 citations

Quantum logic and projective spaces

Lada Peksová

A set of statements about the properties of a quantum system is looked at as at a partially ordered set of subspaces of finite or infinite dimensional Hilbert space. The operation of ordering is performed on a set of propositions comparing the truth values of these propositions and on the set of subspaces as the opera- tion of inclusion. Based on the required properties these structures are translated into operations on the lattice. The correspondence with Heisenberg uncertainty principle is shown there. Furthermore, it is shown that the lattices correspond- ing to the subspaces of infinite dimensional Hilbert space are not modular. This property is replaced with weaker property of orthomodularity, when operation of the negation is added. Following the work of G. Birkhoff and J. von Neumann, the structure of quantum logic is looked for in projective spaces, which are in- troduced either arithmetically or axiomatically. The examples of quantum logic, their physical implementation and eventual implementation in projective spaces are analysed. 1

Jan 1, 20130 citations