Author:
Ambainis Andris,Watrous John
Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. D. Aharonov, A. Kitaev, N. Nisan, Quantum circuits with mixed states, in: Proc. 30th Annu. ACM Symp. on Theory of Computing, Dallas, Texas, 1998, pp. 20–30.
2. A. Ambainis, R. Freivalds, 1-way quantum finite automata: strengths, weaknesses and generalizations, in: Proc. 39th Annu. Symp. on Foundations of Computer Science, Palo Alfo, California, 1998, pp. 332–341.
3. A. Ambainis, A. Nayak, A. Ta-Shma, U. Vazirani, Dense quantum coding and a lower bound for 1-way quantum automata, in: Proc. 31st Annu. ACM Symp. on Theory of Computing, Atlanta, Georgia, 1999, pp. 376–383.
4. Quantum computation;Berthiaume,1997
5. A. Brodsky, N. Pippenger, Characterizations of 1-way quantum finite automata, Los Alamos Preprint Archive, quant-ph/9903014, 1999.
Cited by
104 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Quantum Representation for Deterministic Pushdown Automata;2024-08-08
2. Lifting query complexity to time-space complexity for two-way finite automata;Journal of Computer and System Sciences;2024-05
3. Is creativity computable?;Journal of Cognitive Psychology;2024-02-14
4. Quantum finite automaton-based algorithm for identifying rain cell turbulences in synthetic aperture radar images;Synthetic Aperture Radar Image Processing Algorithms for Nonlinear Oceanic Turbulence and Front Modeling;2024
5. Experimental Demonstration Advantage of Photonic Finite Automata;2023 Asia Communications and Photonics Conference/2023 International Photonics and Optoelectronics Meetings (ACP/POEM);2023-11-04