Related papers: Quantum Computation vs. Firewalls
There is mounting theoretical evidence that black hole horizons induce decoherence on a quantum system, say a particle, put in a superposition of locations, with the decoherence functional, evaluated after closure of the superposition,…
Coherently manipulating multipartite quantum correlations leads to remarkable advantages in quantum information processing. A fundamental question is whether such quantum advantages persist only by exploiting multipartite correlations, such…
A common belief is that further quantum corrections near the singularity of a large black hole should not substantially modify the semiclassical picture of black hole evaporation; in particular, the outgoing spectrum of radiation should be…
Quantum computers are expected to offer substantial speedups over their classical counterparts and to solve problems that are intractable for classical computers. Beyond such practical significance, the concept of quantum computation opens…
I assess the potential of quantum computation. Broad and important applications must be found to justify construction of a quantum computer; I review some of the known quantum algorithms and consider the prospects for finding new ones.…
A nonrelativistic approach to quantum gravity is studied. At least for weak gravitational fields it should be a valid approximation. Such an approach can be used to point out problems and prospects inherent in a more exact theory of quantum…
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…
Simulation of quantum systems that provide intrinsically fault-tolerant quantum computation is shown to preserve fault tolerance. Errors committed in the course of simulation are eliminated by the natural error-correcting features of the…
Quantum computers will require encoding of quantum information to protect them from noise. Fault-tolerant quantum computing architectures illustrate how this might be done but have not yet shown a conclusive practical advantage. Here we…
One of the main goals in the study of quantum nonlocality is to determine the maximum violation achieved by quantum correlations in a Bell scenario. However, given a Bell inequality, there is no general algorithm to perform this task. As an…
Black hole entropy has been shown by 't Hooft to diverge at the horizon. The region near the horizon is in a thermal state, so entropy is linear to energy which consequently also diverges. We find a similar divergence for the energy of the…
Based on an idea that spatial separation of charge states can enhance quantum coherence, we propose a scheme for quantum computation with quantum bit (qubit) constructed from two coupled quantum dots. Quantum information is stored in…
We give a new theoretical solution to a leading-edge experimental challenge, namely to the verification of quantum computations in the regime of high computational complexity. Our results are given in the language of quantum interactive…
It has been claimed that to close the locality loophole in a Bell experiment, random numbers of quantum origin should be used for selecting the measurement settings. This is how it has been implemented in all recent Bell experiment…
Fault-tolerant schemes can use error correction to make a quantum computation arbitrarily ac- curate, provided that errors per physical component are smaller than a certain threshold and in- dependent of the computer size. However in…
"What are the consequences ... that Fermi particles cannot get into the same state ... " R. P. Feynman wrote of the Pauli exclusion principle, "In fact, almost all the peculiarities of the material world hinge on this wonderful fact." In…
A quantum computer, i.e. utilizing the resources of quantum physics, superposition of states and entanglement, could furnish an exponential gain in computing time. A simulation using such resources is called a quantum simulation. The…
The finiteness of black hole entropy suggest that spacetime is fundamentally discrete, and hints at an underlying relationship between geometry and "information". The foundation of this relationship is yet to be uncovered, but should…
How important is fast measurement for fault-tolerant quantum computation? Using a combination of existing and new ideas, we argue that measurement times as long as even 1,000 gate times or more have a very minimal effect on the quantum…
It is well known that quantum computers are superior to classical computers in efficiently simulating quantum systems. Here we report the first experimental simulation of quantum tunneling through potential barriers, a widespread phenomenon…