DOCSLIB.ORG

Variational Quantum Circuits for Machine Learning. an Application for the Detection of Weak Signals

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Variational Quantum Circuits for Machine Learning. an Application for the Detection of Weak Signals applied sciences Article Variational Quantum Circuits for Machine Learning. An Application for the Detection of Weak Signals Israel Griol-Barres 1,* , Sergio Milla 2, Antonio Cebrián 3 , Yashar Mansoori 4 and José Millet 3 1 IDEAS-UPV, Vice-Rectorate for Entrepreneurship and Employment, Universitat Politècnica de València, 46022 Valencia, Spain 2 FGYM, Vice-Rectorate for Entrepreneurship and Employment, Universitat Politècnica de València, 46022 Valencia, Spain; [email protected] 3 Instituto ITACA, Universitat Politècnica de València, 46022 Valencia, Spain; [email protected] (A.C.); [email protected] (J.M.) 4 Department of Technology Management and Economics, Chalmers University of Technology, 412 96 Göteborg, Sweden; [email protected] * Correspondence: [email protected]; Tel.: +34-635-82-28-75 Featured Application: Quantum classifier to detect weak signals. Abstract: Quantum computing is a new paradigm for a multitude of computing applications. This study presents the technologies that are currently available for the physical implementation of qubits and quantum gates, establishing their main advantages and disadvantages and the available frameworks for programming and implementing quantum circuits. One of the main applications for quantum computing is the development of new algorithms for machine learning. In this study, an implementation of a quantum circuit based on support vector machines (SVMs) is described for the resolution of classification problems. This circuit is specially designed for the noisy intermediate-scale Citation: Griol-Barres, I.; Milla, S.; quantum (NISQ) computers that are currently available. As an experiment, the circuit is tested on a Cebrián, A.; Mansoori, Y.; Millet, J. real quantum computer based on superconducting qubits for an application to detect weak signals Variational Quantum Circuits for of the future. Weak signals are indicators of incipient changes that will have a future impact. Even Machine Learning. An Application for experts, the detection of these events is complicated since it is too early to predict this impact. for the Detection of Weak Signals. The data obtained with the experiment shows promising results but also confirms that ongoing Appl. Sci. 2021, 11, 6427. https:// doi.org/10.3390/app11146427 technological development is still required to take full advantage of quantum computing. Academic Editor: Mario Piattini Keywords: quantum computing; variational quantum circuits; quantum support vector machines; weak signals of the future; machine learning Received: 30 May 2021 Accepted: 9 July 2021 Published: 12 July 2021 1. Introduction Publisher’s Note: MDPI stays neutral Approximately every two years the number of transistors in a classical microprocessor with regard to jurisdictional claims in doubles [1]. As a result, transistors are becoming smaller and require lower voltages to published maps and institutional affil- operate. However, current classical computers are reaching the limit of computational iations. capacity because when manipulated in circuits of such small size, electrons tend to act unpredictably. They can also pass through the walls of conduction channels in what is known as the ‘tunnel effect’ [2]. One of the alternatives to classical computing is the exploitation of the laws of quantum mechanics in computational environments. Copyright: © 2021 by the authors. Quantum computing is the development of computational technologies that are based Licensee MDPI, Basel, Switzerland. on the laws of quantum mechanics. This type of computing enables the creation of systems This article is an open access article to store, process, and transfer information encoded in quantum media. The first idea distributed under the terms and of a quantum computer was proposed in 1982 [3] and was based on the first classical conditions of the Creative Commons computing machine defined by Alan Turing [4]. The Turing machine manipulated symbols Attribution (CC BY) license (https:// on a strip according to a table of rules that simulated a computational algorithm. The creativecommons.org/licenses/by/ first proposal for quantum computation replaced the strip with a sequence of two-state 4.0/). Appl. Sci. 2021, 11, 6427. https://doi.org/10.3390/app11146427 https://www.mdpi.com/journal/applsci Appl. Sci. 2021, 11, x FOR PEER REVIEW 2 of 21 symbols on a strip according to a table of rules that simulated a computational algorithm. The first proposal for quantum computation replaced the strip with a sequence of two- state quantum systems. The machine evolved in steps. At the end of each step, the tape was always in a fundamental state of ‘1′ or ‘0′. However, during each step, the machine could be in a superposition of spin states. Soon after the first idea for a quantum computer, some scholars [5] introduced the ‘speculative’ idea that a computer based on the laws of quantum mechanics could perform complex calculations faster than conventional binary computers. Conventional computers convert data into a series of binary digits called bits that Appl. Sci. 2021, 11, 6427 constitute the basic units of information. These bits can only have the values of ‘02′ ofand 21 ‘1′ and are encoded in integrated circuits according to electrical signals of different voltages. Technological advancements have enabled the creation of devices that act as bits. Today an integratedquantum circuit systems. contains The machine millions evolved and millions in steps. of At transistors. the end of each step, the tape was In alwayscontrast, in adata fundamental processed state by of ‘1’quantum or ‘0’. However, computers during use each ‘qubits’ step, the that machine can couldhave the value ofbe ‘0 in′ and a superposition ‘1′ at the same of spin time. states. Unlike bits, qubits can be in a superposition of both Soon after the first idea for a quantum computer, some scholars [5] introduced the states [6].‘speculative’ idea that a computer based on the laws of quantum mechanics could perform Thecomplex Bloch calculationssphere [7] fasteris a thangeometrical conventional representation binary computers. of all possible superposition states that a Conventionalqubit can adopt, computers as can convert be seen data in intoFigure a series 1a. Each of binary point digits on the called surface bits that of the sphere correspondsconstitute the basicto a pure units state of information. of the Hilbert These space bits can of only complex have the dimension values of ‘0’2. The and ‘1’point of coordinatesand are (0,0,1) encoded corresponds in integrated to circuits an eigenvector according to with electrical a positive signals eigenvalue of different voltages.of the Pauli Technological advancements have enabled the creation of devices that act as bits. Today an matrix and the point of coordinates (0,0,−1) corresponds to the eigenvector with negative integrated circuit contains millions and millions of transistors. eigenvalue. InBoth contrast, states data are processed expressed by quantum with the computers notation use |0> ‘qubits’ and that|1> can and have correspond the value to spin upof and ‘0’ andspin ‘1’ down. at the same The time. qubit Unlike can bits, be qubitsrepresented can be in as a superpositiona linear combination of both states of [6 ].both states, as shownThe Bloch in the sphere equation, [7] is a geometricalwhere a and representation b are complex of all possiblenumbers, superposition and where states ||2 + ||2 = 1.that a qubit can adopt, as can be seen in Figure1a. Each point on the surface of the sphere corresponds to a pure state of the Hilbert space of complex dimension 2. The point of coordinates (0,0,1) corresponds|⟩ =|0⟩ to+|1 an eigenvector⟩ = with|0⟩ + a positive |1 eigenvalue⟩ of the Pauli (1) matrix and the point of coordinates (0,0,−1) corresponds to the eigenvector with negative Theeigenvalue. Bloch sphere Both makes states are it possible expressed to with visual theize notation the action |0> and of |1>different and correspond quantum togates graphically.spin upFor and example, spin down. one The of qubitthe most can be used represented quantum as a lineargates combinationis the Hadamard of both states,gate that operatesas on shown a single in the qubit. equation, This where gate ais and equi b arevalent complex to the numbers, combination and where of |twoa|2 rotations,+ |b|2 = 1. one of pi about the z-axis followed by a rotation of pi/2 about E the y-axis E of the Bloch sphere as j i = j i + i = ifa + ifb shown in Figure 1b. y a 0 b 1 rae 0 rbe 1 (1) (a) (b) Figure 1.Figure The Block 1. The sphere Block sphere representing representing a qubit a qubit in inthe the state state of: (a)) |0|0>i and and (b ()b after) after applying applying a a HadamardHadamard gate to gate(a). to (a). The Bloch sphere makes it possible to visualize the action of different quantum gates Thegraphically. Hadamard For gate example, is the one‘quantum of the most Fourier used quantumtransform’ gates performed is the Hadamard on a qubit gate [8]. that The Hadamardoperates gate on is ausually single qubit. the first This gatestage is equivalentin a quantum to the circuit combination because of two it places rotations, the one qubit in a stateof pi of about superposition. the z-axis followed However, by a rotation the ofBloch pi/2 aboutsphere the y-axismodel, of thewhile Bloch conceptually sphere as shown in Figure1b. The Hadamard gate is the ‘quantum Fourier transform’ performed on a qubit [8]. The Hadamard gate is usually the first stage in a quantum circuit because it places the qubit in a state of superposition. However, the Bloch sphere model, while conceptually determining the states that a qubit can have, has the major limitation of not being useful Appl. Sci. 2021, 11, 6427 3 of 21 for showing the ‘entanglement’ of several qubits. One of the most important advantages of state superposition is that, while with n bits one can encode a single state out of 2n possible states, with n qubits one could encode 2n states simultaneously.
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]
  • Simulating Quantum Field Theory with a Quantum Computer
    Simulating quantum field theory with a quantum computer John Preskill Lattice 2018 28 July 2018 This talk has two parts (1) Near-term prospects for quantum computing. (2) Opportunities in quantum simulation of quantum field theory. Exascale digital computers will advance our knowledge of QCD, but some challenges will remain, especially concerning real-time evolution and properties of nuclear matter and quark-gluon plasma at nonzero temperature and chemical potential. Digital computers may never be able to address these (and other) problems; quantum computers will solve them eventually, though I’m not sure when. The physics payoff may still be far away, but today’s research can hasten the arrival of a new era in which quantum simulation fuels progress in fundamental physics. Frontiers of Physics short distance long distance complexity Higgs boson Large scale structure “More is different” Neutrino masses Cosmic microwave Many-body entanglement background Supersymmetry Phases of quantum Dark matter matter Quantum gravity Dark energy Quantum computing String theory Gravitational waves Quantum spacetime particle collision molecular chemistry entangled electrons A quantum computer can simulate efficiently any physical process that occurs in Nature. (Maybe. We don’t actually know for sure.) superconductor black hole early universe Two fundamental ideas (1) Quantum complexity Why we think quantum computing is powerful. (2) Quantum error correction Why we think quantum computing is scalable. A complete description of a typical quantum state of just 300 qubits requires more bits than the number of atoms in the visible universe. Why we think quantum computing is powerful We know examples of problems that can be solved efficiently by a quantum computer, where we believe the problems are hard for classical computers.
    [Show full text]
  • Direct Dispersive Monitoring of Charge Parity in Offset-Charge
    PHYSICAL REVIEW APPLIED 12, 014052 (2019) Direct Dispersive Monitoring of Charge Parity in Offset-Charge-Sensitive Transmons K. Serniak,* S. Diamond, M. Hays, V. Fatemi, S. Shankar, L. Frunzio, R.J. Schoelkopf, and M.H. Devoret† Department of Applied Physics, Yale University, New Haven, Connecticut 06520, USA (Received 29 March 2019; revised manuscript received 20 June 2019; published 26 July 2019) A striking characteristic of superconducting circuits is that their eigenspectra and intermode coupling strengths are well predicted by simple Hamiltonians representing combinations of quantum-circuit ele- ments. Of particular interest is the Cooper-pair-box Hamiltonian used to describe the eigenspectra of transmon qubits, which can depend strongly on the offset-charge difference across the Josephson element. Notably, this offset-charge dependence can also be observed in the dispersive coupling between an ancil- lary readout mode and a transmon fabricated in the offset-charge-sensitive (OCS) regime. We utilize this effect to achieve direct high-fidelity dispersive readout of the joint plasmon and charge-parity state of an OCS transmon, which enables efficient detection of charge fluctuations and nonequilibrium-quasiparticle dynamics. Specifically, we show that additional high-frequency filtering can extend the charge-parity life- time of our device by 2 orders of magnitude, resulting in a significantly improved energy relaxation time T1 ∼ 200 μs. DOI: 10.1103/PhysRevApplied.12.014052 I. INTRODUCTION charge states, like a usual transmon but with measurable offset-charge dispersion of the transition frequencies The basic building blocks of quantum circuits—e.g., between eigenstates, like a Cooper-pair box. This defines capacitors, inductors, and nonlinear elements such as what we refer to as the offset-charge-sensitive (OCS) Josephson junctions [1] and electromechanical trans- transmon regime.
    [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]
  • Quantum Machine Learning: Benefits and Practical Examples
    Quantum Machine Learning: Benefits and Practical Examples Frank Phillipson1[0000-0003-4580-7521] 1 TNO, Anna van Buerenplein 1, 2595 DA Den Haag, The Netherlands [email protected] Abstract. A quantum computer that is useful in practice, is expected to be devel- oped in the next few years. An important application is expected to be machine learning, where benefits are expected on run time, capacity and learning effi- ciency. In this paper, these benefits are presented and for each benefit an example application is presented. A quantum hybrid Helmholtz machine use quantum sampling to improve run time, a quantum Hopfield neural network shows an im- proved capacity and a variational quantum circuit based neural network is ex- pected to deliver a higher learning efficiency. Keywords: Quantum Machine Learning, Quantum Computing, Near Future Quantum Applications. 1 Introduction Quantum computers make use of quantum-mechanical phenomena, such as superposi- tion and entanglement, to perform operations on data [1]. Where classical computers require the data to be encoded into binary digits (bits), each of which is always in one of two definite states (0 or 1), quantum computation uses quantum bits, which can be in superpositions of states. These computers would theoretically be able to solve certain problems much more quickly than any classical computer that use even the best cur- rently known algorithms. Examples are integer factorization using Shor's algorithm or the simulation of quantum many-body systems. This benefit is also called ‘quantum supremacy’ [2], which only recently has been claimed for the first time [3]. There are two different quantum computing paradigms.
    [Show full text]
  • Quantum Computing: Principles and Applications
    Journal of International Technology and Information Management Volume 29 Issue 2 Article 3 2020 Quantum Computing: Principles and Applications Yoshito Kanamori University of Alaska Anchorage, [email protected] Seong-Moo Yoo University of Alabama in Huntsville, [email protected] Follow this and additional works at: https://scholarworks.lib.csusb.edu/jitim Part of the Communication Technology and New Media Commons, Computer and Systems Architecture Commons, Information Security Commons, Management Information Systems Commons, Science and Technology Studies Commons, Technology and Innovation Commons, and the Theory and Algorithms Commons Recommended Citation Kanamori, Yoshito and Yoo, Seong-Moo (2020) "Quantum Computing: Principles and Applications," Journal of International Technology and Information Management: Vol. 29 : Iss. 2 , Article 3. Available at: https://scholarworks.lib.csusb.edu/jitim/vol29/iss2/3 This Article is brought to you for free and open access by CSUSB ScholarWorks. It has been accepted for inclusion in Journal of International Technology and Information Management by an authorized editor of CSUSB ScholarWorks. For more information, please contact [email protected]. Journal of International Technology and Information Management Volume 29, Number 2 2020 Quantum Computing: Principles and Applications Yoshito Kanamori (University of Alaska Anchorage) Seong-Moo Yoo (University of Alabama in Huntsville) ABSTRACT The development of quantum computers over the past few years is one of the most significant advancements in the history of quantum computing. D-Wave quantum computer has been available for more than eight years. IBM has made its quantum computer accessible via its cloud service. Also, Microsoft, Google, Intel, and NASA have been heavily investing in the development of quantum computers and their applications.
    [Show full text]
  • A Scanning Transmon Qubit for Strong Coupling Circuit Quantum Electrodynamics
    ARTICLE Received 8 Mar 2013 | Accepted 10 May 2013 | Published 7 Jun 2013 DOI: 10.1038/ncomms2991 A scanning transmon qubit for strong coupling circuit quantum electrodynamics W. E. Shanks1, D. L. Underwood1 & A. A. Houck1 Like a quantum computer designed for a particular class of problems, a quantum simulator enables quantitative modelling of quantum systems that is computationally intractable with a classical computer. Superconducting circuits have recently been investigated as an alternative system in which microwave photons confined to a lattice of coupled resonators act as the particles under study, with qubits coupled to the resonators producing effective photon–photon interactions. Such a system promises insight into the non-equilibrium physics of interacting bosons, but new tools are needed to understand this complex behaviour. Here we demonstrate the operation of a scanning transmon qubit and propose its use as a local probe of photon number within a superconducting resonator lattice. We map the coupling strength of the qubit to a resonator on a separate chip and show that the system reaches the strong coupling regime over a wide scanning area. 1 Department of Electrical Engineering, Princeton University, Olden Street, Princeton 08550, New Jersey, USA. Correspondence and requests for materials should be addressed to W.E.S. (email: [email protected]). NATURE COMMUNICATIONS | 4:1991 | DOI: 10.1038/ncomms2991 | www.nature.com/naturecommunications 1 & 2013 Macmillan Publishers Limited. All rights reserved. ARTICLE NATURE COMMUNICATIONS | DOI: 10.1038/ncomms2991 ver the past decade, the study of quantum physics using In this work, we describe a scanning superconducting superconducting circuits has seen rapid advances in qubit and demonstrate its coupling to a superconducting CPWR Osample design and measurement techniques1–3.
    [Show full text]
  • COVID-19 Detection on IBM Quantum Computer with Classical-Quantum Transfer Learning
    medRxiv preprint doi: https://doi.org/10.1101/2020.11.07.20227306; this version posted November 10, 2020. The copyright holder for this preprint (which was not certified by peer review) is the author/funder, who has granted medRxiv a license to display the preprint in perpetuity. It is made available under a CC-BY-NC-ND 4.0 International license . Turk J Elec Eng & Comp Sci () : { © TUB¨ ITAK_ doi:10.3906/elk- COVID-19 detection on IBM quantum computer with classical-quantum transfer learning Erdi ACAR1*, Ihsan_ YILMAZ2 1Department of Computer Engineering, Institute of Science, C¸anakkale Onsekiz Mart University, C¸anakkale, Turkey 2Department of Computer Engineering, Faculty of Engineering, C¸anakkale Onsekiz Mart University, C¸anakkale, Turkey Received: .201 Accepted/Published Online: .201 Final Version: ..201 Abstract: Diagnose the infected patient as soon as possible in the coronavirus 2019 (COVID-19) outbreak which is declared as a pandemic by the world health organization (WHO) is extremely important. Experts recommend CT imaging as a diagnostic tool because of the weak points of the nucleic acid amplification test (NAAT). In this study, the detection of COVID-19 from CT images, which give the most accurate response in a short time, was investigated in the classical computer and firstly in quantum computers. Using the quantum transfer learning method, we experimentally perform COVID-19 detection in different quantum real processors (IBMQx2, IBMQ-London and IBMQ-Rome) of IBM, as well as in different simulators (Pennylane, Qiskit-Aer and Cirq). By using a small number of data sets such as 126 COVID-19 and 100 Normal CT images, we obtained a positive or negative classification of COVID-19 with 90% success in classical computers, while we achieved a high success rate of 94-100% in quantum computers.
    [Show full text]
  • BCG) Is a Global Management Consulting Firm and the World’S Leading Advisor on Business Strategy
    The Next Decade in Quantum Computing— and How to Play Boston Consulting Group (BCG) is a global management consulting firm and the world’s leading advisor on business strategy. We partner with clients from the private, public, and not-for-profit sectors in all regions to identify their highest-value opportunities, address their most critical challenges, and transform their enterprises. Our customized approach combines deep insight into the dynamics of companies and markets with close collaboration at all levels of the client organization. This ensures that our clients achieve sustainable competitive advantage, build more capable organizations, and secure lasting results. Founded in 1963, BCG is a private company with offices in more than 90 cities in 50 countries. For more information, please visit bcg.com. THE NEXT DECADE IN QUANTUM COMPUTING— AND HOW TO PLAY PHILIPP GERBERT FRANK RUESS November 2018 | Boston Consulting Group CONTENTS 3 INTRODUCTION 4 HOW QUANTUM COMPUTERS ARE DIFFERENT, AND WHY IT MATTERS 6 THE EMERGING QUANTUM COMPUTING ECOSYSTEM Tech Companies Applications and Users 10 INVESTMENTS, PUBLICATIONS, AND INTELLECTUAL PROPERTY 13 A BRIEF TOUR OF QUANTUM COMPUTING TECHNOLOGIES Criteria for Assessment Current Technologies Other Promising Technologies Odd Man Out 18 SIMPLIFYING THE QUANTUM ALGORITHM ZOO 21 HOW TO PLAY THE NEXT FIVE YEARS AND BEYOND Determining Timing and Engagement The Current State of Play 24 A POTENTIAL QUANTUM WINTER, AND THE OPPORTUNITY THEREIN 25 FOR FURTHER READING 26 NOTE TO THE READER 2 | The Next Decade in Quantum Computing—and How to Play INTRODUCTION he experts are convinced that in time they can build a Thigh-performance quantum computer.
    [Show full text]
  • Simulating Quantum Field Theory with a Quantum Computer
    Simulating quantum field theory with a quantum computer John Preskill Bethe Lecture, Cornell 12 April 2019 Frontiers of Physics short distance long distance complexity Higgs boson Large scale structure “More is different” Neutrino masses Cosmic microwave Many-body entanglement background Supersymmetry Phases of quantum Dark matter matter Quantum gravity Dark energy Quantum computing String theory Gravitational waves Quantum spacetime particle collision molecular chemistry entangled electrons A quantum computer can simulate efficiently any physical process that occurs in Nature. (Maybe. We don’t actually know for sure.) superconductor black hole early universe Opportunities in quantum simulation of quantum field theory Exascale digital computers will advance our knowledge of QCD, but some challenges will remain, especially concerning real-time evolution and properties of nuclear matter and quark-gluon plasma at nonzero temperature and chemical potential. Digital computers may never be able to address these (and other) problems; quantum computers will solve them eventually, though I’m not sure when. The physics payoff may still be far away, but today’s research can hasten the arrival of a new era in which quantum simulation fuels progress in fundamental physics. Collaborators: Stephen Jordan, Keith Lee, Hari Krovi arXiv: 1111.3633, 1112.4833, 1404.7115, 1703.00454, 1811.10085 Work in progress: Alex Buser, Junyu Liu, Burak Sahinoglu ??? Quantum Supremacy! Quantum computing in the NISQ Era The (noisy) 50-100 qubit quantum computer is coming soon. (NISQ = noisy intermediate-scale quantum .) NISQ devices cannot be simulated by brute force using the most powerful currently existing supercomputers. Noise limits the computational power of NISQ-era technology.
    [Show full text]
  • Control of the Geometric Phase in Two Open Qubit–Cavity Systems Linked by a Waveguide
    entropy Article Control of the Geometric Phase in Two Open Qubit–Cavity Systems Linked by a Waveguide Abdel-Baset A. Mohamed 1,2 and Ibtisam Masmali 3,* 1 Department of Mathematics, College of Science and Humanities, Prince Sattam bin Abdulaziz University, Al-Aflaj 710-11912, Saudi Arabia; [email protected] 2 Faculty of Science, Assiut University, Assiut 71516, Egypt 3 Department of Mathematics, Faculty of Science, Jazan University, Gizan 82785, Saudi Arabia * Correspondence: [email protected] Received: 28 November 2019; Accepted: 8 January 2020; Published: 10 January 2020 Abstract: We explore the geometric phase in a system of two non-interacting qubits embedded in two separated open cavities linked via an optical fiber and leaking photons to the external environment. The dynamical behavior of the generated geometric phase is investigated under the physical parameter effects of the coupling constants of both the qubit–cavity and the fiber–cavity interactions, the resonance/off-resonance qubit–field interactions, and the cavity dissipations. It is found that these the physical parameters lead to generating, disappearing and controlling the number and the shape (instantaneous/rectangular) of the geometric phase oscillations. Keywords: geometric phase; cavity damping; optical fiber 1. Introduction The mathematical manipulations of the open quantum systems, of the qubit–field interactions, depend on the ability of solving the master-damping [1] and intrinsic-decoherence [2] equations, analytically/numerically. To remedy the problems of these manipulations, the quantum phenomena of the open systems were studied for limited physical circumstances [3–7]. The quantum geometric phase is a basic intrinsic feature in quantum mechanics that is used as the basis of quantum computation [8].
    [Show full text]
  • Physical Implementations of Quantum Computing
    Physical implementations of quantum computing Andrew Daley Department of Physics and Astronomy University of Pittsburgh Overview (Review) Introduction • DiVincenzo Criteria • Characterising coherence times Survey of possible qubits and implementations • Neutral atoms • Trapped ions • Colour centres (e.g., NV-centers in diamond) • Electron spins (e.g,. quantum dots) • Superconducting qubits (charge, phase, flux) • NMR • Optical qubits • Topological qubits Back to the DiVincenzo Criteria: Requirements for the implementation of quantum computation 1. A scalable physical system with well characterized qubits 1 | i 0 | i 2. The ability to initialize the state of the qubits to a simple fiducial state, such as |000...⟩ 1 | i 0 | i 3. Long relevant decoherence times, much longer than the gate operation time 4. A “universal” set of quantum gates control target (single qubit rotations + C-Not / C-Phase / .... ) U U 5. A qubit-specific measurement capability D. P. DiVincenzo “The Physical Implementation of Quantum Computation”, Fortschritte der Physik 48, p. 771 (2000) arXiv:quant-ph/0002077 Neutral atoms Advantages: • Production of large quantum registers • Massive parallelism in gate operations • Long coherence times (>20s) Difficulties: • Gates typically slower than other implementations (~ms for collisional gates) (Rydberg gates can be somewhat faster) • Individual addressing (but recently achieved) Quantum Register with neutral atoms in an optical lattice 0 1 | | Requirements: • Long lived storage of qubits • Addressing of individual qubits • Single and two-qubit gate operations • Array of singly occupied sites • Qubits encoded in long-lived internal states (alkali atoms - electronic states, e.g., hyperfine) • Single-qubit via laser/RF field coupling • Entanglement via Rydberg gates or via controlled collisions in a spin-dependent lattice Rb: Group II Atoms 87Sr (I=9/2): Extensively developed, 1 • P1 e.g., optical clocks 3 • Degenerate gases of Yb, Ca,..
    [Show full text]