default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNengkun Yu
Person information
- affiliation: Stony Brook University, New York, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j22]Nengkun Yu
:
Quantum temporal logic and reachability problems of matrix semigroups. Inf. Comput. 300: 105197 (2024)- 2023
- [j21]Nengkun Yu:
Almost Tight Sample Complexity Analysis of Quantum Identity Testing by Pauli Measurements. IEEE Trans. Inf. Theory 69(8): 5060-5068 (2023) - [j20]Nengkun Yu:
Structured Theorem for Quantum Programs and its Applications. ACM Trans. Softw. Eng. Methodol. 32(4): 103:1-103:35 (2023) - 2022
- [j19]Peng Yan, Nengkun Yu:
The QQUIC Transport Protocol: Quantum-Assisted UDP Internet Connections. Entropy 24(10): 1488 (2022) - [j18]Peng Yan, Hanru Jiang, Nengkun Yu:
On incorrectness logic for Quantum programs. Proc. ACM Program. Lang. 6(OOPSLA1): 1-28 (2022) - [j17]Nengkun Yu, Li Zhou:
Comments on and Corrections to "When Is the Chernoff Exponent for Quantum Operations Finite?". IEEE Trans. Inf. Theory 68(6): 3989-3990 (2022) - 2021
- [j16]Nengkun Yu, Li Zhou:
When is the Chernoff Exponent for Quantum Operations Finite? IEEE Trans. Inf. Theory 67(7): 4517-4523 (2021) - [j15]Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu:
Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets. IEEE Trans. Inf. Theory 67(8): 5443-5490 (2021) - 2020
- [j14]Youming Qiao, Xiaoming Sun, Nengkun Yu:
Local Equivalence of Multipartite Entanglement. IEEE J. Sel. Areas Commun. 38(3): 568-574 (2020) - [j13]Gushu Li, Li Zhou, Nengkun Yu, Yufei Ding, Mingsheng Ying, Yuan Xie:
Projection-based runtime assertions for testing and debugging Quantum programs. Proc. ACM Program. Lang. 4(OOPSLA): 150:1-150:29 (2020) - [j12]Gilles Barthe, Justin Hsu, Mingsheng Ying, Nengkun Yu, Li Zhou:
Relational proofs for quantum programs. Proc. ACM Program. Lang. 4(POPL): 21:1-21:29 (2020) - [j11]Li Zhou, Shenggang Ying, Nengkun Yu, Mingsheng Ying:
Strassen's theorem for quantum couplings. Theor. Comput. Sci. 802: 67-76 (2020) - [j10]Nengkun Yu:
Multipartite Entanglement Certification, With or Without Tomography. IEEE Trans. Inf. Theory 66(10): 6369-6377 (2020) - 2017
- [j9]Nengkun Yu, Runyao Duan, Quanhua Xu:
Bounds on the Distance Between a Unital Quantum Channel and the Convex Hull of Unitary Channels. IEEE Trans. Inf. Theory 63(2): 1299-1310 (2017) - [j8]Jeongwan Haah, Aram W. Harrow, Zhengfeng Ji, Xiaodi Wu, Nengkun Yu:
Sample-Optimal Tomography of Quantum States. IEEE Trans. Inf. Theory 63(9): 5628-5641 (2017) - 2015
- [j7]Taolue Chen, Nengkun Yu, Tingting Han:
Continuous-time orbit problems are decidable in polynomial-time. Inf. Process. Lett. 115(1): 11-14 (2015) - [j6]Somshubhro Bandyopadhyay, Alessandro Cosentino, Nathaniel Johnston, Vincent Russo, John Watrous, Nengkun Yu:
Limitations on Separable Measurements by Convex Optimization. IEEE Trans. Inf. Theory 61(6): 3593-3604 (2015) - 2014
- [j5]Yangjia Li, Nengkun Yu, Mingsheng Ying:
Termination of nondeterministic quantum programs. Acta Informatica 51(1): 1-24 (2014) - [j4]Nengkun Yu, Runyao Duan, Mingsheng Ying:
Distinguishability of Quantum States by Positive Operator-Valued Measures With Positive Partial Transpose. IEEE Trans. Inf. Theory 60(4): 2069-2079 (2014) - [j3]Mingsheng Ying, Yangjia Li, Nengkun Yu, Yuan Feng:
Model-Checking Linear-Time Properties of Quantum Systems. ACM Trans. Comput. Log. 15(3): 22:1-22:31 (2014) - 2013
- [j2]Yuan Feng, Nengkun Yu, Mingsheng Ying:
Model checking quantum Markov chains. J. Comput. Syst. Sci. 79(7): 1181-1198 (2013) - [j1]Mingsheng Ying, Nengkun Yu, Yuan Feng, Runyao Duan:
Verification of quantum programs. Sci. Comput. Program. 78(9): 1679-1700 (2013)
Conference and Workshop Papers
- 2024
- [c19]Peng Yan, Hanru Jiang, Nengkun Yu:
Approximate Relational Reasoning for Quantum Programs. CAV (3) 2024: 495-519 - 2023
- [c18]Ao Liu, Qishen Han, Lirong Xia, Nengkun Yu:
Accelerating Voting by Quantum Computation. UAI 2023: 1274-1283 - 2022
- [c17]Nengkun Yu:
Towards Efficient Reasoning of Quantum Programs. SAS 2022: 10-15 - [c16]Ji Guan, Nengkun Yu:
A Probabilistic Logic for Verifying Continuous-time Markov Chains. TACAS (2) 2022: 3-21 - 2021
- [c15]Ming Xu, Jingyi Mei, Ji Guan, Nengkun Yu:
Model Checking Quantum Continuous-Time Markov Chains. CONCUR 2021: 13:1-13:17 - [c14]Nengkun Yu:
Sample Efficient Identity Testing and Independence Testing of Quantum States. ITCS 2021: 11:1-11:20 - [c13]Hao-Chung Cheng, Andreas J. Winter, Nengkun Yu:
Discrimination of quantum states under locality constraints in the many-copy setting. ISIT 2021: 1188-1193 - [c12]Li Zhou, Gilles Barthe, Justin Hsu, Mingsheng Ying, Nengkun Yu:
A Quantum Interpretation of Bunched Logic & Quantum Separation Logic. LICS 2021: 1-14 - [c11]Nengkun Yu, Jens Palsberg:
Quantum abstract interpretation. PLDI 2021: 542-558 - 2019
- [c10]Li Zhou, Nengkun Yu, Mingsheng Ying:
An applied quantum Hoare logic. PLDI 2019: 1149-1162 - 2018
- [c9]Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu:
Capacity approaching coding for low noise interactive quantum communication. STOC 2018: 339-352 - 2017
- [c8]Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu:
Exponential separation of quantum communication and classical information. STOC 2017: 277-288 - 2016
- [c7]Shawn X. Cui, Zheng-Feng Ji, Nengkun Yu, Bei Zeng:
Quantum capacities for entanglement networks. ISIT 2016: 1685-1689 - [c6]Jeongwan Haah, Aram W. Harrow, Zheng-Feng Ji, Xiaodi Wu, Nengkun Yu:
Sample-optimal tomography of quantum states. STOC 2016: 913-925 - 2013
- [c5]Shenggang Ying, Yuan Feng, Nengkun Yu, Mingsheng Ying:
Reachability Probabilities of Quantum Markov Chains. CONCUR 2013: 334-348 - [c4]Mingsheng Ying, Yuan Feng, Nengkun Yu:
Quantum Information-Flow Security: Noninterference and Access Control. CSF 2013: 130-144 - [c3]Youming Qiao, Xiaoming Sun, Nengkun Yu:
Determinantal Complexities and Field Extensions. ISAAC 2013: 119-129 - [c2]Yuan Feng, Nengkun Yu, Mingsheng Ying:
Reachability Analysis of Recursive Quantum Markov Chains. MFCS 2013: 385-396 - 2012
- [c1]Nengkun Yu, Mingsheng Ying:
Reachability and Termination Analysis of Concurrent Quantum Programs. CONCUR 2012: 69-83
Informal and Other Publications
- 2023
- [i24]Ao Liu, Lirong Xia, Nengkun Yu:
Accelerating Majority Voting by Quantum Computation. CoRR abs/2301.02995 (2023) - 2022
- [i23]Jingyi Mei, Ming Xu, Ji Guan, Yuxin Deng, Nengkun Yu:
Checking Continuous Stochastic Logic against Quantum Continuous-Time Markov Chains. CoRR abs/2202.05412 (2022) - 2021
- [i22]Li Zhou, Gilles Barthe, Justin Hsu, Mingsheng Ying, Nengkun Yu:
A Quantum Interpretation of Bunched Logic for Quantum Separation Logic. CoRR abs/2102.00329 (2021) - [i21]Ming Xu, Jingyi Mei, Ji Guan, Nengkun Yu:
Model Checking Quantum Continuous-Time Markov Chains. CoRR abs/2105.00382 (2021) - [i20]Nengkun Yu:
Quantum Max-Flow Min-Cut theorem. CoRR abs/2110.00905 (2021) - 2020
- [i19]Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu:
Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets. CoRR abs/2001.02818 (2020) - [i18]Ji Guan, Nengkun Yu:
Verification of Continuous-time Markov Chains. CoRR abs/2004.08059 (2020) - [i17]Peng Yan, Nengkun Yu:
The QQUIC Transport Protocol: Quantum assisted UDP Internet Connections. CoRR abs/2006.00653 (2020) - 2019
- [i16]Gilles Barthe, Justin Hsu, Mingsheng Ying, Nengkun Yu, Li Zhou:
Coupling Techniques for Reasoning about Quantum Programs. CoRR abs/1901.05184 (2019) - [i15]Nengkun Yu, Ching-Yi Lai, Li Zhou:
Protocols for Packet Quantum Network Intercommunication. CoRR abs/1903.10685 (2019) - [i14]Nengkun Yu:
Quantum Temporal Logic. CoRR abs/1908.00158 (2019) - [i13]Gushu Li, Li Zhou, Nengkun Yu, Yufei Ding, Mingsheng Ying, Yuan Xie:
Poq: Projection-based Runtime Assertions for Debugging on a Quantum Computer. CoRR abs/1911.12855 (2019) - 2018
- [i12]Li Zhou, Shenggang Ying, Nengkun Yu, Mingsheng Ying:
Quantum Coupling and Strassen Theorem. CoRR abs/1803.10393 (2018) - 2016
- [i11]Shawn X. Cui, Zhengfeng Ji, Nengkun Yu, Bei Zeng:
Quantum Capacities for Entanglement Networks. CoRR abs/1602.00401 (2016) - [i10]Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu:
Exponential Separation of Quantum Communication and Classical Information. CoRR abs/1611.08946 (2016) - 2015
- [i9]Jeongwan Haah, Aram W. Harrow, Zhengfeng Ji, Xiaodi Wu, Nengkun Yu:
Sample-optimal tomography of quantum states. CoRR abs/1508.01797 (2015) - 2014
- [i8]Mingsheng Ying, Nengkun Yu, Yuan Feng:
Alternation in Quantum Programming: From Superposition of Data to Superposition of Programs. CoRR abs/1402.5172 (2014) - 2013
- [i7]Mingsheng Ying, Yuan Feng, Nengkun Yu:
Quantum Information-Flow Security: Noninterference and Access Control. CoRR abs/1301.6804 (2013) - [i6]Taolue Chen, Xiaoming Sun, Nengkun Yu:
Orbit Problem Revisited. CoRR abs/1302.0566 (2013) - 2012
- [i5]Yangjia Li, Nengkun Yu, Mingsheng Ying:
Termination of Nondeterministic Quantum Programs. CoRR abs/1201.0891 (2012) - [i4]Yuan Feng, Nengkun Yu, Mingsheng Ying:
Model checking quantum Markov chains. CoRR abs/1205.2187 (2012) - [i3]Nengkun Yu, Mingsheng Ying:
Reachability and Termination Analysis of Concurrent Quantum Programs. CoRR abs/1206.1935 (2012) - [i2]Mingsheng Ying, Nengkun Yu, Yuan Feng:
Defining Quantum Control Flow. CoRR abs/1209.4379 (2012) - 2011
- [i1]Mingsheng Ying, Nengkun Yu, Yuan Feng, Runyao Duan:
Verification of Quantum Programs. CoRR abs/1106.4063 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 21:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
