2009/03/31 by Alastair Kay, ALASTAIR KAY · 4 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Computation #Computer science #Constructive #Hamiltonian (control theory) #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum information science #Quantum mechanics #Spins #State (computer science) #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1142/s0219749910006514
published as Int. J. Quantum Inf. 8, 641 (2010) · 18 pages, 6 figures. Although mainly a review, this does contain some minor new results. v2: minor improvements. v3: journal version (to appear in Int. J. Quant. Inform.)
crossref issued 2010/06/01 · crossref published 2010/06/01 · crossref published-print 2010/06/01 · openalex publication_date 2010/06/01 · arxiv created 2010/06/16 · crossref created 2010/07/28 · arxiv updated 2010/08/18 · crossref published-online 2011/11/21 · openalex created_date 2016/06/24 · crossref deposited 2019/08/07 · openalex updated_date 2026/08/05 · crossref indexed 2026/08/06
We review the subject of perfect state transfer — how one designs the (fixed) interactions of a chain of spins so that a quantum state, initially inserted on one end of the chain, is perfectly transferred to the opposite end in a fixed time. The perfect state transfer systems are then used as a constructive tool to design Hamiltonian implementations of other primitive protocols such as entanglement generation and signal amplification in measurements, before showing that, in fact, universal quantum computation can be implemented in this way.