DOCSLIB.ORG

Quantum Information Engineering: Concepts to Quantum Technologies

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Quantum Information Engineering: Concepts to Quantum Technologies Quantum Information Engineering: Concepts to Quantum Technologies. Simon John Devitt, B.Sc (Honours) Melbourne. Submitted in partial fulfilment of the requirements of the degree of Doctor of Philosophy. November, 2007. Center For Quantum Computing Technology. School of Physics, University of Melbourne. Victoria, Australia. Acid Free Paper. ii Quantum Mechanics: It’s all fun and games until somebody loses an i. iii The University of Melbourne. ABSTRACT Quantum Information Engineering: Concepts to Quantum Technologies. by Simon John Devitt. Academic Supervisor: Lloyd C. L. Hollenberg. This thesis investigates several broad areas related to the effective implementation of quantum information processing, from large scale quantum algorithms and error correction, through to system identification and characterization techniques, efficient designs for quantum computing architectures and the design of small devices which utilize quantum effects. The discussion begins with the introduction of a quantum circuit appropri- ate for implementing Shor’s factoring algorithm on Linear Nearest Neighbor qubit arrays such as the Kane phosphorus in silicon system. Detailed numerical sim- ulations are then presented, demonstrating the sensitivity of the circuit under coherent quantum errors. The concepts of Quantum Error Correction and Fault-tolerant computation are reviewed with original work carried out to show the relative robustness and practicality of Fault-tolerant computation for logical state preparation. Methods of intrinsic system identification and characterization are proposed. Protocols for characterizing both the confinement of a multi-level system to the qubit subspace and the Hamiltonian dynamics governing two-qubit interactions are presented as well as a brief review of characterization techniques already developed for single qubit dynamics. A quantum bus protocol is introduced which can be applied to several sys- tems, allowing for a highly distributed architecture which is invulnerable to in- formation loss through the transport bus. Several preliminary architecture de- signs are presented, including solid state and atom/cavity quantum processors. A more detailed, distributed system in ion traps utilizing this protocol is introduced which demonstrates both large scale quantum computation and a smaller proof of principle experiment which will be possible in the near future. Finally, I present a design for a small scale quantum device which can be used to deterministically prepare a large class of highly entangled quantum states using photonic qubits. This device, which is dubbed the “photnic module”, would be extremely versatile with a variety of uses, from communication to computation. iv Declaration This is to certify that: (i) the thesis comprises only my original work towards the PhD except where indicated, (ii) due acknowledgement has been made in the text to all other material used, (iii) the thesis is less than 100,000 words in length, exclusive of table, maps, bibliographies, appendices and footnotes. Simon John Devitt, July 2007. v vi Publications During the course of this project, a number of refereed journal and conference articles have been published based on the work presented in this thesis. They are listed here for reference. Journal Articles A.G. Fowler, S.J. Devitt and L.C.L. Hollenberg, Implementation of • Shor’s Algorithm on a Linear Nearest Neighbour Qubit Array, Quant. Inf. Comp. 4, 237-251 (2004). S.J. Devitt, A.G. Fowler and L.C.L. Hollenberg, Robustness of Shor’s • algorithm, Quant. Inf. Comp. 6, 616-629 (2006). A.D. Greentree, S.J. Devitt and L.C.L. Hollenberg, Quantum infor- • mation transport to multiple receivers, Phys. Rev. A. 73, 032319 (2006). S.J. Devitt, J.H. Cole and L.C.L. Hollenberg, Scheme for direct mea- • surement of a general two-qubit Hamiltonian, Phys. Rev. A 73, 052317 (2006). D.K.L. Oi, S.J. Devitt and L.C.L. Hollenberg, Scalable Error Cor- • rection in Distributed Ion Trap Computers, Phys. Rev. A. 74, 052313 (2006). J.H. Cole, S.J. Devitt and L.C.L. Hollenberg, Precision character- • isation of two-qubit Hamiltonians via entanglement mapping, J. Phys. A: Math.Gen, 39 (2006), 14649-14658. S.J. Devitt, A.D.Greentree and L.C.L. Hollenberg, Information free • quantum bus for generating stabilized states, Quant. Inf. Proc. 6, 229 (2007). S.J. Devitt, S.G. Schirmer, D.K.L. Oi, J.H. Cole and L.C.L. Hol- • lenberg, Subspace Confinement: How good is your qubit? New J. Phys. 9 (2007) 384. vii S.J. Devitt, A.D. Greentree, R. Ionicioiu, J.L. O’Brien, W.J. • Munro and L.C.L. Hollenberg, The Photonic Module: and on-demand source for photonic entanglement. Phys. Rev. A. 76, 052312 (2007). Conference Articles S.J. Devitt, A.G. Fowler and L.C.L. Hollenberg, Investigating the • practical implementation of Shor’s algorithm, Proc. SPIE 5650, 483 (2005). A.G. Fowler, S.J. Devitt and L.C.L. Hollenberg, Constructing Steane • code fault-tolerant gates, Proc. SPIE 5650, 557 (2005). S.J. Devitt, A.G. Fowler and L.C.L. Hollenberg, Practicality of Fault- • Tolerant Quantum Computation, Proc. Australian Institute of Physics 16th National Congress (2005). L.C.L. Hollenberg, A.D. Greentree, C.J. Wellard, A.G. Fowler, • S.J. Devitt and J.H. Cole, Qubit Transport and Fault-tolerant Architec- tures in Silicon, Proc. 2006 International Conference On Nanoscience and Nanotechnology. (2006). S.J. Devitt, S.G. Schirmer, D.K.L. Oi, J.H. Cole and L.C.L. Hol- • lenberg, Subspace confinement of qubit systems, Proc. Australian Institute of Physics 17th National Congress (2006). A.D. Greentree, S.J. Devitt and L.C.L. Hollenberg, Adiabatic proto- • cols for operator measurement based entanglement and quantum computing, Proc. Australian Institute of Physics 17th National Congress (2006). L. C. L. Hollenberg, A. D. Greentree, C. J. Wellard, A. G. Fowler, • S. J. Devitt, J. H. Cole, and A. Stephens, Qubit Transport and fault- tolerant architectures for Si:P quantum computing, Proc. Australian Insti- tute of Physics 17th National Congress (2006). Un-refereed Articles A.M. Stephens, S.J.Devitt, A.G. Fowler, J.C. Ang, L.C.L. Hollen- • berg, Gate-Level Simulation of logical state preparation, quant-ph/0608112, (2006). viii Patents S.J. Devitt, Implementation of Shor’s Algorithm on a Linear Nearest • Neighbour Qubit Array, Australian Provisional Patent, QUCOR Pty. Ltd. Sydney. Patent number:2004900951. ix x Acknowledgements This thesis would never have left the ground if it were not for a number of peo- ple. First I would like to thank my supervisor, Lloyd Hollenberg for exceptional support and guidance and giving me the freedom to pursue aspects of quantum computing which I found interesting and compelling. Secondly to Jared Cole, Andrew Greentree and Austin Fowler, three people whom I have collaborated closely with over the last three years and who have not only brought out the best in my own research, but who have always been up for a few drinks wherever we have been in the world. During my Ph.D I have visited several institutions, including an extended 12 month visiting student-ship in 2006 to Cambridge which was generously funded by the Rae & Edith Bennett Foundation. I wish to acknowledge the tremendous help and entertainment provided by Sonia Schirmer and Daniel Oi of Cambridge University who have been close collaborators and graciously hosted me during my brief visit in 2005 and my extended student-ship in 2006, along with the extraordinary administrative skill of Kaija Hampson who helped me settle into a new environment. Thanks also go to Frank Wilhelm and Jan von Delft at LMU in M¨unchen for hosting me for a month in 2005. Personally I wish to thank the great people at the School of Physics, both the 1st and 2nd generation of inhabitance of room 408 and 412, the guys and girls on the 6th floor, Sean Crosby for continued access to my favorite tool of procrastination, the DMP group at large and scores of others who made my time extremely enjoyable. Finally I wish to acknowledge the support from both my family and non- physics friends (In Australia, the U.K. and Hungary). Their continued tolerance with my moods and tendency to disappear for weeks at a time gave me a much needed break from the world of physics. xi xii Contents 1 Introduction 1 2 Background 5 2.1 Emergence of the Quantum from the Classical. 5 2.2 Quantum Information Processing: Computational Models..... 8 2.2.1 The Quantum Circuit Model. 8 2.2.2 ClusterStateModel . 12 2.3 Conclusion............................... 18 3 Shor’s Factoring Algorithm 19 3.1 Introduction.............................. 20 3.1.1 FromFactoringtoPeriodFinding. 21 3.1.2 The Quantum Period Finding subroutine . 22 3.1.3 Classicalpost-processing . 24 3.2 Linear Nearest Neighbor quantum circuit. 27 3.2.1 Decomposing the QPF subroutine . 28 3.2.2 Conclusion........................... 40 3.3 Stability of Shor’s Algorithm under errors . .. 42 3.3.1 Errormodelsandanalysis . 44 3.3.2 Stability under a fixed number of errors . 47 3.3.3 Conclusion........................... 55 4 Quantum Error Correction and Fault-tolerance. 57 4.1 Introduction.............................. 59 4.2 QuantumErrorCorrection . 61 4.2.1 The3-qubitcode ....................... 62 xiii CONTENTS 4.2.2 StabilizerFormalism . 64 4.2.3 QECwithstabilizercodes . 66 4.3 DigitizationofQuantumErrors . 72 4.3.1 Systematicgateerrors . 72 4.3.2 Environmental decoherence . 73 4.4 Fault-tolerant Quantum Error Correction and the threshold theorem. 76 4.4.1 Fault-tolerance . .. .. 76 4.4.2 ThresholdTheorem. 77 4.5 Fault-tolerant operations on encoded data . .. 80 4.5.1 SingleQubitOperations . 80 4.5.2 Two-qubitgate......................... 82 4.6 Fault-tolerant circuit design for logical state preparation ..... 86 4.7 Simulations ofLogical StatePreparation . .. 90 4.7.1 LNN circuit for logical encoding . 90 4.7.2 Results............................. 93 4.7.3 Conclusions .......................... 94 5 Intrinsic Characterization of qubit systems 97 5.1 Introduction.............................
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]
  • Bilateral Workshop on Nanomagnetism and Spintronics
    Bilateral Workshop on Nanostructured Materials for Magnetic and Spintronic Devices Embassy of Italy Canberra 31st October – 1st November 2012 Office of the Scientific Attaché Embassy of Italy CANBERRA Organising Committee: Sean Cadogan (University of New South Wales, Canberra); Stephen Collocott (Materials Science and Engineering, CSIRO, Sydney); Dino Fiorani (ISM, Consiglio Nazionale delle Ricerche, Roma, and President of the Italian Association of Magnetism); Michael Kostylev (University of Western Australia); Garry McIntyre (Australian Nuclear Science and Technology Organisation, Sydney); Oscar Moze (Embassy of Italy, Canberra); Annemieke Mulders (University of New South Wales, Canberra); Alessandro Soncini (University of Melbourne); Glen Stewart (University of New South Wales, Canberra); Kiyonori Suzuki (Monash University) The workshop’s web site can be found at: http://www.ansto.gov.au/research/bragg_institute/current_research/conferences_and_workshop 2 SPONSORS Ministero degli Affari Esteri Associazione Italiana di Magnetismo Consiglio Nazionale delle Ricerche Australian Nuclear Science and Technology Organization Commonwealth Scientific and Industrial Research Organization Australian Nanotechnology Network Department of Industry, Innovation, Science, Research and tertiary Education Australian Institute of Nuclear Science and Engineering University of New South Wales, Canberra 3 PARTICIPANTS Participant Affiliation Email AUSTRALIA 1. Barnsley, Lester School of Biomolecular and Physical Sciences, Griffith University [email protected] 2. Boskovic, Colette School of Chemistry, University of Melbourne [email protected] 3. Cadogan, Sean School of Physical, Environmental and Mathematical Sciences, [email protected] UNSW, Canberra 4. Campbell, Stewart School of Physical, Environmental and Mathematical Sciences, [email protected] UNSW, Canberra 5. Cole, Jared School of Applied Sciences, Royal Melbourne Institute of Technology [email protected] University 6.
    [Show full text]
  • — 2018 School of Science
    — 2018 School of science HDR Research Projects Applied Physics DR230/ MR230 Contents Click on the project links for more information Professor Toby Allen • Computational Biophysics and Pharmacology of Ion Channels • Computational Molecular Neuroscience and Understanding General Anaesthetics • Computational Biophysics of Membranes, Ion Pumps and Cholesterol Professor Gary Bryant • Rapid measurement of the effects of antimicrobial drug candidates on bacterial motility • Effects of vitrification (glass formation) on biological membranes Professor Andrew Greentree • Information-based approaches to imaging • Laser Threshold Magnetometry • Waveguide Adiabatic Passage for Quantum Gates and Boson Sampling Professor James Macnae • Characterising the shallow sub-surface with a hybrid Ground Penetrating Radar and Electromagnetic system • PRBS waveforms from multi-transmitters for geophysical borehole exploration Associate Professor Jared Cole • Exciton transport and open-quantum systems theory • The quantum mechanics of superconducting electronics • Dissipationless charge transport in topological insulators and two- dimensional materials Professor Peter Daivis • Phase-field modelling of cryoprotectant performance • Modelling shear banding and stick-slip behavior in complex lubricant systems • Thermodynamics of shearing viscoelastic materials Professor Yonggang Zhu • AlveoliChip Associate Professor Brant Gibson • Next generation endoscopic imaging probes using new computational microscopy techniques • Mobile phone microscopy using integrated and
    [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]
  • From Geometric Phases to Intracellular Sensing: New Applications of the Diamond Nitrogen-Vacancy Centre
    School of Physics The University of Melbourne FROM GEOMETRIC PHASES TO INTRACELLULAR SENSING: NEW APPLICATIONS OF THE DIAMOND NITROGEN-VACANCY CENTRE Dougal Maclaurin Submitted in total fulfilment of the requirements of the degree of Master of Philosophy August, 2010 Produced on archival quality paper ii Abstract This thesis consists of two parts, each of which proposes a new application of the diamond nitrogen-vacancy (NV) centre. We first consider the NV centre as a device to detect geometric phases. We show that the Aharonov-Casher phase and Berry’s phase may be produced in the NV centre’s spin sublevels and observed using existing experimental techniques. We give the background theory to geometric phases, then show how these phases apply to the NV system. Finally, we outline a number of realistic experiments to detect these phases. The second part considers the behaviour of an NV centre within a diamond nanocrys- tal which rotates, in a Brownian sense, in a fluid. Our aim is to understand the effect of rotational motion on the initialisation, evolution and readout of an NV centre, moti- vated by the idea of using colloidal nanodiamonds for biological imaging. We first develop a model to describe the quantum evolution of a rotationally diffusing nanocrystal. The model uses theory developed in NV magnetometry and also the geometric phase theory developed in the first part of this thesis. We then explore the consequences of this model for nanoscale sensing. We show that the tumbling NV system may be used as a sensitive magnetometer with nanoscale resolution and also as a probe of its own rotational motion.
    [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]
  • 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.
    [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]
  • Benchmarking ZX-Calculus Circuit Optimization Against Qiskit
    Association for Computing Machinery Student Research Competition, Finalist Round Lia Yeh Benchmarking ZX-Calculus Circuit Optimization Against Qiskit Transpilation Lia Yeh{y, Emma (Maitreyee) Dasgupta+y, Erick Winstony {University of California, Santa Barbara; +The University of Chicago; yIBM Q Abstract Quantum hardware and algorithms researchers alike have expressed the critical need for and short- age of expertise in quantum programming languages, compilation, and computer architecture. We design, implement, and benchmark quantum compilation and visualization in PyZX 1, a Python tool for the ZX-calculus, applied to Qiskit 2, the most widely-used quantum programming language. We demonstrate correct circuit optimization by our Qiskit transpiler pass on 1000 two qubit Randomized Benchmarking circuits, reducing gate count of 29% of the circuits further than Qiskit’s default transpiler. Section I: Problem and Motivation Quantum computers can efficiently simulate quantum systems, phenomena impossible to efficiently simu- late using classical computers 3. The computational capabilities of experimentally realized quantum com- puters, across many quantum hardware platforms, has scaled at an exponential rate in recent years. Fol- lowing quantum supremacy 4 (the demonstration and confirmation of correctness of a quantum algorithm execution vastly outperforming the best-known runnable classical algorithm), quantum computing’s next challenge is to run useful quantum algorithms on near-term quantum devices, as in Figure 1. The vast applications for realizable quantum computation include material science, quantum chemistry, quantum gravity, machine learning, cryptography, drug discovery, optimization, and quantum sensing 5. Figure 1: Reprinted from 6. What would the organization of quantum toolflows look like? As a technology decades from its full theorized potential, the challenge of full-stack quantum computation is in inventing layers upon layers of abstraction bridging quantum algorithms and scalable quantum hardware.
    [Show full text]