Abstract
We define and construct efficient depth-universal and almost-size-universal quantum circuits. Such circuits can be viewed as general-purpose simulators for central quantum circuit classes and used to capture the computational power of the simulated class. For depth we construct universal circuits whose depth is the same order as the circuits being simulated. For size, there is a log factor blow-up in the universal circuits constructed here which is nearly optimal for polynomial size circuits.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Deutsch, D.: Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer. In: Proceedings of the Royal Society of London. Series A, Mathematical and Physical Sciences, vol. 400, pp. 97–117 (1985)
Bera, D., Green, F., Homer, S.: Small depth quantum circuits. SIGACT News 38(2), 35–50 (2007)
Cook, S.A., Hoover, H.J.: A depth-universal circuit. SIAM Journal on Computing 14(4), 833–839 (1985)
Fang, M., Fenner, S., Green, F., Homer, S., Zhang, Y.: Quantum lower bounds for fanout. Quantum Information and Computation 6(1), 46–57 (2006)
Høyer, P., Špalek, R.: Quantum circuits with unbounded fan-out. Theory of Computing 1, 81–103 (2005)
Nielsen, M.A., Chuang, I.L.: Programmable quantum gate arrays. Phys. Rev. Lett. 79(2), 321–324 (1997)
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Sousa, P.B.M., Ramos, R.V.: Universal quantum circuit for n-qubit quantum gate: A programmable quantum gate. Quantum Information and Computation 7(3), 228–242 (2007)
Valiant, L.G.: Universal circuits (preliminary report). In: Proceedings of the 8th ACM Symposium on the Theory of Computing, pp. 196–203 (1976)
Yao, A.C.C.: Quantum circuit complexity. In: Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, pp. 352–361 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bera, D., Fenner, S., Green, F., Homer, S. (2009). Efficient Universal Quantum Circuits. In: Ngo, H.Q. (eds) Computing and Combinatorics. COCOON 2009. Lecture Notes in Computer Science, vol 5609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02882-3_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-02882-3_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02881-6
Online ISBN: 978-3-642-02882-3
eBook Packages: Computer ScienceComputer Science (R0)