Quantum geometry and quantum algorithms

Simple item page
dc.creatorGarnerone, S.
dc.creatorMarzuoli, A.
dc.creatorRasetti, M.
dc.date2006-07-28
dc.date.accessioned2026-07-07T10:43:01Z
dc.date.available2026-07-07T10:43:01Z
dc.descriptionMotivated by algorithmic problems arising in quantum field theories whose dynamical variables are geometric in nature, we provide a quantum algorithm that efficiently approximates the colored Jones polynomial. The construction is based on the complete solution of Chern-Simons topological quantum field theory and its connection to Wess-Zumino-Witten conformal field theory. The colored Jones polynomial is expressed as the expectation value of the evolution of the q-deformed spin-network quantum automaton. A quantum circuit is constructed capable of simulating the automaton and hence of computing such expectation value. The latter is efficiently approximated using a standard sampling procedure in quantum computation.
dc.descriptionSubmitted to J. Phys. A: Math-Gen, for the special issue ``The Quantum Universe'' in honor of G. C. Ghirardi
dc.identifierhttps://arxiv.org/abs/quant-ph/0607203
dc.identifierhttp://arxiv.org/abs/quant-ph/0607203
dc.identifierJ.Phys.A40:3047-3066,2007
dc.identifierdoi:10.1088/1751-8113/40/12/S10
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/182152
dc.subjectQuantum Physics
dc.subjectGeneral Relativity and Quantum Cosmology
dc.titleQuantum geometry and quantum algorithms
dc.typetext

Files

Collections

arXiv