An AND gate computes a∧b=ab for bits a,b. It is irreversible when only its one-bit output is retained. The Toffoli gate embeds the operation reversibly as (a,b,c)↦(a,b,c⊕ab); setting c=0 preserves the inputs while recording their logical conjunction.
Ancestors (9)
- Logical conjunction
- Logical connective
- Proposition
- Propositional logic
- Mathematical logic
- Foundations of mathematics
- Area of mathematics
- Mathematics
- Home
Incoming links (30)
- AC0
- AND gate
- Binary multiplier
- Circuit complexity
- Circuit lower bound
- Classical computation
- Half adder
- Hazard (logic)
- Linial-Mansour-Nisan theorem
- Logic gate
- Past exam of the laser science and quantum information processing course of the University of Oxford / 2021 / 4 / f / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2005 / Functional programming, data structures and algorithms, procedural programming, and digital hardware / 9 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Digital systems, linear algebra, introduction to formal proof / 1 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Digital systems, linear algebra, introduction to formal proof / 1 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Digital systems, linear algebra, introduction to formal proof / 1 / e / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Digital systems, linear algebra, introduction to formal proof / 4 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Digital systems, linear algebra, introduction to formal proof / 4 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Digital systems, linear algebra, introduction to formal proof / 1 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Digital systems, linear algebra, introduction to formal proof / 1 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Digital systems, linear algebra, introduction to formal proof / 2 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Digital systems, linear algebra, introduction to formal proof (resit) / 2 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Digital systems, linear algebra, introduction to formal proof / 3 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Digital systems, linear algebra, introduction to formal proof / 3 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Digital systems, linear algebra, introduction to formal proof / 3 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Digital systems, linear algebra, introduction to formal proof / 3 / e / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Digital systems, linear algebra, introduction to formal proof / 1 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Digital systems, linear algebra, introduction to formal proof / 1 / b / Solution
- Quadratic-equation satisfiability over F2
- Razborov approximation method
- Uniform circuit family
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.