In this paper, we propose a protocol that can produce perfect copy of an unknown d-dimensional equatorial quantum state with assistance from a state preparer. In this protocol, the maximally and non-maximally entangle...In this paper, we propose a protocol that can produce perfect copy of an unknown d-dimensional equatorial quantum state with assistance from a state preparer. In this protocol, the maximally and non-maximally entangled bipartite d-dimensional of states are used as the quantum channels, respectively. The first stage of the protocol requires usual teleportation. In the second stage of the protocol, with the assistance of the preparer, the perfect copy of an original unknown state can be produced.展开更多
We put forward an alternative quantum algorithm for finding ttamiltonian cycles in any N-vertex graph based on adiabatic quantum computing. With a yon Neumann measurement on the final state, one may determine whether ...We put forward an alternative quantum algorithm for finding ttamiltonian cycles in any N-vertex graph based on adiabatic quantum computing. With a yon Neumann measurement on the final state, one may determine whether there is a HamiRonian cycle in the graph and pick out a cycle if there is any. Although the proposed algorithm provides a quadratic speedup, it gives an alternative algorithm based on adiabatic quantum computation, which is of interest because of its inherent robustness.展开更多
文摘In this paper, we propose a protocol that can produce perfect copy of an unknown d-dimensional equatorial quantum state with assistance from a state preparer. In this protocol, the maximally and non-maximally entangled bipartite d-dimensional of states are used as the quantum channels, respectively. The first stage of the protocol requires usual teleportation. In the second stage of the protocol, with the assistance of the preparer, the perfect copy of an original unknown state can be produced.
文摘We put forward an alternative quantum algorithm for finding ttamiltonian cycles in any N-vertex graph based on adiabatic quantum computing. With a yon Neumann measurement on the final state, one may determine whether there is a HamiRonian cycle in the graph and pick out a cycle if there is any. Although the proposed algorithm provides a quadratic speedup, it gives an alternative algorithm based on adiabatic quantum computation, which is of interest because of its inherent robustness.
