Spin based heat engine: demonstration of multiple rounds of algorithmic cooling

We experimentally demonstrate multiple rounds of heat-bath algorithmic cooling in a 3 qubit solid-state nuclear magnetic resonance quantum information processor. By pumping entropy into a heat bath, we are able to surpass the closed system limit of the Shannon bound and purify a single qubit to 1.69 times the heat-bath polarization. The algorithm combines both high fidelity coherent control and a deliberate interaction with the environment. Given this level of quantum control in systems with larger reset polarizations, nearly pure qubits should be achievable.     

Benchmarking quantum computers: the five-qubit error correcting code.

The smallest quantum code that can correct all one-qubit errors is based on five qubits. We experimentally implemented the encoding, decoding, and error-correction quantum networks using nuclear magnetic resonance on a five spin subsystem of labeled crotonic acid. The ability to correct each error was verified by tomography of the process. The use of error correction for benchmarking quantum networks is discussed, and we infer that the fidelity achieved in our experiment is sufficient for preserving entanglement.     

Unified and generalized approach to quantum error correction

We present a unified approach to quantum error correction, called operator quantum error correction. Our scheme relies on a generalized notion of a noiseless subsystem that is investigated here. By combining the active error correction with this generalized noiseless subsystems method, we arrive at a unified approach which incorporates the known techniques--i.e., the standard error correction model, the method of decoherence-free subspaces, and the noiseless subsystem method--as special cases. Moreover, we demonstrate that the quantum error correction condition from the standard model is a necessary condition for all known methods of quantum error correction.     

Theory of quantum error correction for general noise

A measure of quality of an error-correcting code is the maximum number of errors that it is able to correct. We show that a suitable notion of "number of errors" e makes sense for any quantum or classical system in the presence of arbitrary interactions. Thus, e-error-correcting codes protect information without requiring the usual assumptions of independence. We prove the existence of large codes for both quantum and classical information. By viewing error-correcting codes as subsystems, we relate codes to irreducible representations of operator algebras and show that noiseless subsystems are infinite-distance error-correcting codes.     

Partition properties of the dense local order and a colored version of Milliken’s theorem

We study finite dimensional partition properties of the countable homogeneous dense local order (a directed graph closely related to the order structure of the rationals). Some of our results use ideas borrowed from the partition calculus of the rationals and are obtained thanks to a strengthening of Milliken’s theorem on trees.     

Experimental quantum communication without a shared reference frame

We present an experimental realization of a robust quantum communication scheme [Phys. Rev. Lett. 93, 220501 (2004)] using pairs of photons entangled in polarization and time. Our method overcomes errors due to collective rotation of the polarization modes (e.g., birefringence in optical fiber or misalignment), is insensitive to the phase's fluctuation of the interferometer, and does not require any shared reference frame including time reference, except the need to label different photons. The practical robustness of the scheme is further shown by implementing a variation of the Bennett-Brassard 1984 quantum key distribution protocol over 1 km optical fiber.