Meeting 7.1: BQP and QMA

From Eric Samperton 3/9/2021

28 plays 0 comments

I 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 discuss QMA ("Quantum Merlin Arthur"), the quantum analog of NP, or, better yet, the quantum analog of MA.

Tags: bqpqmaquantum computingquantum circuits

Date of creation: 3/9/2021 12:00 AM
Appears In: MATH 595 - Quantum Complexity and Topology

Comments
Related Media

Loading…

	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

Meeting 7.1: BQP and QMA

Related Media