Related papers: Ultimate physical limits to computation
This essay explores the limits of Turing machines concerning the modeling of minds and suggests alternatives to go beyond those limits.
Looking at physical systems as computers allows us to regard physical properties, such as thermal noise, symmetry or topology, as unconventional resources for computation. However, harnessing these resources requires programming…
This book is the final version of a course on algorithmic information theory and the epistemology of mathematics and physics. This is camera-ready copy prepared for publication as a book, but at the last minute I decided to publish it…
The anthropic principle is an inevitable constraint on the space of possible theories. As such it is central to determining the limits of physics. In particular, we contend that what is ultimately possible in physics is determined by…
Quantum computers take advantage of interfering quantum alternatives in order to handle problems that might be too time consuming with algorithms based on classical logic. Developing quantum computers requires new ways of thinking beyond…
Vagueness is something everyone is familiar with. In fact, most people think that vagueness is closely related to language and exists only there. However, vagueness is a property of the physical world. Quantum computers harness…
Inspired by the work of Feynman, Deutsch, We formally propose the theory of physical computability and accordingly, the physical complexity theory. To achieve this, a framework that can evaluate almost all forms of computation using various…
Quantum speed limits set an upper bound to the rate at which a quantum system can evolve. Adopting a phase-space approach we explore quantum speed limits across the quantum to classical transition and identify equivalent bounds in the…
We propose to "boost" the speed of communication and computation by immersing the computing environment into a medium whose index of refraction is smaller than one, thereby trespassing the speed-of-light barrier.
According to the universal entropy bound, the entropy (and hence information capacity) of a complete weakly self-gravitating physical system can be bounded exclusively in terms of its circumscribing radius and total gravitating energy. The…
Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can…
When working to understand quantum systems engineering, there are many constraints to building a scalable quantum computer. Here I discuss a constraint on the qubit control system from an information point of view, showing that the large…
Three limits to the physical world (quantum physics, gravity and dark energy) are presented on a triangular diagram having as summits the Planck scale, the Universe and a neutrino-like object.
Energy-dependent speeds of light have been considered an observable signature of quantum gravity effects. The two simplest dispersion relationships produce either linear or quadratic corrections, in particle energy, to the photon speed. The…
Quantum computing relies on processing information within a quantum system with many continuous degrees of freedom. The practical implementation of this idea requires complete control over all of the 2^n independent amplitudes of a…
Within the setting of the AdS/CFT correspondence, we ask about the power of computers in the presence of gravity. We show that there are computations on $n$ qubits which cannot be implemented inside of black holes with entropy less than…
Optimal control theory is a promising candidate for a drastic improvement of the performance of quantum information tasks. We explore its ultimate limit in paradigmatic cases, and demonstrate that it coincides with the maximum speed limit…
Recent advances in quantum resource theories have been driven by the fact that many quantum information protocols make use of different facets of the same physical features, e.g. entanglement, coherence, etc. Resource theories formalise the…
The bandwidth of a signal is an important physical property that is of relevance in many signal- and information-theoretic applications. In this paper we study questions related to the computability of the bandwidth of computable…
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…