Superadditivity of the Classical Capacity with Limited Entanglement Assistance.

Finding the optimal encoding strategies can be challenging for communication using quantum channels, as classical and quantum capacities may be superadditive. Entanglement assistance can often simplify this task, as the entanglement-assisted classical capacity for any channel is additive, making entanglement across channel uses unnecessary. If the entanglement assistance is limited, the picture is much more unclear.

Additive Classical Capacity of Quantum Channels Assisted by Noisy Entanglement.

We give a capacity formula for the classical information transmission over a noisy quantum channel, with separable encoding by the sender and limited resources provided by the receiver's preshared ancilla. Instead of a pure state, we consider the signal-ancilla pair in a mixed state, purified by a "witness." Thus, the signal-witness correlation limits the resource available from the signal-ancilla correlation.

Supercritical entanglement in local systems: Counterexample to the area law for quantum matter.

Quantum entanglement is the most surprising feature of quantum mechanics. Entanglement is simultaneously responsible for the difficulty of simulating quantum matter on a classical computer and the exponential speedups afforded by quantum computers. Ground states of quantum many-body systems typically satisfy an "area law": The amount of entanglement between a subsystem and the rest of the system is proportional to the area of the boundary.

Criticality without frustration for quantum spin-1 chains.

Frustration-free (FF) spin chains have a property that their ground state minimizes all individual terms in the chain Hamiltonian. We ask how entangled the ground state of a FF quantum spin-s chain with nearest-neighbor interactions can be for small values of s. While FF spin-1/2 chains are known to have unentangled ground states, the case s=1 remains less explored.

Inequalities and separations among assisted capacities of quantum channels.

We exhibit quantum channels whose classical and quantum capacities, when assisted by classical feedback, exceed their unassisted classical Holevo capacity. These channels are designed to be noisy in a way that can be corrected with the help of the output and a reference system entangled with part of the input. A similar construction yields quantum channels whose classical capacity, when assisted by two-way classical communication independent of the source, exceeds their classical capacity assisted by feedback alone.

Entanglement assisted capacity of the broadband Lossy channel.

We calculate the entanglement assisted capacity of a multimode bosonic channel with loss. As long as the efficiency of the channel is above 50%, the superdense coding effect can be used to transmit more bits than those that can be stored in the message sent down the channel. Bounds for the other capacities of the multimode channel are also provided.

Superactivation of bound entanglement.

We show that, in a multiparty setting, two nondistillable (bound-entangled) states tensored together can make a distillable state. This is an example of true superadditivity of distillable entanglement. We also show that unlockable bound-entangled states cannot be asymptotically unentangled, providing the first proof that some states are truly bound-entangled in the sense of being both nondistillable and nonseparable asymptotically.

Oblivious remote state preparation.

We characterize the class of remote state preparation (RSP) protocols that use only forward classical communication and entanglement, deterministically prepare an exact copy of a general state, and do so obliviously-without leaking further information about the state to the receiver. We prove that any such protocol can be modified to require from the sender only a single specimen of the state, without increasing the classical communication cost. This implies Lo's conjectured lower bound on the cost for these protocols.