Efficient quantum circuits for arbitrary sparse unitaries

Details Efficient quantum circuits for arbitrary sparse unitaries Efficient quantum circuits for arbitrary sparse unitaries

2009-04-14

arxiv.org/abs/0904.2211v2

Phys. Rev. A 80, 062301 (2009)

Physics

Quantum Physics

4 pages. Substantially expanded since v1

Scientific paper

Arbitrary exponentially large unitaries cannot be implemented efficiently by quantum circuits. However, we show that quantum circuits can efficiently implement any unitary provided it has at most polynomially many nonzero entries in any row or column, and these entries are efficiently computable. One can formulate a model of computation based on the composition of sparse unitaries which includes the quantum Turing machine model, the quantum circuit model, anyonic models, permutational quantum computation, and discrete time quantum walks as special cases. Thus we obtain a simple unified proof that these models are all contained in BQP. Furthermore our general method for implementing sparse unitaries simplifies several existing quantum algorithms.

Affiliated with

Also associated with

No associations

Rating

Efficient quantum circuits for arbitrary sparse unitaries 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 Efficient quantum circuits for arbitrary sparse unitaries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient quantum circuits for arbitrary sparse unitaries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-591253