On the distributed compression of quantum information

The problem of distributed compression for correlated quantum sources is considered. The classical version of this problem was solved by Slepian and Wolf, who showed that distributed compression could take full advantage of redundancy in the local sources created by the presence of correlations. Here it is shown that, in general, this is not the case for quantum sources, by proving a lower bound on the rate sum for irreducible sources of product states which is stronger than the one given by a naive application of Slepian-Wolf. Nonetheless, strategies taking advantage of correlation do exist for some special classes of quantum sources. For example, Devetak and Winter demonstrated the existence of such a strategy when one of the sources is classical. Optimal nontrivial strategies for a different extreme, sources of Bell states, are presented here. In addition, it is explained how distributed compression is connected to other problems in quantum information theory, including information-disturbance questions, entanglement distillation and quantum error correction.

Demonstrating superior discrimination of locally prepared states using nonlocal measurements

We experimentally demonstrate the superior discrimination of separated, unentangled two-qubit correlated states using nonlocal measurements, when compared with measurements based on local operations and classical communications. When predicted theoretically, this phenomenon was dubbed quantum nonlocality without entanglement. We characterize the performance of the nonlocal, or joint, measurement with a payoff function, for which we measure 0.72 +/- 0.02, compared with the maximum locally achievable value of 2/3 and the overall optimal value of 0.75.

Qubit channels that achieve capacity with two states

This paper considers a class of qubit channels for which three states are always sufficient to achieve the Holevo capacity. For these channels, it is known that there are cases where two orthogonal states are sufficient, two nonorthogonal states are required, or three states are necessary. Here a systematic theory is given which provides criteria to distinguish cases where two states are sufficient, and determine whether these two states should be orthogonal or nonorthogonal. In addition, we prove a theorem on the form of the optimal ensemble when three states are required, and present efficient methods of calculating the Holevo capacity.

Numerical analysis of capacities for two-qubit unitary operations

We present numerical results on the capacities of two-qubit unitary operations for performing communication and creating entanglement. The capacities for communication considered are based upon the increase in Holevo information of an ensemble. Our results indicate that the capacity may be accurately estimated using ensemble sizes and ancilla dimensions of 4. In addition, the calculated values of these capacities were close to, and in some cases equal to, the similarly defined entangling capacities; this result indicates connections between these capacities.

Teleportation via Multi-Qubit Channels

We investigate the problem of teleporting an unknown qubit state to a recipient via a channel of 2L qubits. In this procedure a protocol is employed whereby L Bell state measurements are made and information based on these measurements is sent via a classical channel to the recipient. Upon receiving this information the recipient determines a local gate which is used to recover the original state. We find that the 2(2L)-dimensional Hilbert space of states available for the channel admits a decomposition into four subspaces. Every state within a given subspace is a perfect channel, and each sequence of Bell measurements projects 2L qubits of the system into one of the four subspaces. As a result, only two bits of classical information need be sent to the recipient for them to determine the gate. We note some connections between these four subspaces and ground states of many-body Hamiltonian systems, and discuss the implications of these results towards understanding entanglement in multi-qubit systems.

Testing integrability with a single bit of quantum information

We show that deterministic quantum computing with a single bit can determine whether the classical limit of a quantum system is chaotic or integrable using O(N) physical resources, where N is the dimension of the Hilbert space of the system under study. This is a square-root improvement over all known classical procedures. Our study relies strictly on the random matrix conjecture. We also present numerical results for the nonlinear kicked top.

Optimal measurements for relative quantum information

We provide optimal measurement schemes for estimating relative parameters of the quantum state of a pair of spin systems. We prove that the optimal measurements are joint measurements on the pair of systems, meaning that they cannot be achieved by local operations and classical communication. We also demonstrate that in the limit where one of the spins becomes macroscopic, our results reproduce those that are obtained by treating that spin as a classical reference direction.

GCMC-surface area of carbonaceous materials with N-2 and Ar adsorption as an alternative to the classical BET method

In this paper we apply a new method for the determination of surface area of carbonaceous materials, using the local surface excess isotherms obtained from the Grand Canonical Monte Carlo simulation and a concept of area distribution in terms of energy well-depth of solid–fluid interaction. The range of this well-depth considered in our GCMC simulation is from 10 to 100 K, which is wide enough to cover all carbon surfaces that we dealt with (for comparison, the well-depth for perfect graphite surface is about 58 K). Having the set of local surface excess isotherms and the differential area distribution, the overall adsorption isotherm can be obtained in an integral form. Thus, given the experimental data of nitrogen or argon adsorption on a carbon material, the differential area distribution can be obtained from the inversion process, using the regularization method. The total surface area is then obtained as the area of this distribution. We test this approach with a number of data in the literature, and compare our GCMC-surface area with that obtained from the classical BET method. In general, we find that the difference between these two surface areas is about 10%, indicating the need to reliably determine the surface area with a very consistent method. We, therefore, suggest the approach of this paper as an alternative to the BET method because of the long-recognized unrealistic assumptions used in the BET theory. Beside the surface area obtained by this method, it also provides information about the differential area distribution versus the well-depth. This information could be used as a microscopic finger-print of the carbon surface. It is expected that samples prepared from different precursors and different activation conditions will have distinct finger-prints. We illustrate this with Cabot BP120, 280 and 460 samples, and the differential area distributions obtained from the adsorption of argon at 77 K and nitrogen also at 77 K have exactly the same patterns, suggesting the characteristics of this carbon.

Optimal photons for quantum-information processing

Photonic quantum-information processing schemes, such as linear optics quantum computing, and other experiments relying on single-photon interference, inherently require complete photon indistinguishability to enable the desired photonic interactions to take place. Mode-mismatch is the dominant cause of photon distinguishability in optical circuits. Here we study the effects of photon wave-packet shape on tolerance against the effects of mode mismatch in linear optical circuits, and show that Gaussian distributed photons with large bandwidth are optimal. The result is general and holds for arbitrary linear optical circuits, including ones which allow for postselection and classical feed forward. Our findings indicate that some single photon sources, frequently cited for their potential application to quantum-information processing, may in fact be suboptimal for such applications.