William Matthews

Improving Zero-Error Classical Communication with Entanglement

Given one or more uses of a classical channel, only a certain number of messages can be transmitted with zero probability of error. The study of this number and its asymptotic behavior constitutes the field of classical zero-error information theory. We show that, given a single use of certain classical channels, entangled states of a system shared by the sender and receiver can be used to increase the number of (classical) messages which can be sent without error. In particular, we show how to construct such a channel based on any proof of the Kochen-Specker theorem. We investigate the connection to pseudotelepathy games. The use of generalized nonsignaling correlations to assist in this task is also considered. In this case, an elegant theory results and, remarkably, it is sometimes possible to transmit information with zero error using a channel with no unassisted zero-error capacity.

Distinguishability of Quantum States Under Restricted Families of Measurements with an Application to Quantum Data Hiding

We consider the problem of ambiguous discrimination of two quantum states when we are only allowed to perform a restricted set of measurements. Let the bias of a POVM be defined as the total variational distance between the outcome distributions for the two states to be distinguished. The performance of a set of measurements can then be defined as the ratio of the bias of this POVM and the largest bias achievable by any measurements. We first provide lower bounds on the performance of various POVMs acting on a single system such as the isotropic POVM, and spherical 2 and 4-designs, and show how these bounds can lead to certainty relations. Furthermore, we prove lower bounds for several interesting POVMs acting on multipartite systems, such as the set of local POVMS, POVMs which can be implemented using local operations and classical communication (LOCC), separable POVMs, and finally POVMs for which every bipartition results in a measurement having positive partial transpose (PPT). In particular, our results show that a scheme of Terhal et. al. for hiding data against local operations and classical communication [31] has the best possible dimensional dependence.

Finite Blocklength Converse Bounds for Quantum Channels

We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying framework of quantum hypothesis testing with restricted measurements. Our bounds do not depend on any special property of the channel (such as memorylessness) and generalize both a classical converse of Polyanskiy, Poor, and Verdú as well as a quantum converse of Renner and Wang, and have a number of desirable properties. In particular, our bound on entanglement-assisted codes is a semidefinite program and for memoryless channels, its large blocklength limit is the well-known formula for entanglement-assisted capacity due to Bennett, Shor, Smolin, and Thapliyal.

Entanglement can Increase Asymptotic Rates of Zero-Error Classical Communication over Classical Channels

It is known that the number of different classical messages which can be communicated with a single use of a classical channel with zero probability of decoding error can sometimes be increased by using entanglement shared between sender and receiver. It has been an open question to determine whether entanglement can ever increase the zero-error communication rates achievable in the limit of many channel uses. In this paper we show, by explicit examples, that entanglement can indeed increase asymptotic zero-error capacity, even to the extent that it is equal to the normal capacity of the channel.

A filler-rod technique for controlling redox conditions in cold-seal pressure vessels

Abstract A new method has been developed to impose different redox conditions in high-temperature-pressure experiments in cold-seal pressure vessels, at 800 °C and 2000 bars. Experiments were conducted by loading a metallic filler rod into the autoclave together with H2 sensor capsules, and pressuring the autoclave with H2O. Rod materials tested successfully were Co, Ti, and C (graphite). The oxidation of these rods produces H2, but because of diffusive H2 loss through the walls of the autoclave, the system may not be buffered with respect to H2. However, fH₂ quickly reaches a steady state value, and because fH₂ is easily measured by the hydrogen sensor method, the effect of the filler rods on the intrinsic fO₂ of the autoclave can be quantified. In order to produce oxidized conditions, Ar was used as the pressure medium and metal oxides, contained in Al2O3 tubes, were employed. By using either Ar or H2O as a pressure medium, a log fO₂ range of NNO -3.9 to NNO +4.6 can be imposed by this method, where NNO is the log fO₂ value of the Ni-NiO buffer. The ability to conduct long-run-duration experiments at high temperature and high fH₂ conditions is not possible with the traditional double-capsule technique because the buffer assemblage is consumed too quickly. However, run durations of up to 4 weeks with constant fH₂ at reduced conditions have been conducted using the filler-rod technique. This technique has been shown to be an effective method in controlling redox conditions in cold-seal autoclaves, and thus can be applied to investigating redox-dependent reactions in a wide range of geochemical systems.

Zero-Error Channel Capacity and Simulation Assisted by Non-Local Correlations

The theory of zero-error communication is re-examined in the broader setting of using one classical channel to simulate another exactly in the presence of various classes of nonsignalling correlations between sender and receiver i.e., shared randomness, shared entanglement and arbitrary nonsignalling correlations. When the channel being simulated is noiseless, this is zero-error coding assisted by correlations. When the resource channel is noiseless, it is the reverse problem of simulating a noisy channel exactly by a noiseless one, assisted by correlations. In both cases, separations between the power of the different classes of assisting correlations are exhibited for finite block lengths. The most striking result here is that entanglement can assist in zero-error communication. In the large block length limit, shared randomness is shown to be just as powerful as arbitrary nonsignalling correlations for exact simulation, but not for asymptotic zero-error coding. For assistance by arbitrary nonsignalling correlations, linear programming formulas for the asymptotic capacity and simulation rates are derived, the former being equal (for channels with nonzero unassisted capacity) to the feedback-assisted zero-error capacity derived by Shannon. Finally, a kind of reversibility between nonsignalling-assisted zero-error capacity and exact simulation is observed, mirroring the usual reverse Shannon theorem.

Unbounded number of channel uses may be required to detect quantum capacity

Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and is well understood for channels modelled by classical physics. However, when quantum effects are involved, we do not know how to compute channel capacities. This is because the formula for the quantum capacity involves maximizing the coherent information over an unbounded number of channel uses. In fact, entanglement across channel uses can even increase the coherent information from zero to non-zero. Here we study the number of channel uses necessary to detect positive coherent information. In all previous known examples, two channel uses already sufficed. It might be that only a finite number of channel uses is always sufficient. We show that this is not the case: for any number of uses, there are channels for which the coherent information is zero, but which nonetheless have capacity.

Entanglement-enhanced classical communication over a noisy classical channel

Two parties that share an entangled quantum system can achieve communication tasks which would otherwise be impossible: Sending two bits of classical information using only one qubit [1], unconditionally secure communication [2], transferring quantum information from one quantum system to another using two classical bits [3], and reducing communication complexity in distributed computations [4].

On the Power of PPT-Preserving and Non-Signalling Codes

We derive one-shot upper bounds for quantum noisy channel codes. We do so by regarding a channel code as a bipartite operation with an encoder belonging to the sender and a decoder belonging to the receiver, and imposing constraints on the bipartite operation. We investigate the power of codes whose bipartite operation is non-signalling from Alice to Bob, positive-partial transpose (PPT) preserving, or both, and derive a simple semidefinite program for the achievable entanglement fidelity. Using the semidefinite program, we show that the non-signalling-assisted quantum capacity for memoryless channels is equal to the entanglement-assisted capacity. We also relate our PPT-preserving codes and the PPT-preserving entanglement distillation protocols studied by Rains. Applying these results to a concrete example, the 3-dimensional Werner-Holevo channel, we find that codes that are non-signalling and PPT-preserving can be strictly less powerful than codes satisfying either one of the constraints, and therefore provide a tighter bound for unassisted codes. Furthermore, PPT-preserving non-signalling codes can send 1 qubit perfectly over two uses of the channel, which has no quantum capacity. We discuss whether this can be interpreted as a form of superactivation of quantum capacity.

Pure-state transformations and catalysis under operations that completely preserve positivity of partial transpose

Motivated by the desire to better understand the class of quantum operations on bipartite systems that completely preserve positivity of partial transpose (PPT operations) and its relation to the class LOCC (local operations and classical communication), we present some results on deterministic bipartite pure-state transformations by PPT operations. Restricting our attention to the case in which we start with a rank