Related papers: Quantum teleportation and Grover's algorithm witho…
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…
Entanglement of quantum variables is usually thought to be a prerequisite for obtaining quantum speed-ups of information processing tasks such as searching databases. This paper presents methods for quantum search that give a speed-up over…
We show how an arbitrary qubit rotation can be teleported, albeit probabilistically, using 1 e-bit of entanglement and one classical bit. We use this to present a scheme for implementing quantum secret sharing. The scheme operates…
We derive essential elements of quantum mechanics from a parametric structure extending that of traditional mathematical statistics. The basic setting is a set $\mathcal{A}$ of incompatible experiments, and a transformation group $G$ on the…
In port-based teleportation, Alice teleports an unknown quantum state to one of N ports at Bob's site. Alice applies a measurement and sends Bob the outcome k. Bob only needs to select the kth port in order to obtain the state. We present a…
Grover's quantum search and its generalization, quantum amplitude amplification, provide quadratic advantage over classical algorithms for a diverse set of tasks, but are tricky to use without knowing beforehand what fraction $\lambda$ of…
We analyze three different quantum search algorithms, the traditional Grover's algorithm, its continuous-time analogue by Hamiltonian evolution, and finally the quantum search by local adiabatic evolution. We show that they are closely…
Quantum theory does not provide a unique definition for the joint probability of two non-commuting observables, which is the next important question after the Born's probability for a single observable. Instead, various definitions were…
We report on the possibility of teleportation of a quantum particle, a distinctly different phenomenon from the teleportation of a quantum state through entanglement. With the first meaning, teleportation is theoretically possible by…
We describe a simulation method for a quantum spin model of a generic, general purpose quantum computer. The use of this quantum computer simulator is illustrated through several implementations of Grover's database search algorithm. Some…
We propose a non-Hermitian quantum annealing algorithm which can be useful for solving complex optimization problems. We demonstrate our approach on Grover's problem of finding a marked item inside of unsorted database. We show that the…
Quantum Teleportation is the key communication functionality of the Quantum Internet, allowing the "transmission' of qubits without either the physical transfer of the particle storing the qubit or the violation of the quantum mechanical…
It is known that if the shared resource is a maximally entangled state then it is possible to teleport an unknown state with unit fidelity and unit probability. However, if the shared resource is a non-maximally entangled state then one has…
The standard quantum teleportation scheme is deconstructed, and those aspects of it that appear remarkable and "non-classical" are identified. An alternative teleportation scheme, involving only classical states and classical information,…
A generalized quantum search algorithm, where phase inversions for the marked state and the prepared state are replaced by $\pi/2$ phase rotations, is realized in a 2-qubit NMR heteronuclear system. The quantum algorithm searches a marked…
Quantum teleportation and quantum memory are two crucial elements for large-scale quantum networks. With the help of prior distributed entanglement as a "quantum channel", quantum teleportation provides an intriguing means to faithfully…
Distributed quantum computation is a practical method for large-scale quantum computation on quantum processors with limited size. It can be realized by direct quantum channels in flying qubits. Moreover, the pre-established quantum…
In this paper we investigate the entanglement nature of quantum states generated by Grover's search algorithm by means of algebraic geometry. More precisely we establish a link between entanglement of states generated by the algorithm and…
The phenomenon of quantum entanglement is fundamental to the implementation of quantum computation, and requires at least two qubits for its demonstration. However, both Deutsch algorithm and Grover's search algorithm for two bits do not…
Grover's search algorithm is designed to be executed on a quantum mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides a…