Equivalence Checking of Quantum Finite-State Machines release_x2m4lqgz5bhajmo56kavahflai

by Qisheng Wang and Junyi Liu and Mingsheng Ying


NOTE: currently batch computed and may include additional references sources, or be missing recent changes, compared to entity reference list.
Fuzzy reference matching is a work in progress!
Read more about quality, completeness, and caveats in the fatcat guide.
Showing 1 - 30 of 41 references (in 126ms)

via grobid
Ardeshir-Larijani, E., Gay, S.J., Nagarajan R.: Equivalence checking of quantum protocols. In: Proceedings of TACAS 2013, pp. 478-492 (2013)

via grobid
Ardeshir-Larijani, E., Gay, S.J., Nagarajan R.: Verification of concurrent quantum protocols by equivalence checking. In: Proceedings of TACAS 2014, pp. 500-514 (2014)

via grobid
Banerjee, A., Pathak, A.: Probabilistic model of fault detection in quantum circuits. In: Quantum Quenching, Annealing and Computation. Springer Lecture Notes in Physics, vol. 802, pp. 297-304 (2010)

via grobid
Basu, S., Pollack, R., Roy, M.: Algorithms in Real Algebraic Geometry (2nd Edi- tion), Springer (2006)

via fuzzy
Detection and Diagnosis of Single Faults in Quantum Circuits
Debajyoti Bera
2018   IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

via grobid
Bertoni, A., Mereghetti, C., Palano, B.: Quantum computing: 1-way quantum au- tomata. In: Proceedings of the 9th International Conference on Developments in Language Theory (DLT). Lecture Notes in Computer Science, vol. 2710, pp. 1-20 (2003)

via fuzzy
Fault Models for Quantum Mechanical Switching Networks
Jacob D. Biamonte, Jeff S. Allen, Marek A. Perkowski
2010   Journal of electronic testing
web.archive.org [PDF]

via fuzzy
Characterizations of 1-Way Quantum Finite Automata
Alex Brodsky, Nicholas Pippenger
2002   SIAM journal on computing (Print)
web.archive.org [PDF]

via grobid
Canny J.: Some algebraic and geometric computations in PSPACE. In: Proceedings of the 20th annual ACM Symposium on Theory of Computing, ACM, pp. 460-469 (1988)

via grobid
Gudder, S.: Quantum computers. In: International Journal of Theoretical Physics, 39(9), 2151-2177 (2000)

via grobid
Hung, W.N.-N., Song, X.-Y., Yang, G.-W., Yang, J., Perkowski, M.: Quantum logic synthesis by symbolic reachability analysis. In: Proceedings of the 41st annual Design Automation Conference (DAC), pp. 838-841 (2004)

via grobid
Kohavi, Z., Jha, N.K.: Switching and Finite Automata Theory (3rd Edition), Cam- bridge University Press (2010)

via grobid
Kiefer, S., Wachter, B.: Stability and complexity of minimising probabilistic au- tomata. In: International Colloquium on Automata, Languages, and Programming, pp. 268-279 (2014)

via fuzzy
On the power of quantum finite state automata
A. Kondacs, J. Watrous
IEEE Annual Symposium on Foundations of Computer Science
doi:10.1109/sfcs.1997.646094  dblp:conf/focs/KondacsW97 
web.archive.org [PDF]

via grobid
Koshiba, T.: Polynomial-time algorithms for the equivalence for one-way quantum finite automata. In: Proceedings of the 12th International Symposium on Algo- rithms and Computation (ISAAC). Lecture Notes in Computer Science, vol. 2223, pp. 268-278 (2001)

via grobid
Lee, D., Yannakakis, M.: Testing finite-state machines: state identification and verification. In: IEEE Transactions on Computers, 43(3), 306-320 (1994)

via grobid
Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines - a survey. In: Proceedings of the IEEE, 84(8), 1090-1123 (1996)

via grobid
A Polynomial-Time Algorithm for the Equivalence between Quantum Sequential Machines [article]
Lvzhou Li, Daowen Qiu
2006    pre-print
version:v1  arXiv:quant-ph/0604085v1 
web.archive.org [PDF]

via grobid
Li, L.-Z., Qiu, D.-W.: Determining the equivalence for 1-way quantum finite au- tomata. In: Theoretical Computer Science, 403(1), 42-51 (2008)

via grobid
Li, L.-Z., Qiu, D.-W.: Determination of equivalence between quantum sequential machines. In: Theoretical Computer Science, 358(1), 65-74 (2006)

via grobid
Li, L.-Z., Qiu, D.-W., Zou, X.-F., Li, L.-J., Wu, L.-H., Mateus, P.: Characteri- zations of one-way general quantum finite automata. In: Theoretical Computer Science, vol. 419, pp. 73-91 (2012)

via grobid
Mateus, P., Qiu, D.-W., Li, L.-Z.: On the complexity of minimizing probabilistic and quantum automata. In: Information and Computation, 218(9), 36-53 (2012)

via grobid
Mealy, G.H.: A method for synthesizing sequential circuits. In: Bell System Tech- nical Journal, vol. 34, pp. 1045-1079 (1955)

via grobid
Moore, C., Crutchfield, J.P.: Quantum automata and quantum grammars. In: The- oretical Computer Science, 237(1), 275-306 (2000)

via grobid
Paler, A., Polian, I., Hayes, J.P.: Detection and diagnosis of faulty quantum circuits, In: Proceedings of the 17th Asia South Pac. Design Automation Conference, pp. 181-186 (2012)

via grobid
Paz, A.: Introduction to Probabilistic Automata, Academic Press (1971)

via fuzzy
Test Generation and Fault Localization for Quantum Circuits
M. Perkowski, J. Biamonte, M. Lukac
IEEE International Symposium on Multiple-Valued Logic
doi:10.1109/ismvl.2005.46  dblp:conf/ismvl/PerkowskiBL05 
web.archive.org [PDF]

via grobid
Qiu, D.-W.: Characterization of sequential quantum machines. In: International Journal of Theoretical Physics, 41(5): 811-822 (2002)

via fuzzy
Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
Daowen Qiu, Lvzhou Li, Xiangfu Zou, Paulo Mateus, Jozef Gruska
2011   Acta Informatica
web.archive.org [PDF]

via grobid
Renegar, J.: A faster PSPACE algorithm for deciding the existential theory of the reals. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, IEEE, pp. 291-295 (1988)
Showing 1 - 30 of 41 references  next »