Comparative power of quantum and classical computation models

F. Ablayev

doi:10.1117/12.620484

1 June 2005 Comparative power of quantum and classical computation models

F. Ablayev

Proceedings Volume 5833, Quantum Informatics 2004; (2005) https://doi.org/10.1117/12.620484
Event: 18th International Conference on Photoelectronics and Night Vision Devices and Quantum Informatics 2004, 2004, Moscow, Russian Federation

Abstract

In the talk we present results on comparitve power of classical and quantum computational models. We focus on two well known in Computer Science models: finite automata which is known as uniform computational model and branching programs which is known as nonuniform computational model.

Citation Download Citation

F. Ablayev "Comparative power of quantum and classical computation models", Proc. SPIE 5833, Quantum Informatics 2004, (1 June 2005); https://doi.org/10.1117/12.620484

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available