论文信息 - A Note on Observables for Counting Trails and Paths in Graphs

A Note on Observables for Counting Trails and Paths in Graphs

We point out that the total number of trails and the total number of paths of given length, between two vertices of a simple undirected graph, are obtained as expectation values of specifically engineered quantum mechanical observables. Such observables are contextual with some background independent theories of gravity and emergent geometry. Thus, we point out yet another situation in which the mathematical formalism of a physical theory has some computational aspects involving intractable problems.

Simone Severini | Fotini Markopoulou

[1] Reinhard Diestel,et al. Graph Theory , 1997 .

[2] Peter Winkler,et al. Note on Counting Eulerian Circuits , 2004, ArXiv.

[3] Simone Severini,et al. Quantum graphity: A model of emergent locality , 2008, 0801.0861.

[4] P. Høyer,et al. A Quantum Observable for the Graph Isomorphism Problem , 1999, quant-ph/9901029.

[5] Leslie G. Valiant,et al. Quantum computers that can be simulated classically in polynomial time , 2001, STOC '01.

[6] Mihalis Yannakakis,et al. On the Complexity of Protein Folding , 1998, J. Comput. Biol..

[7] M. A. Nielsen. Computable Functions, Quantum Measurements, and Quantum Dynamics , 1997 .

[8] Richard J. Szabo,et al. Fermionic matrix models , 1997 .

[9] Scott Aaronson,et al. Guest Column: NP-complete problems and physical reality , 2005, SIGA.

[10] S. Lloyd. Programming the Universe: A Quantum Computer Scientist Takes on the Cosmos , 2006 .

[11] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[12] Scott Aaronson,et al. NP-complete Problems and Physical Reality , 2005, Electron. Colloquium Comput. Complex..