Robustness of quantum gates in the presence of noise

We define several quantitative measures of the robustness of a quantum gate against noise. Exact analytic expressions for the robustness against depolarizing noise are obtained for all bipartite unitary quantum gates, and it is found that the controlled-NOT gate is the most robust two-qubit quantum gate, in the sense that it is the quantum gate which can tolerate the most depolarizing noise and still generate entanglement. Our results enable us to place several analytic upper bounds on the value of the threshold for quantum computation, with the best bound in the most pessimistic error model being p(th)less than or equal to0.5.

Lower bounds on the complexity of simulating quantum gates

We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries. We also note that a related lower bound holds for arbitrary n-qubit gates.

Progress in silicon-based quantum computation

We review progress at the Australian Centre for Quantum Computer Technology towards the fabrication and demonstration of spin qubits and charge qubits based on phosphorus donor atoms embedded in intrinsic silicon. Fabrication is being pursued via two complementary pathways: a 'top-down' approach for near-term production of few-qubit demonstration devices and a 'bottom-up' approach for large-scale qubit arrays with sub-nanometre precision. The 'top-down' approach employs a low-energy (keV) ion beam to implant the phosphorus atoms. Single-atom control during implantation is achieved by monitoring on-chip detector electrodes, integrated within the device structure. In contrast, the 'bottom-up' approach uses scanning tunnelling microscope lithography and epitaxial silicon overgrowth to construct devices at an atomic scale. In both cases, surface electrodes control the qubit using voltage pulses, and dual single-electron transistors operating near the quantum limit provide fast read-out with spurious-signal rejection.

The effects of J-gate potential and interfaces on donor exchange coupling in the Kane quantum computer architecture

We calculate the electron exchange coupling for a phosphorus donor pair in silicon perturbed by a J-gate potential and the boundary effects of the silicon host geometry. In addition to the electron-electron exchange interaction we also calculate the contact hyperfine interaction between the donor nucleus and electron as a function of the varying experimental conditions. Donor separation, depth of the P nuclei below the silicon oxide layer and J-gate voltage become decisive factors in determining the strength of both the exchange coupling and hyperfine interaction-both crucial components for qubit operations in the Kane quantum computer. These calculations were performed using an anisotropic effective-mass Hamiltonian approach. The behaviour of the donor exchange coupling as a function of the parameters varied in this work provides relevant information for the experimental design of these devices.

Entanglement and bifurcations in Jahn-Teller models

We compare and contrast the entanglement in the ground state of two Jahn-Teller models. The Exbeta system models the coupling of a two-level electronic system, or qubit, to a single-oscillator mode, while the Exepsilon models the qubit coupled to two independent, degenerate oscillator modes. In the absence of a transverse magnetic field applied to the qubit, both systems exhibit a degenerate ground state. Whereas there always exists a completely separable ground state in the Exbeta system, the ground states of the Exepsilon model always exhibit entanglement. For the Exbeta case we aim to clarify results from previous work, alluding to a link between the ground-state entanglement characteristics and a bifurcation of a fixed point in the classical analog. In the Exepsilon case we make use of an ansatz for the ground state. We compare this ansatz to exact numerical calculations and use it to investigate how the entanglement is shared between the three system degrees of freedom.

Charge-based quantum computing using single donors in semiconductors

Solid-state quantum computer architectures with qubits encoded using single atoms are now feasible given recent advances in the atomic doping of semiconductors. Here we present a charge qubit consisting of two dopant atoms in a semiconductor crystal, one of which is singly ionized. Surface electrodes control the qubit and a radio-frequency single-electron transistor provides fast readout. The calculated single gate times, of order 50 ps or less, are much shorter than the expected decoherence time. We propose universal one- and two-qubit gate operations for this system and discuss prospects for fabrication and scale up.

High-fidelity Z-measurement error encoding of optical qubits

We demonstrate a quantum error correction scheme that protects against accidental measurement, using a parity encoding where the logical state of a single qubit is encoded into two physical qubits using a nondeterministic photonic controlled-NOT gate. For the single qubit input states vertical bar 0 >, vertical bar 1 >, vertical bar 0 > +/- vertical bar 1 >, and vertical bar 0 > +/- i vertical bar 1 > our encoder produces the appropriate two-qubit encoded state with an average fidelity of 0.88 +/- 0.03 and the single qubit decoded states have an average fidelity of 0.93 +/- 0.05 with the original state. We are able to decode the two-qubit state (up to a bit flip) by performing a measurement on one of the qubits in the logical basis; we find that the 64 one-qubit decoded states arising from 16 real and imaginary single-qubit superposition inputs have an average fidelity of 0.96 +/- 0.03.

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.

Dynamical creation of entanglement by homodyne-mediated feedback

For two two-level atoms coupled to a single Bosonic mode that is driven and heavily damped, the steady state can be entangled by resonantly driving the system [S. Schneider and G. J. Milburn, Phys. Rev. A 65, 042107 (2002)]. We present a scheme to significantly increase the steady-state entanglement by using homodyne-mediated feedback, in which the Bosonic mode is that of an electromagnetic cavity, the output of which is measured and the resulting homodyne photocurrent is used to modulate the field driving the qubits. Such feedback can increase the nonlinear response to both the decoherence process of the two-qubit system and the coherent evolution of individual qubits. We present the properties of the entangled states using the SO(3) Q function.

Adaptive phase measurements in linear optical quantum computation

Photon counting induces an effective non-linear optical phase shift in certain states derived by linear optics from single photons. Although this non-linearity is non-deterministic, it is sufficient in principle to allow scalable linear optics quantum computation (LOQC). The most obvious way to encode a qubit optically is as a superposition of the vacuum and a single photon in one mode-so-called 'single-rail' logic. Until now this approach was thought to be prohibitively expensive (in resources) compared to 'dual-rail' logic where a qubit is stored by a photon across two modes. Here we attack this problem with real-time feedback control, which can realize a quantum-limited phase measurement on a single mode, as has been recently demonstrated experimentally. We show that with this added measurement resource, the resource requirements for single-rail LOQC are not substantially different from those of dual-rail LOQC. In particular, with adaptive phase measurements an arbitrary qubit state a alpha/0 > + beta/1 > can be prepared deterministically.

Quantum methods for clock synchronization: Beating the standard quantum limit without entanglement

We introduce methods for clock synchronization that make use of the adiabatic exchange of nondegenerate two-level quantum systems: ticking qubits. Schemes involving the exchange of N independent qubits with frequency omega give a synchronization accuracy that scales as (omega root N)(-1)-i.e., as the standard quantum limit. We introduce a protocol that makes use of N-c coherent exchanges of a single qubit at frequency omega, leading to an accuracy that scales as (omega N-c)(-1) ln N-c. This protocol beats the standard quantum limit without the use of entanglement, and we argue that this scaling is the fundamental limit for clock synchronization allowed by quantum mechanics. We analyze the performance of these protocols when used with a lossy channel.

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.