Peixue Wu
YOU?
Author Swipe
View article: Quantum $f$-divergences and Their Local Behaviour: An Analysis via Relative Expansion Coefficients
Quantum $f$-divergences and Their Local Behaviour: An Analysis via Relative Expansion Coefficients Open
Any reasonable measure of distinguishability of quantum states must satisfy a data processing inequality, that is, it must not increase under the action of a quantum channel. We can ask about the proportion of information lost or preserved…
View article: Transportation cost and contraction coefficient for channels on von Neumann algebras
Transportation cost and contraction coefficient for channels on von Neumann algebras Open
We present a noncommutative optimal transport framework for quantum channels acting on von Neumann algebras. Our central object is the Lipschitz cost measure, a transportation-inspired quantity that evaluates the minimal cost required to m…
View article: Reverse-type Data Processing Inequality
Reverse-type Data Processing Inequality Open
The quantum data processing inequality asserts that two quantum states become harder to distinguish when a noisy channel is applied. On the other hand, a reverse quantum data processing inequality characterizes whether distinguishability i…
View article: Additivity of quantum capacities in simple non-degradable quantum channels
Additivity of quantum capacities in simple non-degradable quantum channels Open
Quantum channel capacities give the fundamental performance limits for information flow over a communication channel. However, the prevalence of superadditivity is a major obstacle to understanding capacities, both quantitatively and conce…
View article: Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach
Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach Open
Simulating quantum dynamics is one of the most promising applications of quantum computers. While the upper bound of the simulation cost has been extensively studied through various quantum algorithms, much less work has focused on establi…
View article: A note on the stabilizer formalism via noncommutative graphs
A note on the stabilizer formalism via noncommutative graphs Open
In this short note we formulate a stabilizer formalism in the language of noncommutative graphs. The classes of noncommutative graphs we consider are obtained via unitary representations of compact groups, and suitably chosen operators on …
View article: Quantum secret sharing and tripartite information
Quantum secret sharing and tripartite information Open
We develop a connection between tripartite information $I_3$, secret sharing protocols and multi-unitaries. This leads to explicit ((2,3)) threshold schemes in arbitrary dimension minimizing tripartite information $I_3$. As an application …
View article: Resource-Dependent Complexity of Quantum Channels
Resource-Dependent Complexity of Quantum Channels Open
We introduce a new framework for quantifying the complexity of quantum channels, grounded in a suitably chosen resource set. This class of convex functions is designed to analyze the complexity of both open and closed quantum systems. By l…
View article: Stability property for the quantum jump operators of an open system
Stability property for the quantum jump operators of an open system Open
We show the continuity property of spectral gaps and complete Logarithmic constants in terms of the jump operators of Lindblad generators in finite dimensional setting. Our method is based on the bimodule structure of the derivation space …