Kun Fang

Kun Fang

Auto-generated profile, based on publicly available information

Kun Fang

School of Data Science, The Chinese University of Hong Kong, Shenzhen, Shenzhen, CHINA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 July 2018 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
BRBartosz Regula
Bartosz Regula
KFKun Fang
Kun Fang
XWXin Wang
Xin Wang
GAGerardo Adesso
Gerardo Adesso
We characterize the distillation of quantum coherence in the one-shot setting, that is, the conversion of general quantum states into maximally coherent states under different classes of quantum operations. We show that the maximally incoherent operations (MIO) and the dephasing-covariant incoherent operations (DIO) have the same power in the task of one-shot coherence distillation. We establish that the one-shot distillable coherence under MIO and DIO is efficiently computable with a semidefinite program, which we show to correspond to a quantum hypothesis testing problem. Further, we introduce a family of coherence monotones generalizing the robustness of coherence as well as the modified trace distance of coherence, and show that they admit an operational interpretation in characterizing the fidelity of distillation under different classes of operations. By providing an explicit formula for these quantities for pure states, we show that the one-shot distillable coherence under MIO, DIO, strictly incoherent operations, and incoherent operations is equal for all pure states.

6 August 2020 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
KFKun Fang
Kun Fang
ZLZi-Wen Liu
Zi-Wen Liu
The manipulation of quantum “resources” such as entanglement, coherence, and magic states lies at the heart of quantum science and technology, empowering potential advantages over classical methods. In practice, a particularly important kind of manipulation is to “purify” the quantum resources since they are inevitably contaminated by noise and thus often lose their power or become unreliable for direct usage. Here we prove fundamental limitations on how effectively generic noisy resources can be purified enforced by the laws of quantum mechanics, which universally apply to any reasonable kind of quantum resource. More explicitly, we derive nontrivial lower bounds on the error of converting any full-rank noisy state to any target pure resource state by any free protocol (including probabilistic ones)—it is impossible to achieve perfect resource purification, even probabilistically. Our theorems indicate strong limits on the efficiency of distillation, a widely used type of resource purification routine that underpins many key applications of quantum information science. In particular, this general result induces the first explicit lower bounds on the resource cost of magic state distillation, a leading scheme for realizing scalable fault-tolerant quantum computation. Implications for the standard error-correction-based methods are specifically discussed.

19 October 2018 in Quantum
Verified
Journal Article
Open access
MDMaría García Díaz
María García Díaz
KFKun Fang
Kun Fang
XWXin Wang
Xin Wang
MRMatteo Rosati
Matteo Rosati
MSMichalis Skotiniotis
Michalis Skotiniotis
AWAndreas Winter
Andreas Winter
Coherent superposition is a key feature of quantum mechanics that underlies the advantage of quantum technologies over their classical counterparts. Recently, coherence has been recast as a resource theory in an attempt to identify and quantify it in an operationally well-defined manner. Here we study how the coherence present in a state can be used to implement a quantum channel via incoherent operations and, in turn, to assess its degree of coherence. We introduce the robustness of coherence of a quantum channel-which reduces to the homonymous measure for states when computed on constant-output channels-and prove that: i) it quantifies the minimal rank of a maximally coherent state required to implement the channel; ii) its logarithm quantifies the amortized cost of implementing the channel provided some coherence is recovered at the output; iii) its logarithm also quantifies the zero-error asymptotic cost of implementation of many independent copies of a channel. We also consider the generalized problem of imperfect implementation with arbitrary resource states. Using the robustness of coherence, we find that in general a quantum channel can be implemented without employing a maximally coherent resource state. In fact, we prove that every pure coherent state in dimension larger than 2, however weakly so, turns out to be a valuable resource to implement some coherent unitary channel. We illustrate our findings for the case of single-qubit unitary channels.

17 August 2018 in Physical Review Letters
Verified
Journal Article
Open access
PDF file
KFKun Fang
Kun Fang
XWXin Wang
Xin Wang
LLLudovico Lami
Ludovico Lami
BRBartosz Regula
Bartosz Regula
GAGerardo Adesso
Gerardo Adesso
The ability to distill quantum coherence is pivotal for optimizing the performance of quantum technologies; however, such a task cannot always be accomplished with certainty. Here we develop a general framework of probabilistic distillation of quantum coherence in a one-shot setting, establishing fundamental limitations for different classes of free operations. We first provide a geometric interpretation for the maximal success probability, showing that under maximally incoherent operations (MIO) and dephasing-covariant incoherent operations (DIO) the problem can be simplified into efficiently computable semidefinite programs. Exploiting these results, we find that DIO and its subset of strictly incoherent operations have equal power in the probabilistic distillation of coherence from pure input states, while MIO are strictly stronger. We then prove a fundamental no-go result: Distilling coherence from any full-rank state is impossible even probabilistically. We further find that in some conditions the maximal success probability can vanish suddenly beyond a certain threshold in the distillation fidelity. Finally, we consider probabilistic coherence distillation assisted by a catalyst and demonstrate, with specific examples, its superiority to the unassisted and deterministic cases.

6 May 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
KFKun Fang
Kun Fang
XWXin Wang
Xin Wang
MTMarco Tomamichel
Marco Tomamichel
RDRunyao Duan
Runyao Duan
Entanglement distillation, an essential quantum information processing task, refers to the conversion from multiple copies of noisy entangled states to a smaller number of highly entangled states. In this work, we study the non-asymptotic fundamental limits for entanglement distillation. We investigate the optimal tradeoff between the distillation rate, the number of prepared states, and the error tolerance. First, we derive the one-shot distillable entanglement under completely positive partial transpose preserving operations as a semidefinite program and demonstrate an exact characterization via the quantum hypothesis testing relative entropy. Second, we establish efficiently computable second-order estimations of the distillation rate for general quantum states. In particular, we provide explicit as well as approximate evaluations for various quantum states of practical interest, including pure states, mixture of Bell states, maximally correlated states and isotropic states.

5 October 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
XWXin Wang
Xin Wang
KFKun Fang
Kun Fang
RDRunyao Duan
Runyao Duan
We derive several efficiently computable converse bounds for quantum communication over quantum channels in both the one-shot and asymptotic regime. First, we derive one-shot semidefinite programming (SDP) converse bounds on the amount of quantum information that can be transmitted over a single use of a quantum channel, which improve the previous bound from [Tomamichel/Berta/Renes, Nat. Commun. 7, 2016]. As applications, we study quantum communication over depolarizing channels and amplitude damping channels with finite resources. Second, we find an SDP strong converse bound for the quantum capacity of an arbitrary quantum channel, which means the fidelity of any sequence of codes with a rate exceeding this bound will vanish exponentially fast as the number of channel uses increases. Furthermore, we prove that the SDP strong converse bound improves the partial transposition bound introduced by Holevo and Werner. Third, we prove that this SDP strong converse bound is equal to the socalled max-Rains information, which is an analog to the Rains information introduced in [Tomamichel/Wilde/Winter, IEEE Trans. Inf. Theory 63:715, 2017]. Our SDP strong converse bound is weaker than the Rains information, but it is efficiently computable for general quantum channels.