Nengkun Yu

According to our database1, Nengkun Yu
  • authored at least 28 papers between 2011 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

Sample-Optimal Tomography of Quantum States.
IEEE Trans. Information 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.
CoRR, 2016

Exponential Separation of Quantum Communication and Classical Information.
CoRR, 2016

Sample-optimal tomography of quantum states.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 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. Information Theory, 2015

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

Sample-optimal tomography of quantum states.
CoRR, 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. Information Theory, 2014

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

Termination of nondeterministic quantum programs.
Acta Inf., 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

Quantum Information-Flow Security: Noninterference and Access Control
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
CoRR, 2012

Model checking quantum Markov chains
CoRR, 2012

Termination of Nondeterministic Quantum Programs
CoRR, 2012

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

2011
Verification of Quantum Programs
CoRR, 2011


  Loading...