相关论文: Computability at the Planck scale

We have found that the hierarchial problems appearing in cosmology is a manifestation of the quantum nature of the universe. The universe is still described by the same formulae that once hold at Planck's time. The universe is found to be…

We argue that a quantum aether is consistent with the principle of relativity and can provide an economical way of having an invariant quantum gravity or Planck scale. We also show that it may change the effective scale at which quantum…

The field of quantum algorithms aims to find ways to speed up the solution of computational problems by using a quantum computer. A key milestone in this field will be when a universal quantum computer performs a computational task that is…

Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…

The theory of quantum computation is presented in a self contained way from a computer science perspective. The basics of classical computation and quantum mechanics is reviewed. The circuit model of quantum computation is presented in…

The relationship between brains and computers is often taken to be merely metaphorical. However, genuine computational systems can be implemented in virtually any media; thus, one can take seriously the view that brains literally compute.…

The gap between classical mechanics and quantum mechanics has an important interpretive implication: the Universe must have an irreducible fundamental level, which determines the properties of matter at higher levels of organization. We…

In this first of two papers, strong limits on the accuracy of physical computation are established. First it is proven that there cannot be a physical computer C to which one can pose any and all computational tasks concerning the physical…

Although classical mechanics and quantum mechanics are separate disciplines, we live in a world where Planck's constant \hbar>0, meaning that the classical and quantum world views must actually {\it coexist}. Traditionally, canonical…

The classical view of epistemic logic is that an agent knows all the logical consequences of their knowledge base. This assumption of logical omniscience is often unrealistic and makes reasoning computationally intractable. One approach to…

It is shown that quantum logic is a logic in the very same way in which classical logic is a logic. Soundness and completeness of both quantum and classical logics have been proved for novel lattice models that are not orthomodular and…

A quantum system subject to external fields is said to be controllable if these fields can be adjusted to guide the state vector to a desired destination in the state space of the system. Fundamental results on controllability are reviewed…

As computability implies value definiteness, certain sequences of quantum outcomes cannot be computable.

When one takes into account gravitation, the measurement of space and time cannot be carried out with infinite accuracy. When quantum mechanics is reformulated taking into account this lack of accuracy, the resolution of the measurement…

The discovery of an algorithm for factoring which runs in polynomial time on a quantum computer has given rise to a concerted effort to understand the principles, advantages, and limitations of quantum computing. At the same time, many…

All existing experimental results are currently interpreted using classical geometry. However, there are theoretical reasons to suspect that at a deeper level, geometry emerges as an approximate macroscopic behavior of a quantum system at…

Quantum computers are considered as a part of the family of the reversible, lineary-extended, dynamical systems (Quanputers). For classical problems an operational reformulation is given. A universal algorithm for the solving of classical…

Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strategies is crucial to harness the full potential of quantum…

In contrast with software-generated randomness (called pseudo-randomness), quantum randomness is provable incomputable, i.e.\ it is not exactly reproducible by any algorithm. We provide experimental evidence of incomputability --- an…

Manin, Feynman, and Deutsch have viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum logic circuits and quantum Turing machines has shown how these machines can simulate an…