Overcoming the Superposition-State Limitation for Directed Graph Centrality Ranking with Ancilla Assistance

Jul 21, 2025·
Miaomiao Yu
,
Pingyu Zhu
,
Yang Wang
,
Yan Wang
,
Yuxing Du
Kun WANG
Kun WANG
,
Ping Xu
· 0 min read
Abstract
This work develops an ancilla-assisted method for directed-graph centrality ranking. The additional system overcomes a limitation imposed by direct superposition-state encodings and extends the class of directed graph-ranking problems that the quantum construction can address.
Type
Publication
Physical Review A 112, 012418
publication research
Quantum Algorithms Directed Graphs Centrality Ranking
Kun WANG
Authors
Kun WANG
Associate Researcher

I am an Associate Researcher and Outstanding Young Talent in the College of Computer Science and Technology, National University of Defense Technology (NUDT).

My research develops practical foundations for reliable and scalable quantum information processing. I work across photonic quantum computing, quantum characterization, verification and validation, distributed quantum estimation, and quantum information theory.

Before joining NUDT, I was a Senior Researcher at the Institute for Quantum Computing, Baidu Research, from 2020 to 2023. I led the development of the Quantum Error Processing (QEP) toolkit for characterizing, mitigating, and correcting errors in quantum devices through software. I received the Shenzhen Industrial Development and Innovation Talent Award in 2023.

Previously, I was a postdoc at the Shenzhen Institute for Quantum Science and Engineering (SIQSE), Southern University of Science and Technology, where I worked with Prof. Masahito Hayashi.