Kochen-Specker Algorithms for Qunits

Details Kochen-Specker Algorithms for Qunits Kochen-Specker Algorithms for Qunits

2004-12-25

arxiv.org/abs/quant-ph/0412197v1

Physics

Quantum Physics

4 pages, 4 figures, appeared in Barnett, S.M., Andersson, E., Jeffers, J., Ohberg, P., and Hirota, O., (Eds), QCMC 2004. Quant

Scientific paper

Algorithms for finding arbitrary sets of Kochen-Specker (KS) qunits (n-level systems) as well as all the remaining vectors in a space of an arbitrary dimension are presented. The algorithms are based on linear MMP diagrams which generate orthogonalities of KS qunits, on an algebraic definition of states on the diagrams, and on nonlinear equations corresponding to MMP diagrams whose solutions are either KS qunits or the remaining vectors of a chosen space depending on whether the diagrams allow 0-1 states or not. The complexity of the algorithms is polynomial. New results obtained with the help of the algorithms are presented.

Affiliated with

Also associated with

No associations

Rating

Kochen-Specker Algorithms for Qunits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Kochen-Specker Algorithms for Qunits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kochen-Specker Algorithms for Qunits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-24227