Related papers: Quantum teleportation and Grover's algorithm witho…
Quantum teleportation is considered a basic primitive in many quantum information processing tasks and has been experimentally confirmed in various photonic and matter-based setups. Here, we consider teleportation of quantum information…
We give a dimension independent formulation of the quantum search algorithm introduced in [L. K. Grover, Phys. Rev. Lett. {\bf 79}, 325 (1997)]. This algorithm provides a quadratic gain when compared to its classical counterpart by…
Understanding the relation between the different forms of inseparability in quantum mechanics is a longstanding problem in the foundations of quantum theory and has implications for quantum information processing. Here we make progress in…
It is argued that the so-called holographic principle will obstruct attempts to produce physically realistic models for the unification of general relativity with quantum mechanics, unless determinism in the latter is restored. The notion…
Quantum states can in a sense be thought of as generalizations of classical probability distributions, but are more powerful than probability distributions when used for computation or communication. Quantum speedup therefore requires some…
Possibly, teleportation is the most representative quantum algorithm in the public domain. Nevertheless than this quantum procedure transmits only information than objects, its coverage is still very limited and easily subject to errors.…
Quantum teleportation is possible because entanglement allows a definition of precise correlations between the non-commuting properties of a local system and corresponding non-commuting properties of a remote system. In this paper, the…
Quantum algorithms use the principles of quantum mechanics, as for example quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimisation,…
The quantum teleportation protocol is extracted directly out of a standard classical circuit that exchanges the states of two qubits using only controlled-NOT gates. This construction of teleportation from a classically transparent circuit…
A new approach to the classical limit of Grover's algorithm is discussed by assuming a very rapid dephasing of a system between consecutive Grover's unitary operations, which drives pure quantum states to decohered mixed states. One can…
We show that quantum entanglement states are associated with multilinear polynomials that cannot be factored. By using these multilinear polynomials, we propose a geometric representation for entanglement states. In particular, we show that…
It is known that non-commuting observables in quantum mechanics do not have joint probability. This statement refers to the precise (additive) probability model. I show that the joint distribution of any non-commuting pair of variables can…
We construct the most general form of our previously proposed nonlinear extension of quantum mechanics that possesses three basic properties. Unlike the simpler model, the new version is not completely integrable, but it has an underlying…
Quantum algorithms and circuits can, in principle, outperform the best non-quantum (classical) techniques for some hard computational problems. However, this does not necessarily lead to useful applications. To gauge the practical…
The underlying probabilistic theory for quantum mechanics is non-Kolmogorovian. The order in which physical observables will be important if they are incompatible (non-commuting). In particular, the notion of conditioning needs to be…
We find that quantum teleportation, using the thermally entangled state of two-qubit Heisenberg XX chain as a resource, with fidelity better than any classical communication protocol is possible. However, a thermal state with a greater…
Traditional tree search algorithms supply a blueprint for modeling problem solving behaviour. A diverse spectrum of problems can be formulated in terms of tree search. Quantum computation, in particular Grover's algorithm, has aroused a…
We report the implementation of Grover's quantum search algorithm in the scalable system of trapped atomic ion quantum bits. Any one of four possible states of a two-qubit memory is marked, and following a single query of the search space,…
Partial teleportation of entanglement is to teleport one particle of an entangled pair through a quantum channel. This is conceptually equivalent to quantum swapping. We consider the partial teleportation of entanglement in the noisy…
Quantum teleportation is the name of a problem: how can the real-valued parameters encoding the state at Alice's location make their way to Bob's location via shared entanglement and only two bits of classical communication? Without an…