| Author(s): |
Coutinho, Gabriel
;
Godsil, Chris
Total Authors: 2
|
| Document type: | Journal article |
| Source: | QUANTUM INFORMATION & COMPUTATION; v. 17, n. 5-6, p. 495-502, MAY 1 2017. |
| Web of Science Citations: | 2 |
| Abstract | |
We show that deciding whether a graph admits perfect state transfer can be done in polynomial time on a classical computer with respect to the size of the graph. (AU) | |
| FAPESP's process: | 15/16339-2 - Algebraic graph theory methods in quantum information theory and extremal combinatorics, and connections to semidefinite programming |
| Grantee: | Gabriel de Morais Coutinho |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science |
| Grantee: | Carlos Eduardo Ferreira |
| Support Opportunities: | Research Projects - Thematic Grants |