相关论文: An extension of Chaitin's halting probability \Ome…
This is yet another version of the course notes in chao-dyn/9407003. Here we change the universal Turing machine that is used to measure program-size complexity so that the constants in our information-theoretic incompleteness theorems are…
The origin of the uncertainty inherent in quantum measurements has been discussed since quantum theory's inception, but to date the source of the indeterminacy of measurements performed at an angle with respect to a quantum state's…
We characterize learnability for quantum measurement classes by establishing matching necessary and sufficient conditions for their PAC learnability, along with corresponding sample complexity bounds, in the setting where the learner is…
In this paper, we introduce a new public quantum interactive proof system and the first quantum alternating Turing machine: qAM proof system and qATM, respectively. Both are obtained from their classical counterparts (Arthur-Merlin proof…
Probabilistic operational semantics for a nondeterministic extension of pure lambda calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics are both…
Majorization theory is a powerful mathematical tool to compare the disorder in distributions, with wide-ranging applications in many fields including mathematics, physics, information theory, and economics. While majorization theory…
Principal component analysis is an important dimension reduction technique in machine learning. In [S. Lloyd, M. Mohseni and P. Rebentrost, Nature Physics 10, 631-633, (2014)], a quantum algorithm to implement principal component analysis…
The history based formalism known as Quantum Measure Theory (QMT) generalizes the concept of probability-measure so as to incorporate quantum interference. The resulting \textit{quantum measure} $\mu$ is defined for arbitrary events (sets…
We prove that, assuming $\mathrm{ZF}$, and restricted to any pointed set, Chaitin's $\Omega_U:x\mapsto \Omega_U^x=\sum_{U^x(\sigma)\downarrow}2^{-|\sigma|}$ is not injective for any universal prefix-free Turing machine $U$, and that…
Measurement uncertainty relations are lower bounds on the errors of any approximate joint measurement of two or more quantum observables. The aim of this paper is to provide methods to compute optimal bounds of this type. The basic method…
To find the Hermitian phase operatorof a single-mode electromagnetic field in quantum mechanics, the Schroedinger representation is extended to a larger Hilbert space augmented by states with infinite excitation by nonstandard analysis. The…
A remarkable new definition of a self-delimiting universal Turing machine is presented that is easy to program and runs very quickly. This provides a new foundation for algorithmic information theory. This new universal Turing machine is…
We study the construction of probability densities for time-of-arrival in quantum mechanics. Our treatment is based upon the facts that (i) time appears in quantum theory as an external parameter to the system, and (ii) propositions about…
We consider probabilistic theories in which the most elementary system, a two-dimensional system, contains one bit of information. The bit is assumed to be contained in any complete set of mutually complementary measurements. The…
We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (``universal probability'') as a starting point, and define complexity (an operator) as its negative logarithm. A number of…
Superposition is an essential feature of quantum mechanics. From the Schrodinger's cat to quantum algorithms such as Deutsch-Jorsza algorithm, quantum superposition plays an important role. It is one fundamental and crucial question how to…
Three extensions and reinterpretations of nonclassical probabilities are reviewed. (i) We propose to generalize the probability axiom of quantum mechanics to self-adjoint positive operators of trace one. Furthermore, we discuss the…
A central result in the study of Quantum Hamiltonian Complexity is that the k-Local hamiltonian problem is QMA-complete. In that problem, we must decide if the lowest eigenvalue of a Hamiltonian is bounded below some value, or above…
We revisit the Extended Uncertainty Principle (EUP) from an operational viewpoint, replacing wavefunction-based widths with apparatus-defined position constraints such as a finite slit of width $\Delta x$ or a geodesic ball of radius $R$.…
In accordance with the fact that quantum measurements are described in terms of positive operator measures (POMs), we consider certain aspects of a quantization scheme in which a classical variable $f:\R^2\to \R$ is associated with a unique…