A new sibling of BQP
<|reference_start|>A new sibling of BQP: 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.<|reference_end|>
@article{tusarova2005a,
    title={A new sibling of BQP},
    author={Tereza Tusarova},
    journal={arXiv preprint arXiv:cs/0507057},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0507057},
    primaryClass={cs.CC}
}