Nengkun Yu

Orcid: 0000-0003-1188-3032

Affiliations:
  • Stony Brook University, New York, USA


According to our database1, Nengkun Yu authored at least 50 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Almost Tight Sample Complexity Analysis of Quantum Identity Testing by Pauli Measurements.
IEEE Trans. Inf. Theory, August, 2023

Structured Theorem for Quantum Programs and its Applications.
ACM Trans. Softw. Eng. Methodol., July, 2023

Accelerating Majority Voting by Quantum Computation.
CoRR, 2023

Accelerating Voting by Quantum Computation.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

2022
Comments on and Corrections to "When Is the Chernoff Exponent for Quantum Operations Finite?".
IEEE Trans. Inf. Theory, 2022

On incorrectness logic for Quantum programs.
Proc. ACM Program. Lang., 2022

The QQUIC Transport Protocol: Quantum-Assisted UDP Internet Connections.
Entropy, 2022

Checking Continuous Stochastic Logic against Quantum Continuous-Time Markov Chains.
CoRR, 2022

A Probabilistic Logic for Verifying Continuous-time Markov Chains.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

Towards Efficient Reasoning of Quantum Programs.
Proceedings of the Static Analysis - 29th International Symposium, 2022

2021
When is the Chernoff Exponent for Quantum Operations Finite?
IEEE Trans. Inf. Theory, 2021

Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets.
IEEE Trans. Inf. Theory, 2021

Quantum Max-Flow Min-Cut theorem.
CoRR, 2021

Quantum abstract interpretation.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

A Quantum Interpretation of Bunched Logic & Quantum Separation Logic.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Discrimination of quantum states under locality constraints in the many-copy setting.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Sample Efficient Identity Testing and Independence Testing of Quantum States.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Model Checking Quantum Continuous-Time Markov Chains.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Multipartite Entanglement Certification, With or Without Tomography.
IEEE Trans. Inf. Theory, 2020

Strassen's theorem for quantum couplings.
Theor. Comput. Sci., 2020

Projection-based runtime assertions for testing and debugging Quantum programs.
Proc. ACM Program. Lang., 2020

Relational proofs for quantum programs.
Proc. ACM Program. Lang., 2020

Local Equivalence of Multipartite Entanglement.
IEEE J. Sel. Areas Commun., 2020

Verification of Continuous-time Markov Chains.
CoRR, 2020

2019
Poq: Projection-based Runtime Assertions for Debugging on a Quantum Computer.
CoRR, 2019

Quantum Temporal Logic.
CoRR, 2019

Protocols for Packet Quantum Network Intercommunication.
CoRR, 2019

Coupling Techniques for Reasoning about Quantum Programs.
CoRR, 2019

An applied quantum Hoare logic.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

2018
Quantum Coupling and Strassen Theorem.
CoRR, 2018

Capacity approaching coding for low noise interactive quantum communication.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
Bounds on the Distance Between a Unital Quantum Channel and the Convex Hull of Unitary Channels.
IEEE Trans. Inf. Theory, 2017

Sample-Optimal Tomography of Quantum States.
IEEE Trans. Inf. Theory, 2017

Exponential separation of quantum communication and classical information.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016
Quantum capacities for entanglement networks.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Limitations on Separable Measurements by Convex Optimization.
IEEE Trans. Inf. Theory, 2015

Continuous-time orbit problems are decidable in polynomial-time.
Inf. Process. Lett., 2015

2014
Model-Checking Linear-Time Properties of Quantum Systems.
ACM Trans. Comput. Log., 2014

Distinguishability of Quantum States by Positive Operator-Valued Measures With Positive Partial Transpose.
IEEE Trans. Inf. Theory, 2014

Alternation in Quantum Programming: From Superposition of Data to Superposition of Programs.
CoRR, 2014

Termination of nondeterministic quantum programs.
Acta Informatica, 2014

2013
Verification of quantum programs.
Sci. Comput. Program., 2013

Model checking quantum Markov chains.
J. Comput. Syst. Sci., 2013

Orbit Problem Revisited
CoRR, 2013

Reachability Analysis of Recursive Quantum Markov Chains.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Determinantal Complexities and Field Extensions.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Quantum Information-Flow Security: Noninterference and Access Control.
Proceedings of the 2013 IEEE 26th Computer Security Foundations Symposium, 2013

Reachability Probabilities of Quantum Markov Chains.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012
Defining Quantum Control Flow
CoRR, 2012

Reachability and Termination Analysis of Concurrent Quantum Programs.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012


  Loading...