Perfect state transfer and efficient quantum routing: a discrete-time quantum walk approach
classification
🪐 quant-ph
keywords
quantumstatewalkarbitrarydiscrete-timeinformationnetworkperfect
read the original abstract
We show a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flippings, and extend this method to distribution of an arbitrary unknown multi-qubit entangled state between every pair of sites in the multi-dimensional network. Furthermore, we study the routing of quantum information on this network in a quantum walk architecture, which can be used as quantum information processors to communicate between separated qubits.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.