Related papers: Notes on the firewall paradox, complexity, and qua…
In the first of this pair of papers, it was proven that that no physical computer can correctly carry out all computational tasks that can be posed to it. The generality of this result follows from its use of a novel definition of…
A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from…
We put forward a possible new interpretation and explanatory framework for quantum theory. The basic hypothesis underlying this new framework is that quantum particles are conceptual entities. More concretely, we propose that quantum…
Parikh and Wilczek formulated Hawking radiation as quantum tunneling across the event horizon proving the spectrum to be nonthermal. These nonthermality factors emerging due to back reaction effects have been claimed to be responsible for…
The question of how long a particle takes to pass through a potential barrier is still a controversial topic in quantum mechanics. Arguably, the main theoretical problem in obtaining estimates for measurable times is the fact that…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
This is an analysis of the recently published article `Quantum theory cannot consistently describe the use of itself' by D. Frauchiger and R. Renner~\cite{1}. Here I decipher the paradox and analyze it from the point of view of de…
Any attempt to introduce probabilities into quantum mechanics faces difficulties due to the mathematical structure of Hilbert space, as reflected in Birkhoff and von Neumann's proposal for a quantum logic. The (consistent or decoherent)…
We discuss models of computing that are beyond classical. The primary motivation is to unearth the cause of nonclassical advantages in computation. Completeness results from computational complexity theory lead to the identification of very…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically…
Recent work by Renou et al. (2021) has led to some controversy concerning the question of whether quantum theory requires complex numbers for its formulation. We promote the view that the main result of that work is best understood not as a…
The Wigner's friend thought experiment was intended to illustrate the difficulty one has in describing an agent as a quantum system when that agent performs a measurement. While it does pose a challenge to the orthodox interpretation of…
Quantum computing promises exponential improvements in solving large systems of partial differential equations (PDE), which forms a bottleneck in high-resolution computational fluid dynamics (CFD) simulations, in, among others, aerospace…
In the early 1930's, Erwin Schroedinger, motivated by his quest for a more classical formulation of quantum mechanics, posed a large deviation problem for a cloud of independent Brownian particles. He showed that the solution to the problem…
In a previous paper we discussed corrections to Hawking radiation from a collapsing shell due to quantum fluctuations of the shell and the resulting horizon. For the computation of the quantum corrections we used several approximations. In…
It is conjectured that in the geometric formulation of quantum computing, one can study quantum complexity through classical entropy of statistical ensembles established non-relativistically in the group manifold of unitary operators. The…
We compare Hawking radiation in a collapse background with Schwinger pair creation in an electric field. The comparison is driven by the presence of an analogue horizon in the Schwinger case, which causally divides spacetime for classical…
Relatively simple but apparently novel ways are proposed for viewing three related subjects: black hole entropy, the black hole information paradox, and time travel paradoxes. (1) Gibbons and Hawking have completely explained the origin of…
Firewalls in black holes are easiest to understand by imposing time reversal invariance, together with a unitary evolution law. The best approach seems to be to split up the time span of a black hole into short periods, during which no…