Quantum geometry and quantum algorithms

From MaRDI portal



Abstract: Motivated 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.











This page was built for publication: Quantum geometry and quantum algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3431658)