A new sibling of BQP

Authors:
Tereza Tušarová
Affiliations:
Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic
Venue:
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Year:
2005

Citing 2
Cited 0

Quantum Complexity Theory

SIAM Journal on Computing
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.