The Power of Lorentz Quantum Computer
<|reference_start|>The Power of Lorentz Quantum Computer: We demonstrate the superior capabilities of the recently proposed Lorentz quantum computer (LQC) compared to conventional quantum computers. We introduce an associated computational complexity class termed bounded-error Lorentz quantum polynomial-time (BLQP), demonstrating its equivalence to the complexity class ${\text P}^{\sharp \text{P}}$. We present LQC algorithms that efficiently solve the problem of maximum independent set, PP (probabilistic polynomial-time), and consequently ${\text P}^{\sharp \text{P}}$, all within polynomial time. Additionally, we show that the quantum computing with postselection proposed by Aaronson can be efficiently simulated by LQC, but not vice versa.<|reference_end|>
@article{zhang2024the,
    title={The Power of Lorentz Quantum Computer},
    author={Qi Zhang and Biao Wu},
    journal={arXiv preprint arXiv:2403.04170},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.04170},
    primaryClass={quant-ph cs.CC}
}