Name
Abstract | ||
|---|---|---|
Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted models such as quantum versions of finite automata have been studied. In this paper, we survey various models of quantum finite automata and their properties. We also provide some open questions and new directions for researchers. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Open quantum system,Quantum finite automata,Discrete mathematics,Combinatorics,Quantum computer,Theoretical computer science,Quantum simulator,Quantum algorithm,Quantum information,Quantum cellular automaton,Mathematics,Quantum network |
DocType | Volume | Citations |
Journal | abs/1507.01988 | 7 |
PageRank | References | Authors |
0.59 | 41 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andris Ambainis | 1 | 2000 | 183.24 |
| Abuzer Yakaryilmaz | 2 | 168 | 25.31 |