summaryrefslogtreecommitdiff
path: root/content/know/concept/toffoli-gate/index.pdc
diff options
context:
space:
mode:
authorPrefetch2022-09-27 21:20:05 +0200
committerPrefetch2022-09-28 20:51:35 +0200
commit03accd13c0a6ec4de2d8001edf3ce7553f831160 (patch)
tree59840d0c443752c6fef87f74597e032db91cd219 /content/know/concept/toffoli-gate/index.pdc
parent7e0b6df586da7c79df3853ba0bdc9f98c10af839 (diff)
Clean up CSS, minor design changes
Diffstat (limited to 'content/know/concept/toffoli-gate/index.pdc')
-rw-r--r--content/know/concept/toffoli-gate/index.pdc12
1 files changed, 6 insertions, 6 deletions
diff --git a/content/know/concept/toffoli-gate/index.pdc b/content/know/concept/toffoli-gate/index.pdc
index f3ab0ba..f0b39ad 100644
--- a/content/know/concept/toffoli-gate/index.pdc
+++ b/content/know/concept/toffoli-gate/index.pdc
@@ -22,7 +22,7 @@ and flips $C$ if both $A$ and $B$ are true.
In circuit diagrams, its representation is:
<a href="toffoli.png">
-<img src="toffoli.png" style="width:19%;display:block;margin:auto;">
+<img src="toffoli.png" style="width:19%">
</a>
This gate is reversible, because $A$ and $B$ are preserved,
@@ -31,7 +31,7 @@ Moreover, this gate is universal,
because we can make a NAND gate from it:
<a href="nand.png">
-<img src="nand.png" style="width:38%;display:block;margin:auto;">
+<img src="nand.png" style="width:38%">
</a>
A NAND is enough to implement every conceivable circuit.
@@ -39,15 +39,15 @@ That said, we can efficiently implement NOT, AND, and XOR using a single Toffoli
Note that NOT is a special case of NAND:
<a href="not.png">
-<img src="not.png" style="width:32%;display:block;margin:auto;">
+<img src="not.png" style="width:32%">
</a>
<a href="and.png">
-<img src="and.png" style="width:35%;display:block;margin:auto;">
+<img src="and.png" style="width:35%">
</a>
<a href="xor.png">
-<img src="xor.png" style="width:35%;display:block;margin:auto;">
+<img src="xor.png" style="width:35%">
</a>
Using these, we can, as an example, make an OR gate
@@ -56,7 +56,7 @@ thanks to the fact that $A \lor B = \neg (\neg A \land \neg B)$,
i.e. OR is NAND of NOT $A$ and NOT $B$:
<a href="or.png">
-<img src="or.png" style="width:50%;display:block;margin:auto;">
+<img src="or.png" style="width:50%">
</a>
Thanks to its reversibility and universality,