Meeting 6.2: More on reversible circuits, and quantum circuitsI 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…
From Eric Samperton
| 10
10 plays
| 0
|
|
Meeting 6.1: Classical warm-ups to quantum computingWe discuss (classical) probabilistic algorithms and reversible circuits.
From Eric Samperton
| 13
13 plays
| 0
|