DOCSLIB.ORG

Information and Computation: Classical and Quantum Aspects

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Information and Computation: Classical and Quantum Aspects Reviews of Modern Physics to apperar Information and Computation: Classical and Quantum Aspects A. Galindo† and M.A. Mart´ın-Delgado‡ Departamento de F´ısica T´eorica I. Facultad de Ciencias F´ısicas. Universidad Complutense. 28040 Madrid. Spain. Quantum theory has found a new field of applications in the realm of information and computation during the recent years. This paper reviews how quantum physics allows information coding in classically unexpected and subtle nonlocal ways, as well as information processing with an efficiency largely surpassing that of the present and foreseeable classical computers. Some outstanding aspects of classical and quantum information theory will be addressed here. Quantum teleportation, dense coding, and quantum cryptography are discussed as a few samples of the impact of quanta in the transmission of information. Quantum logic gates and quantum algorithms are also discussed as instances of the improvement in information processing by a quantum computer. We provide finally some examples of current experimental realizations for quantum computers and future prospects. PACS numbers: 03.67.-a, 03.67.Lx CONTENTS A.The Ion-Trap QC 58 B.NMR Liquids: Quantum Ensemble Computation 61 I.Introduction 1 C.Solid-State Quantum Computers 66 II.Classical Information 2 XII.Conclusions 70 A.The Theorems of Shannon 2 Acknowledgments 71 B.Classical Error Correction 4 List of Symbols and Acronyms 71 III.Quantum Information 6 Appendix: Computational Complexity 72 A.Entanglement and Information 8 A.Classical Complexity Classes 72 B.Quantum Coding and Schumacher’s Theorem 10 B.Quantum Complexity Classes 74 C.Capacities of a Quantum Channel 11 References 74 D.Quantum Error Correction 11 E.Entanglement Distillation 13 IV.Quantum Teleportation 15 I. INTRODUCTION V.Dense Coding 16 VI.Cryptography 17 A.Classical Cryptography 17 The twentieth century we have just left behind opened B.Quantum Cryptography 20 with the discovery of quanta by Planck (1900) and fol- C.Practical Implementation of QKD 23 lowed with the formulation of the quantum theory during VII.Quantum Computation 23 the first decades. As the century went by, we have wit- VIII.Classical Computers 24 A.The Turing Machine 24 nessed a continuous and growing increase in the number arXiv:quant-ph/0112105v1 18 Dec 2001 B.The von Neumann Machine 28 of applications of quantum mechanics, which began with C.Classical Parallelism 29 atomic physics and then the number kept growing (nu- D.Classical Logic Gates and Circuits 31 clear and particle physics, optics, condensed matter, . ) IX.Principles of Quantum Computation 32 and became countless. As the century was closing we A.The Quantum Turing Machine 33 B.Quantum Logic Gates 37 have come across an unexpected new field of applications C.Quantum Circuits 40 that have given quantum physics a refreshing twist, keep- X.Quantum Algorithms 44 ing the pace even with the newest trends of discoveries, A.Deutsch-Jozsa Algorithm 45 such as the field of new technologies of information and B.Simon Algorithm 47 computation. In a sense and having in mind the times we C.Grover Algorithm 47 D.Shor Algorithm 51 live, those of the information era and the new technolo- E.On the Classification of Algorithms 54 gies, it seems inevitable that physics gets affected by the XI.Experimental Proposals of Quantum Computers 56 presence of computers all over around, which are more and more powerful and have revolutionized many areas of science. What is more surprising is the fact that quan- tum physics may influence the field of information and †Electronic address: [email protected] computation in a new and profound way, getting at the ‡Electronic address: mardel@miranda.fis.ucm.es very root of their foundations. For instance, fundamental 2 aspects of quantum mechanics such as those entering the scribing the notion of a quantum Turing machine and its EPR (Einstein, Podolsky and Rosen, 1935) states have practical implementation with quantum circuits. We de- found unexpected applications in information transmis- scribe the notion of elementary quantum gates for univer- sion and cryptography. sal computation and how this extends the classical coun- But, why has this happened? It all begun by realizing terpart. We also provide a discussion of the basic quan- that information has physical nature (Landauer, 1991; tum algorithms and finally we give a general overview 1996; 1961). It is printed on a physical support (the of some of the possible physical realizations of quantum rocky wall of a cave, a clay tablet, a parchment, a sheet computers. of paper, a magneto-optic disk, etc.), it cannot be trans- Both in the information and computation parts we mitted faster than light in vacuum, and it abides by the make special emphasis in presenting first an introduc- natural laws. The statement that information is physical tion to the classical aspects of these disciplines in order does not simply mean that a computer is a physical ob- to better clarify what quantum theory adds to them in ject, but in addition that information itself is a physical the new formulations of these theories. Actually, this is entity. In turn, this implies that the laws of informa- also what we do in physics. tion are restricted or governed by the laws of physics. In particular, those of quantum physics. In fact these ones, through their linearity, entanglement of states, nonlocal- II. CLASSICAL INFORMATION ity and indetermination principle make possible new and powerful transmission tools and information treatments, Information is discretized: it comes in irreducible pack- as well as a really prodigious efficiency of computation. ages. The elementary unit of classical information is the A typical computation is implemented through an al- bit (or cbit, for classic bit), a classical system with only gorithm in a computer. This algorithm is now regarded two states 0 and 1 (False and True, No and Yes, . ). Any as a set of physical operations and the registers of the text can be coded into a string of bits: for instance, it quantum computer are considered to be states of a quan- is enough to assign to each symbol its ASCII code num- tum system. Moreover, the familiar operation of initial- ber in binary form, appended with a parity check bit. izing the data for a program to run is replaced by the Example: quanta can be coded as preparation of an initial quantum state, and the usual 11100010 11101011 11000011 11011101 11101000 11000011 tasks of writing programs and running them correspond, in the new formulation, to finding appropriate Hamilto- Each bit can be stored physically; in classical comput- nians for their time evolution operators to lead to the ers, each bit is registered as a charge state of a capacitor desired output. This output is retrieved by a quantum (0 = discharged, 1 = charged). They are distinguishable measurement of the register, and this fact has deep im- macroscopic states, and robust enough or stable. They plications on the way quantum information must be han- are not spoiled when they are read in (if carefully done) dled. and they can be cloned or replicated without any prob- We shall see that information and computation blend lem. well with quantum mechanics. Their combination brings Information is not only stored; it is usually transmit- unexpected results on the way information can be trans- ted (communication), and sometimes processed (compu- mitted and processed, extending the capabilities known tation). so far in the field of classical information to unsuspected limits, sometimes entering the realm of science-fiction, sometimes surpassing it. A. The Theorems of Shannon The advance has been remarkable mainly in the field of cryptography, where it has provided systems absolutely The classical theory of information is due to Shannon secure for the quantum distribution of keys. Quantum (1948,1949), who in two seminal works definitively laid computation is also one of the hot research fields in cur- down its principles in 1948. With his celebrated noise- rent physics; the same applies to the challenge posed less coding theorem he showed how much compressible a by the experimental realization of a computer complex message can be, or equivalently, how much redundancy enough to implement the new algorithms that exploit it has. Likewise with his coding theorem in a noisy chan- the fantastic possibilities of the massive parallelism char- nel he also found what is the minimum redundancy that acterizing those quantum computers, and that would must be present into a message in order to be compre- amount to a dramatic improvement for solving hard or hensible when reaching the receiver, despite of the noise. classically untractable problems. Let A := a1, ..., a A be a finite alphabet, endowed We first review the essentials of quantum information with a probability{ distribution| |} p : a p (a ), with theory and then discuss several of their consequences and A i 7→ A i 1 i A pA(ai) = 1. Sometimes we shall be write this applications, some of them specifically quantum such as ≤ ≤| | A quantum teleportation, dense coding; some of them with Pas A := ai,pA(ai) i|=1| . Let us consider messages or { } n a classical echo such as quantum cryptography. Next character strings x1x2...xn A , originating from a ∈ we review the fundamentals of quantum computation de- memoryless source, i.e., a symbol a appears in a given 3 place with probability pA(a), independently of the sym- Let X be the alphabet of the transmitter station (of bols entering the remaining sites in the chain.1 The first a memoryless source), and Y be the one of the receiver Shannon’s theorem asserts that, if n 1, the informa- station. Let (pY X (yj xi)) be the stochastic matrix for tion supplied by a generic message of≫n characters (and that channel, with| entries| given by the probabilities that thus (n log2 A )-bits long) essentially coincides with that the input symbol xi X appears as yi Y on out- transmitted| by| another shorter message, of bit length put.
Load more

Recommended publications
  • Quantum Dots
    NMR Silicon quantum computing Quantum dots Practical realization of Quantum Computation QC implementation proposals Bulk spin Optical Atoms Solid state Resonance (NMR) Linear optics Cavity QED Trapped ions Optical lattices Electrons on He Semiconductors Superconductors Nuclear spin Electron spin Orbital state Flux Charge qubits qubits qubits qubits qubits http://courses.washington.edu/bbbteach/576/ 1 What is NMR (Nuclear magnetic resonance) ? NMR: study of the transitions between the Zeeman levels of an atomic nucleus in a magnetic field. • If put a system of nuclei with non-zero spin in E static magnetic field, there 2 E will be different energy RF 0 levels. 0 E2 E1 • If radio frequency wave with is applied, RF 0 E1 transitions will occur. Nuclear Energy Levels 2 Nuclear magnetic resonance NMR is one of the most important spectroscopic techniques available in molecular sciences since the frequencies of the NMR signal allow study of molecular structure. Basic idea: use nuclear spins of molecules as qubits Liquid NMR: rapid molecular motion in fluids greatly simplifies the NMR Hamiltonian as anisotropic interactions can be replaced by their isotropic averages, often zero. The signals are often narrow (high-resolution NMR). It is impossible to pick individual molecule. The combined signal from all molecules is detected (“bulk” NMR). Liquid Solution NMR Billions of molecules are used, each one a separate quantum computer. Most advanced experimental demonstrations to date, but poor scalability as molecule design gets difficult. Qubits are stored in nuclear spin of molecules and controlled by different frequencies of magnetic pulses. Vandersypen, 2000 Used to factor 15 experimentally.
    [Show full text]
  • Or Printers' Test Notes
    Printers’ Test Notes – A Primer Or Everything You Wanted to Know About Printers’ Test Notes, But Were Afraid to Ask. Now that The Catalog of Test Notes has been split into two catalogs, one for ATM and related test notes and one for Printer related test notes, I have better means to offer a look at the test notes more familiar to bank note collectors. Printers’ test note are also called advertising, promotional, house, trial, demonstration, and color samples., ATM test notes are often colorful, but notes produced by firms involved in bank note production offer much more sophisticated specimens – showing off their latest security and durability innovations. The avid collector of high tech bank notes will find the most up-to-date notes, actually prototypes of future notes present in a test note collection. So here is a group of questions of which the answers give the collector a good start to a new collecting interest. What different types of firms produce test notes? As Sev Onyshkevych wrote in the IBNS forum, “The "printers" category also includes the entire food chain.” This means any firm contributing to a bank note being produced can also produce a test note. The types of firms which are attributed with test notes so far are: engravers, printers, paper and polymer producers, banknote designers, security ink providers, central banks, security foiling suppliers and substrate providers. Currency counters, sorters, verification machines, dispensers, and legitimate training notes providers also make test notes which make up the inventory in The Catalog of ATM Test Notes. Which firm has produced the most different test notes in the printers catalog? There are four firms with 60 or more different test notes, not including their sub varieties.
    [Show full text]
  • Advanced Track & Trace
    Advanced Track & ATT- Trace 101aD Advanced Track & Trace provides authentication solutions embedded in bank notes through printing or directly in the materials. Patented systems developed with the Bank of France include SealNote®, Sealgn@ture® and SealTaglio®. 99 avenue de la Châtaigneraie 92504 Rueil Malmaison France 1 Test note attributed Aestron Security ASD- Design 101D An acquired security consultancy of Joh. Enschedé Zeverijinstraat 12, 1216 GK Hilversum, The Netherlands 1 Test note attributed American Banknote ABNC- Company 192NC Produced food coupons, postage stamps, stock and bond certificates, travelers’ checks, foreign currency, passports, bank checks, and commercial documents. Filed Chapter 11 in 1999; spun off American Bank Note Holographics unit in 1998. This unit sold to JDSU in 2008. 560 Sylvan Ave. Englewood Cliffs, NJ 07632 140 Test note attributed James M. Anderson & AND- Son 101NC Engraving firm active in the mid- 1800’s. Produced shares for The Baltimore & Havana Steamship Company. 148 Baltimore Street, Baltimore, Maryland 1 Test note attributed Applegarth and AC- Cowper 111aNC Inventors of the horizontal steam powered syndical press, submitted notes for 20,000 pound prize for forge-proof banknote to the Bank of England. Auction.net, the English auction house has three different varieties of Applegarth and Cowpar trial notes at auction. They estimate the year of issue as about 1818. Spink estimates the same note as 1821. “The Bank of England Note: A History of Its Printing” by A. D. Mackenzie estimates the year of issue as 1819, noting the Court of Directors of the Bank of England approved their design on February 4, 1819.
    [Show full text]
  • Material Platforms for Defect Qubits and Single Photon Emitters
    Material Platforms for Defect Qubits and Single Photon Emitters Gang Zhang1, Yuan Cheng1, Jyh-Pin Chou2,3,*, Adam Gali4,5,* 1 Institute of High Performance Computing, A*STAR, 1 Fusionopolis Way, Singapore 138632, Singapore. 2 Department of Physics, National Changhua University of Education, Changhua 50007, Taiwan. 3 Department of Mechanical Engineering, City University of Hong Kong, 83 Tat Chee Avenue, Hong Kong SAR 999077, China. 4 Institute for Solid State Physics and Optics, Wigner Research Centre for Physics, P.O. Box 49, H-1525 Budapest, Hungary. 5 Department of Atomic Physics, Budapest University of Technology and Economics, Budafoki út 8, H- 1111 Budapest, Hungary. Author to whom correspondence should be addressed: [email protected] (Jyh-Pin Chou) and [email protected] (Adam Gali) Abstract Quantum technology has grown out of quantum information theory and now provides a valuable tool that researchers from numerous fields can add to their toolbox of research methods. To date, various systems have been exploited to promote the application of quantum information processing. The systems that can be used for quantum technology include superconducting circuits, ultra-cold atoms, trapped ions, semiconductor quantum dots, and solid-state spins and emitters. In this review, we will discuss the state of the art on material platforms for spin-based quantum technology, with a focus on the progress in solid- state spins and emitters in several leading host materials, including diamond, silicon carbide, boron nitride, silicon, two-dimensional semiconductors, and other materials. We will highlight how first- principles calculations can serve as an exceptionally robust tool for finding the novel defect qubits and single photon emitters in solids, through detailed predictions of the electronic, magnetic and optical properties.
    [Show full text]
  • PDF, 4MB Herunterladen
    Status of quantum computer development Entwicklungsstand Quantencomputer Document history Version Date Editor Description 1.0 May 2018 Document status after main phase of project 1.1 July 2019 First update containing both new material and improved readability, details summarized in chapters 1.6 and 2.11 1.2 June 2020 Second update containing new algorithmic developments, details summarized in chapters 1.6.2 and 2.12 Federal Office for Information Security Post Box 20 03 63 D-53133 Bonn Phone: +49 22899 9582-0 E-Mail: [email protected] Internet: https://www.bsi.bund.de © Federal Office for Information Security 2020 Introduction Introduction This study discusses the current (Fall 2017, update early 2019, second update early 2020 ) state of affairs in the physical implementation of quantum computing as well as algorithms to be run on them, focused on applications in cryptanalysis. It is supposed to be an orientation to scientists with a connection to one of the fields involved—mathematicians, computer scientists. These will find the treatment of their own field slightly superficial but benefit from the discussion in the other sections. The executive summary as well as the introduction and conclusions to each chapter provide actionable information to decision makers. The text is separated into multiple parts that are related (but not identical) to previous work packages of this project. Authors Frank K. Wilhelm, Saarland University Rainer Steinwandt, Florida Atlantic University, USA Brandon Langenberg, Florida Atlantic University, USA Per J. Liebermann, Saarland University Anette Messinger, Saarland University Peter K. Schuhmacher, Saarland University Aditi Misra-Spieldenner, Saarland University Copyright The study including all its parts are copyrighted by the BSI–Federal Office for Information Security.
    [Show full text]
  • Time Evolution of Quantum Computer Michimasa Sugimura
    MASTER THESIS Time Evolution of Quantum Computer Michimasa Sugimura Department of Physics, Graduate College of Science and Engineering, Aoyama Gakuin University Supervisor: Naomichi Hatano 2001 論 文 要 旨 （和 文） 提 出 年 度 ： 2001 年度 提 出 日 ： 2 月 15 日 専 攻 ： 物理学専攻 学 生 番 号 ： 35100011 学 生 氏 名 ： 杉村 充理 研究指導教員： 羽田野 直道 （論文題目） 算機の時間発展シミュレーションڐ量子 （内容の要旨） 算機は、１９８５年に Deutsch によって明確に定式化された、量子ڐ量子 算機の概念である。古典力学に従う従来のڐ力学の原理に基づく全く新しい 算要ڐ算機では、０または１のどちらかのみの状態をとるビットを基本のڐ 算機の０にあたるビットを２準位系ڐ算機では、古典ڐ素としている。量子 の基底状態、１にあたるものを第一励֬状態と対応させ、０と１の重ね合わ せ状態に拡張したビットを用いる。このビットは qubit と呼ばれている。ま 算にあたる操作を、ユニタリ－変換による量子状態ڐ算機ではそのڐた量子 の遷移として行う。このとき初期状態としてお互いに量子的な相関を持つ 算できるڐqubit を複数用意することによって、同時に重ね合わせ状態を並列 。算機の利点であるڐことが量子 算機の実現にあたっては、量子的な重ね合わせڐこの概念を利用した量子 状態を良ࡐに維持するために、環境系との相互作用によるデコヒ－レンス時 間がସいことが必要となる。この要求に対する新しい方法が１９９８年に Kane によって提案された。それはシリコン中にド－プした 31P の核スピンを qubit として用いることにより、qubit が環境系と相互作用することによる緩 和をේぐものである。この提案におけるゲート操作は NMR で行われている 方法と同様に外൉磁場によって誘֬されたゼ－マン分裂に、共鳴したݗ周波 磁場を照射することによって行う。 本研究では、Kane の提案した半導体量子コンピュータのゲート操作を数 値的に再現することをࠟみた。これを行う方法として、まず半導体デバイス 中にド－プされた 31P は水素་似原子であると仮定した。z ࡃ方向のৌ磁場中 における核-஢子系のスピンハミルトニアンに、ݗ周波磁場を時間に依存する 摂動として加え、エネルギー準位間の遷移確率を求めた。 ো山学院大学大学院理工学研究科 † † Academic Year of 2001, Submitted on February 22, 2002 Graduate College of Science and Engineering, Aoyama Gakuin University Master Thesis Time evolution of quantum computer Michimasa Sugimura (35100011) Supervisor : Naomichi Hatano Department of Physics Deutsch formulated in 1985 a new computer based on the quantum mechanics. In quantum computers, the ones and zeros of classical digital computers are replaced by the quantum state of a two-level system which is named qubit. Computation, i.e., a sequence of unitary transformations, simultaneously affects each element of the superposition, generating a massive parallel data processing, albeit within one piece of quantum hardware. Practical of quantum computer, requires preventing decoherence (uncontrolled interaction of a quantum system with its surrounding environment) in order to maintain the superposition.
    [Show full text]
  • China's Gifts to the West
    CHINA'S GIFTS TO THE WEST Prepared by Professor Derk Bodde for the Committee on Asiatic Studies in American Education Reprinted with permission in China: A Teaching Workbook, Asia for Educators, Columbia University Introduction An exercise identifying Chinese inventions that we use and enjoy in daily life provides an excellent starting point for discussing both the achievements of the Chinese civilization and China's influence on the West. The article China 's Gifts to the West describes China's inventions of silk, tea, porcelain ("china"), paper, printing, gunpowder, the mariner's compass, medicines, lacquer, games (including cards, dominoes, and kites), and miscellaneous items such as umbrellas, as well as natural resources, such as plants (including peaches, apricots, and citrus fruits) and minerals (including coal and zinc), first discovered and cultivated by the Chinese. Lesson Ideas: For homework, have the students look up several items on the above list in an encyclopedia to see if they can identify their origin. Then use the article China's Gift to the West to enrich the story of how each invention was brought to the West. A second approach might be to assign individual students one invention to read about in China's Gift to the West and report to the class. A separate chapter is devoted to each of the items/inventions in the list above. Foreward In 1940 almost 10,000 new books were printed in the United States. Millions of copies of the 13,000 newspapers in the country were distributed. All of this was possible because we know how to make paper and to print with movable type — inventions which occurred in China.
    [Show full text]
  • Printers' Test Notes – a Primer
    Printers’ Test Notes – A Primer Now that The Catalog of Test Notes has been split into two catalogs, one for ATM and related test notes and one for Printer related test notes, I have better means to offer a look at the test notes more familiar to bank note collectors. Printers’ test note are also called advertising, promotional, house, trial, demonstration, and color samples., ATM test notes are often colorful, but notes produced by firms involved in bank note production offer much more sophisticated specimens – showing off their latest security and durability innovations. The avid collector of high tech bank notes will find the most up-to-date notes, actually prototypes of future notes present in a test note collection. So here is a group of questions of which the answers give the collector a good start to a new collecting interest. What different types of firms produce test notes? As Sev Onyshkevych wrote in the IBNS forum, “The "printers" category also includes the entire food chain.” This means any firm contributing to a bank note being produced can also produce a test note. The types of firms which are attributed with test notes so far are: engravers, printers, paper and polymer producers, banknote designers, security ink providers, central banks, security foiling suppliers and substrate providers. Currency counters, sorters, verification machines, dispensers, and legitimate training notes providers also make test notes which make up the inventory in The Catalog of ATM Test Notes. Which firm has produced the most different test notes in the printers catalog? There are four firms with 60 or more different test notes, not including their sub varieties.
    [Show full text]
  • Realistic Read-Out and Control for Si:P Based Quantum Computers
    Realistic read-out and control for Si:P based quantum computers by Matthew James Testolin BSc(Hons) Submitted in total fulfilment of the requirements for the degree of Doctor of Philosophy School of Physics The University of Melbourne Australia August, 2008 Abstract This thesis identifies problems with the current operation proposals for Si:P based solid-state quantum computing architectures and outlines realistic alter- natives as an effective fix. The focus is qubit read-out and robust two-qubit control of the exchange interaction in the presence of both systematic and environmental errors. We develop a theoretical model of the doubly occupied D− read-out state found in Si:P based nuclear spin architectures. We test our theory by using it to determine the binding energy of the D− state, comparing to known re- sults. Our model can be used in detailed calculations of the adiabatic read-out protocol proposed for these devices. Regarding this protocol, preliminary cal- culations suggest the small binding energy of the doubly occupied read-out state will result in a state dwell-time less than that required for measurement using a single electron transistor (SET). We propose and analyse an alterna- tive approach to single-spin read-out using optically induced spin to charge transduction, showing that the top gate biases required for qubit selection are significantly less than those demanded by the adiabatic scheme, thereby in- + creasing the D D− lifetime. Implications for singlet-triplet discrimination for electron spin qubits are also discussed. On the topic of robust two-qubit control, we demonstrate how by using two-qubit composite rotations a high fidelity controlled-NOT (CNOT) gate can be constructed, even when the strength of the interaction between qubits is not accurately known.
    [Show full text]
  • Atomistic Modeling of Nano Devices: from Qubits to Transistors
    Network for Computational Nanotechnology (NCN) Atomistic Modeling of Nano Devices: From Qubits to Transistors Rajib Rahman Purdue University The Future of Electronics? Optimization: Materials & Designs New Variables: Spins ITRS New Paradigms: Quantum Logic Challenge for device modeling? New Material, Design Spintronic Devices Quantum Bits 2D Material MTJ Quantum dot Tunnel FET Spin transistor NV center Unified approach for modeling? Enter “Atoms”! Atomistic Modeling Approach Group IV & III-Vs 2D TMDs Magnetic Materials Silicon Interactions in Atomic Basis: Spin-orbit, E-field, B-field, strain Conduction electrons Donors/Acceptors Valence holes 4 Impact on Experiments Less electrons Atomistic simulations were successful to match experimental results The Future of Electronics? Optimization: Materials & Designs New Variables: Spins . Historical Perspective New Paradigms: . Exchange Interaction Quantum Logic . Spin-orbit Quantum Computing 1982: Feynman proposed a model for quantum computing. 1 Qubit: Superposition 2 Qubit: Entanglement Quantum Annealing in AQC: arXiv 1512:02206 For N qubit, all 2N states are used in parallel. 30 qubit more powerful than a supercomputer. QC: Promises massive speedup for difficult problems! History: Semiconductor Quantum Computing 1998: Loss, Divincenzo proposal - QDs 1998: Kane proposal – donors in Si Two promising proposals for semiconductor qubits! Kane’s Quantum Computer Wavefunction control (ON/OFF) Two Qubit Single Qubit Utilize Si:P for quantum computing! Wavefunction control. History: Semiconductor Quantum Computing 1998: Loss, Divincenzo proposal – QDs 1998: Kane proposal – donors in Si 2008: Single donor states observed 2005: First QD qubit in GaAs. in transport. 2012: First QD qubit in Si. Single donors probed in experiments! 2008-2012: Addressing single donors with transport Deterministic dopant location Random dopant locations Control of donor wavefunction by fields! History: Semiconductor Quantum Computing 1998: Loss, Divincenzo proposal – QDs 1998: Kane proposal – donors in Si 2005: First QD qubit in GaAs.
    [Show full text]
  • A Non-Adiabatic Controlled Not Gate for the Kane Solid State Quantum
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE A Non-Adiabatic Controlled Not Gate for the Kane Solid provided by CERN Document Server State Quantum Computer C. Wellard†, L.C.L. Hollenberg†∗ and H.C.Pauli∗. † School of Physics, University of Melbourne, 3010, AUSTRALIA. ∗ Max-Planck-Institut f¨ur Kernphysik, Heidelberg D69029, GERMANY. The method of iterated resolvents is used to obtain an effective Hamiltonian for neighbouring qubits in the Kane solid state quantum computer. In contrast to the adiabatic gate processes inherent in the Kane proposal we show that free evolution of the qubit-qubit system, as generated by this effective Hamiltonian, combined with single qubit operations, is sufficient to produce a controlled-NOT (c-NOT) gate. Thus the usual set of universal gates can be obtained on the Kane quantum computer without the need for adiabatic switching of the controllable parameters as prescribed by Kane [1]. Both the fidelity and gate time of this non-adiabatic c-NOT gate are determined by numerical simulation. 1 I. INTRODUCTION 1 31 In the Kane proposal for a solid state quantum computer a series of spin 2 P nuclei in a silicon substrate are used as qubits [1]. The interaction between these qubits is mediated by valence electrons weakly bound to the nuclei, such that at energies much lower than these electrons binding energy the system Hamiltonian is given by H = µ B(σz + σz ) g µ B(σz + σz ) B 1e 2e − n n 1n 2n + A1~σ1e:~σ1n + A2~σ2e:~σ2n + J~σ1e:~σ2e: (1) The interaction strengths A1 , A2 as well as J are controllable by means of voltage biases applied to “A” and “J” gates respectively [1,2].
    [Show full text]
  • Toronto Coin Expo Spring Sale May 3Rd & 4Th, 2018
    G eoffrey B ell A u c t i o n s Toronto Coin Expo Spring Sale May 3rd & 4th, 2018 Proofs & Specimens Two types of notes that are often confusing to collectors, even seasoned ones, are proof and specimen issues. A proof note is fairly easy to identify, but many are unsure of the reason for their existence. Such banknotes are usually printed on thin India paper, often backed with card stock. They can also be printed right on the card. They will commonly lack any serial number and may sometimes have “specimen” on them. In addition to these characteristics, they are easily spotted because they are usually only printed on one side. A proof note was used to sample or test the printing plates before they were put into use. Specimen banknotes, often confused with proofs, were used to familiarize bank employees, among others, with new notes. They are normally printed, front and back, with the same banknote paper that will be used for circulated notes, making them very similar to regular issues. The word “specimen” will usually appear stamped somewhere on the note, such as the on signature line, or sheet numbering area, or they may be punch cancelled. They will lack manuscript signatures and serial numbers will commonly, but not always, be all zeroes. We have a large offering for your consideration. Brian G eoffrey B ell A u c t i o n s The Bram & Bluma Appel Salon, Toronto Reference Library, Toronto, Ontario Lot viewing will take place May 3rd & 4th, 9:30am – 4:30pm EDT We are proud and excited to conduct our auction in conjunction with the 2018 Spring Toronto Coin Expo.
    [Show full text]