Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation
Cryptographers show quantum indistinguishability obfuscation yields publicly verifiable quantum advantage and classical BQP verification.
Stories per day · 30 days
4 stories, newest first · one card per story
Stories tagged #verifiable-computation
Verifiable quantum advantage based on polynomials with planted structures
Researchers propose verifiable quantum advantage using planted cubic IQP polynomials and a faster classical cross-entropy check.
Verifiable Computation with Trusted Execution Environments and On-Chain Digital Rights Tokens
Researchers propose TEE-sealed data pools with on-chain Digital Rights Tokens so analysts run code without seeing underlying data.
Atlas: Efficient Verifiable Semantic Search
Atlas delivers zero-knowledge proofs for HNSW semantic search, verifying RAG retrieval in under a second on SIFT1M and 2.0 seconds at 100M vectors.