Tomohiro Yamasaki
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tomohiro Yamasaki has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Hiroshi Imai
Graduate School of Information Science and Technology, The University of Tokyo
4 shared publications - Hirotada Kobayashi
Quantum Computation and Information Project Exploratory Research for Advanced Technology Japan Science and Technology Corporation 5-28-3 Hongo Bunkyo-ku 113-0033 Tokyo Japan
3 shared publications - Hirotada Kobayashi
Department of Information Science Graduate School of Science The University of Tokyo 7-3-1 Hongo Bunkyo-ku 113-0033 Tokyo Japan
1 shared publication
Latest Publications
- 15 April 2005
- Published by Elsevier in Theoretical Computer Science
- Vol. 334 (1-3) , 275-297
Quantum versus deterministic counter automata
- 15 April 2005
- Published by Elsevier in Theoretical Computer Science
- Vol. 334 (1-3) , 275-297
Quantum versus deterministic counter automata
- 2 July 2003
- Published by American Physical Society (APS) in Physical Review A
- Vol. 68 (1) , 012302
Analysis of absorbing times of quantum walks
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard walks on the line and symmetric walks on the hypercube from the viewpoint of absorbing probability and time.
- 2 July 2003
- Published by American Physical Society (APS) in Physical Review A
- Vol. 68 (1) , 012302
Analysis of absorbing times of quantum walks
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard walks on the line and symmetric walks on the hypercube from the viewpoint of absorbing probability and time.
- Open Access
Analysis of Absorbing Times of Quantum Walks
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard walks on the line and symmetric walks on the hypercube from the viewpoint of absorbing probability and time.
Open AccessAnalysis of Absorbing Times of Quantum Walks
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard walks on the line and symmetric walks on the hypercube from the viewpoint of absorbing probability and time.
- Open Access
Two-way Quantum One-counter Automata
After the first treatments of quantum finite state automata by Moore and Crutchfield and by Kondacs and Watrous, a number of papers study the power of quantum finite state automata and their variants. This paper introduces a model of two-way quantum one-counter automata (2Q1CAs), combining the model of two-way quantum finite state automata (2QFAs) by Kondacs and Watrous and the model of one-way quantum one-counter automata (1Q1CAs) by Kravtsev. We give the definition of 2Q1CAs with well-formedness conditions. It is proved that 2Q1CAs are at least as powerful as classical two-way deterministic one-counter automata (2D1CAs), that is, every language L recognizable by 2D1CAs is recognized by 2Q1CAs with no error. It is also shown that several non-context-free languages including {a^n b^{n^2}} and {a^n b^{2^n}} are recognizable by 2Q1CAs with bounded error.
Open AccessTwo-way Quantum One-counter Automata
After the first treatments of quantum finite state automata by Moore and Crutchfield and by Kondacs and Watrous, a number of papers study the power of quantum finite state automata and their variants. This paper introduces a model of two-way quantum one-counter automata (2Q1CAs), combining the model of two-way quantum finite state automata (2QFAs) by Kondacs and Watrous and the model of one-way quantum one-counter automata (1Q1CAs) by Kravtsev. We give the definition of 2Q1CAs with well-formedness conditions. It is proved that 2Q1CAs are at least as powerful as classical two-way deterministic one-counter automata (2D1CAs), that is, every language L recognizable by 2D1CAs is recognized by 2Q1CAs with no error. It is also shown that several non-context-free languages including {a^n b^{n^2}} and {a^n b^{2^n}} are recognizable by 2Q1CAs with bounded error.