Combinatorial Algebra for second-quantized Quantum Theory

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Abstract

We describe an algebra G of diagrams which faithfully gives a diagrammatic representation of the structures of both the Heisenberg-Weyl algebra H - the associative algebra of the creation and annihilation operators of quantum mechanics - and U(L_H), the enveloping algebra of the Heisenberg Lie algebra L_H. We show explicitly how G may be endowed with the structure of a Hopf algebra, which is also mirrored in the structure of U(L_H). While both H and U(L_H) are images of G, the algebra G has a richer structure and therefore embodies a finer combinatorial realization of the creation-annihilation system, of which it provides a concrete model.

Related collections

Most cited references 6

Record: found
Abstract: found
Article: found

Is Open Access

In defense of the epistemic view of quantum states: a toy theory

Robert W Spekkens (2004)

We present a toy theory that is based on a simple principle: the number of questions about the physical state of a system that are answered must always be equal to the number that are unanswered in a state of maximal knowledge. A wide variety of quantum phenomena are found to have analogues within this toy theory. Such phenomena include: the noncommutativity of measurements, interference, the multiplicity of convex decompositions of a mixed state, the impossibility of discriminating nonorthogonal states, the impossibility of a universal state inverter, the distinction between bi-partite and tri-partite entanglement, the monogamy of pure entanglement, no cloning, no broadcasting, remote steering, teleportation, dense coding, mutually unbiased bases, and many others. The diversity and quality of these analogies is taken as evidence for the view that quantum states are states of incomplete knowledge rather than states of reality. A consideration of the phenomena that the toy theory fails to reproduce, notably, violations of Bell inequalities and the existence of a Kochen-Specker theorem, provides clues for how to proceed with this research program.

0 comments Cited 97 times – based on 0 reviews

Preprint

     Review now

Bookmark

Record: found
Abstract: not found
Book Chapter: not found

From Finite Sets to Feynman Diagrams

John Baez, James Dolan (2001)

0 comments Cited 24 times – based on 0 reviews

Bookmark

Record: found
Abstract: found
Article: found

Is Open Access

Computing Spin Networks

, (2004)

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's) is discussed.