Classical verifier checks a beyond-PH quantum language via an oracle
The public-coin protocol has perfect completeness and soundness error at most 1/4, with near-optimal message count.
3 stories, newest first · one card per story
The public-coin protocol has perfect completeness and soundness error at most 1/4, with near-optimal message count.
Tight quantum query bounds show high XEB scores certify near-ideal randomness from untrusted samplers.
A no-go theorem shows Regev-style dihedral coset algorithms fail if they discard too many Fourier-label bits.
Today 1.5K readers · 2.4K views · 757 reads · all time 189K views