2 | Kun WANG

Efficient Verification of Stabilizer Code Subspaces with Local Measurements

Tue, 09 Jun 2026 00:00:00 +0000

Distributed Quantum Inner Product Estimation with Structured Random Circuits

Tue, 21 Apr 2026 00:00:00 +0000

Quantum Fidelity Estimation in the Resource Theory of Nonstabilizerness

Thu, 20 Nov 2025 00:00:00 +0000

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

Mon, 21 Jul 2025 00:00:00 +0000

GHZ-W Genuinely Entangled Subspace Verification with Adaptive Local Measurements

Thu, 10 Jul 2025 00:00:00 +0000

Quantum Process Overlapping Tomography: Theory and Experiment

Tue, 17 Jun 2025 00:00:00 +0000

A Fully Connected Polarization-Entangled Network via Integrated Spontaneous Four-Wave Mixing Engineering

Tue, 01 Apr 2025 00:00:00 +0000

Efficient Quantum Estimation of Hamiltonian Spectra via Shallow Circuits

Thu, 27 Feb 2025 00:00:00 +0000

Quantum Memory Assisted Entangled State Verification with Local Measurements

Thu, 02 Jan 2025 00:00:00 +0000

Detecting and Eliminating Quantum Noise of Quantum Measurements

Wed, 25 Sep 2024 00:00:00 +0000

Retrieving Nonlinear Features from Noisy Quantum States

Wed, 12 Jun 2024 00:00:00 +0000

Quantifying the unextendibility of entanglement

Thu, 14 Mar 2024 00:00:00 +0000

Cross-Platform Comparison of Arbitrary Quantum Processes

Wed, 03 Jan 2024 00:00:00 +0000

Fidelity Estimation of Entangled Measurements with Local States

Thu, 21 Dec 2023 00:00:00 +0000

Mitigating quantum errors via truncated Neumann series

Wed, 05 Jul 2023 00:00:00 +0000

Dense Coding with Locality Restriction on Decoders: Quantum Encoders versus Superquantum Encoders

Thu, 29 Sep 2022 00:00:00 +0000

Brief Summary

Dense coding is one of the earliest and most prominent quantum protocols that reveal the power of quantum entanglement in communication. Although it has been intensively studied, it has typically been restricted to scenarios where the receiver can perform global measurements to decode information, which is experimentally challenging. Thus, it is natural to impose locality conditions on the decoders from a practical perspective.

In this work, we explore the practicality of dense coding by elaborating 21 classes of dense coding capacities with different encoder-decoder pairs, where the encoders are constrained by the resource theory of asymmetry and the decoders are constrained by various locality conditions. Our contributions are to 1) show that all these capacities are equal and derive a single-letter capacity formula; 2) prove that all these capacities satisfy the desirable strong converse property; and 3) establish an equivalence among three different quantities of a bipartite quantum state—the operationally defined dense coding capacity, the mathematically defined regularized asymmetry of assistance, and the quantum entropy of the twirled quantum state—thus providing the regularized asymmetry of the assistance measure an operational meaning.

Our results significantly push forward the research of practical dense coding in both the one-shot and asymptotic regimes within different resource theories. These results deepen our understanding of quantum entanglement and dense coding, and, more generally, the classical and quantum communication via quantum resources.

Published in .

Experimental optimal verification of three-dimensional entanglement on a silicon chip

Tue, 06 Sep 2022 00:00:00 +0000

Detecting and quantifying entanglement on near-term quantum devices

Mon, 09 May 2022 00:00:00 +0000

Physical Implementability of Linear Maps and Its Application in Error Mitigation

Tue, 07 Dec 2021 00:00:00 +0000

Measurement Error Mitigation via Truncated Neumann Series

Thu, 25 Mar 2021 00:00:00 +0000

Finite Block Length Analysis on Quantum Coherence Distillation and Incoherent Randomness Extraction

Thu, 04 Mar 2021 00:00:00 +0000

Permutation Enhances Classical Communication Assisted by Entangled States

Fri, 19 Feb 2021 00:00:00 +0000

Abstract

We study classical communication over a noisy quantum channel when bipartite states are preshared between the sender and the receiver, and one of the following encoding strategies are available: i) local operations; ii) local operations and one-way classical communication; iii) local operations and global permutations. Our main result is a capacity formula for strategy iii). This formula's two endpoints are the capacity formula in strategy i) and the entanglement-assisted classical capacity. Interestingly, these capacities satisfy the strong converse property, and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. We prove that the difference between the capacities by strategy i) and strategy iii) is upper bounded by the discord of formation of the preshared state. What's more, we show that strategy ii) has no advantage over strategy i) in the weak converse regime. As examples, we derive these capacities analytically by the above strategies for some fundamental quantum channels. In some cases, the capacity of strategy iii) is strictly larger than those of strategies i) and ii) whenever entanglement assistance is available. Our results witness the power of random permutation in entanglement-assisted classical communication.

Published in .

Towards the standardization of quantum state verification using optimal strategies

Tue, 27 Oct 2020 00:00:00 +0000

Application of the resource theory of channels to communication scenarios

Wed, 19 Feb 2020 00:00:00 +0000

Entanglement Detection via Direct-Sum Majorization Uncertainty Relations

Thu, 16 Jan 2020 00:00:00 +0000

Optimal verification of two-qubit pure states

Tue, 10 Sep 2019 00:00:00 +0000

Uncertainty relations in the presence of quantum memory for mutually unbiased measurements

Wed, 26 Sep 2018 00:00:00 +0000

One-dimensional lackadaisical quantum walks

Fri, 24 Nov 2017 00:00:00 +0000

Grover walks on a line with absorbing boundaries

Tue, 07 Jun 2016 00:00:00 +0000

On Four Non-Computable Decision Problems

Thu, 01 Jan 2015 00:00:00 +0000