Universality in quantum computation
May, 199511 pages
Published in:
- Proc.Roy.Soc.Lond.A 449 (1995) 669
e-Print:
- quant-ph/9505018 [quant-ph]
View in:
Citations per year
Abstract:
We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates.Note:
- 11 pages, LaTeX
References(18)
Figures(0)
- [1]
- [2]
- [3]
- [4]
- [4]
- [5]
- [5]
- [5]
- [5]
- [5]
- [6]
- [7]
- [8]
- [9]
- [10]
- [11]
- [12]
- [13]