Experimental requirements for Grover's algorithm in optical quantum computation

The field of linear optical quantum computation (LOQC) will soon need a repertoire of experimental milestones. We make progress in this direction by describing several experiments based on Grover's algorithm. These experiments range from a relatively simple implementation using only a single nonscalable controlled- NOT (CNOT) gate to the most complex, requiring two concatenated scalable CNOT gates, and thus form a useful set of early milestones for LOQC. We also give a complete description of basic LOQC using polarization-encoded qubits, making use of many simplifications to the original scheme of Knill, Laflamme, and Milburn [E. Knill, R. Laflamme, and G. J. Milburn, Nature (London) 409, 46 (2001)].

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.

Optical quantum computation using cluster states

We propose an approach to optical quantum computation in which a deterministic entangling quantum gate may be performed using, on average, a few hundred coherently interacting optical elements (beam splitters, phase shifters, single photon sources, and photodetectors with feedforward). This scheme combines ideas from the optical quantum computing proposal of Knill, Laflamme, and Milburn [Nature (London) 409, 46 (2001)], and the abstract cluster-state model of quantum computation proposed by Raussendorf and Briegel [Phys. Rev. Lett. 86, 5188 (2001)].

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 computing and polynomial equations over the finite field Z(2)

What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily computed set of polynomials defined over the finite field Z(2). This connection allows simple proofs to be given for two known relationships between quantum and classical complexity classes, namely BQP subset of P-#P and BQP subset of PP.

Noise thresholds for optical cluster-state quantum computation

In this paper we do a detailed numerical investigation of the fault-tolerant threshold for optical cluster-state quantum computation. Our noise model allows both photon loss and depolarizing noise, as a general proxy for all types of local noise other than photon loss noise. We obtain a threshold region of allowed pairs of values for the two types of noise. Roughly speaking, our results show that scalable optical quantum computing is possible in the combined presence of both noise types, provided that the loss probability is less than 3 X 10(-3) and the depolarization probability is less than 10(-4). Our fault-tolerant protocol involves a number of innovations, including a method for syndrome extraction known as telecorrection, whereby repeated syndrome measurements are guaranteed to agree. This paper is an extended version of Dawson.

Universal quantum computation with continuous-variable cluster states

We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For universal quantum computation, a nonlinear element is required. This can be satisfied by adding to the toolbox any single-mode non-Gaussian measurement, while the initial cluster state itself remains Gaussian. Homodyne detection alone suffices to perform an arbitrary multimode Gaussian transformation via the cluster state. We also propose an experiment to demonstrate cluster-based error reduction when implementing Gaussian operations.

Quantum computation using weak nonlinearities: Robustness against decoherence

We investigate decoherence effects in the recently suggested quantum-computation scheme using weak nonlinearities, strong probe coherent fields, detection, and feedforward methods. It is shown that in the weak-nonlinearity-based quantum gates, decoherence in nonlinear media can be made arbitrarily small simply by using arbitrarily strong probe fields, if photon-number-resolving detection is used. On the contrary, we find that homodyne detection with feedforward is not appropriate for this scheme because in this case decoherence rapidly increases as the probe field gets larger.

Quantum symmetries and the Weyl–Wigner product of group representations

In the usual formulation of quantum mechanics, groups of automorphisms of quantum states have ray representations by unitary and antiunitary operators on complex Hilbert space, in accordance with Wigner's theorem. In the phase-space formulation, they have real, true unitary representations in the space of square-integrable functions on phase space. Each such phase-space representation is a Weyl–Wigner product of the corresponding Hilbert space representation with its contragredient, and these can be recovered by 'factorizing' the Weyl–Wigner product. However, not every real, unitary representation on phase space corresponds to a group of automorphisms, so not every such representation is in the form of a Weyl–Wigner product and can be factorized. The conditions under which this is possible are examined. Examples are presented.

Quantum integrability and exact solution of the supersymmetric U model with boundary terms

Quantum integrability is established for the one-dimensional supersymmetric U model with boundary terms by means of the quantum inverse-scattering method. The boundary supersymmetric U chain is solved by using the coordinate-space Bethe-ansatz technique and Bethe-ansatz equations are derived. This provides us with a basis for computing the finite-size corrections to the low-lying energies in the system. [S0163-1829(98)00425-1].

Measurements on trapped laser-cooled ions using quantum computations

There are some interesting connections between the theory of quantum computation and quantum measurement. As an illustration, we present a scheme in which an ion trap quantum computer can be used to make arbitrarily accurate measurements of the quadrature phase variables for the collective vibrational motion of the ion. We also discuss some more general aspects of quantum computation and measurement in terms of the Feynman-Deutsch principle.

Disagreement between correlations of quantum mechanics and stochastic electrodynamics in the damped parametric oscillator

Intracavity and external third order correlations in the damped nondegenerate parametric oscillator are calculated for quantum mechanics and stochastic electrodynamics (SED), a semiclassical theory. The two theories yield greatly different results, with the correlations of quantum mechanics being cubic in the system's nonlinear coupling constant and those of SED being linear in the same constant. In particular, differences between the two theories are present in at least a mesoscopic regime. They also exist when realistic damping is included. Such differences illustrate distinctions between quantum mechanics and a hidden variable theory for continuous variables.

Quantum measurement and stochastic processes in mesoscopic conductors

In quantum measurement theory it is necessary to show how a, quantum source conditions a classical stochastic record of measured results. We discuss mesoscopic conductance using quantum stochastic calculus to elucidate the quantum nature of the measurement taking place in these systems. To illustrate the method we derive the current fluctuations in a two terminal mesoscopic circuit with two tunnel barriers containing a single quasi bound state on the well. The method enables us to focus on either the incoming/ outgoing Fermi fields in the leads, or on the irreversible dynamics of the well state itself. We show an equivalence between the approach of Buttiker and the Fermi quantum stochastic calculus for mesoscopic systems.

Quantum control and quantum entanglement

We discuss quantum error correction for errors that occur at random times as described by, a conditional Poisson process. We shoo, how a class of such errors, detected spontaneous emission, can be corrected by continuous closed loop, feedback.