DOCSLIB.ORG

Deterministic Quantum Teleportation of Atomic Qubits

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Deterministic Quantum Teleportation of Atomic Qubits letters to nature 7. Wootters, W. K. & Zurek, W. H. A single quantum cannot be cloned. Nature 299, 802–803 (1982). surprising as precise specification of a general qubit state requires an 8. Nielsen, M. A. & Chuang, I. J. Quantum Computation and Quantum Information (Cambridge Univ. infinite amount of classical information. Aside from the obvious Press, Cambridge, 2000). 9. Gottesman, D. & Chuang, I. L. Demonstrating the viability of universal quantum computation using differences in the various experimental demonstrations, the basic teleportation and single-qubit operations. Nature 402, 390–393 (1999). teleportation protocol is the same1. Alice is in possession of a qubit 10. Furusawa, A. et al. Unconditional quantum teleportation. Science 282, 706–709 (1998). (here labelled 2) that is in an unknown state jwl2 ; aj"l2 þ bj#l2; 11. Nielsen, M. A., Knill, E. & Laflamme, R. Complete quantum teleportation using nuclear magnetic j#l j"l resonance. Nature 396, 52–55 (1998). where and denote eigenstates of the qubit in the measure- 12. Barrett, M. D. et al. Quantum teleportation with atomic qubits. Nature (this issue). ment basis. In addition, Alice and Bob each possess one qubit of a 13. Schmidt-Kaler, F. et al. How to realize a universal quantum gate with trapped ions. Appl. Phys. B 77, two-qubit entangled pair that we take to be a singlet jSl1;3 ; j"l1j#l3 789–796 (2003). 2j#l j"l (where, for simplicity, we omit normalization factors). 14. Roos, C. F. et al. Bell states of atoms with ultra long lifetimes and their tomographic state analysis. 1 3 Phys. Rev. Lett. (in the press) Preprint at khttp://arXiv.org/abs/ physics/0307210l (2003). Therefore, Alice possesses qubits 1 and 2, while Bob holds qubit 3. 15. Massar, S. & Popescu, S. Optimal extraction of information from finite quantum ensembles. Phys. Rev. Alice wishes to transmit the state of qubit 2 to Bob’s qubit using only Lett. 74, 1259–1263 (1995). classical communication. The initial joint state of all three qubits is 16. Gisin, N. Nonlocality criteria for quantum teleportation. Phys. Lett. A 210, 157–159 (1996). 17. Kielpinski, D., Monroe, C. & Wineland, D. J. Architecture for a large-scale ion-trap quantum ^ computer. Nature 417, 709–711 (2002). jFl ¼jSl1;3 jwl2: ð1Þ 18. Gulde, S. et al. Implementation of the Deutsch-Jozsa algorithm on an ion-trap quantum computer. Nature 412, 48–50 (2003). 19. Hahn, E. L. Spin Echoes. Phys. Rev. 80, 580–594 (1950). This state can be rewritten using an orthonormal basis of Bell states14 jWkl1;2ðk ¼ 1–4Þ for the first two qubits and unitary transformations Acknowledgements We thank H. Briegel and P.Zoller for a critical reading of the manuscript. We U k acting on jwl3ð¼ aj"l3 þ bj#l3Þ so that jFl ¼ gratefully acknowledge support by the Austrian Science Fund (FWF), by the European 4 Commission (QUEST, QUBITS and QGATES networks), by the Institut fu¨r Sk¼1jWkl1;2ðUkjwl3Þ: A measurement in the Bell-state basis {jWkl} Quanteninformation, and by the Los Alamos LDRD Program. This material is based upon work by Alice then leaves Bob with one of the four possibilities Ukjwl3: supported in part by the US Army Research Office. H.H is funded by the Marie-Curie program of Once Bob learns of Alice’s measurement outcome (through classical the European Union. communication), he can recover the original unknown state by 21 applying the appropriate unitary operator, Uk ; to his state Competing interests statement The authors declare that they have no competing financial j l interests. Uk w 3: We note that Alice’s Bell-state measurement can be accom- plished by transforming from the basis {jWkl1;2} into the measure- Correspondence and requests for materials should be addressed to R.B. ([email protected]) ment basis {j""l1;2; j"#l1;2; j#"l1;2; j##l1;2}beforethemeasurement. Our implementation uses atomic qubits (9Beþ ions) that are confined in a linear radiofrequency Paul trap similar to that used in ref. 15. The control electrodes are segmented into eight sections as shown schematically in Fig. 1, providing a total of six trapping zones .............................................................. (centred on electrode segments 2 to 7). Potentials applied to these electrodes can be varied in time to separate ions and move them to Deterministic quantum teleportation different locations. The qubits are composed of the ground-state of atomic qubits hyperfine levels j"l;jF ¼ 1;m ¼ 21l and j#l;jF ¼ 2;m ¼ 22l; whichareseparatedbyq0 ø 2p £ 1:25GHz: These states are coupled through stimulated Raman transitions16–18 from two laser M. D. Barrett1*, J. Chiaverini1, T. Schaetz1, J. Britton1, W. M. Itano1, J. D. Jost1, E. Knill2, C. Langer1, D. Leibfried1, R. Ozeri1 & D. J. Wineland1 1Time and Frequency Division, NIST, Boulder, Colorado 80305, USA 2Mathematical and Computational Sciences Division, NIST, Boulder, Colorado 80305, USA * Present address: Department of Physics, University of Otago, PO Box 56, Dunedin, New Zealand ............................................................................................................................................................................. Quantum teleportation1 provides a means to transport quantum information efficiently from one location to another, without the physical transfer of the associated quantum-information carrier. This is achieved by using the non-local correlations of previously distributed, entangled quantum bits (qubits). Teleportation is expected to play an integral role in quantum communication2 and quantum computation3. Previous experimental demon- strations have been implemented with optical systems that used both discrete and continuous variables4–9, and with liquid- state nuclear magnetic resonance10. Here we report uncondi- tional teleportation5 of massive particle qubits using atomic Figure 1 Schematic representation of the teleportation protocol. The ions are numbered (9Be1) ions confined in a segmented ion trap, which aids left to right, as indicated at the top, and retain their order throughout. Positions, relative individual qubit addressing. We achieve an average fidelity of to the electrodes, are shown at each step in the protocol. The widths of the electrodes 78 per cent, which exceeds the fidelity of any protocol that vary, with the width of the separation electrode (6) being the smallest at 100 mm. The does not use entanglement11. This demonstration is also import- spacing between ions in the same trap is about 3 mm, and laser-beam spot sizes (in ant because it incorporates most of the techniques necessary traps 5 and 6) at the position of the ions are approximately 30 mm. In step 1 we prepare for scalable quantum information processing in an ion-trap the outer ions in an entangled (singlet) state and the middle ion in an arbitrary state system12,13. (equation (1)). Steps 2–4 constitute a measurement in a Bell-basis for ions 1 and 2 (Alice’s Quantum teleportation1 provides a means for transporting a qubits), teleporting the state of ion 2 onto ion 3 (Bob’s qubit), up to unitary operations quantum state between two separated parties, Alice and Bob, that depend on the measurement outcomes. In step 5 we invoke these conditional through the transmission of a relatively small amount of classical operations, recovering the initial state. Interspersed are spin-echo pulses applied in trap 6 information. For the case of a two-state quantum system or ‘qubit’, that protect the state from de-phasing due to fluctuating magnetic fields but do not affect only two bits of classical information are needed, which seems the teleportation protocol. 737 NATURE | VOL 429 | 17 JUNE 2004 | www.nature.com/nature © 2004 Nature Publishing Group letters to nature beams, which are used to implement the single-qubit rotations state of ion 1 to j"l1; a subsequent simultaneous detection of ions 1 Rðv;fÞ¼cosðv=2ÞI þ isinðv=2ÞcosðfÞj þ isinðv=2ÞsinðfÞj ; ð2Þ and 2 effectively measures the state of ion 2 with error less than 1% x y due to the presence of ion 1. where I is the identity operator, j x, jy and j z denote the Pauli spin To complete the teleportation, we apply unitary operations to ion matrices in the {j"l; j#l} basis (k "j; ð1;0Þ; k #j; ð0;1Þ), v is 3 that depend on the measurement outcomes for ions 1 and 2. We proportional to the duration of the Raman pulse, and f is the first move ions 1 and 2 to trap 2 and ion 3 to trap 5, where unitary relative phase between the Raman beams at the position of the ion. operations consisting of a p/2-pulse, R(p/2,p/2), followed by The Raman beams are also used to generate entanglement between the operators j x, j y, I, j z for the measurement outcomes j""l1;2; 18 two qubits by implementing the phase gate j"#l1;2; j#"l1;2; j##l1;2 respectively, are applied. As noted above, the aj""l þ bj"#l þ cj#"l þ dj##l ! aj""l inclusion of the spin-echo pulses does not fundamentally change ð3Þ the teleportation protocol; however for fSE ¼ p=2; we must reorder 2 ibj"#l 2 icj#"l þ dj##l: the operations following the p/2-pulse, R(p/2,p/2), to I, j z, j x, j y respectively. A complete experiment is about 4 ms in duration, Our teleportation scheme is shown schematically in Fig. 1. We predominantly due to three elements: the cooling of all three axial highlight the key elements of the protocol in bold lettering and also modes to the ground state (1 ms), implementing the ion separations 15,18 include the auxiliary ‘spin-echo’ pulses (R(p,f SE)) applied to and movements (2 ms), and the three detection durations (0.6 ms). ions in trap 6.
Load more

Recommended publications
  • Quantum Computing Overview
    Quantum Computing at Microsoft Stephen Jordan • As of November 2018: 60 entries, 392 references • Major new primitives discovered only every few years. Simulation is a killer app for quantum computing with a solid theoretical foundation. Chemistry Materials Nuclear and Particle Physics Image: David Parker, U. Birmingham Image: CERN Many problems are out of reach even for exascale supercomputers but doable on quantum computers. Understanding biological Nitrogen fixation Intractable on classical supercomputers But a 200-qubit quantum computer will let us understand it Finding the ground state of Ferredoxin 퐹푒2푆2 Classical algorithm Quantum algorithm 2012 Quantum algorithm 2015 ! ~3000 ~1 INTRACTABLE YEARS DAY Research on quantum algorithms and software is essential! Quantum algorithm in high level language (Q#) Compiler Machine level instructions Microsoft Quantum Development Kit Quantum Visual Studio Local and cloud Extensive libraries, programming integration and quantum samples, and language debugging simulation documentation Developing quantum applications 1. Find quantum algorithm with quantum speedup 2. Confirm quantum speedup after implementing all oracles 3. Optimize code until runtime is short enough 4. Embed into specific hardware estimate runtime Simulating Quantum Field Theories: Classically Feynman diagrams Lattice methods Image: Encyclopedia of Physics Image: R. Babich et al. Break down at strong Good for binding energies. coupling or high precision Sign problem: real time dynamics, high fermion density. There’s room for exponential
    [Show full text]
  • Quantum Clustering Algorithms
    Quantum Clustering Algorithms Esma A¨ımeur [email protected] Gilles Brassard [email protected] S´ebastien Gambs [email protected] Universit´ede Montr´eal, D´epartement d’informatique et de recherche op´erationnelle C.P. 6128, Succursale Centre-Ville, Montr´eal (Qu´ebec), H3C 3J7 Canada Abstract Multidisciplinary by nature, Quantum Information By the term “quantization”, we refer to the Processing (QIP) is at the crossroads of computer process of using quantum mechanics in order science, mathematics, physics and engineering. It con- to improve a classical algorithm, usually by cerns the implications of quantum mechanics for infor- making it go faster. In this paper, we initiate mation processing purposes (Nielsen & Chuang, 2000). the idea of quantizing clustering algorithms Quantum information is very different from its classi- by using variations on a celebrated quantum cal counterpart: it cannot be measured reliably and it algorithm due to Grover. After having intro- is disturbed by observation, but it can exist in a super- duced this novel approach to unsupervised position of classical states. Classical and quantum learning, we illustrate it with a quantized information can be used together to realize wonders version of three standard algorithms: divisive that are out of reach of classical information processing clustering, k-medians and an algorithm for alone, such as being able to factorize efficiently large the construction of a neighbourhood graph. numbers, with dramatic cryptographic consequences We obtain a significant speedup compared to (Shor, 1997), search in a unstructured database with a the classical approach. quadratic speedup compared to the best possible clas- sical algorithms (Grover, 1997) and allow two people to communicate in perfect secrecy under the nose of an 1.
    [Show full text]
  • Unconditional Quantum Teleportation
    R ESEARCH A RTICLES our experiment achieves Fexp 5 0.58 6 0.02 for the field emerging from Bob’s station, thus Unconditional Quantum demonstrating the nonclassical character of this experimental implementation. Teleportation To describe the infinite-dimensional states of optical fields, it is convenient to introduce a A. Furusawa, J. L. Sørensen, S. L. Braunstein, C. A. Fuchs, pair (x, p) of continuous variables of the electric H. J. Kimble,* E. S. Polzik field, called the quadrature-phase amplitudes (QAs), that are analogous to the canonically Quantum teleportation of optical coherent states was demonstrated experi- conjugate variables of position and momentum mentally using squeezed-state entanglement. The quantum nature of the of a massive particle (15). In terms of this achieved teleportation was verified by the experimentally determined fidelity analogy, the entangled beams shared by Alice Fexp 5 0.58 6 0.02, which describes the match between input and output states. and Bob have nonlocal correlations similar to A fidelity greater than 0.5 is not possible for coherent states without the use those first described by Einstein et al.(16). The of entanglement. This is the first realization of unconditional quantum tele- requisite EPR state is efficiently generated via portation where every state entering the device is actually teleported. the nonlinear optical process of parametric down-conversion previously demonstrated in Quantum teleportation is the disembodied subsystems of infinite-dimensional systems (17). The resulting state corresponds to a transport of an unknown quantum state from where the above advantages can be put to use. squeezed two-mode optical field.
    [Show full text]
  • Quantum Algorithms
    An Introduction to Quantum Algorithms Emma Strubell COS498 { Chawathe Spring 2011 An Introduction to Quantum Algorithms Contents Contents 1 What are quantum algorithms? 3 1.1 Background . .3 1.2 Caveats . .4 2 Mathematical representation 5 2.1 Fundamental differences . .5 2.2 Hilbert spaces and Dirac notation . .6 2.3 The qubit . .9 2.4 Quantum registers . 11 2.5 Quantum logic gates . 12 2.6 Computational complexity . 19 3 Grover's Algorithm 20 3.1 Quantum search . 20 3.2 Grover's algorithm: How it works . 22 3.3 Grover's algorithm: Worked example . 24 4 Simon's Algorithm 28 4.1 Black-box period finding . 28 4.2 Simon's algorithm: How it works . 29 4.3 Simon's Algorithm: Worked example . 32 5 Conclusion 33 References 34 Page 2 of 35 An Introduction to Quantum Algorithms 1. What are quantum algorithms? 1 What are quantum algorithms? 1.1 Background The idea of a quantum computer was first proposed in 1981 by Nobel laureate Richard Feynman, who pointed out that accurately and efficiently simulating quantum mechanical systems would be impossible on a classical computer, but that a new kind of machine, a computer itself \built of quantum mechanical elements which obey quantum mechanical laws" [1], might one day perform efficient simulations of quantum systems. Classical computers are inherently unable to simulate such a system using sub-exponential time and space complexity due to the exponential growth of the amount of data required to completely represent a quantum system. Quantum computers, on the other hand, exploit the unique, non-classical properties of the quantum systems from which they are built, allowing them to process exponentially large quantities of information in only polynomial time.
    [Show full text]
  • Quantum Error Modelling and Correction in Long Distance Teleportation Using Singlet States by Joe Aung
    Quantum Error Modelling and Correction in Long Distance Teleportation using Singlet States by Joe Aung Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Master of Science in Electrical Engineering and Computer Science at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY May 2002 @ Massachusetts Institute of Technology 2002. All rights reserved. Author ................... " Department of Electrical Engineering and Computer Science May 21, 2002 72-1 14 Certified by.................. .V. ..... ..'P . .. ........ Jeffrey H. Shapiro Ju us . tn Professor of Electrical Engineering Director, Research Laboratory for Electronics Thesis Supervisor Accepted by................I................... ................... Arthur C. Smith Chairman, Department Committee on Graduate Students BARKER MASSACHUSE1TS INSTITUTE OF TECHNOLOGY JUL 3 1 2002 LIBRARIES 2 Quantum Error Modelling and Correction in Long Distance Teleportation using Singlet States by Joe Aung Submitted to the Department of Electrical Engineering and Computer Science on May 21, 2002, in partial fulfillment of the requirements for the degree of Master of Science in Electrical Engineering and Computer Science Abstract Under a multidisciplinary university research initiative (MURI) program, researchers at the Massachusetts Institute of Technology (MIT) and Northwestern University (NU) are devel- oping a long-distance, high-fidelity quantum teleportation system. This system uses a novel ultrabright source of entangled photon pairs and trapped-atom quantum memories. This thesis will investigate the potential teleportation errors involved in the MIT/NU system. A single-photon, Bell-diagonal error model is developed that allows us to restrict possible errors to just four distinct events. The effects of these errors on teleportation, as well as their probabilities of occurrence, are determined.
    [Show full text]
  • Bidirectional Quantum Controlled Teleportation by Using Five-Qubit Entangled State As a Quantum Channel
    Bidirectional Quantum Controlled Teleportation by Using Five-qubit Entangled State as a Quantum Channel Moein Sarvaghad-Moghaddam1,*, Ahmed Farouk2, Hussein Abulkasim3 to each other simultaneously. Unfortunately, the proposed Abstract— In this paper, a novel protocol is proposed for protocol required additional quantum and classical resources so implementing BQCT by using five-qubit entangled states as a that the users required two-qubit measurements and applying quantum channel which in the same time, the communicated users global unitary operations. There are many approaches and can teleport each one-qubit state to each other under permission prototypes for the exploitation of quantum principles to secure of controller. The proposed protocol depends on the Controlled- the communication between two parties and multi-parties [18, NOT operation, proper single-qubit unitary operations and single- 19, 20, 21, 22]. While these approaches used different qubit measurement in the Z-basis and X-basis. The results showed that the protocol is more efficient from the perspective such as techniques for achieving a private communication among lower shared qubits and, single qubit measurements compared to authorized users, but most of them depend on the generation of the previous work. Furthermore, the probability of obtaining secret random keys [23, 2]. In this paper, a novel protocol is Charlie’s qubit by eavesdropper is reduced, and supervisor can proposed for implementing BQCT by using five-qubit control one of the users or every two users. Also, we present a new entanglement state as a quantum channel. In this protocol, users method for transmitting n and m-qubits entangled states between may transmit an unknown one-qubit quantum state to each other Alice and Bob using proposed protocol.
    [Show full text]
  • SECURING CLOUDS – the QUANTUM WAY 1 Introduction
    SECURING CLOUDS – THE QUANTUM WAY Marmik Pandya Department of Information Assurance Northeastern University Boston, USA 1 Introduction Quantum mechanics is the study of the small particles that make up the universe – for instance, atoms et al. At such a microscopic level, the laws of classical mechanics fail to explain most of the observed phenomenon. At such a state quantum properties exhibited by particles is quite noticeable. Before we move forward a basic question arises that, what are quantum properties? To answer this question, we'll look at the basis of quantum mechanics – The Heisenberg's Uncertainty Principle. The uncertainty principle states that the more precisely the position is determined, the less precisely the momentum is known in this instant, and vice versa. For instance, if you measure the position of an electron revolving around the nucleus an atom, you cannot accurately measure its velocity. If you measure the electron's velocity, you cannot accurately determine its position. Equation for Heisenberg's uncertainty principle: Where σx standard deviation of position, σx the standard deviation of momentum and ħ is the reduced Planck constant, h / 2π. In a practical scenario, this principle is applied to photons. Photons – the smallest measure of light, can exist in all of their possible states at once and also they don’t have any mass. This means that whatever direction a photon can spin in -- say, diagonally, vertically and horizontally -- it does all at once. This is exactly the same as if you constantly moved east, west, north, south, and up-and-down at the same time.
    [Show full text]
  • Computational Complexity: a Modern Approach
    i Computational Complexity: A Modern Approach Sanjeev Arora and Boaz Barak Princeton University http://www.cs.princeton.edu/theory/complexity/ [email protected] Not to be reproduced or distributed without the authors’ permission ii Chapter 10 Quantum Computation “Turning to quantum mechanics.... secret, secret, close the doors! we always have had a great deal of difficulty in understanding the world view that quantum mechanics represents ... It has not yet become obvious to me that there’s no real problem. I cannot define the real problem, therefore I suspect there’s no real problem, but I’m not sure there’s no real problem. So that’s why I like to investigate things.” Richard Feynman, 1964 “The only difference between a probabilistic classical world and the equations of the quantum world is that somehow or other it appears as if the probabilities would have to go negative..” Richard Feynman, in “Simulating physics with computers,” 1982 Quantum computing is a new computational model that may be physically realizable and may provide an exponential advantage over “classical” computational models such as prob- abilistic and deterministic Turing machines. In this chapter we survey the basic principles of quantum computation and some of the important algorithms in this model. One important reason to study quantum computers is that they pose a serious challenge to the strong Church-Turing thesis (see Section 1.6.3), which stipulates that every physi- cally reasonable computation device can be simulated by a Turing machine with at most polynomial slowdown. As we will see in Section 10.6, there is a polynomial-time algorithm for quantum computers to factor integers, whereas despite much effort, no such algorithm is known for deterministic or probabilistic Turing machines.
    [Show full text]
  • Arxiv:2009.07590V2 [Quant-Ph] 9 Dec 2020
    Emulating quantum teleportation of a Majorana zero mode qubit He-Liang Huang,1, 2, 3 Marek Naro˙zniak,4, 5 Futian Liang,1, 2, 3 Youwei Zhao,1, 2, 3 Anthony D. Castellano,1, 2, 3 Ming Gong,1, 2, 3 Yulin Wu,1, 2, 3 Shiyu Wang,1, 2, 3 Jin Lin,1, 2, 3 Yu Xu,1, 2, 3 Hui Deng,1, 2, 3 Hao Rong,1, 2, 3 6, 7, 8 1, 2, 3 4, 8, 9, 5 1, 2, 3, 1, 2, 3 Jonathan P. Dowling ∗, Cheng-Zhi Peng, Tim Byrnes, Xiaobo Zhu, † and Jian-Wei Pan 1Hefei National Laboratory for Physical Sciences at the Microscale and Department of Modern Physics, University of Science and Technology of China, Hefei 230026, China 2Shanghai Branch, CAS Center for Excellence in Quantum Information and Quantum Physics, University of Science and Technology of China, Shanghai 201315, China 3Shanghai Research Center for Quantum Sciences, Shanghai 201315, China 4New York University Shanghai, 1555 Century Ave, Pudong, Shanghai 200122, China 5Department of Physics, New York University, New York, NY 10003, USA 6Hearne Institute for Theoretical Physics, Department of Physics and Astronomy, Louisiana State University, Baton Rouge, Louisiana 70803, USA 7Hefei National Laboratory for Physical Sciences at Microscale and Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui 230026, China 8NYU-ECNU Institute of Physics at NYU Shanghai, 3663 Zhongshan Road North, Shanghai 200062, China 9State Key Laboratory of Precision Spectroscopy, School of Physical and Material Sciences, East China Normal University, Shanghai 200062, China (Dated: December 10, 2020) Topological quantum computation based on anyons is a promising approach to achieve fault- tolerant quantum computing.
    [Show full text]
  • Arxiv:0905.2794V4 [Quant-Ph] 21 Jun 2013 Error Correction 7 B
    Quantum Error Correction for Beginners Simon J. Devitt,1, ∗ William J. Munro,2 and Kae Nemoto1 1National Institute of Informatics 2-1-2 Hitotsubashi Chiyoda-ku Tokyo 101-8340. Japan 2NTT Basic Research Laboratories NTT Corporation 3-1 Morinosato-Wakamiya, Atsugi Kanagawa 243-0198. Japan (Dated: June 24, 2013) Quantum error correction (QEC) and fault-tolerant quantum computation represent one of the most vital theoretical aspect of quantum information processing. It was well known from the early developments of this exciting field that the fragility of coherent quantum systems would be a catastrophic obstacle to the development of large scale quantum computers. The introduction of quantum error correction in 1995 showed that active techniques could be employed to mitigate this fatal problem. However, quantum error correction and fault-tolerant computation is now a much larger field and many new codes, techniques, and methodologies have been developed to implement error correction for large scale quantum algorithms. In response, we have attempted to summarize the basic aspects of quantum error correction and fault-tolerance, not as a detailed guide, but rather as a basic introduction. This development in this area has been so pronounced that many in the field of quantum information, specifically researchers who are new to quantum information or people focused on the many other important issues in quantum computation, have found it difficult to keep up with the general formalisms and methodologies employed in this area. Rather than introducing these concepts from a rigorous mathematical and computer science framework, we instead examine error correction and fault-tolerance largely through detailed examples, which are more relevant to experimentalists today and in the near future.
    [Show full text]
  • Quantum Computational Complexity Theory Is to Un- Derstand the Implications of Quantum Physics to Computational Complexity Theory
    Quantum Computational Complexity John Watrous Institute for Quantum Computing and School of Computer Science University of Waterloo, Waterloo, Ontario, Canada. Article outline I. Definition of the subject and its importance II. Introduction III. The quantum circuit model IV. Polynomial-time quantum computations V. Quantum proofs VI. Quantum interactive proof systems VII. Other selected notions in quantum complexity VIII. Future directions IX. References Glossary Quantum circuit. A quantum circuit is an acyclic network of quantum gates connected by wires: the gates represent quantum operations and the wires represent the qubits on which these operations are performed. The quantum circuit model is the most commonly studied model of quantum computation. Quantum complexity class. A quantum complexity class is a collection of computational problems that are solvable by a cho- sen quantum computational model that obeys certain resource constraints. For example, BQP is the quantum complexity class of all decision problems that can be solved in polynomial time by a arXiv:0804.3401v1 [quant-ph] 21 Apr 2008 quantum computer. Quantum proof. A quantum proof is a quantum state that plays the role of a witness or certificate to a quan- tum computer that runs a verification procedure. The quantum complexity class QMA is defined by this notion: it includes all decision problems whose yes-instances are efficiently verifiable by means of quantum proofs. Quantum interactive proof system. A quantum interactive proof system is an interaction between a verifier and one or more provers, involving the processing and exchange of quantum information, whereby the provers attempt to convince the verifier of the answer to some computational problem.
    [Show full text]
  • Quantum Technology: Advances and Trends
    American Journal of Engineering and Applied Sciences Review Quantum Technology: Advances and Trends 1Lidong Wang and 2Cheryl Ann Alexander 1Institute for Systems Engineering Research, Mississippi State University, Vicksburg, Mississippi, USA 2Institute for IT innovation and Smart Health, Vicksburg, Mississippi, USA Article history Abstract: Quantum science and quantum technology have become Received: 30-03-2020 significant areas that have the potential to bring up revolutions in various Revised: 23-04-2020 branches or applications including aeronautics and astronautics, military Accepted: 13-05-2020 and defense, meteorology, brain science, healthcare, advanced manufacturing, cybersecurity, artificial intelligence, etc. In this study, we Corresponding Author: Cheryl Ann Alexander present the advances and trends of quantum technology. Specifically, the Institute for IT innovation and advances and trends cover quantum computers and Quantum Processing Smart Health, Vicksburg, Units (QPUs), quantum computation and quantum machine learning, Mississippi, USA quantum network, Quantum Key Distribution (QKD), quantum Email: [email protected] teleportation and quantum satellites, quantum measurement and quantum sensing, and post-quantum blockchain and quantum blockchain. Some challenges are also introduced. Keywords: Quantum Computer, Quantum Machine Learning, Quantum Network, Quantum Key Distribution, Quantum Teleportation, Quantum Satellite, Quantum Blockchain Introduction information and the computation that is executed throughout a transaction (Humble, 2018). The Tokyo QKD metropolitan area network was There have been advances in developing quantum established in Japan in 2015 through intercontinental equipment, which has been indicated by the number of cooperation. A 650 km QKD network was established successful QKD demonstrations. However, many problems between Washington and Ohio in the USA in 2016; a still need to be fixed though achievements of QKD have plan of a 10000 km QKD backbone network was been showcased.
    [Show full text]