Related papers: Quantum teleportation and Grover's algorithm witho…
The principle of teleportation can be used to perform a quantum computation even before its quantum input is defined. The basic idea is to perform the quantum computation at some earlier time with qubits which are part of an entangled…
Grover's quantum search algorithm drives a quantum computer from a prepared initial state to a desired final state by using selective transformations of these states. Here, we analyze a framework when one of the selective trasformations is…
The tomographic invertable map of the Wigner function onto the positive probability distribution function is studied. Alternatives to the Schr\"odinger evolution equation and to the energy level equation written for the positive probability…
Quantum teleportation provides a "disembodied" way to transfer quantum states from one object to another at a distant location, assisted by priorly shared entangled states and a classical communication channel. In addition to its…
The academic research into entanglement nicely illustrates the interplay between fundamental science and applications, and the need to foster both aspects to advance either one. For instance, the possibility to distribute entangled photons…
The possibility of teleportation is by sure the most interesting consequence of quantum non-separability. So far, however, teleportation schemes have been formulated by use of state vectors and considering individual entities only. In the…
We investigate the lower bound of the amount of entanglement for faithfully teleporting a quantum state belonging to a subset of the whole Hilbert space. Moreover, when the quantum state belongs to a set composed of two states, a…
New convenient thumbrules are obtained to test entanglement of wavefunctions for bipartite qubit and qutrit systems. All results are analytic. The new results are: (a) For bipartite qubit systems there exists a matrix $A$ for which $\det A…
The relations of antilinear maps, bipartite states and quantum channels is summarized. Antilinear maps are applied to describe bipartite states and entanglement. Teleportation is treated in this general formalism with an emphasis on…
We recast Grover's generalised search algorithm in a geometric language even when the states are not approximately orthogonal. We provide a possible search algorithm based on an arbitrary unitary transformation which can speed up the steps…
In this paper, a modified formulation of generalized probabilistic theories that will always give rise to the structure of Hilbert space of quantum mechanics, in any finite outcome space, is presented and the guidelines to how to extend…
An explicit quantum circuit is given to implement quantum teleportation. This circuit makes teleportation straightforward to anyone who believes that quantum computation is a reasonable proposition. It could also be genuinely used inside a…
We present a generalization of quantum teleportation that distributes quantum information from a sender's $d$-level particle to $N_o$ particles held by remote receivers via an initially shared multiparticle entangled state. This entangled…
There are major advantages in a newer version of Grover's quantum algorithm utilizing a general unitary transformation in the search of a single object in a large unsorted database. In this paper, we generalize this algorithm to multiobject…
One of the significant breakthroughs in quantum computation is Grover's algorithm for unsorted database search. Recently, the applications of Grover's algorithm to solve global optimization problems have been demonstrated, where unknown…
Grover's algorithm for quantum search can also be applied to classical energy transfer. The procedure takes a system in which the total energy is equally distributed among $N$ subsystems and transfers most of the it to one marked subsystem.…
We propose and analyze a setup to tailor the wave functions of the quantum states. Our setup is based on the quantum teleportation circuit, but instead of the usual two-mode squeezed state, two-mode non-Gaussian entangled state is used.…
Grover's quantum search algorithm can be formulated as a quantum particle randomly walking on the (highly symmetric) complete graph, with one vertex marked by a nonzero potential. From an initial equal superposition, the state evolves in a…
Quantum theory can be regarded as a non-commutative generalization of classical probability. From this point of view, one expects quantum dynamics to be analogous to classical conditional probabilities. In this paper, a variant of the…
We provide an alternative simple proof of the necessity of entanglement in quantum teleportation by using the no-disentanglement theorem. We show that this is true even when the state to be teleported is known to be among two noncommuting…