Efficient quantum circuits for arbitrary sparse unitaries
- Creators
- Jordan, Stephen P.
- Wocjan, Pawel
Abstract
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.
Additional Information
© 2009 The American Physical Society. Received 21 April 2009; revised 5 August 2009; published 1 December 2009. We thank Dominik Janzing for helpful discussions. S.P.J. gratefully acknowledges support from the Sherman Fairchild Foundation and the National Science Foundation under Grant No. PHY-0803371. P.W. gratefully acknowledges the support by NSF Grants No. CCF-0726771 and No. CCF-0746600.Additional details
- Eprint ID
- 17268
- DOI
- 10.1103/PhysRevA.80.062301
- Resolver ID
- CaltechAUTHORS:20100121-132802102
- Sherman Fairchild Foundation
- CCF-0726771
- NSF
- CCF- 0746600
- NSF
- PHY-0803371
- NSF
- Created
-
2010-01-25Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field