相关论文: Deduction, Ordering, and Operations in Quantum Log…
Quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister, a system of qubits, representing a…
We explore in the framework of Quantum Computation the notion of {\em Computability}, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm for Hilbert's tenth problem, which is equivalent to…
Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time…
Distinguishability is a fundamental and operational task generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and…
Finding a denotational semantics for higher order quantum computation is a long-standing problem in the semantics of quantum programming languages. Most past approaches to this problem fell short in one way or another, either limiting the…
In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…
It is first shown that when the Schr\"{o}dinger equation for a wave function is written in the polar form, complete information about the system's {\em quantum-ness} is separated out in a single term $Q$, the so called `quantum potential'.…
Making new methods for quantum problems often relies on using basic operations in linear algebra. Often these routines are hidden behind well-known libraries that have been optimized over decades. Attempting to improve on those basic…
The question about the existence of so-called ``hidden'' variables in quantum mechanics and the perception of the completeness of quantum mechanics are two sides of the same coin. Quantum analytical mechanics constitutes a completion of…
A simple alternative scheme for implementing quantum gates with a single trapped cold two-level ion beyond the Lamb-Dicke (LD) limit is proposed. Basing on the quantum dynamics for the laser-ion interaction described by a generalized…
An extended analysis is made of the Gell-Mann and Hartle axioms for a generalised `histories' approach to quantum theory. Emphasis is placed on finding equivalents of the lattice structure that is employed in standard quantum logic.…
In this work we study the convex set of quantum states from a quantum logical point of view. We consider an algebraic structure based on the convex subsets of this set. The relationship of this algebraic structure with the lattice of…
We give a quantum logspace algorithm for powering contraction matrices, that is, matrices with spectral norm at most~1. The algorithm gets as an input an arbitrary $n\times n$ contraction matrix $A$, and a parameter $T \leq…
In the absence of a satisfactory interpretation of quantum theory, physical law lacks physical basis. This paper reviews the orthodox, or Dirac-von Neumann interpretation, and makes explicit that Hilbert space describes propositions about…
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
When considering a sequent-style proof system for quantum programs, there are certain elements of quantum mechanics that we may wish to capture, such as phase, dynamics of unitary transformations, and measurement probabilities. Traditional…
Quantum physics is a linear theory, so it is somewhat puzzling that it can underlie very complex systems such as digital computers and life. This paper investigates how this is possible. Physically, such complex systems are necessarily…
Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms…
Categorical quantum mechanics exploits the dagger compact closed structure of finite dimensional Hilbert spaces, and uses the graphical calculus of string diagrams to facilitate reasoning about finite dimensional processes. A significant…
Quantum separable operations are defined as those that cannot produce entanglement from separable states, and it is known that they strictly surpass local operations and classical communication (LOCC) in a number of tasks, which is…