Sabanci University · 2015 · 20 citations · 43 references
ComputingComputer SciencePhysicsMathematical PhysicsQuantum ComputingQuantum MechanicsQuantum BitsQuantum ComputationQuantum StatesQuantum State TransferQuantum WalksQubit BiasingState Transfer
We propose a scheme for perfect transfer of an unknown qubit state via the discrete-time quantum walk on a line or a circle. For this purpose, we introduce an additional coin operator which is applied at the end of the walk. This operator does not depend on the state to be transferred. We show that perfect state transfer over an arbitrary distance can be achieved only if the walk is driven by an identity or a flip coin operator. Other biased coin operators and the Hadamard coin allow perfect state transfer over finite distances only. Furthermore, we show that quantum walks ending with a perfect state transfer are periodic.
43
Yakir Aharonov, L. Davidovich, N. Zagury · Physical Review A · 1993 · 1.6K citations
Quantum Communication through an Unmodulated Spin Chain
Sougato Bose · Physical Review Letters · 2003 · 1.4K citations · Full text
Quantum random walks: An introductory overview
Contemporary Physics · 2003 · 1.4K citations · Full text
Quantum computation and decision trees
Edward Farhi, Sam Gutmann · Physical Review A · 1998 · 1.3K citations · Full text
Perfect State Transfer in Quantum Spin Networks
Matthias Christandl, Nilanjana Datta, Artur Ekert et al. · Physical Review Letters · 2004 · 1.2K citations · Full text
Computing, Computer Science, Physics +15