|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'500'096
Articles rated: 2609
19 April 2024 |
|
| | | | |
|
Article forum
| |
|
|
How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory? | | Tomoyuki Yamakami
; | | Date: |
15 Jan 2020 | | Abstract: | Quantum computation has emerged as a powerful computational medium of our
time, having demonstrated the efficiency in solving the integer factoring and
searching a database faster than any currently known classical computer
algorithm. Adiabatic evolution of quantum systems have been studied as a
potential means that physically realizes quantum computation. Up to now, all
the research on adiabatic quantum systems has dealt with polynomial
time-bounded computation and little attention has been paid to, for example,
adiabatic quantum systems consuming only constant memory space. Such quantum
systems can be modeled in a form similar to quantum finite automata. This
exposition dares to ask a bold question of how to make adiabatic quantum
computation fit into the rapidly progressing framework of quantum automata
theory. As our answer to this eminent but profound question, we first lay out a
fundamental platform for adiabatic evolutionary quantum systems (AEQSs) with
limited computational resources and then establish how to construct AEQSs using
quantum finite automata. We also explore fundamental structural properties of
decision problems (or equivalently, languages) solved quickly by such AEQSs. | | Source: | arXiv, 2001.5247 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No message found in this article forum.
You have a question or message about this article?
Ask the community and write a message in the forum.
If you want to rate this article, please use the review section..
To add a message in the forum, you need to login or register first. (free): registration page
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER