pith. sign in

arxiv: quant-ph/0506266 · v2 · submitted 2005-06-30 · 🪐 quant-ph

The Second Quantized Quantum Turing Machine and Kolmogorov Complexity

classification 🪐 quant-ph
keywords kolmogorovcomplexityquantizedsecondquantumphysicaldefinemachine
0
0 comments X
read the original abstract

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 second quantized Kolmogorov complexity is closer to physical reality and unlike other quantum Kolmogorov complexities it is continuous. We give examples where second quantized and quantum Kolmogorov complexity differ.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.