Related papers: An Extension of Gleason's Theorem for Quantum Comp…
We extend Gleason's theorem to the two-dimensional Hilbert space of a qubit by invoking the standard axiom that describes composite quantum systems. The tensor-product structure allows us to derive density matrices and Born's rule for $d=2$…
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…
We develop and defend the thesis that the Hilbert space formalism of quantum mechanics is a new theory of probability. The theory, like its classical counterpart, consists of an algebra of events, and the probability measures defined on it.…
We derive Born's rule and the density-operator formalism for quantum systems with Hilbert spaces of dimension two or larger. Our extension of Gleason's theorem only relies upon the consistent assignment of probabilities to the outcomes of…
In this paper, a modified formulation of generalized probabilistic theories that will always give rise to the structure of Hilbert space of quantum mechanics, in any finite outcome space, is presented and the guidelines to how to extend…
Based on a recent proof of free choices in linking equations to the experiments they describe, I clarify relations among some purely mathematical entities featured in quantum mechanics (probabilities, density operators, partial traces, and…
Nielsen [quant-ph/0108020] introduced a model of quantum computation by measurement-based simulation of unitary computations. In this model, a consequence of the non-determinism of quantum measurement is the probabilistic termination of…
Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then…
Gleason-type theorems for quantum theory allow one to recover the quantum state space by assuming that (i) states consistently assign probabilities to measurement outcomes and that (ii) there is a unique state for every such assignment. We…
Gleason's theorem [A. Gleason, J. Math. Mech., \textbf{6}, 885 (1957)] is an important result in the foundations of quantum mechanics, where it justifies the Born rule as a mathematical consequence of the quantum formalism. Formally, it…
We explore in the framework of Quantum Computation the notion of computability, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm that exploits the quantum adiabatic processes is considered…
A certain generalization of the mathematical formalism of quantum mechanics beyond operator algebras is considered. The approach is based on the concept of conditional probability and the interpretation of the Lueders - von Neumann quantum…
Gleason's theorem asserts the equivalence of von Neumann's density operator formalism of quantum mechanics and frame functions, which are functions on the pure states that sum to 1 on any orthonormal basis of Hilbert space of dimension at…
Within the framework of quantum contextuality, we discuss the ideas of extracontextuality and extravalence, that allow one to relate Kochen-Specker's and Gleason's theorems. We emphasize that whereas Kochen-Specker's is essentially a no-go…
The topical quantum computation paradigm is a transposition of the Turing machine into the quantum framework. Implementations based on this paradigm have limitations as to the number of: qubits, computation steps, efficient quantum…
In operator algebra theory, a conditional expectation is usually assumed to be a projection map onto a sub-algebra. In the paper, a further type of conditional expectation and an extension of the Lueders - von Neumann measurement to…
The standard theory of quantum computation relies on the idea that the basic information quantity is represented by a superposition of elements of the canonical basis and the notion of probability naturally follows from the Born rule. In…
In the quantum mechanical Hilbert space formalism, the probabilistic interpretation is a later ad-hoc add-on, more or less enforced by the experimental evidence, but not motivated by the mathematical model itself. A model involving a clear…
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…
We derive essential elements of quantum mechanics from a parametric structure extending that of traditional mathematical statistics. The basic setting is a set $\mathcal{A}$ of incompatible experiments, and a transformation group $G$ on the…