.png){kind=icon}
Return
Computing spin networks
.png){kind=icon}
OA
AI
DOI：10.1016/j.aop.2005.01.005.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We expand a set of notions recently introduced providing the general setting for a universal representation of the quantum structure on which quantum information stands. The dynamical evolution process associated with generic quantum information manipulation is based on the (re)coupling theory of SU(2) angular momenta. Such scheme automatically incorporates all the essential features that make quantum information encoding much more efficient than classical: it is fully discrete; it deals with inherently entangled states, naturally endowed with a tensor product structure; it allows for generic encoding patterns. The model proposed can be thought of as the non-Boolean generalization of the quantum circuit model, with unitary gates expressed in terms of 3nj coefficients connecting inequivalent binary coupling schemes of n + 1 angular momentum variables, as well as Wigner rotations in the eigenspace of the total angular momentum. A crucial role is played by elementary j-gates (6j symbols) which satisfy algebraic identities that make the structure of the model similar to state sum models employed in discretizing topological quantum field theories and quantum gravity. The spin network simulator can thus be viewed also as a Combinatorial QFT model for computation. The semiclassical limit (large j) is discussed. (c) 2005 Elsevier Inc. All rights reserved.
Keywords:
quantum computation
spin networks
topological quantum field theory
Journal
IF:
3
Papers:
5.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
On the variation of dissolution rates at the orthoclase (0 0 1) surface with pH and temperature
PREAI
ShareSaveShareSaveShareSave
View more