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.

A data structure for improved gp analysis via efficient computation and visualisation of population measures

Population measures for genetic programs are defined and analysed in an attempt to better understand the behaviour of genetic programming. Some measures are simple, but do not provide sufficient insight. The more meaningful ones are complex and take extra computation time. Here we present a unified view on the computation of population measures through an information hypertree (iTree). The iTree allows for a unified and efficient calculation of population measures via a basic tree traversal. © Springer-Verlag 2004.

The Quantum Mitochondrion and Optimal Health

A sufficiently complex set of molecules, if subject to perturbation, will self-organise and show emergent behaviour. If such a system can take on information it will become subject to natural selection. This could explain how self-replicating molecules evolved into life and how intelligence arose. A pivotal step in this evolutionary process was of course the emergence of the eukaryote and the advent of the mitochondrion, which both enhanced energy production per cell and increased the ability to process, store and utilise information. Recent research suggest that from its inception life embraced quantum effects such as “tunnelling” and “coherence” while competition and stressful conditions provided a constant driver for natural selection. We believe that the biphasic adaptive response to stress described by hormesis – a process that captures information to enable adaptability, is central to this whole process. Critically, hormesis could improve mitochondrial quantum efficiency, improving the ATP/ROS ratio, while inflammation, which is tightly associated with the aging process, might do the opposite. This all suggests that to achieve optimal health and healthy ageing, one has to sufficiently stress the system to ensure peak mitochondrial function, which itself could reflect selection of optimum efficiency at the quantum level.

Quantum Gate and Quantum State Preparation through Neighboring Optimal Control

Successful implementation of fault-tolerant quantum computation on a system of qubits places severe demands on the hardware used to control the many-qubit state. It is known that an accuracy threshold Pa exists for any quantum gate that is to be used for such a computation to be able to continue for an unlimited number of steps. Specifically, the error probability Pe for such a gate must fall below the accuracy threshold: Pe < Pa. Estimates of Pa vary widely, though Pa ∼ 10−4 has emerged as a challenging target for hardware designers. I present a theoretical framework based on neighboring optimal control that takes as input a good quantum gate and returns a new gate with better performance. I illustrate this approach by applying it to a universal set of quantum gates produced using non-adiabatic rapid passage. Performance improvements are substantial comparing to the original (unimproved) gates, both for ideal and non-ideal controls. Under suitable conditions detailed below, all gate error probabilities fall by 1 to 4 orders of magnitude below the target threshold of 10−4. After applying the neighboring optimal control theory to improve the performance of quantum gates in a universal set, I further apply the general control theory in a two-step procedure for fault-tolerant logical state preparation, and I illustrate this procedure by preparing a logical Bell state fault-tolerantly. The two-step preparation procedure is as follow: Step 1 provides a one-shot procedure using neighboring optimal control theory to prepare a physical qubit state which is a high-fidelity approximation to the Bell state |β01⟩ = 1/√2(|01⟩ + |10⟩). I show that for ideal (non-ideal) control, an approximate |β01⟩ state could be prepared with error probability ϵ ∼ 10−6 (10−5) with one-shot local operations. Step 2 then takes a block of p pairs of physical qubits, each prepared in |β01⟩ state using Step 1, and fault-tolerantly prepares the logical Bell state for the C4 quantum error detection code.

Energy spectra for quantum wires and two-dimensional electron gases in magnetic fields with Rashba and Dresselhaus spin-orbit interactions

We introduce an analytical approximation scheme to diagonalize parabolically confined two-dimensional (2D) electron systems with both the Rashba and Dresselhaus spin-orbit interactions. The starting point of our perturbative expansion is a zeroth-order Hamiltonian for an electron confined in a quantum wire with an effective spin-orbit induced magnetic field along the wire, obtained by properly rotating the usual spin-orbit Hamiltonian. We find that the spin-orbit-related transverse coupling terms can be recast into two parts W and V, which couple crossing and noncrossing adjacent transverse modes, respectively. Interestingly, the zeroth-order Hamiltonian together with W can be solved exactly, as it maps onto the Jaynes-Cummings model of quantum optics. We treat the V coupling by performing a Schrieffer-Wolff transformation. This allows us to obtain an effective Hamiltonian to third order in the coupling strength k(R)l of V, which can be straightforwardly diagonalized via an additional unitary transformation. We also apply our approach to other types of effective parabolic confinement, e. g., 2D electrons in a perpendicular magnetic field. To demonstrate the usefulness of our approximate eigensolutions, we obtain analytical expressions for the nth Landau-level g(n) factors in the presence of both Rashba and Dresselhaus couplings. For small values of the bulk g factors, we find that spin-orbit effects cancel out entirely for particular values of the spin-orbit couplings. By solving simple transcendental equations we also obtain the band minima of a Rashba-coupled quantum wire as a function of an external magnetic field. These can be used to describe Shubnikov-de Haas oscillations. This procedure makes it easier to extract the strength of the spin-orbit interaction in these systems via proper fitting of the data.

The role of quantum confinement and crystalline structure on excitonic lifetimes in silicon nanoclusters

The emission energy dependence of the photoluminescence (PL) decay rate at room temperature has been studied in Si nanoclusters (Si-ncl) embedded in Si oxide matrices obtained by thermal annealing of substoichiometric Si oxide layers Si(y)O(1-y), y=(0.36,0.39,0.42), at various annealing temperatures (T(a)) and gas atmospheres. Raman scattering measurements give evidence for the formation of amorphous Si-ncl at T(a)=900 degrees C and of crystalline Si-ncl for T(a)=1000 degrees C and 1100 degrees C. For T(a)=1100 degrees C, the energy dispersion of the PL decay rate does not depend on sample fabrication conditions and follows previously reported behavior. For lower T(a), the rate becomes dependent on fabrication conditions and less energy dispersive. The effects are attributed to exciton localization and decoherence leading to the suppression of quantum confinement and the enhancement of nonradiative recombination in disordered and amorphous Si-ncl. (C) 2010 American Institute of Physics. [doi: 10.1063/1.3457900]

Museum, object and information

This text aims to approach museums` role in the production of knowledge and how objects are transformed into documents when museums incorporate them. On accepting the effects of such transformation, museums start working not only with material goods, but also symbolic goods. The collection manager or exhibition curator communicate through documents rather than bringing into light its intrinsic content. In this sense, every process involving museum documents, from the selection of collections to exhibitions, has a rhetoric and ideological nature which is given. Museums must search for meanings through correlations established in the process of producing information. Exhibitions should present objects in multiple contexts, giving visitors the opportunity to participate and attribute their own meanings to them.

Knowledge and information flows in supply chains: A study on pharmaceutical companies

A great deal of attention in the supply chain management literature is devoted to study material and demand information flows and their coordination. But in many situations, supply chains may convey information from different nature, they may be an important channel companies have to deliver knowledge, or specifically, technical information to the market. This paper studies the technical flow and highlights its particular requirements. Drawing upon a qualitative field research, it studies pharmaceutical companies, since those companies face a very specific challenge: consumers do not have discretion over their choices, ethical drugs must be prescribed by physicians to be bought and used by final consumers. Technical information flow is rich, and must be redundant and early delivered at multiple points. Thus, apart from the regular material channel where products and order information flow, those companies build a specialized information channel, developed to communicate to those who need it to create demand. Conclusions can be extended to supply chains where products and services are complex and decision makers must be clearly informed about technology-related information. (C) 2009 Elsevier B.V. All rights reserved.