Zobrazeno 1 - 10
of 205
pro vyhledávání: '"Yu, Nengkun"'
Autor:
Yu, Nengkun
The conventional approach to understanding the characteristics of an unknown quantum state involves having numerous identical independent copies of the system in that state. However, we demonstrate that gleaning insights into specific properties is f
Externí odkaz:
http://arxiv.org/abs/2404.05714
Autor:
Trinh, Xuan Du, Yu, Nengkun
This note shows that adaptive strategies do not offer additional advantages for learning and testing Pauli channels with entangled input. First, the tight query complexity of learning Pauli channels with entangled input is established for the general
Externí odkaz:
http://arxiv.org/abs/2403.09033
Autor:
Yu, Nengkun, Wei, Tzu-Chieh
Beyond computer science, quantum complexity theory can potentially revolutionize multiple branches of physics, ranging from quantum many-body systems to quantum field theory. In this paper, we investigate the relationship between the sample complexit
Externí odkaz:
http://arxiv.org/abs/2303.08938
Studying the computational complexity and designing fast algorithms for determining winners under voting rules are classical and fundamental questions in computational social choice. In this paper, we accelerate voting by leveraging quantum computati
Externí odkaz:
http://arxiv.org/abs/2301.02995
Autor:
Gao, Li, Yu, Nengkun
A state on a tripartite quantum system $\mathcal{H}_{A}\otimes \mathcal{H}_{B}\otimes\mathcal{H}_{C} $ forms a Markov chain, i.e., quantum conditional independence, if it can be reconstructed from its marginal on $\mathcal{H}_{A}\otimes \mathcal{H}_{
Externí odkaz:
http://arxiv.org/abs/2209.02240
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 (quantum CTMCs). The branching-time properties of quantum CTMCs are specif
Externí odkaz:
http://arxiv.org/abs/2202.05412
Autor:
Yu, Nengkun
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, which connects the rank of a tensor network and the min-cut. Cui et al
Externí odkaz:
http://arxiv.org/abs/2110.00905
Autor:
Palsberg, Jens, Yu, Nengkun
Publikováno v:
In Linear Algebra and Its Applications 1 August 2024 694:206-261
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 a real-time system, we specify the temporal properties on QCTMC by si
Externí odkaz:
http://arxiv.org/abs/2105.00382