Meeting 8.1: Simon's problem and factoringSimon's problem is a somewhat contrived oracle problem that provides an oracle separation of BQP and BPP, which should be interpreted as evidence (but not proof) that BQP and BPP are distinct. …
From Eric Samperton
| 17
17 plays
| 0
|
|
Meeting 7.1: BQP and QMAI define BQP ("bounded error quantum polynomial time") and pay lip service to the Solovay-Kitaev theorem (hopefully a student will prove it in a talk at the end of the semester). I also…
From Eric Samperton
| 21
21 plays
| 0
|
![]() | Contact Technology Services to report an issue, offer feedback, or request assistance. |
Technology Services Home | Kaltura Help | Privacy Policy | |
Illinois Media Space, © 2022 Board of Trustees of the University of Illinois |