Switching and partially switching the hypercube while maintaining perfect state transfer
Autor: | Sarah Plosker, Xiaohong Zhang, Steve Kirkland |
---|---|
Přispěvatelé: | University of Manitoba |
Rok vydání: | 2019 |
Předmět: |
Nuclear and High Energy Physics
Structure (category theory) FOS: Physical sciences General Physics and Astronomy Context (language use) Topology Theoretical Computer Science symbols.namesake FOS: Mathematics Quantum system Mathematics - Combinatorics Sensitivity (control systems) Quantum Mathematical Physics Mathematics Quantum Physics 05C50 15A18 81Q10 Statistical and Nonlinear Physics Computational Theory and Mathematics symbols Combinatorics (math.CO) Hypercube Perfect state transfer Quantum Physics (quant-ph) Hamiltonian (quantum mechanics) quantum State transfer. Perfect state transfer. Adjacency matrices. Hypercubes. Godsil-McKay switching |
Zdroj: | Quantum Information and Computation. 19:541-554 |
ISSN: | 1533-7146 |
Popis: | A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with respect to inter-qubit interactions of a quantum system. We perform various perturbations to the hypercube graph---a graph that is known to exhibit PST---to create graphs that maintain many of the same properties of the hypercube, including PST as well as the distance for which PST occurs. We show that the sensitivity with respect to readout time errors remains unaffected for the vertices involved in PST. We give motivation for when these perturbations may be physically desirable or even necessary. 16 pages, 1 figure; many changes to improve presentation since earlier version |
Databáze: | OpenAIRE |
Externí odkaz: |