Extensively Not P-Bi-Immune promiseBQP-Complete Languages
<|reference_start|>Extensively Not P-Bi-Immune promiseBQP-Complete Languages: In this paper, I first establish -- via methods other than the Gottesman-Knill theorem -- the existence of an infinite set of instances of simulating a quantum circuit to decide a decision problem that can be simulated classically. I then examine under what restrictions on quantum circuits the existence of infinitely many classically simulable instances persists. There turns out to be a vast number of such restrictions, and any combination of those found can be applied at the same time without eliminating the infinite set of classically simulable instances. Further analysis of the tools used in this then shows there exists a language that every (promise) BQP language is one-one reducible to. This language is also not P-bi-immune under very many promises.<|reference_end|>
@article{jackson2024extensively,
    title={Extensively Not P-Bi-Immune promiseBQP-Complete Languages},
    author={Andrew Jackson},
    journal={arXiv preprint arXiv:2406.16764},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.16764},
    primaryClass={cs.CC quant-ph}
}