Abstract

Pretty good state transfer in networks of qubits occurs when a continuous-time quantum walk allows the transmission of a qubit state from one node of the network to another, with fidelity arbitrarily close to 1. We prove that in a Heisenberg chain with n qubits, there is pretty good state transfer between the nodes at the jth and (n − j + 1)th positions if n is a power of 2. Moreover, this condition is also necessary for j = 1. We obtain this result by applying a theorem due to Kronecker about Diophantine approximations, together with techniques from algebraic graph theory.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.