Write, autoreview, editor, reviewer
3,129
edits
Verification of Universal Quantum Computation: Difference between revisions
Verification of Universal Quantum Computation (edit)
Revision as of 21:14, 17 June 2019
, 17 June 2019→Further Information
| Line 26: | Line 26: | ||
==Further Information== | ==Further Information== | ||
This problem remained unsolved for a completely classical client until Urmila Mahadev's protocol for classical verification of quantum protocols in 2018 (See Tags). The problem was formally addressed by Gottesman in 2004, and then promoted by Aaronson in 2007 [[Verification of Universal Quantum Computation#References||(1)]]. Emphasized by Vazirani later in 2007 from a philosophical point of view [[Verification of Universal Quantum Computation#References||(2)]], he raised the question, 'Is quantum mechanics a falsifiable theory?' | |||
*Review Papers | *Review Papers | ||
# [https://arxiv.org/abs/1709.06984 Gheorghiu et al (2018)]: Major portion of this functionality file has been adapted from this review | # [https://arxiv.org/abs/1709.06984 Gheorghiu et al (2018)]: Major portion of this functionality file has been adapted from this review | ||
==References== | |||
#[http://www.scottaaronson.com/blog/?p=284 The Aaronson $25.00 prize] | |||
#[http://users.cms.caltech.edu/~schulman/Workshops/CS-Lens-2/cs-lens-2.html Vazirani (2007)] | |||
<div style='text-align: right;'>''contributed by Shraddha Singh''</div> | <div style='text-align: right;'>''contributed by Shraddha Singh''</div> | ||