Universality in quantum computation

Unknown author(s)

Proceedings of the Royal Society of London Series A Mathematical and Physical Sciences · 1995 · 328 citations · 9 references

DOIFull text

Open access

Concepts

Abstract

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.

References

9