Universality in Quantum Computation

Preprint

24 May 1995

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.quant-ph/9505018

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.

Keywords

COMPUTATIONAL COMPONENTS
PHYSICAL CONSIDERATIONS
CONSIDERATIONS BEARING
QUANTUM COMPUTATION
COMPUTATION WE SHOW
PROPER DEFINITION
UNIVERSAL GATE
LOGIC

All Related Versions

Version 1, 1995-05-24, ArXiv
Published version: Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 449 (1937), 669.

This publication has 0 references indexed in Scilit: