Journal article

Universality in Quantum Computation

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.

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Deutsch, D., Barenco, A., & Ekert, A. (1995). Universality in Quantum Computation.

MLA Style

Deutsch, D., et al. Universality in Quantum Computation. 1995.

Chicago Style

Deutsch, D, A Barenco, and A Ekert. 1995. “Universality in Quantum Computation.”
Share
Print

Authors

+ Deutsch, D More by this author

Role:: Author

+ Barenco, A More by this author

Role:: Author

+ Ekert, A More by this author

Role:: Author

Publication date:: 1995-05-24

Keywords:: quant-ph
Pubs id:: pubs:313227
UUID:: uuid:31b9e12e-2c67-4085-b46d-3814e2af2d9d
Local pid:: pubs:313227
Source identifiers:: 313227
Deposit date:: 2012-12-19

Terms of use

Copyright date:: 1995
Notes:: 11 pages, LaTeX

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP