Mutually Unbiased Bases, Generalized Spin Matrices and Separability

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

A collection of orthonormal bases for a complex dXd Hilbert space is called mutually unbiased (MUB) if for any two vectors v and w from different bases the square of the inner product equals 1/d: || ^{2}=1/d. The MUB problem is to prove or disprove the the existence of a maximal set of d+1 bases. It has been shown in [W. K. Wootters, B. D. Fields, Annals of Physics, 191, no. 2, 363-381, (1989)] that such a collection exists if d is a power of a prime number p. We revisit this problem and use dX d generalizations of the Pauli spin matrices to give a constructive proof of this result. Specifically we give explicit representations of commuting families of unitary matrices whose eigenvectors solve the MUB problem. Additionally we give formulas from which the orthogonal bases can be readily computed. We show how the techniques developed here provide a natural way to analyze the separability of the bases. The techniques used require properties of algebraic field extensions, and the relevant part of that theory is included in an Appendix.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Mutually Unbiased Bases, Generalized Spin Matrices and Separability 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 Mutually Unbiased Bases, Generalized Spin Matrices and Separability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mutually Unbiased Bases, Generalized Spin Matrices and Separability will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-58529

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.