Instead of "quantum advantage" you should probably say "superpolynomial quantum computational advantage". We are talking about building a quantum experiment that appears not to be simulable in P or BPP with high confidence. If you drop "computational" then "superpolynomial quantum advantage" includes existing exponential violations of Bell inequalities that are efficiently classically simulable (in a complexity theoretic sense). If you drop "superpolynomial" then "quantum computational advantage" is not necessarily about problems outside P / BPP (even a constant speed-up would be fine). If you drop both, then Wiesner's quantum money and BB84 quantum key distribution demonstrate "quantum advantages" even without entanglement.
If there is nothing shorter than "superpolynomial quantum computational advantage", we could simply roll back to the classic term "**quantum speed-up**", which at least saves you from the need to add "computational", and then add "superpolynomial" whenever we are at risk of confusion.
Instead of "quantum advantage" you should probably say "superpolynomial quantum computational advantage". We are talking about building a quantum experiment that appears not to be simulable in P or BPP with high confidence. If you drop "computational" then "superpolynomial quantum advantage" includes existing exponential violations of Bell inequalities that are efficiently classically simulable (in a complexity theoretic sense). If you drop "superpolynomial" then you are not talking about problems outside P / BPP. If you drop both, then Wiesner's quantum money and BB84 quantum key distribution demonstrate "quantum advantages" even without entanglement.
If there is nothing shorter than "superpolynomial quantum computational advantage", we could simply roll back to the classic term "**quantum speed-up**", which at least saves you from the need to add "computational", and then add "superpolynomial" whenever we are at risk of confusion.
Instead of "quantum advantage" you should probably be say "superpolynomial quantum computational advantage". We are talking about building a quantum experiment that appears not to be simulable in P or BPP with high confidence. If you drop "computational" then "superpolynomial quantum advantage" includes existing exponential violations of Bell inequalities that are efficiently classically simulable (in a complexity theoretic sense). If you drop "superpolynomial" then you are not talking about problems outside P / BPP. If you drop both, then Wiesner's quantum money and BB84 quantum key distribution demonstrate "quantum advantages" even without entanglement.
If there is nothing shorter than "superpolynomial quantum computational advantage", we could simply roll back to the classic term "**quantum speed-up**", which at least saves you from the need to add "computational", and then add "superpolynomial" whenever we are at risk of confusion.
Instead of "quantum advantage" you should probably be say "superpolynomial quantum computational advantage". We are talking about building a quantum experiment that appears not to be simulable in P or BPP with high confidence. If you drop "computational" then "superpolynomial quantum advantage" includes existing exponential violations of Bell inequalities that are efficiently classically simulable (in a complexity theoretic sense). If you drop "superpolynomial" then you are not talking about problems outside P / BPP. If you drop both, then Wiesner's quantum money and BB84 quantum key distribution demonstrate "quantum advantages" even without entanglement.
If there is nothing shorter than "superpolynomial quantum computational advantage", we could simply roll back to the classic term "quantum speed-up", which at least saves you from the need to add "computational", and then add "superpolynomial" whenever we are at risk of confusion.
Instead of "quantum advantage" you should probably be say "superpolynomial quantum computational advantage". We are talking about building a quantum experiment that appears not to be simulable in P or BPP with high confidence. If you drop "computational" then "superpolynomial quantum advantage" includes existing exponential violations of Bell inequalities that are efficiently classically simulable (in a complexity theoretic sense). If you drop "superpolynomial" then you are not talking about problems outside P / BPP. If you drop both, then Wiesner's quantum money and BB84 quantum key distribution demonstrate "quantum advantage" even without entanglement.
If there is nothing shorter than "superpolynomial quantum computational advantage", we could simply roll back to the classic term "quantum speed-up", which at least saves you from the need to add "computational", and then add "superpolynomial" whenever we are at risk of confusion.
Braneshop, and
the US National Science Foundation.
SciRate