Related papers: Quantum Computation and Arrows of Time
Quantum computers are expected to revolutionize our ability to process information. The advancement from classical to quantum computing is a product of our advancement from classical to quantum physics -- the more our understanding of the…
In the first part of this thesis Bell's theorem is revisited. It points at a difference between the quantum and the classical world. This difference is often behind the advantages of solutions using quantum mechanics. New and more general…
Alongside the development of quantum algorithms and quantum complexity theory in recent years, quantum techniques have also proved instrumental in obtaining results in classical (non-quantum) areas. In this paper we survey these results and…
In this research notebook in the four-part, quantum computation and applications, quantum computation and algorithms, quantum communication protocol, and universal quantum computation for quantum engineers, researchers, and scientists, we…
The "problem of time" in canonical quantum gravity refers to the difficulties involved in defining a Hilbert space structure on states -- and local observables on this Hilbert space -- for a theory in which the spacetime metric is treated…
While the microscopic laws of physics are often symmetric under time reversal, most natural processes that we observe are not. The emergent asymmetry between typical and time-reversed processes is referred to as the arrow of time. In…
It is shown that the structures in the universe can be interpreted to show a closed wheel of time, rather than a straight arrow. An analysis in $f(R)$ gravity model has been carried out to show that due to local observations a small arc at…
This article aims to explain some of the basic facts about the questions raised in the title, without the technical details that are available in the literature. We provide a gentle introduction to some rather classical results about…
These notes discuss the quantum algorithms we know of that can solve problems significantly faster than the corresponding classical algorithms. So far, we have only discovered a few techniques which can produce speed up versus classical…
A deterministic, relativistically local and thus classical Bell-type apparatus is reported that violates the Bell-CHSH inequality by introducing a simple local memory element in the detector and by requiring the detector combinations to…
Among the many perplexing results of quantum mechanics is one that contradicts a result from introductory physics: the possibility of finding a quantum particle in a region that would be forbidden classically by energy conservation. An…
Motivated by some recent news, a journalist asks a group of physicists: "What's the meaning of the violation of Bell's inequality?" One physicist answers: "It means that non-locality is an established fact". Another says: "There is no…
Bell's Theorem proved that one cannot in general reproduce the results of quantum theory with a classical, deterministic local model. However, Einstein originally considered the case where one could define an 'element of reality', namely…
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 concept of quantum computing has inspired a whole new generation of scientists, including physicists, engineers, and computer scientists, to fundamentally change the landscape of information technology. With experimental demonstrations…
Quantum non-locality has become a popular term. Yet, its precise meaning, and even its mere existence, is the subject of controversies. The main cause of the controversies is the never ending discussion on the appropriate definitions of…
This paper argues that the requirement of applicableness of quantum linearity to any physical level from molecules and atoms to the level of macroscopic extensional world, which leads to a main foundational problem in quantum theory…
It is possible in principle to construct quantum mechanical observables and unitary operators which, if implemented in physical systems as measurements and dynamical evolution, would contradict the Church-Turing thesis, which lies at the…
Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum computer (Quantum Mechanical Computers, Richard P. Feynman, Foundations of Physics, Vol. 16, No. 6, p597-531, 1986). Feynman's answer…
Quantum computation is frequently mischaracterized as the simultaneous execution of exponentially many classical computations. This article offers a conceptual clarification of why this ``branchwise parallelism'' picture is misleading,…