Nengkun Yu

Nengkun Yu

University of Technology

H-index: 25

Asia-India

About Nengkun Yu

Nengkun Yu, With an exceptional h-index of 25 and a recent h-index of 21 (since 2020), a distinguished researcher at University of Technology, specializes in the field of Quantum Information and Computation.

His recent articles reflect a diverse array of research interests and contributions to the field:

What if you have only one copy? Low-depth quantum circuits have no advantage in decision problems!

Discrimination of quantum states under locality constraints in the many-copy setting

Structured Theorem for Quantum Programs and its Applications

Almost Tight Sample Complexity Analysis of Quantum Identity Testing by Pauli Measurements

Learning marginals suffices!

The QQUIC Transport Protocol: Quantum-Assisted UDP Internet Connections

Quantum earth mover’s distance, a no-go quantum Kantorovich–Rubinstein theorem, and quantum marginal problem

Sample optimal tomography of quantum Markov chains

Nengkun Yu Information

University

Position

___

Citations(all)

1943

Citations(since 2020)

1356

Cited By

1116

hIndex(all)

25

hIndex(since 2020)

21

i10Index(all)

43

i10Index(since 2020)

34

Email

University Profile Page

University of Technology

Google Scholar

View Google Scholar Profile

Nengkun Yu Skills & Research Interests

Quantum Information and Computation

Top articles of Nengkun Yu

Title

Journal

Author(s)

Publication Date

What if you have only one copy? Low-depth quantum circuits have no advantage in decision problems!

arXiv preprint arXiv:2404.05714

Nengkun Yu

2024/4/8

Discrimination of quantum states under locality constraints in the many-copy setting

Communications in Mathematical Physics

Hao-Chung Cheng

Andreas Winter

Nengkun Yu

2023/11

Structured Theorem for Quantum Programs and its Applications

ACM Transactions on Software Engineering and Methodology

Nengkun Yu

2023/5/26

Almost Tight Sample Complexity Analysis of Quantum Identity Testing by Pauli Measurements

IEEE Transactions on Information Theory

Nengkun Yu

2023/4/27

Learning marginals suffices!

arXiv preprint arXiv:2303.08938

Nengkun Yu

Tzu-Chieh Wei

2023/3/15

The QQUIC Transport Protocol: Quantum-Assisted UDP Internet Connections

Entropy

Peng Yan

Nengkun Yu

2022/10/18

Quantum earth mover’s distance, a no-go quantum Kantorovich–Rubinstein theorem, and quantum marginal problem

Journal of Mathematical Physics

Li Zhou

Nengkun Yu

Shenggang Ying

Mingsheng Ying

2022/10/1

Sample optimal tomography of quantum Markov chains

arXiv preprint arXiv:2209.02240

Li Gao

Nengkun Yu

2022/9/6

On incorrectness logic for Quantum programs

Proceedings of the ACM on Programming Languages

Peng Yan

Hanru Jiang

Nengkun Yu

2022/4/29

A probabilistic logic for verifying continuous-time Markov chains

Ji Guan

Nengkun Yu

2022/3/30

Towards efficient reasoning of quantum programs

Nengkun Yu

2022/12/2

Checking continuous stochastic logic against quantum continuous-time Markov chains

arXiv preprint arXiv:2202.05412

Jingyi Mei

Ming Xu

Ji Guan

Yuxin Deng

Nengkun Yu

2022/2/11

Model checking quantum continuous-time Markov chains

arXiv preprint arXiv:2105.00382

Ming Xu

Jingyi Mei

Ji Guan

Nengkun Yu

2021/5/2

Quantum Max-Flow Min-Cut theorem

arXiv preprint arXiv:2110.00905

Nengkun Yu

2021/10/3

When is the Chernoff exponent for quantum operations finite?

IEEE Transactions on Information Theory

Nengkun Yu

Li Zhou

2021/3/22

Protocols for packet quantum network intercommunication

IEEE Transactions on Quantum Engineering

Nengkun Yu

Ching-Yi Lai

Li Zhou

2021/9/14

Experimental cryptographic verification for near-term quantum cloud computing

Science Bulletin

Xi Chen

Bin Cheng

Zhaokai Li

Xinfang Nie

Nengkun Yu

...

2021/1/15

Entirety of Quantum Uncertainty and Its Experimental Verification

Chinese Physics Letters

Jie Xie

Li Zhou

Aonan Zhang

Huichao Xu

Man-Hong Yung

...

2021/7/1

Quantum Abstract Interpretation

Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation

Nengkun Yu

Jens Palsberg

2021

LOCC protocols with bounded width per round optimize convex functions

Debbie Leung

Andreas Winter

Nengkun Yu

2021/6/30

See List of Professors in Nengkun Yu University(University of Technology)

Co-Authors

H-index: 100
Yuan Xie

Yuan Xie

University of California, Santa Barbara

H-index: 69
Gui Lu Long

Gui Lu Long

Tsinghua University

H-index: 53
Mingsheng Ying

Mingsheng Ying

University of Technology

academic-engine