Coined quantum walks lift the cospectrality of graphs and trees

Pattern Recognition

Volumn 42, Issue 9, 2009, Pages 1988-2002

  Emms, David ^a   Severini, Simone ^b   Wilson, Richard C ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Cospectrality; Graph matching; Graph spectra; Quantum walks; Strongly regular graphs; Unitary representations

Indexed keywords

COSPECTRALITY; GRAPH MATCHING; GRAPH SPECTRA; QUANTUM WALKS; STRONGLY REGULAR GRAPHS; UNITARY REPRESENTATIONS;

MATRIX ALGEBRA; PATTERN MATCHING; POLYNOMIAL APPROXIMATION; QUANTUM COMPUTERS; SET THEORY; STANDARDS;

GRAPH THEORY;

EID: 67349095041     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2008.10.025     Document Type: Article

References (41)

1. L. Grover, A fast quantum mechanical algorithm for database search, in: Proceedings of the 28th Annual ACM Symposium on the Theory of Computation, New York, NY, ACM Press, New York, 1996, pp. 212-219.
2. Shor P.W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26 (1997) 1484-1509
3. Nielson M.A., and Chuang I.L. Quantum Computing and Quantum Information (2000), Cambridge University Press, Cambridge
4. Braunstein S.L. Quantum teleportation without irreversible detection. Phys. Rev. A (1996) 1900-1903
5. A. Robles-Kelly, E.R. Hancock, Edit distance from graph spectra, in: Proceedings of the IEEE International Conference on Computer Vision, 2003, pp. 234-241.
6. L. Lovász, Random Walks on Graphs: A Survey, Combinatorics, Paul Erdös is Eighty, vol. 2, János Bolyai Mathematical Society, Budapest, 1996, pp. 353-398.
7. Sinclair A. Algorithms for Random Generation and Counting: A Markov Chain Approach (1993), Birkhauser Verlag, Boston
8. Doyle P., and Snell J. Random Walks and Electrical Networks (1984), Mathematical Association of America, Washington
9. Brin S., and Page L. The anatomy of a large-scale hypertextual Web search engine. Comput. Networks ISDN Syst. 30 1-7 (1998) 107-117
10. Robles-Kelly A., and Hancock E.R. String edit distance, random walks and graph matching. Int. J. Pattern Recognition Artif. Intell. 18 3 (2004) 315-327
11. Sarti L., Maggini M., and Gori M. Exact and approximate graph matching using random walks. IEEE Trans. Pattern Anal. Mach. Intell. 27 7 (2005) 1100-1111
12. Cameron P.J. Strongly regular graphs. Topics in Algebraic Graph Theory (2004), Cambridge University Press, Cambridge 203-221
13. Schwenk A.J. Almost all trees are cospectral. In: Harary F. (Ed). New Directions in the Theory of Graphs (1973), Academic Press, New York 275-307
14. Merris R. Almost all trees are coimmanantal. Linear Algebra Appl. 150 (1991) 61-66
15. Kempe J. Quantum random walks-an introductory overview. Contemp. Phys. 44 4 (2003) 307-327
16. Ambainis A. Quantum walks and their algorithmic applications. Int. J. Quantum Inf. 1 (2003) 507-518
17. Shenvi N., Kempe J., and Whaley K.B. A quantum random walk search algorithm. Phys. Rev. A 67 5 (2003)
18. Childs A., Farhi E., and Gutmann S. An example of the difference between quantum and classical random walks. Quantum Inf. Process. 1 (2002) 35
19. J. Kempe, Quantum random walks hit exponentially faster, in: Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM'03), 2003, pp. 354-369.
20. A. Ambainis, Quantum walk algorithm for element distinctness, in: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), 2004.
21. Kwiat P., Mitchell J.R., Schwindt P.D.D., and White A.G. Grover's search algorithm: an optical approach. J. Mod. Opt. 47 (2000) 257
22. Cirac J., Zoller P., Kimble H.J., and Mabuchi H. Quantum state transfer and entanglement distribution among distant nodes in a quantum network. Phys. Rev. Lett. 78 (1997) 3221-3224
23. J.R. Norris, Markov Chains, Cambridge University Press, Cambridge, July 1998.
24. D. Aharonov, A. Ambainis, J. Kempe, U. Vazirani, Quantum walks on graphs, in: STOC '01: Proceedings of ACM Theory of Computing, ACM Press, New York, 2001, pp. 50-59.
25. A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, J. Watrous, One-dimensional quantum walks, in: Proceedings of 33th STOC, New York, NY, ACM, New York, 2001, pp. 60-69.
26. A. Nayak, A. Vishwanath, Quantum walk on a line, DIMACS Technical Report 2000-43, 2000.
27. D.M. Emms, Analysis of graph structure using quantum walks, Ph.D. Thesis, University of York, 2008.
28. Severini S. On the structure of the adjacency matrix of the line digraph of a regular digraph. Discrete Appl. Math. 154 12 (2006) 1663-1665
29. R. Mathon, Sample graphs for isomorphism testing, in: 9th Southeastern Conference on Combinatorics, vol. 21, 1978, pp. 499-517.
30. Torsello A., Hidovic-Rowe D., and Pelillo M. Polynomial-time metrics for attributed trees. IEEE Trans. Pattern Anal. Mach. Intell. 27 7 (2005) 1087-1099
31. S. Nene, S. Nayar, H. Murase, Columbia object image library: COIL, 1996.
32. C. Harris, M. Stephens, A combined corner and edge detector, in: Proceedings of 4th Alvey Vision Conference, Manchester, vol. 15, 1988, pp. 147-151.
33. E. Spence, Strongly regular graphs, 2006 〈http://www.maths.gla.ac.uk/es/srgraphs.html〉.
34. C.J. Colbourn, J.H. Dinitz (Eds.), The CRC Handbook of Combinatorial Designs, CRC Press, New York, 1996.
35. Colbourn C.J., and van Oorschot P.C. Applications of combinatorial designs in computer science. ACM Comput. Surv. 21 2 (1989) 223-250
36. Colbourn M.J., and Colbourn C.J. Concerning the complexity of deciding isomorphism of block designs. Discrete Appl. Math. 3 (1981) 155-162
37. G. Royle, Strongly Regular Graphs, 2006 〈http://www.csse.uwa.edu.au/gordon/remote/designs/index.html〉.
38. D. Spielman, Faster isomorphism testing of strongly regular graphs, in: STOC '96: Proceedings of 28th ACM Symposium on Theory of Computing, New York, NY, USA, ACM Press, New York, 1996, pp. 576-584.
39. Shokoufandeh A., Macrini D., Dickinson S., Siddiqi K., and Zucker S. Indexing hierarchical structures using graph spectra. IEEE Trans. Pattern Anal. Mach. Intell. 27 7 (July 2005)
40. P. Zhu, R. Wilson, A study of graph spectra for comparing graphs, in: Proceedings of the 16th British Machine Vision Conference, Oxford, 2005, pp. 499-517.
41. Webb A. Statistical Pattern Recognition. second ed. (2002), Wiley, Chichester, England