Entanglement measure for rank-2 mixed states

We provide an easily computable formula for a bipartite mixed-state entanglement measure. Our formula can be applied to readily calculate the entanglement for any rank-2 mixed state of a bipartite system. We use this formula to provide a tight upper bound for the entanglement of formation for rank-2 states of a qubit and a qudit. We also outline situations where our formula could be applied to study the entanglement properties of complex quantum systems.

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.

Measurement-based teleportation along quantum spin chains

We examine the teleportation of an unknown spin-1/2 quantum state along a quantum spin chain with an even number of sites. Our protocol, using a sequence of Bell measurements, may be viewed as an iterated version of the 2-qubit protocol of C. H. Bennett et al. [Phys. Rev. Lett. 70, 1895 (1993)]. A decomposition of the Hilbert space of the spin chain into 4 vector spaces, called Bell subspaces, is given. It is established that any state from a Bell subspace may be used as a channel to perform unit fidelity teleportation. The space of all spin-0 many-body states, which includes the ground states of many known antiferromagnetic systems, belongs to a common Bell subspace. A channel-dependent teleportation parameter O is introduced, and a bound on the teleportation fidelity is given in terms of O.

Stabilizer formalism for operator quantum error correction

Operator quantum error correction is a recently developed theory that provides a generalized and unified framework for active error correction and passive error avoiding schemes. In this Letter, we describe these codes using the stabilizer formalism. This is achieved by adding a gauge group to stabilizer codes that defines an equivalence class between encoded states. Gauge transformations leave the encoded information unchanged; their effect is absorbed by virtual gauge qubits that do not carry useful information. We illustrate the construction by identifying a gauge symmetry in Shor's 9-qubit code that allows us to remove 3 of its 8 stabilizer generators, leading to a simpler decoding procedure and a wider class of logical operations without affecting its essential properties. This opens the path to possible improvements of the error threshold of fault-tolerant quantum computing.

A geometric approach to quantum circuit lower bounds

What is the minimal size quantum circuit required to exactly implement a specified n-qubit unitary operation, U, without the use of ancilla qubits? We show that a lower bound on the minimal size is provided by the length of the minimal geodesic between U and the identity, I, where length is defined by a suitable Finsler metric on the manifold SU(2(n)). The geodesic curves on these manifolds have the striking property that once an initial position and velocity are set, the remainder of the geodesic is completely determined by a second order differential equation known as the geodesic equation. This is in contrast with the usual case in circuit design, either classical or quantum, where being given part of an optimal circuit does not obviously assist in the design of the rest of the circuit. Geodesic analysis thus offers a potentially powerful approach to the problem of proving quantum circuit lower bounds. In this paper we construct several Finsler metrics whose minimal length geodesics provide lower bounds on quantum circuit size. For each Finsler metric we give a procedure to compute the corresponding geodesic equation. We also construct a large class of solutions to the geodesic equation, which we call Pauli geodesics, since they arise from isometries generated by the Pauli group. For any unitary U diagonal in the computational basis, we show that: (a) provided the minimal length geodesic is unique, it must be a Pauli geodesic; (b) finding the length of the minimal Pauli geodesic passing from I to U is equivalent to solving an exponential size instance of the closest vector in a lattice problem (CVP); and (c) all but a doubly exponentially small fraction of such unitaries have minimal Pauli geodesics of exponential length.

Cluster-state quantum computation

This article is a short introduction to and review of the cluster-state model of quantum computation, in which coherent quantum information processing is accomplished via a sequence of single-qubit measurements applied to a fixed quantum state known as a cluster state. We also discuss a few novel properties of the model, including a proof that the cluster state cannot occur as the exact ground state of any naturally occurring physical system, and a proof that measurements on any quantum state which is linearly prepared in one dimension can be efficiently simulated on a classical computer, and thus are not candidates for use as a substrate for quantum computation.

Entangled-state cycles from conditional quantum evolution

A system of cascaded qubits interacting via the one-way exchange of photons is studied. While for general operating conditions the system evolves to a superposition of Bell states (a dark state) in the long-time limit, under a particular resonance condition no steady state is reached within a finite time. We analyze the conditional quantum evolution (quantum trajectories) to characterize the asymptotic behavior under this resonance condition. A distinct bimodality is observed: for perfect qubit coupling, the system either evolves to a maximally entangled Bell state without emitting photons (the dark state) or executes a sustained entangled-state cycle-random switching between a pair of Bell states while emitting a continuous photon stream; for imperfect coupling, two entangled-state cycles coexist, between which a random selection is made from one quantum trajectory to another.

Interconvertibility of single-rail optical qubits

We show how to convert between partially coherent superpositions of a single photon with the vacuum by using linear optics and postselection based on homodyne measurements. We introduce a generalized quantum efficiency for such states and show that any conversion that decreases this quantity is possible. We also prove that our scheme is optimal by showing that no linear optical scheme with generalized conditional measurements, and with one single-rail qubit input, can improve the generalized efficiency. (c) 2006 Optical Society of America.

Quantum computation by communication

We present here a new approach to scalable quantum computing - a 'qubus computer' - which realizes qubit measurement and quantum gates through interacting qubits with a quantum communication bus mode. The qubits could be 'static' matter qubits or 'flying' optical qubits, but the scheme we focus on here is particularly suited to matter qubits. There is no requirement for direct interaction between the qubits. Universal two-qubit quantum gates may be effected by schemes which involve measurement of the bus mode, or by schemes where the bus disentangles automatically and no measurement is needed. In effect, the approach integrates together qubit degrees of freedom for computation with quantum continuous variables for communication and interaction.

Quantum memory scheme based on optical fibers and cavities

An optical quantum memory scheme using two narrow-linewidth cavities and some optical fibers is proposed. The cavities are connected via an optical fiber, and the gap of each cavity can be adjusted to allow photons with a certain bandwidth to transmit through or reflect back. Hence, each cavity acts as a shutter and the photons can be stored in the optical fiber between the cavities at will. We investigate the feasibility of using this device in storing a single photon. We estimate that with current technology storage of a photon qubit for up to 50 clock cycles (round trips) could be achieved with a probability of success of 85%. We discuss how this figure could be improved.

Quantum nondemolition measurements for quantum information

We discuss the characterization and properties of quantum nondemolition (QND) measurements on qubit systems. We introduce figures of merit which can be applied to systems of any Hilbert space dimension, thus providing universal criteria for characterizing QND measurements. The controlled-NOT gate and an optical implementation are examined as examples of QND devices for qubits. We also consider the QND measurement of weak values.