The Kolmogorov complexity of a physical state is the minimal physical resources required to reproduce that state. We define a second quantized quantum Turing machine and use it to define second quantized Kolmogorov complexity. There are two advantages to our approach our measure of the second quantized Kolmogorov complexity is closer to physical reality and unlike other quantum Kolmogorov complexities, it is continuous. We give examples where the second quantized and quantum Kolmogorov complexity differ. © 2008 World Scientific Publishing Company
While we have intuitive notions of structure and complexity, the formalization of this intuition is ...
We show that there exists a universal quantum Turing machine (UQTM) that can simulate every other QT...
Foundations of the theory of quantum Turing machines are investigated. The protocol for the preparat...
The Kolmogorov complexity of a physical state is the minimal physical resources required to reproduc...
The Kolmogorov complexity of a physical state is the minimal physical resources required to reproduc...
AbstractIn this paper we give a definition for quantum Kolmogorov complexity. In the classical setti...
In this paper, a survey of Kolmogorov complexity is reported. The basics are briefly covered to give...
We give a denition for the Kolmogorov com-plexity of a pure quantum state. In classical in-formation...
Kolmogorov complexity is a measure of the information contained in a binary string. We investigate h...
Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our rst ...
We present a classical probabilistic simulation technique of quantum Turing machines. As a corollary...
Ziel dieser Arbeit ist es, den Begriff der Quanten-Kolmogorov-Komplexität formal zu definieren und s...
We present a classical probabilistic simulation technique of quantum Turing machines. As a corollary...
We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable den...
A simple notion of quantum Turing machine with deterministic, classical control is proposed and show...
While we have intuitive notions of structure and complexity, the formalization of this intuition is ...
We show that there exists a universal quantum Turing machine (UQTM) that can simulate every other QT...
Foundations of the theory of quantum Turing machines are investigated. The protocol for the preparat...
The Kolmogorov complexity of a physical state is the minimal physical resources required to reproduc...
The Kolmogorov complexity of a physical state is the minimal physical resources required to reproduc...
AbstractIn this paper we give a definition for quantum Kolmogorov complexity. In the classical setti...
In this paper, a survey of Kolmogorov complexity is reported. The basics are briefly covered to give...
We give a denition for the Kolmogorov com-plexity of a pure quantum state. In classical in-formation...
Kolmogorov complexity is a measure of the information contained in a binary string. We investigate h...
Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our rst ...
We present a classical probabilistic simulation technique of quantum Turing machines. As a corollary...
Ziel dieser Arbeit ist es, den Begriff der Quanten-Kolmogorov-Komplexität formal zu definieren und s...
We present a classical probabilistic simulation technique of quantum Turing machines. As a corollary...
We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable den...
A simple notion of quantum Turing machine with deterministic, classical control is proposed and show...
While we have intuitive notions of structure and complexity, the formalization of this intuition is ...
We show that there exists a universal quantum Turing machine (UQTM) that can simulate every other QT...
Foundations of the theory of quantum Turing machines are investigated. The protocol for the preparat...