Abstract. Technological growth in the electronics industry has historically been measured by the number of transistors that can be crammed onto a single microchip. Unfortunately, all good things must come to an end; spectacular growth in the number of transistors on a chip requires spectacular reduction of the transistor size. For electrons in semiconductors, the laws of quantum mechanics take over at the nanometre scale, and the conventional wisdom for progress (transistor cramming) must be abandoned. This realization has stimulated extensive research on ways to exploit the spin (in addition to the orbital) degree of freedom of the electron, giving birth to the field of spintronics. Perhaps the most ambitious goal of spintronics is to realize complete control over the quantum mechanical nature of the relevant spins. This prospect has motivated a race to design and build a spintronic device capable of complete control over its quantum mechanical state, and ultimately, performing computations: a quantum computer. In this tutorial we summarize past and very recent developments which point the way to spin-based quantum computing in the solid-state. After introducing a set of basic requirements for any quantum computer proposal, we offer a brief summary of some of the many theoretical proposals for solid-state quantum computers. We then focus on the Loss-DiVincenzo proposal for quantum computing with the spins of electrons confined to quantum dots. There are many obstacles to building such a quantum device. We address these, and survey recent theoretical, and then experimental progress in the field. To conclude the tutorial, we list some as-yet unrealized experiments, which would be crucial for the development of a quantumdot quantum computer. Recipes for spin-based quantum computing 2 1.
Abstract. Technological growth in the electronics industry has historically been measured by the number of transistors that can be crammed onto a single microchip. Unfortunately, all good things must come to an end; spectacular growth in the number of transistors on a chip requires spectacular reduction of the transistor size. For electrons in semiconductors, the laws of quantum mechanics take over at the nanometre scale, and the conventional wisdom for progress (transistor cramming) must be abandoned. This realization has stimulated extensive research on ways to exploit the spin (in addition to the orbital) degree of freedom of the electron, giving birth to the field of spintronics. Perhaps the most ambitious goal of spintronics is to realize complete control over the quantum mechanical nature of the relevant spins. This prospect has motivated a race to design and build a spintronic device capable of complete control over its quantum mechanical state, and ultimately, performing computations: a quantum computer. In this tutorial we summarize past and very recent developments which point the way to spin-based quantum computing in the solid-state. After introducing a set of basic requirements for any quantum computer proposal, we offer a brief summary of some of the many theoretical proposals for solid-state quantum computers. We then focus on the Loss-DiVincenzo proposal for quantum computing with the spins of electrons confined to quantum dots. There are many obstacles to building such a quantum device. We address these, and survey recent theoretical, and then experimental progress in the field. To conclude the tutorial, we list some as-yet unrealized experiments, which would be crucial for the development of a quantumdot quantum computer. Recipes for spin-based quantum computing 2 1.
Technological growth in the electronics industry has historically been measured by the number of transistors that can be crammed onto a single microchip. Unfortunately, all good things must come to an end; spectacular growth in the number of transistors on a chip requires spectacular reduction of the transistor size. For electrons in semiconductors, the laws of quantum mechanics take over at the nanometre scale, and the conventional wisdom for progress (transistor cramming) must be abandoned. This realization has stimulated extensive research on ways to exploit the spin (in addition to the orbital) degree of freedom of the electron, giving birth to the field of spintronics . Perhaps the most ambitious goal of spintronics is to realize complete control over the quantum mechanical nature of the relevant spins. This prospect has motivated a race to design and build a spintronic device capable of complete control over its quantum mechanical state, and ultimately, performing computations: a quantum computer. In this tutorial we summarize past and very recent developments which point the way to spin-based quantum computing in the solid state. After introducing a set of basic requirements for any quantum computer proposal, we offer a brief summary of some of the many theoretical proposals for solid-state quantum computers. We then focus on the Loss–DiVincenzo proposal for quantum computing with the spins of electrons confined to quantum dots. There are many obstacles to building such a quantum device. We address these, and survey recent theoretical, and then experimental progress in the field. To conclude the tutorial, we list some as-yet unrealized experiments, which would be crucial for the development of a quantum dot quantum computer.
Control over electron-spin states, such as coherent manipulation, filtering and measurement promises access to new technologies in conventional as well as in quantum computation and quantum communication. We review our proposal of using electron spins in quantum confined structures as qubits and discuss the requirements for implementing a quantum computer. We describe several realizations of one- and two-qubit gates and of the read-in and read-out tasks. We discuss recently proposed schemes for using a single quantum dot as spin-filter and spin-memory device. Considering electronic EPR pairs needed for quantum communication we show that their spin entanglement can be detected in mesoscopic transport measurements using metallic as well as superconducting leads attached to the dots.
Since the seminal work by Shor who proposed a quantum algorithm factorizing integers into prime factors, it has become manifest that the laws of quantum mechanics provide resources for computation that overpower classical physics. The computational advantages that quantum physics offers have stimulated a tremendous amount of theoretical and experimental research. In this context, spin systems have played a major role, given that the spin degree of freedom -- with the paradigmatic case of the spin-1/2 of electrons -- represents an obvious candidate for the encoding of an elementary bit of quantum information (qubit). \n \nOn the other hand, however, quantum objects are very fragile entities, being very susceptible to the environment they reside in. This fragility of qubits is one of the main obstacles in the realization of a quantum computer. \n \nIn this thesis, we mainly address the two following questions relevant to quantum computation. \n \ni) How is it possible to realize quantum gates both in a reliable and scalable way? \n \nii) How can we store quantum information in a way that is resilient to the errors caused by the thermal environment? \n \nWe focus on spin systems and demonstrate that long-range spin-spin interactions in the models considered can have beneficial effects. \n \nIn their pioneering work, Loss and DiVincenzo proposed a way to perform quantum computation in a semiconductor-based architecture where the spin state of an electron trapped in a quantum dot is chosen to encode the elementary qubit. In this proposal, the spins are required to lie spatially close to each other, and this might complicate the realization of a scalable architecture. \n \nIn the first part of the thesis we thus propose a scheme that allows the constraint on the positioning of the qubits to be relaxed. This is achieved by introducing a ferromagnetic coupler between the distant qubits, to which it is coupled via a dipolar interaction. Most importantly, our proposal is applicable to any type of spin qubits and in particular to the technologically very relevant silicon-based qubits and NV-centers in diamond to which previous coupling schemes do not apply. \n \nAs additional key element, a quantum computer needs a memory capable of reliably storing quantum information in the presence of thermal fluctuations. \n \nThis brings us to the second part of this thesis, where we consider self-correcting memories, for which the protection against thermal noise is built-in at the hardware level. We propose physical models that exhibit these self-correcting properties, using as a starting point the well known topologically ordered toric code. In particular, we investigate how to induce long-range interactions between the spins of the toric code, since such interactions help increase the memory lifetime. \n \nAs a first step, we study a honeycomb quantum spin model coupled to delocalized cavity modes. We investigate the properties of the low-energy toric code Hamiltonian and show that the coupling to cavity modes prolongs the lifetime of the memory and offers a method to detect the presence of excitations. \nWhile the introduction of extended bosonic modes makes the model non-local, we also propose a purely local model consisting of a toric code embedded in a three-dimensional cubic lattice of hopping bosons; the low-energy sector of a toric code coupled to a three-dimensional Heisenberg ferromagnet in a broken-symmetry state realizes this model. Our analysis leads to an energy penalty for the creation of defects that grows linearly with the size L of the memory and thus to a lifetime increasing exponentially with L. \n \nIn the third part of this thesis, we study spin systems that support anyons, i.e., particles with fractional statistics. Similar to the toric code, such systems are topologically ordered: they are immune to local perturbations and quantum gates are implemented by non-local operations, namely the exchange of anyons, whose outcomes depend only on the topology of the exchange. Here again the fault-tolerance is achieved at the level of the hardware and physical systems supporting non-abelian anyons are thus promising platforms for quantum computation. \n \nWe focus on spin systems that exhibit some of these properties and specifically on variations of the honeycomb quantum spin model. We first investigate the exact solution of the honeycomb model in detail and derive an explicit formula for the projector onto the physical subspace. We use this result to study inhomogeneous open spin ladders, related to the honeycomb model, which can be tuned between topological and non-topological phases. We test the robustness of Majorana end states (MES) which emerge at the boundary between sections in different topological phases. Furthermore, we present a trijunction setup where MES can be braided. This is of interest since MES in these spin ladders potentially follow non-abelian braiding statistics. Finally, we study the ground states of the aforementioned ladders and show that they are free of vortices when the signs of the spin couplings are all positive or negative. To prove this, we use exact reflection-positivity-based methods as well as approximate methods. \n \nIn the last part of the thesis, we provide an extension of the Mermin-Wagner theorem to a system of lattice spins that are spin-coupled to itinerant and interacting charge carriers. We prove that neither (anti-) ferromagnetic nor helical long-range order is possible in one and two dimensions at any finite temperature (in the absence of spin-orbit). The fundamental question whether spontaneous ordering of the lattice spins occurs in these systems is of interest in the context of quantum computation; the polarization of nuclear spins coupled to a two-dimensional electron gas is a possible route towards the reduction of decoherence induced by the fluctuating Overhauser field in gate-defined quantum dots. \n \n
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.
For the realization of a quantum computer, a good qubit design as the basic building block is a nontrivial starting point. To fully leverage the potential of quantum computing, quantum processors will likely have to incorporate billions of high-quality qubits. Several approaches are being pursued and exhibit different strength and weaknesses. The device concepts and fabrication procedures for semiconductor based qubits are very similar to those used in the semiconductor industry. Using the spin-degree of freedom, their coherence properties and the quality of single-qubit operations have now reached the required level and are on par with competing approaches. Two-qubit operations will likely follow suit in the near future. With these basic requirements being met, it is now time to think if and how increasingly large multi-qubit systems and eventually functional quantum processor can be realized. This quest raises many pertinent questions, some of which equally apply to other qubit platforms. How reproducibly can the different types of semiconductor qubits be produced? How can their operating point be adjusted efficiently and in an automated way? How can they be connected to form meaningful multi-qubit circuits? How severe are multi-qubit control issues such as crosstalk and frequency crowding, and how can they be avoided? What control system architectures are most suitable for operating large numbers of qubits? What is the limit of cryogenic electronics regarding power consumption and integration density? This paper gives a (partial) overview of the state of the art in the field and discusses future challenges associated with the realization of large-scale quantum processors, many of which will greatly benefit from input from engineering science. The guiding vision is that of a highly integrated quantum processor with an ultra-low power cryogenic control system.
Quantum computation is not an imminent achievement . We will not wake up tomorrow and find quantum computers on our desks. At the time of this writing, IBM has just unveiled the Condor – a chip containing 1,121 superconducting qubits. This number will likely increase (perhaps spectacularly) in the near future. However, the qubits have a relatively large error rate and, in the absence of a breakthrough advance that significantly lowers this rate, one would need hundreds of physical qubits to realize an error-corrected logical qubit. Predicting how long it will take to achieve the controlled manipulation of thousands of (logical) qubits (i.e., a number of qubits consistent with the “useful” implementation of known quantum algorithms) is probably not a rational undertaking, at least for a scientist. The most pessimistic experts regard the lively research activity in quantum computation as a waste of time and resources. But the pervading mood in this field is one of cautious optimism, particularly considering the possibility of achieving useful tasks (e.g., simulating quantum systems) with a sufficiently large number of “imperfect” qubits. Expediency may be responsible for some of this optimism; a good feeling about the prospects for quantum computation certainly helps when it comes to publishing papers and getting funded. Ultimately, however, the responsibility for the wise distribution of resources rests with the funding agencies; scientists, on the other hand, are called to explore every aspect of real and possible worlds that looks fascinating and worthy of their curiosity. From this perspective, quantum computation (defined broadly) offers plenty of opportunities for producing “good science.” The problems brought to the fore by the development of this field range from basic questions regarding the foundations of quantum mechanics and unsolved problems in computational complexity, to the investigation of new phases of matter (e.g., topological quantum phases), the quest for “complete” control over quantum systems, and the critical need for significant advances in materials science and device fabrication (e.g., engineering nanoscale heterostructures with atomic precision). Progress in these areas will naturally open new possibilities for interesting applications. Precisely identifying these applications is premature, but building a (general purpose) quantum computer will not necessarily be among the first of them.