Even quantum advice is unlikely to solve PP
<|reference_start|>Even quantum advice is unlikely to solve PP: We give a corrected proof that if PP $\subseteq$ BQP/qpoly, then the Counting Hierarchy collapses, as originally claimed by [Aaronson 2006 arXiv:cs/0504048]. This recovers the related unconditional claim that PP does not have circuits of any fixed size $n^k$ even with quantum advice. We do so by proving that YQP*, an oblivious version of (QMA $\cap$ coQMA), is contained in APP, and so is PP-low.<|reference_end|>
@article{yirka2024even,
    title={Even quantum advice is unlikely to solve PP},
    author={Justin Yirka},
    journal={arXiv preprint arXiv:2403.09994},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.09994},
    primaryClass={cs.CC quant-ph}
}