Abstract
Unfortunately, the most interesting questions related to quantum complexity theory, for example, “Is NP contained in BQP or not?”, are extremely difficult and far beyond recent knowledge. In this chapter we will mention some complexity theoretical aspects of quantum computation, which may somehow illustrate these difficult questions.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hirvensalo, M. (2001). Complexity Lower Bounds for Quantum Circuits. In: Quantum Computing. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04461-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-04461-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-04463-6
Online ISBN: 978-3-662-04461-2
eBook Packages: Springer Book Archive