zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Quantum geometry and quantum algorithms. (English) Zbl 1110.81157
Summary: 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 coloured Jones polynomial. The construction is based on the complete solution of the Chern-Simons topological quantum field theory and its connection to Wess-Zumino-Witten conformal field theory. The coloured 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 an expectation value. The latter is efficiently approximated using a standard sampling procedure in quantum computation.
81T80Simulation and numerical modelling (quantum field theory)
81P68Quantum computation
81R50Quantum groups and related algebraic methods in quantum theory
81Q60Supersymmetry and quantum mechanics