Related papers: On the Physical Explanation for Quantum Computatio…
The quantum speed limit (QSL) time for open system characterizes the most efficient response of the system to the environmental influences. Previous results showed that the non-Markovianity governs the quantum speedup. Via studying the…
Insofar as quantum computation is faster than classical, it appears to be irreversible. In all quantum algorithms found so far the speed-up depends on the extra-dynamical irreversible projection representing quantum measurement. Quantum…
We consider quantum formalism limited by the classical simulating computer with the fixed memory. The memory is redistributed in the course of modeling by the variation of the set of classical states and the accuracy of the representation…
Optimal universal entanglement processes are discussed which entangle two quantum systems in an optimal way for all possible initial states. It is demonstrated that the linear character of quantum theory which enforces the peaceful…
Entanglement is a key ingredient for quantum technologies and a fundamental signature of quantumness in a broad range of phenomena encompassing many-body physics, thermodynamics, cosmology, and life sciences. For arbitrary multiparticle…
We build a framework allowing for a systematic investigation of the issue: "Which quantum states are universal resources for one-way quantum computation?" We start by re-examining what is exactly meant by "universality" in quantum…
An Everett (`Many Worlds') interpretation of quantum mechanics due to Saunders and Zurek is presented in detail. This is used to give a physical description of the process of a quantum computation. Objections to such an understanding are…
The one clean qubit model of quantum computation (DQC1) efficiently implements a computational task that is not known to have a classical alternative. During the computation, there is never more than a small but finite amount of…
Despite rapid recent progress towards the development of quantum computers capable of providing computational advantages over classical computers, it seems likely that such computers will, initially at least, be required to run in a hybrid…
The increasing growth of data volume, and the consequent explosion in demand for computational power, are affecting scientific computing, as shown by the rise of extreme data scientific workflows. As the need for computing power increases,…
An outstanding problem in quantum computing is the calculation of entanglement, for which no closed-form algorithm exists. Here we solve that problem, and demonstrate the utility of a quantum neural computer, by showing, in simulation, that…
A computer, in order to perform a given computation, requires a certain amount of space (memory) and a certain amount of time (runtime). This leaves certain computations beyond reach due to technological limits on processing speed and…
Quantum entanglement, after playing a significant role in the development of the foundations of quantum mechanics, has been recently rediscovered as a new physical resource with potential commercial applications such as, for example,…
Entanglement is not only the most intriguing feature of quantum mechanics, but also a key resource in quantum information science. The entanglement content of random pure quantum states is almost maximal; such states find applications in…
I argue that the many worlds explanation of quantum computation is not licensed by, and in fact is conceptually inferior to, the many worlds interpretation of quantum mechanics from which it is derived. I argue that the many worlds…
The possibility to save and process information in fundamentally indistinguishable states is the quantum mechanical resource that is not encountered in classical computing. I demonstrate that, if energy constraints are imposed, this…
Quantum information theory is a rapidly growing area of math and physics that combines two independent theories, quantum mechanics and information theory. Quantum entanglement is a concept that was first proposed in the EPR paradox. In…
While it seems possible that quantum computers may allow for algorithms offering a computational speed-up over classical algorithms for some problems, the issue is poorly understood. We explore this computational speed-up by investigating…
An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is…
Quantum computers offer a new paradigm of computing with the potential to vastly outperform any imagineable classical computer. This has caused a gold rush towards new quantum algorithms and hardware. In light of the growing expectations…