465 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Tsinghua UniversityCN89 papers
- Beijing National Research Center for Information Science and TechnologyCN18 papers
- University of Technology SydneyAU16 papers
- Chinese Academy of SciencesCN6 papers
- Tencent (China)CN4 papers
- Academy of Mathematics and Systems ScienceCN3 papers
- Baidu (China)CN3 papers
- Beijing University of Posts and TelecommunicationsCN3 papers
- Institució Catalana de Recerca i Estudis AvançatsES3 papers
- Institute of SoftwareCN3 papers
- Microsoft (United States)US3 papers
- State Key Laboratory of Computer Science3 papers
32 papers · 1 filter
On zero-error communication via quantum channels in the presence of noiseless feedback
Runyao Duan, Simone Severini, Andreas Winter
We initiate the study of zero-error communication via quantum channels when the receiver and sender have at their disposal a noiseless feedback channel of unlimited quantum capacit…
No-Signalling Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovasz Number
Runyao Duan, Andreas Winter
We study the one-shot zero-error classical capacity of a quantum channel assisted by quantum no-signalling correlations, and the reverse problem of exact simulation of a prescribed…
Obtain -state from three-qubit -state on rate 1
Nengkun Yu, Cheng Guo, Runyao Duan
In this paper, we study the entanglement transformation rate between multipartite states under stochastic local operations and classical communication (SLOCC). Firstly, we show tha…
Five Two-Qubit Gates Are Necessary for Implementing Toffoli Gate
Nengkun Yu, Runyao Duan, Mingsheng Ying
In this paper, we settle the long-standing open problem of the minimum cost of two-qubit gates for simulating a Toffoli gate. More precisely, we show that five two-qubit gates are…
Multi-partite type state is determined by its single particle reduced density matrices
Nengkun Yu
In this short note, we show that multi-partite -type state is up to local unitaries uniquely determined by its reduced density matrices.
Four Locally Indistinguishable Ququad-Ququad Orthogonal Maximally Entangled States
Nengkun Yu, Runyao Duan, Mingsheng Ying
We explicitly exhibit a set of four ququad-ququad orthogonal maximally entangled states that cannot be perfectly distinguished by means of local operations and classical communicat…
Any subspace is locally distinguishable
Nengkun Yu, Runyao Duan, Mingsheng Ying
A subspace of a multipartite Hilbert space is called \textit{locally indistinguishable} if any orthogonal basis of this subspace cannot be perfectly distinguished by local operatio…
Multi-Error-Correcting Amplitude Damping Codes
Runyao Duan, Markus Grassl, Zhengfeng Ji +1
We construct new families of multi-error-correcting quantum codes for the amplitude damping channel. Our key observation is that, with proper encoding, two uses of the amplitude da…
Local Unambiguous Discrimination with Remaining Entanglement
Yangjia Li, Runyao Duan, Mingsheng Ying
A bipartite state which is secretly chosen from a finite set of known entangled pure states cannot be immediately useful in standard quantum information processing tasks. To effect…
The Tensor Rank of the Tripartite State }
Nengkun Yu, Eric Chitambar, Cheng Guo +1
Tensor rank refers to the number of product states needed to express a given multipartite quantum state. Its non-additivity as an entanglement measure has recently been observed. I…
Optimal Simulation of a Perfect Entangler
Nengkun Yu, Runyao Duan, Mingsheng Ying
A unitary operation is called a perfect entangler if it can generate a maximally entangled state from some unentangled input. We study the following question: How many…
Tripartite to Bipartite Entanglement Transformations and Polynomial Identity Testing
Eric Chitambar, Runyao Duan, Yaoyun Shi
We consider the problem of deciding if a given three-party entangled pure state can be converted, with a non-zero success probability, into a given two-party pure state through loc…
The Perfect Distinguishability of Quantum Operations
Runyao Duan, Yuan Feng, Mingsheng Ying
We provide a feasible necessary and sufficient condition for when an unknown quantum operation (quantum device) secretely selected from a set of known quantum operations can be ide…
Perfect many-to-one teleportation with stabilizer states
Guoming Wang, Mingsheng Ying
We study the possibility of performing perfect teleportation of unknown quantum states from multiple senders to a single receiver with a previously shared stabilizer state. In the…
Deterministic distributed dense coding with stabilizer states
Guoming Wang, Mingsheng Ying
We consider the possibility of using stabilizer states to perform deterministic dense coding among multiple senders and a single receiver. In the model we studied, the utilized sta…
The LU-LC conjecture is false
Zhengfeng Ji, Jianxin Chen, Zhaohui Wei +1
The LU-LC conjecture is an important open problem concerning the structure of entanglement of states described in the stabilizer formalism. It states that two local unitary equival…
Local Distinguishability of Multipartite Unitary Operations
Runyao Duan, Yuan Feng, Mingsheng Ying
We show that any two different unitary operations acting on an arbitrary multipartite quantum system can be perfectly distinguishable by local operations and classical communicatio…
Parameter estimation of quantum channels
Zhengfeng Ji, Guoming Wang, Runyao Duan +2
The efficiency of parameter estimation of quantum channels is studied in this paper. We introduce the concept of programmable parameters to the theory of estimation. It is found th…
Majorization in Quantum Adiabatic Algorithms
Zhaohui Wei, Zhengfeng Ji, Mingsheng Ying
The majorization theory has been applied to analyze the mathematical structure of quantum algorithms. An empirical conclusion by numerical simulations obtained in the previous lite…
Quantum loop programs
Mingsheng Ying, Yuan Feng
Loop is a powerful program construct in classical computation, but its power is still not exploited fully in quantum computation. The exploitation of such power definitely requires…
Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations
Runyao Duan, Yuan Feng, Mingsheng Ying
We show that a unitary operation (quantum circuit) secretely chosen from a finite set of unitary operations can be determined with certainty by sequentially applying only a finite…
Identification and Distance Measures of Measurement Apparatus
Zhengfeng Ji, Yuan Feng, Runyao Duan +1
We propose simple schemes that can perfectly identify projective measurement apparatus secretly chosen from a finite set. Entanglements are used in these schemes both to make possi…
A modified quantum adiabatic evolution for the Deutsch-Jozsa problem
Zhaohui Wei, Mingsheng Ying
Deutsch-Jozsa algorithm has been implemented via a quantum adiabatic evolution by S. Das et al. [Phys. Rev. A 65, 062310 (2002)]. This adiabatic algorithm gives rise to a quadratic…
Unambiguous discrimination among quantum operations
Guoming Wang, Mingsheng Ying
We address the problem of unambiguous discrimination among a given set of quantum operations. The necessary and sufficient condition for them to be unambiguously distinguishable is…