LWE parameterization and trapdoor handling
Map the mathematical construction to concrete parameters, isolate key-generation and trapdoor material, define serialization, and record the assumptions attached to every accepted transcript.
Protocol notebook · Liju James
Classical checks for quantum claims.
Active research into LWE-based trapdoors, prover transcripts, and the evidence required for a classical verifier to accept—or reject—a quantum computation.
A verifier that stays classical
The objective is to let a classical verifier issue cryptographic challenges, receive a transcript from a quantum prover, and check whether the prover behaved consistently with the requested measurements.
The cryptographic core is not “quantum randomness” as a label. It is a precise protocol, parameter set, transcript format, trapdoor lifecycle, and soundness reduction.
Trapdoor setupchallenge → responseTranscript check
Transcript and verifier design
Specify messages, domain separation, rejection paths, deterministic replay, and evidence packaging so independent verification does not depend on QBeacon availability.
Hardware experiments and claim boundaries
Separate a CHSH hardware measurement, a CVQC-labelled experimental run, and a complete cryptographic verification protocol. Each supports a different statement and requires different evidence.
Dr. Urmila Mahadev
Mahadev's 2018 protocol provides a classical-verification framework whose computational soundness rests on the assumed quantum hardness of Learning With Errors. Related work uses trapdoor claw-free functions with an adaptive hardcore-bit property for tests of quantumness and certifiable randomness.
These are scholarly foundations. QBeacon does not imply collaboration with or endorsement by Dr. Mahadev. A QBeacon implementation must be evaluated on its own specification, code, parameters, tests, and review.