Author:
Ambainis Andris,Iwama Kazuo,Nakanishi Masaki,Nishimura Harumichi,Raymond Rudy,Tani Seiichiro,Yamashita Shigeru
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference19 articles.
1. Ambainis Andris (1999) A Note on Quantum Black-Box Complexity of Almost all Boolean Functions. Information Processing Letters 71(1): 5–7
2. Andris Ambainis, Arturs Bačkurs, Juris Smotrovs & Ronald de Wolf (2013). Optimal quantum query bounds for almost all Boolean functions. In Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 446–453.
3. A. Ambainis, A. M. Childs, B. W. Reichardt, R. Špalek, & S. Zhang (2010). Any AND-OR Formula of Size $${{N}}$$ N Can Be Evaluated in Time $${{N}^{1/2+o(1)}}$$ N 1 / 2 + o ( 1 ) on a Quantum Computer. SIAM Journal on Computing 39(6): 2513–2530
4. Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra & Shigeru Yamashita (2004). Quantum Identification of Boolean Oracles. In Proceedings of the Twenty-First Annual Symposium on Theoretical Aspects of Computer Science (STACS’04), volume 2996 of Lecture Notes in Computer Science, 105–116. Springer.
5. Ambainis Andris, Iwama Kazuo, Kawachi Akinori, Raymond Rudy, Yamashita Shigeru (2007) Improved algorithms for quantum identification of Boolean oracles. Theoretical Computer Science 378(1): 41–53
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献