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.

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.

Single-spin measurement using single-electron transistors to probe two-electron systems

We present a method for measuring single spins embedded in a solid by probing two-electron systems with a single-electron transistor (SET). Restrictions imposed by the Pauli principle on allowed two-electron states mean that the spin state of such systems has a profound impact on the orbital states (positions) of the electrons, a parameter which SET's are extremely well suited to measure. We focus on a particular system capable of being fabricated with current technology: a Te double donor in Si adjacent to a Si/SiO2, interface and lying directly beneath the SET island electrode, and we outline a measurement strategy capable of resolving single-electron and nuclear spins in this system. We discuss the limitations of the measurement imposed by spin scattering arising from fluctuations emanating from the SET and from lattice phonons. We conclude that measurement of single spins, a necessary requirement for several proposed quantum computer architectures, is feasible in Si using this strategy.

Molecular orbital calculations of two-electron states for P-donor solid-state spin qubits

We theoretically study the Hilbert space structure of two neighboring P-donor electrons in silicon-based quantum computer architectures. To use electron spins as qubits, a crucial condition is the isolation of the electron spins from their environment, including the electronic orbital degrees of freedom. We provide detailed electronic structure calculations of both the single donor electron wave function and the two-electron pair wave function. We adopted a molecular orbital method for the two-electron problem, forming a basis with the calculated single donor electron orbitals. Our two-electron basis contains many singlet and triplet orbital excited states, in addition to the two simple ground state singlet and triplet orbitals usually used in the Heitler-London approximation to describe the two-electron donor pair wave function. We determined the excitation spectrum of the two-donor system, and study its dependence on strain, lattice position, and interdonor separation. This allows us to determine how isolated the ground state singlet and triplet orbitals are from the rest of the excited state Hilbert space. In addition to calculating the energy spectrum, we are also able to evaluate the exchange coupling between the two donor electrons, and the double occupancy probability that both electrons will reside on the same P donor. These two quantities are very important for logical operations in solid-state quantum computing devices, as a large exchange coupling achieves faster gating times, while the magnitude of the double occupancy probability can affect the error rate.

Generation of eigenstates using the phase-estimation algorithm

The phase estimation algorithm is so named because it allows an estimation of the eigenvalues associated with an operator. However, it has been proposed that the algorithm can also be used to generate eigenstates. Here we extend this proposal for small quantum systems, identifying the conditions under which the phase-estimation algorithm can successfully generate eigenstates. We then propose an implementation scheme based on an ion trap quantum computer. This scheme allows us to illustrate two simple examples, one in which the algorithm effectively generates eigenstates, and one in which it does not.

Preparing encoded states in an oscillator

Recently a scheme has been proposed for constructing quantum error-correcting codes that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. One of the difficult steps in this scheme is the preparation of the encoded states. We show how these states can be generated by coupling a continuous quantum variable to a single qubit. An ion trap quantum computer provides a natural setting for a continuous system coupled to a qubit. We discuss how encoded states may be generated in an ion trap.

Electron exchange coupling for single-donor solid-state spin qubits

Intervalley interference between degenerate conduction band minima has been shown to lead to oscillations in the exchange energy between neighboring phosphorus donor electron states in silicon [B. Koiller, X. Hu, and S. Das Sarma, Phys. Rev. Lett. 88, 027903 (2002); Phys. Rev. B 66, 115201 (2002)]. These same effects lead to an extreme sensitivity of the exchange energy on the relative orientation of the donor atoms, an issue of crucial importance in the construction of silicon-based spin quantum computers. In this article we calculate the donor electron exchange coupling as a function of donor position incorporating the full Bloch structure of the Kohn-Luttinger electron wave functions. It is found that due to the rapidly oscillating nature of the terms they produce, the periodic part of the Bloch functions can be safely ignored in the Heitler-London integrals as was done by Koiller, Hu, and Das Sarma, significantly reducing the complexity of calculations. We address issues of fabrication and calculate the expected exchange coupling between neighboring donors that have been implanted into the silicon substrate using an 15 keV ion beam in the so-called top down fabrication scheme for a Kane solid-state quantum computer. In addition, we calculate the exchange coupling as a function of the voltage bias on control gates used to manipulate the electron wave functions and implement quantum logic operations in the Kane proposal, and find that these gate biases can be used to both increase and decrease the magnitude of the exchange coupling between neighboring donor electrons. The zero-bias results reconfirm those previously obtained by Koiller, Hu, and Das Sarma.

Numerical study of hydrogenic effective mass theory for an impurity P donor in Si in the presence of an electric field and interfaces

In this paper we examine the effects of varying several experimental parameters in the Kane quantum computer architecture: A-gate voltage, the qubit depth below the silicon oxide barrier, and the back gate depth to explore how these variables affect the electron density of the donor electron. In particular, we calculate the resonance frequency of the donor nuclei as a function of these parameters. To do this we calculated the donor electron wave function variationally using an effective-mass Hamiltonian approach, using a basis of deformed hydrogenic orbitals. This approach was then extended to include the electric-field Hamiltonian and the silicon host geometry. We found that the phosphorous donor electron wave function was very sensitive to all the experimental variables studied in our work, and thus to optimize the operation of these devices it is necessary to control all parameters varied in this paper.

Voltage control of exchange coupling in phosphorus doped silicon

Motivated by applications to quantum computer architectures we study the change in the exchange interaction between neighbouring phosphorus donor electrons in silicon due to the application of voltage biases to surface control electrodes. These voltage biases create electro-static fields within the crystal substrate, perturbing the states of the donor electrons and thus altering the strength of the exchange interaction between them. We find that control gates of this kind can be used to either enhance or reduce the strength of the interaction, by an amount that depends both on the magnitude and orientation of the donor separation.

Quantum technology: the second quantum revolution

We are currently in the midst of a second quantum revolution. The first quantum revolution gave us new rules that govern physical reality. The second quantum revolution will take these rules and use them to develop new technologies. In this review we discuss the principles upon which quantum technology is based and the tools required to develop it. We discuss a number of examples of research programs that could deliver quantum technologies in coming decades including: quantum information technology, quantum electromechanical systems, coherent quantum electronics, quantum optics and coherent matter technology.

Stochastic gauges in quantum dynamics for many-body simulations

Quantum dynamics simulations can be improved using novel quasiprobability distributions based on non-orthogonal Hermitian kernel operators. This introduces arbitrary functions (gauges) into the stochastic equations. which can be used to tailor them for improved calculations. A possible application to full quantum dynamic simulations of BEC's is presented. (C) 2001 Elsevier Science B.V. All rights reserved.

Read-only-memory-based quantum computation: Experimental explorations using nuclear magnetic resonance and future prospects

Read-only-memory-based (ROM-based) quantum computation (QC) is an alternative to oracle-based QC. It has the advantages of being less magical, and being more suited to implementing space-efficient computation (i.e., computation using the minimum number of writable qubits). Here we consider a number of small (one- and two-qubit) quantum algorithms illustrating different aspects of ROM-based QC. They are: (a) a one-qubit algorithm to solve the Deutsch problem; (b) a one-qubit binary multiplication algorithm; (c) a two-qubit controlled binary multiplication algorithm; and (d) a two-qubit ROM-based version of the Deutsch-Jozsa algorithm. For each algorithm we present experimental verification using nuclear magnetic resonance ensemble QC. The average fidelities for the implementation were in the ranges 0.9-0.97 for the one-qubit algorithms, and 0.84-0.94 for the two-qubit algorithms. We conclude with a discussion of future prospects for ROM-based quantum computation. We propose a four-qubit algorithm, using Grover's iterate, for solving a miniature real-world problem relating to the lengths of paths in a network.

Quantum dynamics of two coupled qubits

We investigate the difference between classical and quantum dynamics of coupled magnetic dipoles. We prove that in general the dynamics of the classical interaction Hamiltonian differs from the corresponding quantum model, regardless of the initial state. The difference appears as nonpositive-definite diffusion terms in the quantum evolution equation of an appropriate positive phase-space probability density. Thus, it is not possible to express the dynamics in terms of a convolution of a positive transition probability function and the initial condition as can be done in the classical case. It is this feature that enables the quantum system to evolve to an entangled state. We conclude that the dynamics are a quantum element of nuclear magnetic resonance quantum-information processing. There are two limits where our quantum evolution coincides with the classical one: the short-time limit before spin-spin interaction sets in and the long-time limit when phase diffusion is incorporated.

One-dimensional quantum walk with unitary noise

The effect of unitary noise on the discrete one-dimensional quantum walk is studied using computer simulations. For the noiseless quantum walk, starting at the origin (n=0) at time t=0, the position distribution P-t(n) at time t is very different from the Gaussian distribution obtained for the classical random walk. Furthermore, its standard deviation, sigma(t) scales as sigma(t)similar tot, unlike the classical random walk for which sigma(t)similar toroott. It is shown that when the quantum walk is exposed to unitary noise, it exhibits a crossover from quantum behavior for short times to classical-like behavior for long times. The crossover time is found to be Tsimilar toalpha(-2), where alpha is the standard deviation of the noise.