Permutational Quantum Computing

Details Permutational Quantum Computing Permutational Quantum Computing

2009-06-14

arxiv.org/abs/0906.2508v1

Quantum Information and Computation Vol. 10 pg. 470 (2010)

Physics

Quantum Physics

25 pages, 8 figures

Scientific paper

In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of computation that disregards even the topology of the particle trajectory, and computes by permuting particles. Whereas topological quantum computation requires anyons, permutational quantum computation can be performed with ordinary spin-1/2 particles, using a variant of the spin-network scheme of Marzuoli and Rasetti. We do not know whether permutational computation is universal. It may represent a new complexity class within BQP. Nevertheless, permutational quantum computers can in polynomial time approximate matrix elements of certain irreducible representations of the symmetric group and simulate certain processes in the Ponzano-Regge spin foam model of quantum gravity. No polynomial time classical algorithms for these problems are known.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-341714