# Google award backs effort to verify quantum computations

Published 2026-11-20 · Quantum.world Team · Quantum.world

> A Google Academic Research Award will support work on using Hidden Code Sampling to check quantum computations and generate certified random numbers. The project has not yet demonstrated that the method can produce certifiable randomness.

## Google backing for a verification project

A Google Academic Research Award will support a project to test whether Hidden Code Sampling can help verify quantum computations and generate certified random numbers, according to a [University of Chicago](https://physicalsciences.uchicago.edu/news/article/a-google-award-to-help-quantum-computers-prove-their-work/) report published November 19, 2026. Bill Fefferman, an associate professor of computer science at the university, and Soumik Ghosh, a former doctoral student in his group who is now a postdoctoral researcher at MIT, received the award.

The award provides travel, access to GPU computing clusters and meetings with Google scientists. The project will investigate whether the verification method can be turned into a practical cryptography tool; the report identifies certified randomness as its target application.

## Keeping the code hidden

Hidden Code Sampling draws on quantum error correction. In the proposed setup, a verifier secretly selects an error-correcting code and keeps it from the person running the computation. The code shapes the output in a way the verifier can check, while remaining hidden from an operator trying to fake the results.

The researchers describe the protocol as a contest between a verifier using an ordinary computer and an experimentalist claiming to operate a quantum computer. The verifier tests whether the results have the expected structure; the tests are intended to catch an experimentalist who is instead using a classical machine. The team’s preprint describes the output as “conditionally peaked,” a feature it says enables efficient classical verification.

The preprint explains the idea through error correction: measurement results can be divided into a logical register and a syndrome register. Given the syndrome, the logical register should be concentrated around a particular outcome. The scheme uses that structure to design verification tests, while adding other checks intended to catch classical attempts to imitate the output.

## Randomness remains a goal

For cryptography, the project aims to determine whether the method could certify that generated bits are genuinely random. Public and private encryption keys are generally made from random numbers, the university report explains. A recipient who does not trust the sender could calculate a benchmark score; a high score would give confidence that the sender is honest.

The method has not yet been shown to generate certifiable randomness. The university report says the paper describing the verification scheme is under peer review and available as an arXiv preprint, while the certified-randomness work is new. Ghosh identified proving that Hidden Code Sampling experiments can generate certifiable randomness as the award’s central goal.

## Work still ahead

The researchers are in discussions with several hardware makers, according to the report. They consider it reasonable to expect near-term quantum computers to run the scheme within about two years, and say it does not require fully error-proof machines.

The approach builds on earlier work proposing the use of quantum advantage experiments for verification. The university report says small demonstrations have taken place, but their verification costs have prevented them from scaling; Fefferman and collaborators also received a Google award in 2022 for related theoretical work.

## Sources

1. Original source [University of Chicago Physical Sciences Division](https://physicalsciences.uchicago.edu/news/article/a-google-award-to-help-quantum-computers-prove-their-work/) physicalsciences.uchicago.edu

Other pages read

2. [arXiv](https://arxiv.org/abs/2510.05262) arxiv.org

## Related stories

- [Harvard team gets $12 million for AI-designed quantum error correction](https://quantum.world/news/harvard-team-12-million-ai-quantum-error-correction)
- [Researchers publish simulated feedback protocols for quantum drift](https://quantum.world/news/quantum-calibration-feedback-drift-protocols)
- [Google preprint links Willow’s lingering errors to third-state leakage](https://quantum.world/news/google-willow-temporally-correlated-error-suppression)
- [Qblox and AMD report microsecond quantum-feedback tests](https://quantum.world/news/qblox-amd-quantum-feedback-tests)
- [MASQ preprint reports 8,098-fold QEC sampling speedup](https://quantum.world/news/masq-preprint-qec-sampling-speedup)

## Explore

[More articles](https://quantum.world/news)

---

Canonical: https://quantum.world/news/google-award-quantum-computation-verification
