Universality in Quantum Computation
Deutsch (David), Barenco (Adriano) & Ekert (Artur)
Source: Royal Society Proceedings: Mathematical and Physical Sciences, Vol. 449, No. 1937 (Jun. 8, 1995), pp. 669-677
Paper - Abstract

Paper Summary


Author’s Abstract

  1. We show that in quantum computation almost every gate that operates on two or more bits is a universal gate.
  2. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates.

Text Colour Conventions (see disclaimer)

  1. Blue: Text by me; © Theo Todman, 2017
  2. Mauve: Text by correspondent(s) or other author(s); © the author(s)



© Theo Todman, June 2007 - November 2017. Please address any comments on this page to theo@theotodman.com. File output:
Website Maintenance Dashboard
Return to Top of this Page Return to Theo Todman's Philosophy Page Return to Theo Todman's Home Page