In the effort to design and to construct a quantum computer, several leading proposals make use of spin-based qubits. These designs generally assume that spins undergo pairwise interactions. We point out that, when several spins are engaged mutually in pairwise interactions, the quantitative strengths of the interactions can change and qualitatively new terms can arise in the Hamiltonian, including four-body interactions. In parameter regimes of experimental interest, these coherent effects are large enough to interfere with computation and may require new error correction or avoidance techniques.
In the effort to design and to construct a quantum computer, several leading proposals make use of spin-based qubits. These designs generally assume that spins undergo pairwise interactions. We point out that, when several spins are engaged mutually in pairwise interactions, the quantitative strengths of the interactions can change and qualitatively new terms can arise in the Hamiltonian, including four-body interactions. In parameter regimes of experimental interest, these coherent effects are large enough to interfere with computation and may require new error correction or avoidance techniques.
Electron spins in semiconductor quantum dots are promising candidates for the experimental realization of solid-state qubits. We analyse the dynamics of a system of three qubits arranged in a linear geometry and a system of four qubits arranged in a square geometry. Calculations are performed for several quantum dot confining potentials. In the three-qubit case, three-body effects are identified that have an important quantitative influence upon quantum computation. In the four-qubit case, the full Hamiltonian is found to include both three-body and four-body interactions that significantly influence the dynamics in physically relevant parameter regimes. We consider the implications of these results for the encoded universality paradigm applied to the four-electron qubit code; in particular, we consider what is required to circumvent the four-body effects in an encoded system (four spins per encoded qubit) by the appropriate tuning of experimental parameters.
This paper explores the limitations that interaction between the physical qubits making up a quantum computer may impose on the computer's performance. For computers using atoms as qubits, magnetic dipole-dipole interactions are likely to be dominant; various types of errors which they might introduce are considered here. The strength of the interaction may be reduce by increasing the distance between qubits, which in general will make the computer slower. For ion-chain based quantum computers the slowing down due to this effect is found to be generally more sever than that due to other causes. In particular, this effect alone would be enough to make these systems unacceptably slow for large-scale computation, whether they use the center of mass motion as the 'bus' or whether they do this via an optical cavity mode.
Trapped ions, trapped atoms, and NMR spin systems are all fine ways of building small “toy” quantum computers, each with its own advantages and disadvantages. There are also many other techniques which have been suggested, although these three so far remain in the lead for general-purpose quantum computing. However, the most powerful general-purpose quantum computers constructed to date have only about a dozen qubits, and this is not nearly large enough to make quantum computers useful rather than merely interesting. (Larger systems have been used to demonstrate particular quantum information processing techniques, but these cannot as yet be used to implement arbitrary quantum algorithms.)
We present a Hamiltonian quantum-computation scheme universal for quantum computation. Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of constant-norm, time-independent, two-body interaction terms. Furthermore, each qubit in the system interacts only with a constant number of other qubits in a three-layer, geometrically local layout. The computer runs in three steps---it starts in a simple initial product state, evolves according to a time-independent Hamiltonian for time of order L2 (up to logarithmic factors), and finishes with a two-qubit measurement. Our model improves previous universal two-local-Hamiltonian constructions, as it avoids using perturbation gadgets and large energy-penalty terms in the Hamiltonian, which would result in a large required run time.
A quantum computer is similar to an ordinary computer, except that instead of bits it uses two-level quantum systems (qubits), and the usual logical operations on bits are replaced with noiseless quantum dynamics in the form of unitary gates or Hamiltonian interactions. Many sets of resources that are universal for quantum computation (that is, capable of implementing any quantum computation) have been found, but general conditions for universality are still only partially understood. Improving our understanding of these conditions contributes to two broad goals. On the one hand, understanding what class of physical systems is suitable for quantum computation allows us choose the systems that are most easily controlled or built in the laboratory. On the other hand, identifying the unifying characteristics of such a class provides insight into the fundamental physics responsible for the much greater computational power of quantum computers. The original results presented in this thesis are a contribution to our understanding of the physical requirements for universal quantum computation. These results lead to the identification of a new, large class of universal dynamics. More specifically, the main problem that is addressed is the following: consider a physical system that is made up of a finite number of qubits that are subject to a natural, fixed interaction described by a two-body Hamiltonian. Suppose we have the ability to control the system only by applying fast one-qubit operations. Under what conditions is this system capable of universal quantum computation? The first original result of the thesis is to prove that universal quantum computation is possible under these conditions given the single extra constraint that the Hamiltonian must entangle, or connect, all of the qubits. In other words, since a two-body Hamiltonian is expressible as a sum of coupling terms each of which acts nontrivially on a pair of qubits, consider the graph whose vertices correspond to qubits and whose edges connect qubits that are coupled by a term in the Hamiltonian. Then this Hamiltonian, together with fast one-qubit unitaries, is universal for quantum computation precisely when the corresponding graph is connected. This result suggests many potential generalizations, three of which are explored in this thesis. The first generalization is to show that the same result holds for a two-body Hamiltonian that acts on D-dimensional quantum systems (qudits), given fast one-qudit unitaries. A second extension is to the case of a many-body Hamiltonian, that is, a Hamiltonian that has coupling terms that act on more than two qubits. Again, we find that under mild restrictions, such Hamiltonians are universal provided they are connected and that arbitrary one-qubit unitaries are available. We also discover and explore some surprising structure in many-body Hamiltonians that is associated with the parity of the couplings. A third related problem that is addressed is the question of what two-qubit unitaries are universal for quantum computation. This problem was originally solved by J.-L. and R. Brylinski [BB02], who gave a technical proof of the universality of any two-qudit gate that is not the swap gate or a product of one-qudit unitaries, given one-qudit unitaries as a free resource. We develop an elementary and constructive proof for the case of qubits, and prove that our construction is very close to optimal in the number of uses of the two-qubit gate. Given a qualitative understanding of what dynamical resources are universal for quantum computation, it is natural to consider developing a quantitative measure of the usefulness of quantum dynamics for quantum information processing. This is done in the final chapter of the thesis, in which the beginnings of a quantitative theory of quantum dynamics are developed.
The recent discovery of efficient quantum algorithms for factoring and database search has shown that quantum computing would allow to solve important problems which are intractable with conventional computers. In contrast to the very demanding task of building a large-scale quantum computer, there are quantum communication protocols, e.g. quantum key distribution for cryptography, which—though still difficult—require much less effort and can be implemented with current technology. Apart from the technological motivation, the study of quantum information offers (at least) two additional benefits. First, new insight into fundamental questions on quantum mechanics, e.g. concerning non-locality and entanglement, are gained from an information-theoretical approach. And second, investigating a particular physical implementation of quantum information can give rise to independent physical results. Spintronics, the use of spin as opposed to charge in (classical) electronics is a new field for which some results presented here could be relevant. In this dissertation we investigate several theoretical aspects of the physical implementation of quantum computation and communication in which the fundamental unit of quantum information, the qubit, is represented by the spin of electrons in semiconductor quantum dots. The required coupling between the spins can be obtained by allowing for tunneling of electrons between adjacent dots, leading to a Heisenberg exchange coupling J S1 · S2 between the spins, a scenario which we study for laterally coupled quantum dots in a two-dimensional electron system, and for a three-dimensional setup with vertically coupled quantum dots. Furthermore, an alternative scheme to couple the spins via the interaction with an optical cavity mode is presented. Quantum error correction represents one of the important ingredients for the physical implementation of a quantum computer by protecting \nit from the e�ects of a noisy environment. As a �rst test for errorcorrection \nin a solid-state device using spins, we propose an optimized \nimplementation of the most primitive error correction scheme (the threebit \ncode). In this context, we introduce parallel switching, allowing \nto operate a quantum computer more e�ciently than the usual serial \nswitching. \nCoupling spins with the exchange interaction J S1 �S2 is not su�cient \nfor quantum computation; the spins also have to be addressed individually \nusing controllable local magnetic �elds or g-factors giBi �Si in order \nto allow for single-qubit operations. On the one hand, we discuss several \nschemes for overcoming the di�culty of applying local magnetic �elds \n(requiring large gradients), e.g. g-factor engineering, which allows for \nall-electric operation of the device. On the other hand, we show that \nat the expense of additional devices (spins) and switching operations, \nsingle-spin rotations can be dispensed with completely. \nAddressing the feasibility of quantum communication with entangled \nelectrons in mesoscopic wires, i.e. interacting many-body environments, \nwe propose an interference experiment using a scattering set-up with an \nentangler and a beam splitter. The current noise for electronic singlet \nstates turns out to be enhanced (bunching), while it is reduced for triplets \n(antibunching). Due to interactions, the �delity of the entangled singlet \nand triplet states is reduced by z4F \nin a conductor described by Fermi \nliquid theory, zF being the quasiparticle weight factor. \nFinally, we study the related but more general problem of the noise of \nthe cotunneling current through one or several tunnel-coupled quantum \ndots in the Coulomb blockade regime. The various regimes of weak and \nstrong, elastic and inelastic cotunneling are analyzed for quantum-dot \nsystems (QDS) with few-level, nearly-degenerate, and continuous electronic \nspectra. In contrast to sequential tunneling, the noise in inelastic \ncotunneling can be super-Poissonian. In order to investigate strong cotunneling \nwe develop a microscopic theory of cotunneling based on the \ndensity-operator formalism and using the projection operator technique. \nWe have derived the master equation for the QDS and the current and \nnoise in cotunneling in terms of the stationary state of the QDS. These \nresults are then applied to QDS with a nearly degenerate and continuous \nspectrum.