Classical Verification of Quantum Computation Using Trapdoor Functions.

May 24, 2019

img_3273

“Urmila Mahadev spent eight years in graduate school solving one of the most basic questions in quantum computation: How do you know whether a quantum computer has done anything quantum at all?”

https://www.quantamagazine.org/graduate-student-solves-quantum-verification-problem-20181008/

https://arxiv.org/pdf/1804.01082.pdf

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: