Scivillage.com Casual Discussion Science Forum

Full Version: Graduate student solves quantum verification problem for computers
You're currently viewing a stripped down version of our content. View the full version with proper formatting.
https://www.quantamagazine.org/graduate-...-20181008/

EXCERPT: . . . once a quantum computer can perform computations a classical computer can’t, how will we know if it has done them correctly? If you distrust an ordinary computer, you can, in theory, scrutinize every step of its computations for yourself. But quantum systems are fundamentally resistant to this kind of checking. For one thing, their inner workings are incredibly complex: Writing down a description of the internal state of a computer with just a few hundred quantum bits (or “qubits”) would require a hard drive larger than the entire visible universe.

And even if you somehow had enough space to write down this description, there would be no way to get at it. The inner state of a quantum computer is generally a superposition of many different non-quantum, “classical” states (like Schrödinger’s cat, which is simultaneously dead and alive). But as soon as you measure a quantum state, it collapses into just one of these classical states. Peer inside a 300-qubit quantum computer, and essentially all you will see is 300 classical bits — zeros and ones — smiling blandly up at you. “A quantum computer is very powerful, but it’s also very secretive,” [Umesh] Vazirani said.

Given these constraints, computer scientists have long wondered whether it is possible for a quantum computer to provide any ironclad guarantee that it really has done what it claimed. “Is the interaction between the quantum and the classical worlds strong enough so that a dialogue is possible?” asked Dorit Aharonov, a computer scientist at the Hebrew University of Jerusalem.

During her second year of graduate school, [Urmila] Mahadev became captivated by this problem, for reasons even she doesn’t fully understand. In the years that followed, she tried one approach after another. “I’ve had a lot of moments where I think I’m doing things right, and then they break, either very quickly or after a year,” she said.

But she refused to give up. Mahadev displayed a level of sustained determination that Vazirani has never seen matched. “Urmila is just absolutely extraordinary in this sense,” he said.

Now, after eight years of graduate school, Mahadev has succeeded. She has come up with an interactive protocol by which users with no quantum powers of their own can nevertheless employ cryptography to put a harness on a quantum computer and drive it wherever they want, with the certainty that the quantum computer is following their orders. Mahadev’s approach, Vazirani said, gives the user “leverage that the computer just can’t shake off.”

For a graduate student to achieve such a result as a solo effort is “pretty astounding,” [Scott] Aaronson said....

MORE: https://www.quantamagazine.org/graduate-...-20181008/