[1] | Xin Hong, Xiangzhen Zhou, Sanjiang Li, Yuan Feng, and Mingsheng Ying. A tensor network based decision diagram for representation of quantum circuits. ACM Trans. Des. Autom. Electron. Syst., 27(6), jun 2022. [ DOI | http ] |
[2] | Yuxiang Peng, Mingsheng Ying, and Xiaodi Wu. Algebraic reasoning of quantum programs via non-idempotent kleene algebra. In PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, pages 657–670. ACM, 2022. [ DOI | http ] |
[3] | Mingsheng Ying, Li Zhou, Yangjia Li, and Yuan Feng. A proof system for disjoint parallel quantum programs. Theor. Comput. Sci., 897:164–184, 2022. [ DOI | http ] |
[4] | Ji Guan, Wang Fang, and Mingsheng Ying. Verifying fairness in quantum machine learning. In Computer Aided Verification - 34th International Conference, CAV, volume 13372 of Lecture Notes in Computer Science, pages 408–429. Springer, 2022. [ DOI | http ] |
[5] | Junyi Liu, Li Zhou, Gilles Barthe, and Mingsheng Ying. Quantum weakest preconditions for reasoning about expected runtimes of quantum programs. In LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, pages 4:1–4:13. ACM, 2022. [ DOI | http ] Distinguished Paper Award at LICS 2022 |
[6] | Qisheng Wang, Riling Li, and Mingsheng Ying. Equivalence checking of sequential quantum circuits. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pages 1–1, 2021. [ DOI ] |
[7] | Li Zhou, Gilles Barthe, Justin Hsu, Mingsheng Ying, and Nengkun Yu. A quantum interpretation of bunched logic & quantum separation logic. In 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, pages 1–14. IEEE, 2021. [ DOI | http ] |
[8] | Mingsheng Ying. Model checking for verification of quantum circuits. In Formal Methods - 24th International Symposium, FM 2021, volume 13047 of Lecture Notes in Computer Science, pages 23–39. Springer, 2021. [ DOI | http ] |
[9] | Xin Hong, Mingsheng Ying, Yuan Feng, Xiangzhen Zhou, and Sanjiang Li. Approximate equivalence checking of noisy quantum circuits. In 58th ACM/IEEE Design Automation Conference, DAC 2021, pages 637–642. IEEE, 2021. [ DOI | http ] |
[10] | Ji Guan, Qisheng Wang, and Mingsheng Ying. An HHL-based algorithm for computing hitting probabilities of quantum walks. Quantum Inf. Comput., 21(5&6):395–408, 2021. [ DOI | http ] |
[11] | Qisheng Wang, Junyi Liu, and Mingsheng Ying. Equivalence checking of quantum finite-state machines. J. Comput. Syst. Sci., 116:1–21, 2021. [ DOI | http ] |
[12] | Mingsheng Ying, Yuan Feng, and Shenggang Ying. Optimal policies for quantum markov decision processes. Int. J. Autom. Comput., 18(3):410–421, 2021. [ DOI | http ] |
[13] | Gilles Barthe, Justin Hsu, Mingsheng Ying, Nengkun Yu, and Li Zhou. Relational proofs for quantum programs. Proc. ACM Program. Lang., 4(POPL):21:1–21:29, 2020. [ DOI | http ] |
[14] | Gushu Li, Li Zhou, Nengkun Yu, Yufei Ding, Mingsheng Ying, and Yuan Xie. Projection-based runtime assertions for testing and debugging quantum programs. Proc. ACM Program. Lang., 4(OOPSLA):150:1–150:29, 2020. [ DOI | http ] Distinguished Paper Award at OOPSLA 2020 |
[15] | Riling Li, Bujiao Wu, Mingsheng Ying, Xiaoming Sun, and Guangwen Yang. Quantum supremacy circuit simulation on sunway taihulight. IEEE Trans. Parallel Distributed Syst., 31(4):805–816, 2020. [ DOI | http ] 2020 Best Paper Award for IEEE Transactions on Parallel and Distributed Systems |
[16] | Li Zhou, Shenggang Ying, Nengkun Yu, and Mingsheng Ying. Strassen's theorem for quantum couplings. Theor. Comput. Sci., 802:67–76, 2020. [ DOI | http ] |
[17] | Li Zhou, Nengkun Yu, and Mingsheng Ying. An applied quantum hoare logic. In Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2019, pages 1149–1162. ACM, 2019. [ DOI | http ] |
[18] | Junyi Liu, Bohua Zhan, Shuling Wang, Shenggang Ying, Tao Liu, Yangjia Li, Mingsheng Ying, and Naijun Zhan. Formal verification of quantum algorithms using quantum hoare logic. In Computer Aided Verification - 31st International Conference, CAV 2019, volume 11562 of Lecture Notes in Computer Science, pages 187–207. Springer, 2019. [ DOI | http ] |
[19] | Shih-Han Hung, Kesha Hietala, Shaopeng Zhu, Mingsheng Ying, Michael Hicks, and Xiaodi Wu. Quantitative robustness analysis of quantum programs. Proc. ACM Program. Lang., 3(POPL):31:1–31:29, 2019. [ DOI | http ] |
[20] | Mingsheng Ying. Toward automatic verification of quantum programs. Formal Aspects Comput., 31(1):3–25, 2019. [ DOI | http ] |
[21] | Junyi Liu, Bohua Zhan, Shuling Wang, Shenggang Ying, Tao Liu, Yangjia Li, Mingsheng Ying, and Naijun Zhan. Quantum hoare logic. Arch. Formal Proofs, 2019, 2019. [ .html ] |
[22] | Yangjia Li and Mingsheng Ying. Algorithmic analysis of termination problems for quantum programs. Proc. ACM Program. Lang., 2(POPL):35:1–35:29, 2018. [ DOI | http ] |
[23] | Ji Guan, Yuan Feng, and Mingsheng Ying. Super-activating quantum memory with entanglement. Quantum Inf. Comput., 18(13&14):1115–1124, 2018. [ DOI | http ] |
[24] | Ji Guan, Yuan Feng, and Mingsheng Ying. Decomposition of quantum markov chains and its applications. J. Comput. Syst. Sci., 95:55–68, 2018. [ DOI | http ] |
[25] | Shenggang Ying and Mingsheng Ying. Reachability analysis of quantum markov decision processes. Inf. Comput., 263:31–51, 2018. [ DOI | http ] |
[26] | Mingsheng Ying, Shenggang Ying, and Xiaodi Wu. Invariants of quantum programs: characterisations and generation. In Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, pages 818–832. ACM, 2017. [ DOI | http ] |
[27] | Li Zhou and Mingsheng Ying. Differential privacy in quantum computation. In 30th IEEE Computer Security Foundations Symposium, CSF 2017, pages 249–262. IEEE Computer Society, 2017. [ DOI | http ] |
[28] | Yuan Feng and Mingsheng Ying. Toward automatic verification of quantum cryptographic protocols. In 26th International Conference on Concurrency Theory, CONCUR 2015, volume 42 of LIPIcs, pages 441–455. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. [ DOI | http ] |
[29] | Yangjia Li, Nengkun Yu, and Mingsheng Ying. Termination of nondeterministic quantum programs. Acta Informatica, 51(1):1–24, 2014. [ DOI | http ] |
[30] | Yangjia Li and Mingsheng Ying. (un)decidable problems about reachability of quantum systems. In CONCUR 2014 - Concurrency Theory - 25th International Conference, CONCUR 2014, volume 8704 of Lecture Notes in Computer Science, pages 482–496. Springer, 2014. [ DOI | http ] |
[31] | Mingsheng Ying, Yangjia Li, Nengkun Yu, and Yuan Feng. Model-checking linear-time properties of quantum systems. ACM Trans. Comput. Log., 15(3):22:1–22:31, 2014. [ DOI | http ] |
[32] | Yuan Feng, Yuxin Deng, and Mingsheng Ying. Symbolic bisimulation for quantum processes. ACM Trans. Comput. Log., 15(2):14:1–14:32, 2014. [ DOI | http ] |
[33] | Nengkun Yu, Runyao Duan, and Mingsheng Ying. Distinguishability of quantum states by positive operator-valued measures with positive partial transpose. IEEE Trans. Inf. Theory, 60(4):2069–2079, 2014. [ DOI | http ] |
[34] | Mingsheng Ying, Nengkun Yu, Yuan Feng, and Runyao Duan. Verification of quantum programs. Sci. Comput. Program., 78(9):1679–1700, 2013. [ DOI | http ] |
[35] | Yuan Feng, Nengkun Yu, and Mingsheng Ying. Reachability analysis of recursive quantum markov chains. In Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, volume 8087 of Lecture Notes in Computer Science, pages 385–396. Springer, 2013. [ DOI | http ] |
[36] | Mingsheng Ying, Yuan Feng, and Nengkun Yu. Quantum information-flow security: Noninterference and access control. In 2013 IEEE 26th Computer Security Foundations Symposium, pages 130–144. IEEE Computer Society, 2013. [ DOI | http ] |
[37] | Shenggang Ying, Yuan Feng, Nengkun Yu, and Mingsheng Ying. Reachability probabilities of quantum markov chains. In CONCUR 2013 - Concurrency Theory - 24th International Conference, CONCUR 2013, volume 8052 of Lecture Notes in Computer Science, pages 334–348. Springer, 2013. [ DOI | http ] |
[38] | Yuan Feng, Nengkun Yu, and Mingsheng Ying. Model checking quantum markov chains. J. Comput. Syst. Sci., 79(7):1181–1198, 2013. [ DOI | http ] |
[39] | Nengkun Yu and Mingsheng Ying. Reachability and termination analysis of concurrent quantum programs. In CONCUR 2012 - Concurrency Theory - 23rd International Conference, volume 7454 of Lecture Notes in Computer Science, pages 69–83. Springer, 2012. [ DOI | http ] |
[40] | Yuan Feng, Runyao Duan, and Mingsheng Ying. Bisimulation for quantum processes. ACM Trans. Program. Lang. Syst., 34(4):17:1–17:43, 2012. [ DOI | http ] |
[41] | Mingsheng Ying and Yuan Feng. A flowchart language for quantum programming. IEEE Trans. Software Eng., 37(4):466–485, 2011. [ DOI | http ] |
[42] | Mingsheng Ying. Floyd-hoare logic for quantum programs. ACM Trans. Program. Lang. Syst., 33(6):19:1–19:49, 2011. [ DOI | http ] |
[43] | Yuan Feng, Runyao Duan, and Mingsheng Ying. Bisimulation for quantum processes. In Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, pages 523–534. ACM, 2011. [ DOI | http ] |
[44] | Mingsheng Ying and Yuan Feng. Quantum loop programs. Acta Informatica, 47(4):221–250, 2010. [ DOI | http ] |
[45] | Jianxin Chen and Mingsheng Ying. Ancilla-assisted discrimination of quantum gates. Quantum Inf. Comput., 10(1&2):160–177, 2010. [ DOI | http ] |
[46] | Zheng-Feng Ji, Jianxin Chen, Zhaohui Wei, and Mingsheng Ying. The LU-LC conjecture is false. Quantum Inf. Comput., 10(1&2):97–108, 2010. [ DOI | http ] |
[47] | Mingsheng Ying. Quantum computation, quantum theory and AI. Artif. Intell., 174(2):162–176, 2010. [ DOI | http ] |
[48] | Mingsheng Ying, Yuan Feng, Runyao Duan, and Zheng-Feng Ji. An algebra of quantum processes. ACM Trans. Comput. Log., 10(3):19:1–19:36, 2009. [ DOI | http ] |
[49] | Runyao Duan, Yuan Feng, Yu Xin, and Mingsheng Ying. Distinguishability of quantum states by separable operations. IEEE Trans. Inf. Theory, 55(3):1320–1330, 2009. [ DOI | http ] |
[50] | Mingsheng Ying and Yuan Feng. An algebraic language for distributed quantum computing. IEEE Trans. Computers, 58(6):728–743, 2009. [ DOI | http ] |
[51] | Yuan Feng, Runyao Duan, and Mingsheng Ying. Locally undetermined states, generalized schmidt decomposition, and application in deistributed comuting. Quantum Inf. Comput., 9(11&12):997–1012, 2009. [ DOI | http ] |
[52] | Zheng-Feng Ji, Guoming Wang, Runyao Duan, Yuan Feng, and Mingsheng Ying. Parameter estimation of quantum channels. IEEE Trans. Inf. Theory, 54(11):5172–5185, 2008. [ DOI | http ] |
[53] | Yuan Feng, Runyao Duan, Zheng-Feng Ji, and Mingsheng Ying. Proof rules for the correctness of quantum programs. Theor. Comput. Sci., 386(1-2):151–166, 2007. [ DOI | http ] |
[54] | Mingsheng Ying, Jianxin Chen, Yuan Feng, and Runyao Duan. Commutativity of quantum weakest preconditions. Inf. Process. Lett., 104(4):152–158, 2007. [ DOI | http ] |
[55] | Yuan Feng, Runyao Duan, Zheng-Feng Ji, and Mingsheng Ying. Probabilistic bisimulations for quantum processes. Inf. Comput., 205(11):1608–1639, 2007. [ DOI | http ] |
[56] | Runyao Duan, Yuan Feng, and Mingsheng Ying. Partial recovery of quantum entanglement. IEEE Trans. Inf. Theory, 52(7):3080–3104, 2006. [ DOI | http ] |
[57] | Runyao Duan, Zheng-Feng Ji, Yuan Feng, and Mingsheng Ying. Some issues in quantum information theory. J. Comput. Sci. Technol., 21(5):776–789, 2006. [ DOI | http ] |
[58] | Yuan Feng, Runyao Duan, and Mingsheng Ying. Catalyst-assisted probabilistic entanglement transformation. IEEE Trans. Inf. Theory, 51(3):1090–1101, 2005. [ DOI | http ] |
[59] | Xiaoming Sun, Runyao Duan, and Mingsheng Ying. The existence of quantum entanglement catalysts. IEEE Trans. Inf. Theory, 51(1):75–80, 2005. [ DOI | http ] |
[60] | Mingsheng Ying. A theory of computation based on quantum logic (I). Theor. Comput. Sci., 344(2-3):134–207, 2005. [ DOI | http ] |
[61] | Daowen Qiu and Mingsheng Ying. Characterizations of quantum automata. Theor. Comput. Sci., 312(2-3):479–489, 2004. [ DOI | http ] |
This file was generated by bibtex2html 1.99.