Pretty good state transfer among large sets of vertices
In a continuous-time quantum walk on a network of qubits, pretty good state transfer is the phenomenon of state transfer between two vertices with fidelity arbitrarily close to 1. We construct families of graphs to demonstrate that there is no bound on the size of a set of vertices that admits pretty good state transfer between any two vertices of the set.Mathematics Subject Classifications: 05C50, 05C38Keywords: Continuous-time quantum walks, pretty good state transfer
Authors
- Ada Chan (ORCID: https://orcid.org/0000-0001-9310-034X)
- Peter Sin (ORCID: https://orcid.org/0000-0003-4493-7631)
Publication Details
- Journal
- Combinatorial Theory
- Published
- 2024-09-27
- DOI
- https://doi.org/10.5070/c64264238
- Citations
- 2
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.69
Funders
- University of Waterloo
- Universidade Federal de Minas Gerais
- Natural Sciences and Engineering Research Council of Canada