Question

Description acceptable. A proposal for demonstrating this result involves inputting n photons into an m-mode random interferometer then sampling from its output distribution. Many experimental procedures for demonstrating this result calculate the cross-entropy benchmarking fidelity. Demonstrating this result, which is equivalent to showing that BQP is not contained in BPP, would collapse the polynomial hierarchy. (-5[1])John Preskill’s original term for this result conveyed the (*) superpolynomial improvement it requires, but has been critiqued as colonialist. Google claimed to have demonstrated this result with its Sycamore (10[1])processor, which performed a task in 200 seconds that would have taken 10,000 years for IBM's Summit to achieve. (10[1])For 10 points, give the term for this result concerning the relative computational speed of systems of qubits versus ordinary bits. ■END■

ANSWER: quantum advantage [or quantum supremacy; or quantum primacy; accept descriptions like "there exists tasks for which quantum computers are exponentially faster or better at than classical computers"; accept BQP is not equal to or not contained in BPP before "BQP"; prompt on answers referring to the polynomial hierarchy or PH collapsing]
<Chen, Physics>
= Average correct buzz position

Back to tossups

Buzzes

PlayerTeamOpponentBuzz PositionValue
Kevin YeBerkeley BStanford54-5
Eric ChenFree AgentsBerkeley A8310
Michał GerasimiukStanfordBerkeley B10210

Summary

2024 ESPN @ Stanford03/09/2024Y2100%0%50%92.50