Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Keming He

dblp:363/8877 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0008-3745-1637ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Quantum computing and quantum information · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
quantum information theory
0.912025
Virtual Quantum Markov Chains · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › quantum information theory
quantum markov chains
0.912025
Virtual Quantum Markov Chains · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › quantum entanglement
multipartite entanglement
0.312025
Virtual Quantum Markov Chains · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information
quantum entanglement
0.312025
Virtual Quantum Markov Chains · IEEE Trans. Inf. Theory 2025

Methods — techniques the papers use, named apart from their topics

local operations and classical communication · 0.9algebraic characterization · 0.9
YearPublicationVenuePosition
2026 O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling
Chenghong Zhu, Keming He, Xin Wang 0022, Lingling Lao
ISCA4
2025 Virtual Quantum Markov Chains
abstract
Quantum Markov chains generalize classical Markov chains for random variables to the quantum realm and exhibit unique inherent properties, making them an important feature in quantum information theory. In this work, we propose the concept ofvirtual quantum Markov chains(VQMCs), focusing on scenarios where subsystems retain classical information about global systems from measurement statistics. As a generalization of quantum Markov chains, VQMCs characterize states where arbitrary global shadow information can be recovered from subsystems through local quantum operations and measurements. We present an algebraic characterization for virtual quantum Markov chains and show that the virtual quantum recovery is fully determined by the block matrices of a quantum state on its subsystems. Notably, we find a distinction between two classes of tripartite entanglement by showing that the W state is a VQMC while the GHZ state is not. Furthermore, we introduce the virtual non- Markovianity to quantify the non-Markovianity of a given quantum state which also assesses the optimal sampling overhead for virtually recovering this state. Our findings elucidate distinctions between quantum Markov chains and virtual quantum Markov chains, extending our understanding of quantum recovery to scenarios prioritizing classical information from measurement statistics.
Yu-Ao Chen, Chengkai Zhu, Keming He, Mingrui Jing, Xin Wang 0022
IEEE Trans. Inf. Theory3