Computer Science – Computational Complexity
Scientific paper
2005-07-21
Computer Science
Computational Complexity
extended abstract, submitted to UC'05
Scientific paper
We present a new quantum complexity class, called MQ^2, 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 its 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.
No associations
LandOfFree
A new sibling of BQP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A new sibling of BQP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new sibling of BQP will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-706573