Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Aaronson, S.: NP-complete problems and physical reality. ACM SIGACT News (Guest Column) 36(1), 30–52 (2005). arXiv:quant-ph/0502072v2
Brightwell, G.R., Winkler, P.: Note on Counting Eulerian Circuits. CDAM research report LSE-CDAM-2004-12. arXiv:cs/0405067v1 [cs.CC]
Crescenzi, P., Goldman, D., Papadimitriou, C., Piccoboni, A., Yannakakis, M.: On the complexity of protein folding. J. Comput. Biol. 5, 423–466 (1998)
Diestel, R.: Graph theory, (2nd edn.) In: Graduate Texts in Mathematics. Published electronically at ftp://math.uni-hamburg.de/pub/unihh/math/books/diestel. Springer, New York (2000)
Ettinger, M., Hoyer, P.: A Quantum Observable for the Graph Isomorphism Problem. LA-UR-99-179. arXiv:quant-ph/9901029v1
Konopka, T., Markopoulou, F., Severini, S.: Quantum Graphity: a model of emergent locality. Phys. Rev. D 77, 104029 (2008). arXiv:0801.0861v1 [hep-th]
Konopka, T., Markopoulou, F., Smolin, L.: Quantum Graphity. arXiv:hep-th/0611197v1
Lloyd, S.: Programming the Universe: A Quantum Computer Scientist Takes On the Cosmos. Knopf, New York (2006)
Nielsen, M.A.: Computable functions, quantum measurements, and quantum dynamics. Phys. Rev. Lett. 79, 2915–2918 (1997). arXiv:quant-ph/9706006v1
Semenoff, G.W., Szabo, J.R.: Fermionic matrix models. Int. J. Mod. Phys. A 12(12), 2135–2291 (1997)
Troyansky, L., Tishby, N.: Permanent uncertainty: on the quantum computation of the determinant and permanent of a matrix. In: Proceedings of PhysComp96, Boston, 22–24 November 1996
Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 410–421 (1979)
Valiant, L.G.: Quantum computers that can be simulated classically in polynomial time. In: Proceedings of the thirty-third annual ACM symposium on theory of computing, pp. 114–123. ACM, New York (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Markopoulou, F., Severini, S. A Note on Observables for Counting Trails and Paths in Graphs. J Math Model Algor 8, 335–342 (2009). https://doi.org/10.1007/s10852-009-9111-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-009-9111-7