One Complexity Theorist's View of Quantum Computing — mentioned by abdullahkhalids

Wed, 03 Mar 2021 19:43:03 GMT

It has been claimed that "we can simulate a BQP machine using efficiently computable entries from the set {−1, −4/5 , − 3/5 , 0, 3/5 , 4/5 , 1}" [1]. So any part of reality that you can reduce to an efficient computation on a quantum computer, admits a description using the rationals only. But I might be out of my depth here. [1] https://arxiv.org/abs/quant-ph/0003035

Paper and discussion history. A mention is not an endorsement.

One Complexity Theorist's View of Quantum Computing · HackerPapers discussions

One Complexity Theorist's View of Quantum Computing — mentioned by abdullahkhalids