A new sibling of BQP

Simple item page
dc.creatorTusarova, Tereza
dc.date2005-07-21
dc.date.accessioned2026-07-07T03:23:15Z
dc.date.available2026-07-07T03:23:15Z
dc.descriptionWe 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.
dc.descriptionextended abstract, submitted to UC'05
dc.identifierhttps://arxiv.org/abs/cs/0507057
dc.identifierhttp://arxiv.org/abs/cs/0507057
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32870
dc.subjectComputational Complexity
dc.titleA new sibling of BQP
dc.typetext

Files

Collections

arXiv