Meeting 6.2: More on reversible circuits, and quantum circuits

From Eric Samperton 3/4/2021

12 plays 0 comments

I follow up more thoroughly on RSAT, an NP-complete satisfiability problem for Boolean reversible circuits. It actually has several variants, of which we discuss 2. (See my Section 2.2 of one of my paper's with Greg Kuperberg here for more info.) Important techniques include ancilla bits, gate dilation, padding and uncomputation. We then begin discussing quantum circuits.

Tags: np-completenp-hardcsatreversible circuitsquantum circuits

Date of creation: 3/4/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 6.2: More on reversible circuits, and quantum circuits

Related Media