Skip to main content
SpringerLink
Log in

A New Sibling of BQP

  • Conference paper
Unconventional Computation (UC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3699))

Included in the following conference series:

  • 493 Accesses

Abstract

We describe a quantum complexity class which is contained in AWPP. This class has a compact and simple mathematical definition, involving only polynomial-time computable functions and a unitarity condition. It contains both Deutsch-Jozsa’s and Shor’s algorithm, while it’s relation to BQP is unknown. This shows that in the complexity class hierarchy, BQP is not an extraordinary isolated island, but has ”siblings” which as well can solve prime-factorization.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM Journal on Computing 26(5), 1411–1473 (1997), citeseer.nj.nec.com/bernstein97quantum.html

    Google Scholar 

  2. Deutsch, D., Jozsa, R.: Proceedings of the Royal Society of London Ser. A, vol. 439(553) (1992)

    Google Scholar 

  3. Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: IEEE Symposium on Foundations of Computer Science, pp. 124–134 (1994), citeseer.nj.nec.com/14533.html

  4. Tušarová, T.: Quantum complexity classes. Master’s thesis, Vrije Universiteit, Amsterdam (2003), http://arxiv.org/cs.CC/0409051

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic

    Tereza Tušarová

Authors
  1. Tereza Tušarová
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Auckland, New Zealand

    Cristian S. Calude

  2. Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand

    Michael J. Dinneen

  3. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, Bucureşti, Romania

    Gheorghe Păun

  4. Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Seville, Avda. Reina Mercedes, 41012, Sevilla, Spain

    Mario J. Pérez-Jímenez

  5. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tušarová, T. (2005). A New Sibling of BQP. In: Calude, C.S., Dinneen, M.J., Păun, G., Pérez-Jímenez, M.J., Rozenberg, G. (eds) Unconventional Computation. UC 2005. Lecture Notes in Computer Science, vol 3699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560319_19

Download citation

  • DOI: https://doi.org/10.1007/11560319_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29100-8

  • Online ISBN: 978-3-540-32022-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation