175 citations · 1.2k across the 63 of their papers we have counts for
64 papers
Learning marginals suffices!
Nengkun Yu, Tzu-Chieh Wei
Beyond computer science, quantum complexity theory can potentially revolutionize multiple branches of physics, ranging from quantum many-body systems to quantum field theory. In th…
Accelerating Voting by Quantum Computation
Ao Liu, Qishen Han, Lirong Xia +1
Studying the computational complexity and designing fast algorithms for determining winners under voting rules are classical and fundamental questions in computational social choic…
Sample optimal tomography of quantum Markov chains
Li Gao, Nengkun Yu
A state on a tripartite quantum system forms a Markov chain, i.e., quantum conditional independence, if it can be re…
Checking Continuous Stochastic Logic against Quantum Continuous-Time Markov Chains
Ming Xu, Jingyi Mei, Ji Guan +2
Verifying quantum systems has attracted a lot of interest in the last decades.In this paper, we study the quantitative model-checking of quantum continuous-time Markov chains (quan…
Quantum Max-Flow Min-Cut theorem
Nengkun Yu
The max-flow min-cut theorem is a cornerstone result in combinatorial optimization. Calegari et al. (arXiv:0802.3208) initialized the study of quantum max-flow min-cut conjecture,…
Model Checking Quantum Continuous-Time Markov Chains
Ming Xu, Jingyi Mei, Ji Guan +1
Verifying quantum systems has attracted a lot of interests in the last decades. In this paper, we initialised the model checking of quantum continuous-time Markov chain (QCTMC). As…