
 [No title] 
  This result is different from binary reversible logic, where the minimum universal gate is 3*3 [19,44] (all quantum gates are reversible and reversible gates have the same number of inputs and outputs and are onetoone mappings, k*k gate has k inputs and k outputs). 
  Ternary logic values of 0, 1 or 2 are represented by a set of distinguishable different states of a qudit. 
  Pairs of ternary qudits are capable of representing nine distinct Boolean states, 00>, 01>, 02>, 10>, 11>, 12>, 20>, 21> and 22>, as well as all possible superpositions of the states. 
 www.ee.pdx.edu /~mperkows/=PUBLICATIONS/PDF2003/sendai.doc (4707 words) 
