Continuous quantum error correction by cooling

We describe an implementation of quantum error correction that operates continuously in time and requires no active interventions such as measurements or gates. The mechanism for carrying away the entropy introduced by errors is a cooling procedure. We evaluate the effectiveness of the scheme by simulation, and remark on its connections to some recently proposed error prevention procedures.

Multiquantum eigenstates of a linear chain of coupled qubits

We present a technique to identify exact analytic expressions for the multiquantum eigenstates of a linear chain of coupled qubits. A choice of Hilbert subspaces is described that allows an exact solution of the stationary Schrodinger equation without imposing periodic boundary conditions and without neglecting end effects, fully including the dipole-dipole nearest-neighbor interaction between the atoms. The treatment is valid for an arbitrary coherent excitation in the atomic system, any number of atoms, any size of the chain relative to the resonant wavelength and arbitrary initial conditions of the atomic system. The procedure we develop is general enough to be adopted for the study of excitation in an arbitrary array of atoms including spin chains and one-dimensional Bose-Einstein condensates.

Unified derivations of measurement-based schemes for quantum computation

We present unified, systematic derivations of schemes in the two known measurement-based models of quantum computation. The first model (introduced by Raussendorf and Briegel, [Phys. Rev. Lett. 86, 5188 (2001)]) uses a fixed entangled state, adaptive measurements on single qubits, and feedforward of the measurement results. The second model (proposed by Nielsen, [Phys. Lett. A 308, 96 (2003)] and further simplified by Leung, [Int. J. Quant. Inf. 2, 33 (2004)]) uses adaptive two-qubit measurements that can be applied to arbitrary pairs of qubits, and feedforward of the measurement results. The underlying principle of our derivations is a variant of teleportation introduced by Zhou, Leung, and Chuang, [Phys. Rev. A 62, 052316 (2000)]. Our derivations unify these two measurement-based models of quantum computation and provide significantly simpler schemes.

Detecting multipartite entanglement

We discuss the problem of determining whether the state of several quantum mechanical subsystems is entangled. As in previous work on two subsystems we introduce a procedure for checking separability that is based on finding state extensions with appropriate properties and may be implemented as a semidefinite program. The main result of this work is to show that there is a series of tests of this kind such that if a multiparty state is entangled this will eventually be detected by one of the tests. The procedure also provides a means of constructing entanglement witnesses that could in principle be measured in order to demonstrate that the state is entangled.

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.

Nonclassicality of a photon-subtracted Gaussian field

We investigate the nonclassicality of a photon-subtracted Gaussian field, which was produced in a recent experiment, using negativity of the Wigner function and the nonexistence of well-behaved positive P function. We obtain the condition to see negativity of the Wigner function for the case including the mixed Gaussian incoming field, the threshold photodetection and the inefficient homodyne measurement. We show how similar the photon-subtracted state is to a superposition of coherent states.

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.

Relativistically invariant quantum information

We show that quantum information can be encoded into entangled states of multiple indistinguishable particles in such a way that any inertial observer can prepare, manipulate, or measure the encoded state independent of their Lorentz reference frame. Such relativistically invariant quantum information is free of the difficulties associated with encoding into spin or other degrees of freedom in a relativistic context.

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.

Continuous-variable quantum-state sharing via quantum disentanglement

Quantum-state sharing is a protocol where perfect reconstruction of quantum states is achieved with incomplete or partial information in a multipartite quantum network. Quantum-state sharing allows for secure communication in a quantum network where partial information is lost or acquired by malicious parties. This protocol utilizes entanglement for the secret-state distribution and a class of quantum disentangling protocols for the state reconstruction. We demonstrate a quantum-state sharing protocol in which a tripartite entangled state is used to encode and distribute a secret state to three players. Any two of these players can collaborate to reconstruct the secret state, while individual players obtain no information. We investigate a number of quantum disentangling processes and experimentally demonstrate quantum-state reconstruction using two of these protocols. We experimentally measure a fidelity, averaged over all reconstruction permutations, of F=0.73 +/- 0.02. A result achievable only by using quantum resources.

Entanglement under restricted operations: Analogy to mixed-state entanglement

We show that the classification of bipartite pure entangled states when local quantum operations are restricted yields a structure that is analogous in many respects to that of mixed-state entanglement. Specifically, we develop this analogy by restricting operations through local superselection rules, and show that such exotic phenomena as bound entanglement and activation arise using pure states in this setting. This analogy aids in resolving several conceptual puzzles in the study of entanglement under restricted operations. In particular, we demonstrate that several types of quantum optical states that possess confusing entanglement properties are analogous to bound entangled states. Also, the classification of pure-state entanglement under restricted operations can be much simpler than for mixed-state entanglement. For instance, in the case of local Abelian superselection rules all questions concerning distillability can be resolved.

Better Bell-inequality violation by collective measurements

The standard Bell-inequality experiments test for violation of local realism by repeatedly making local measurements on individual copies of an entangled quantum state. Here we investigate the possibility of increasing the violation of a Bell inequality by making collective measurements. We show that the nonlocality of bipartite pure entangled states, quantified by their maximal violation of the Bell-Clauser-Horne inequality, can always be enhanced by collective measurements, even without communication between the parties. For mixed states we also show that collective measurements can increase the violation of Bell inequalities, although numerical evidence suggests that the phenomenon is not common as it is for pure states.

Classical simulation of quantum many-body systems with a tree tensor network

We show how to efficiently simulate a quantum many-body system with tree structure when its entanglement (Schmidt number) is small for any bipartite split along an edge of the tree. As an application, we show that any one-way quantum computation on a tree graph can be efficiently simulated with a classical computer.

Coherent-state quantum key distribution without random basis switching

The random switching of measurement bases is commonly assumed to be a necessary step of quantum key distribution protocols. In this paper we present a no-switching protocol and show that switching is not required for coherent-state continuous-variable quantum key distribution. Further, this protocol achieves higher information rates and a simpler experimental setup compared to previous protocols that rely on switching. We propose an optimal eavesdropping attack against this protocol, assuming individual Gaussian attacks. Finally, we investigate and compare the no-switching protocol applied to the original Bennett-Brassard 1984 scheme.