Related papers: Quantum teleportation and Grover's algorithm witho…
A well-known feature of quantum mechanics is the secure exchange of secret bit strings which can then be used as keys to encrypt messages transmitted over any classical communication channel. It is demonstrated that this quantum key…
The phenomenon called quantum "teleportation" has been formulated assuming the presence of entangled states and is interpreted as a realization of quantum non-locality. In contrast, correlations from both entanglement and disentanglement…
In a previous paper, we showed that many important quantum information-theoretic phenomena, including the no-cloning and no-broadcasting theorems, are in fact generic in all non-classical probabilistic theories. An exception is…
We consider a generalized quantum teleportation protocol for an unknown qubit using non-maximally entangled state as a shared resource. Without recourse to local filtering or entanglement concentration, using standard Bell-state measurement…
The execution of Grover's quantum search algorithm needs rather limited resources without much fine tuning. Consequently, the algorithm can be implemented in a variety of physical set-ups, which involve wave dynamics but may not need other…
Teleportation of finite dimensional quantum states by a non-local entangled state is studied. For a generally given entangled state, an explicit equation that governs the teleportation is presented. Detailed examples and the roles played by…
We present a general algorithm, based on machine learning, which can create optimal unitary operators to implement quantum teleportation in any system with well-defined set of measurements in a relevant entangled basis. We illustrate it…
Although entanglement is widely considered to be necessary for quantum algorithms to improve on classical ones, Lloyd has observed recently that Grover's quantum search algorithm can be implemented without entanglement, by replacing…
The quantum mechanical no-cloning theorem for pure states is generalized and transfered to the quantum logics with a conditional probability calculus in a rather abstract, though simple and basic fashion without relying on a tensor product…
We introduce a generalized concept of quantum teleportation in the framework of quantum measurement and reversing operation. Our framework makes it possible to find an optimal protocol for quantum teleportation enabling a faithful transfer…
In this paper we address the question as to what extent the quantum-mechanical nature of the process is relevant for teleportation of A spin-1/2 state. For this purpose we analyze the possibility of underpinning teleportation with a…
Recent experiments confirm that quantum teleportation is possible at least for states of photons and nuclear spins. The quantum teleportation is not only a curious effect but a fundamental protocol of quantum communication and quantum…
Teleportation is the most widely discussed application of the basic principles of quantum mechanics. Fundamentally, this process describes the transmission of information, which involves transport of neither matter nor energy. The implicit…
In quantum theory, the modulus-square of the inner product of two normalized Hilbert space elements is to be interpreted as the transition probability between the pure states represented by these elements. A probabilistically motivated and…
A non-Boolean extension of the classical probability model is proposed. The non-Boolean probabilities reproduce typical quantum phenomena. The proposed model is more general and more abstract, but easier to interpret, than the quantum…
The search problem is to find a state satisfying certain properties out of a given set. Grover's algorithm drives a quantum computer from a prepared initial state to the target state and solves the problem quadratically faster than a…
In the framework of an algebraic approach, we consider a quantum teleportation procedure. It turns out that using the quantum measurement nonlocality hypothesis is unnecessary for describing this procedure. We study the question of what…
An algebraic analysis of Grover's quantum search algorithm is presented for the case in which the initial state is an arbitrary pure quantum state of n qubits. This approach reveals the geometrical structure of the quantum search process,…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…
Search-base algorithms have widespread applications in different scenarios. Grover's quantum search algorithms and its generalization, amplitude amplification, provide a quadratic speedup over classical search algorithms for unstructured…