World Wires · story 83964 · corroborated · 1 source(s)

Classical Verification of Quantum Computation Beyond Polynomial Hierarchy

Researchers demonstrate a public-coin protocol enabling classical verification of arbitrary quantum computations for a language beyond the polynomial hiera

Open in the desk

Coverage

• Classical Verification of Quantum Computation Beyond Polynomial Hierarchy arXiv: new preprints (security, AI, physics) · tier C · clear net · 2026-10-27 17:54 UTC

What this site indexes