CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishA quantum algorithm for approximating efficiently three-manifold topological invariants in the framework of SU}(2) Chern-Simons-Witten (CSW) topological quantum field theory at finite values of the coupling constant k is provided. The model of computation adopted is the q-deformed spin network model viewed as a quantum recognizer, where eachbasic unitary transition function can be efficiently processed by a standard quantum circuit. This achievement is an extension of the algorithm for approximating polynomial invariants of colored oriented links found by the authors. Thus all the significant quantities - partition functions and observables - of quantum CSW theory can be processed efficiently on a quantum computer, reflecting the intrinsic, field-theoretic solvability of such theory at finite k. The paper is supplemented by a critical overview of the basic conceptual tools underlying the construction of quantum invariants of links and three-manifolds and connections with algorithmic questions that arise in geometry and quantum gravity models are discussed.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
| Titolo: | Efficient quantum processing of 3-manifold topological invariants | |
| Autori: | ||
| Data di pubblicazione: | 2009 | |
| Rivista: | ||
| Abstract: | A quantum algorithm for approximating efficiently three-manifold topological invariants in the framework of SU}(2) Chern-Simons-Witten (CSW) topological quantum field theory at finite values of the coupling constant k is provided. The model of computation adopted is the q-deformed spin network model viewed as a quantum recognizer, where eachbasic unitary transition function can be efficiently processed by a standard quantum circuit. This achievement is an extension of the algorithm for approximating polynomial invariants of colored oriented links found by the authors. Thus all the significant quantities - partition functions and observables - of quantum CSW theory can be processed efficiently on a quantum computer, reflecting the intrinsic, field-theoretic solvability of such theory at finite k. The paper is supplemented by a critical overview of the basic conceptual tools underlying the construction of quantum invariants of links and three-manifolds and connections with algorithmic questions that arise in geometry and quantum gravity models are discussed. | |
| Handle: | http://hdl.handle.net/11571/33782 | |
| Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
http://hdl.handle.net/11571/33782
Copyright © 2022