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 (15[1])fidelity. Demonstrating this result, which is equivalent to showing that BQP is not contained (15[1])in BPP, would collapse the polynomial hierarchy. John Preskill’s (15[1]-5[1])original term for this result (-5[1])conveyed the (*) superpolynomial improvement (10[1]-5[1])it requires, but has been critiqued as colonialist. Google claimed (-5[1])to have demonstrated (10[2])this result with its (10[1])Sycamore processor, which performed a task (10[1])in 200 seconds that would have taken (-5[1])10,000 (10[2])years (10[2])for IBM's Summit (10[1]-5[1])to achieve. For 10 points, give the term for this result (10[1])concerning the relative computational speed of systems of qubits versus ordinary (10[1])bits. (10[1])■END■ (10[7])