Quantum hashing with the icosahedral group

Details Quantum hashing with the icosahedral group Quantum hashing with the icosahedral group

2009-03-09

arxiv.org/abs/0903.1497v2

Phys.Rev.Lett.104:160502,2010

Physics

Quantum Physics

5 pages, 4 figures; revised version, to appear in Phys. Rev. Lett.

Scientific paper

10.1103/PhysRevLett.104.160502

We study an efficient algorithm to hash any single qubit gate (or unitary matrix) into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different lengths, we introduce a series of pseudo-groups. Joining these braid segments in a renormalization group fashion, we obtain a Gaussian unitary ensemble of random-matrix representations of braids. With braids of length O[log(1/epsilon)], we can approximate all SU(2) matrices to an average error epsilon with a cost of O[log(1/epsilon)] in time. The algorithm is applicable to generic quantum compiling.

Affiliated with

Also associated with

No associations

Rating

Quantum hashing with the icosahedral group 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 Quantum hashing with the icosahedral group, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum hashing with the icosahedral group will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-95482