IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2018-11-26 09:50
Non-Uniform State Complexity of Quantum Finite Automata and Quantum Polynomial-Time Logarithmic-Space Computation with Quantum Advice -- (Preliminary Report) --
Tomoyuki Yamakami (U of Fukui)
Abstract (in Japanese) (See Japanese page) 
(in English) The state complexity of a finite(-state) automaton intuitively measures the size of the description of the automaton. Sakoda and Sipser (STOC 1972, pp. 275--286) were concerned with non-uniform families of finite automata and they discussed the behaviors of non-uniform complexity classes defined by families of such finite automata having polynomial-size state complexity.
In a similar fashion, we introduce non-uniform state complexity classes using families of quantum finite automata. Our primarily concern is one-way quantum finite automata empowered by garbage tapes. We show inclusion and separation relationships among non-uniform state complexity classes of various one-way finite automata, including deterministic, nondeterministic, probabilistic, and quantum finite automata. For two-way quantum finite automata with garbage tapes,
we discover a close relationship between the state complexity of non-uniform families of such quantum finite automata and the parameterized complexity class induced by quantum polynomial-time logarithmic-space computation with polynomial-size advice.
Keyword (in Japanese) (See Japanese page) 
(in English) quantum finite automata / state complexity / quantum Turing machine / probabilistic finite automata / bounded-error probability / quantum advice / /  
Reference Info. IEICE Tech. Rep.
Paper #  
Date of Issue  
ISSN  
Download PDF

Conference Information
Committee QIT  
Conference Date 2018-11-26 - 2018-11-27 
Place (in Japanese) (See Japanese page) 
Place (in English) The University of Tokyo 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Quantum Information 
Paper Information
Registration To QIT 
Conference Code 2018-11-QIT 
Language English 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Non-Uniform State Complexity of Quantum Finite Automata and Quantum Polynomial-Time Logarithmic-Space Computation with Quantum Advice 
Sub Title (in English) (Preliminary Report) 
Keyword(1) quantum finite automata  
Keyword(2) state complexity  
Keyword(3) quantum Turing machine  
Keyword(4) probabilistic finite automata  
Keyword(5) bounded-error probability  
Keyword(6) quantum advice  
Keyword(7)  
Keyword(8)  
1st Author's Name Tomoyuki Yamakami  
1st Author's Affiliation University of Fukui (U of Fukui)
2nd Author's Name  
2nd Author's Affiliation ()
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2018-11-26 09:50:00 
Presentation Time 20 minutes 
Registration for QIT 
Paper #  
Volume (vol) vol. 
Number (no)  
Page  
#Pages  
Date of Issue  

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan