Related papers: Quantum convolution and quantum correlation algori…
Experimentally, certain degrees of freedom may appear classical because their quantum fluctuations are smaller than the experimental error associated with measuring them. An approximation to a fully quantum theory is described in which the…
Leveraging the extraordinary phenomena of quantum superposition and quantum correlation, quantum computing offers unprecedented potential for addressing challenges beyond the reach of classical computers. This paper tackles two pivotal…
Quantum algorithms offer significant speedups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian…
Most quantum algorithms that give an exponential speedup over classical algorithms exploit the Fourier transform in some way. In Shor's algorithm, sampling from the quantum Fourier spectrum is used to discover periodicity of the modular…
Quantum algorithms are built enabling to find Poincar\'e recurrence times and periodic orbits of classical dynamical systems. It is shown that exponential gain compared to classical algorithms can be reached for a restricted class of…
General relativity required the abandonment of Euclidean geometry. Here we show that quantum theory requires the abandonment of classical logic. We show that the Hilbert space representation of quantum theory is logically inevitable. There…
Quantum physics is a linear theory, so it is somewhat puzzling that it can underlie very complex systems such as digital computers and life. This paper investigates how this is possible. Physically, such complex systems are necessarily…
We show that for two initially excited qubits, interacting via dipole forces and with a common reservoir, entanglement is preceded by the emergence of quantum and classical correlations. After a time lag, entanglement finally starts…
Generalized Fourier transformation between the position and the momentum representation of a quantum state is constructed in a coordinate independent way. The only ingredient of this construction is the symplectic (canonical) geometry of…
Involving only the measurements of commuting observables - the problem-setting and the corresponding solution - quantum algorithms should be subject to classical logic. This would allow flanking their customary quantum description with a…
Many physicists limit oneself to an instrumentalist description of quantum phenomena and ignore the problems of foundation and interpretation of quantum mechanics. This instrumentalist approach results to "specialization barbarism" and mass…
Quantum superposition is normally sustained in a microscopic regime governed by Heisenberg uncertainty principle applicable to a single particle. Quantum correlation between paired particles implies the violation of local realism governed…
The notion of entanglement can be naturally extended from quantum-states to the level of general quantum evolutions. This is achieved by considering multi-partite unitary transformations as elements of a multi-partite Hilbert space and then…
The production and manipulation of quantum correlation protocols will play a central role where the quantum nature of the correlation can be used as a resource to yield properties unachievable within a classical framework is a very active…
The impossibility to clone an unknown quantum state is a powerful principle to understand the nature of quantum mechanics, especially within the context of quantum computing and quantum information. This principle has been generalized to…
The impossibility of perfectly copying (or cloning) an arbitrary quantum state is one of the basic rules governing the physics of quantum systems. The processes that perform the optimal approximate cloning have been found in many cases.…
Quantum correlation includes quantum entanglement and quantum discord. Both entanglement and discord have a common necessary condition--------quantum coherence or quantum superposition. In this paper, we attempt to give an alternative…
The celebrated quantum no-cloning theorem states that an arbitrary quantum state cannot be cloned perfectly. This raises questions about cloning of classical states, which have also attracted attention. Here, we present a physical approach…
Grover search is a well-known quantum algorithm that outperforms any classical search algorithm. It is known that quantum correlations such as entanglement are necessary for the power of quantum computation. But entanglement is not the only…
We identify "proper quantum computation" with computational processes that cannot be efficiently simulated on a classical computer. For optical quantum computation, we establish "no-go" theorems for classes of quantum optical experiments…