Simulating Quantum Many-Body Dynamics on a Current Digital Quantum Computer

Total Page:16

File Type:pdf, Size:1020Kb

Simulating Quantum Many-Body Dynamics on a Current Digital Quantum Computer www.nature.com/npjqi ARTICLE OPEN Simulating quantum many-body dynamics on a current digital quantum computer Adam Smith 1,2*,M.S.Kim1, Frank Pollmann2 and Johannes Knolle1 Universal quantum computers are potentially an ideal setting for simulating many-body quantum dynamics that is out of reach for classical digital computers. We use state-of-the-art IBM quantum computers to study paradigmatic examples of condensed matter physics—we simulate the effects of disorder and interactions on quantum particle transport, as well as correlation and entanglement spreading. Our benchmark results show that the quality of the current machines is below what is necessary for quantitatively accurate continuous-time dynamics of observables and reachable system sizes are small comparable to exact diagonalization. Despite this, we are successfully able to demonstrate clear qualitative behaviour associated with localization physics and many-body interaction effects. npj Quantum Information (2019) 5:106 ; https://doi.org/10.1038/s41534-019-0217-0 INTRODUCTION example, allowed us to study Hubbard model physics31,35 and 32–34 Quantum computers are general purpose devices that leverage many-body localized systems in two dimensions. More 1234567890():,; quantum mechanical behaviour to outperform their classical recently, there have also been advances in trapped ion quantum counterparts by reducing the computational time and/or the simulators, which have the benefit of being able to implement 6,7,37 required physical resources.1 Excitement about quantum compu- long range interactions, and have been used to study the tation was initially fuelled by the prime-factorization algorithm Schwinger-mechanism of pair production/annihilation in 1D developed by Shor,2 which is most popularly associated with the lattice QED7 and Floquet time crystals.38 ability to attack currently used cyber security protocols. More Universal quantum computers are also increasingly looking like importantly, it provided a paradigmatic example of dramatic a feasible setting for simulating quantum dynamics. One of the exponential improvement in computational speed when com- biggest advantages of using a quantum computer for this purpose pared with classical algorithms. It has since been realised that the is the flexibility it offers. A single quantum device could in potential power of quantum computers could have far reaching principle perform simulations that currently require several applications, from quantum chemistry and the associated benefits different experiments, using disparate methods. Furthermore, it for medicine and drug discovery,3 to quantum machine learning should be possible to access new physics not currently accessible, and artificial intelligence.4 Even before reaching these lofty goals, most notably, the simulation of lattice gauge theories with there may also be practical uses for noisy intermediate-scale dynamical gauge fields. These are ubiquitous in the theoretical quantum (NISQ) devices.5 study of strongly-correlated quantum matter but require multi- These quantum devices can be implemented in a large number body couplings, which have so far proven difficult to achieve in of ways, for example, using ultracold trapped ions6–11 cavity experiment.39,40 quantum electrodynamics (QED),12–15 photonic circuits,16–18 sili- A particularly exciting opportunity has been provided by IBM in con quantum dots,19–21 and theoretically even by braiding, as yet the form of an online quantum computing network called IBM Q. unobserved, exotic collective excitations called non-abelian any- This consists of a set of small quantum computers of 5 and 16 ons.22–24 One of the most promising approaches is using qubits that are available freely to the public, two 20 qubit superconducting circuits,25–27 where recent advances have machines accessible by IBM Q partners,41 and the qiskit python resulted in devices consisting of up to 72 qubits, pushing us ever API42 for programming the devices. The publicly available closer to realising so-called quantum supremacy.28 The apparent resources have already resulted in a spread of results, such as proximity of current devices to this milestone makes it timely to calculating the ground state of simple molecules,3,43 creating and review the current capabilities and limitations of quantum measuring highly entangled many qubit states,44,45 implementing – computers. quantum algorithms,46 48 and simulating non-equilibrium Richard Feynman’s original idea was to simulate quantum dynamics in the transverse-field Ising,49,50 Heisenberg51,52 and many-body dynamics—a notoriously hard problem for a classical Schwinger53 models, as just a few examples. Given the infancy of computer—by using another quantum system.29 Over the last quantum computing efforts, all these results are understandably couple of decades, this approach of using a purpose built small scale and of limited accuracy. quantum simulator has been extremely successful in accessing IBM is not alone in their efforts to make quantum computing physics beyond the reach of numerics on a classical computer. more mainstream, with Microsoft introducing the Q-sharp Most notable are cold atom experiments with optical lattices30–36 programming language,54 Google developing the Circq python where the natural evolution of the atoms corresponds to a high library,55 and Rigetti providing their own Quantum Cloud Service accuracy to that of a local Hamiltonian of choice. This has, for and Forest SDK built on Python.56 Rigetti and IonQ also provide 1Blackett Laboratory, Imperial College London, London SW7 2AZ, UK. 2Department of Physics, T42, Technische Universität München, James-Franck-Straße 1, D-85748 Garching, Germany. *email: [email protected] Published in partnership with The University of New South Wales A. Smith et al. 2 selective public access to hardware—based on superconducting qubits and trapped ions, respectively. All of these resources are allowing a lot of hands on experience with quantum computers from researchers and the general public all around the world. Furthermore, it highlights that there are currently several parallel efforts of research and development from industry focussed on quantum computing, quantum programming and cloud-based services that are flexible and prepared for future hardware. Given the current stage of development, and the immense expectation from the public and physics communities, it is timely to critically assess and benchmark the state-of-the-art. In this article we consider the far-from-equilibrium dynamics of global quantum quenches simulated on an IBM 20 qubit quantum computer. The models that we consider are of central importance to condensed matter physics and display a wide range of phenomenologies. By measuring a range of physical correlators, Fig. 1 Schematic of the implementation of Trotterized evolution. a The procedure of adding more Trotter steps to reach longer times. b, c we can assess the capabilities and limitations of current quantum are the basic and symmetric Trotter decomposition, respectively, for computers for simulating quantum dynamics. ^z ^ Àihj σ Δt ^ the Hamiltonian Eq. (3). In b the operators are Aj ¼ e j ; Bj ¼ σ^z σ^z σ^x σ^x σ^y σ^y Δ ^z Δt ÀiðU j j 1ÀJð j j 1þ ÞÞ t ^ Àihj σ ^ e þ þ j jþ1 and in c they are Aj ¼ e j 2 ; Bj ¼ σ^z σ^z σ^x σ^x σ^y σ^y Δt σ^z σ^z σ^x σ^x σ^y σ^y Δ ÀiðU j j 1ÀJð j j 1þ ÞÞ ^ ÀiðU j j 1ÀJð j j 1þ ÞÞ t RESULTS e þ þ j jþ1 2 ; Cj ¼ e þ þ j jþ1 . Setup In this article, we study global quantum quenches,57,58 that is we calculate local observables and correlators of the form These Hamiltonians are perfect testbeds for digital quantum simulation since they can be directly simulated on a quantum ψ ^ ψ ; ψ ^ ^ ψ ; (1) ðtÞ Oj ðtÞ ðtÞ OjOk ðtÞ computer – the spins-1/2 of the former correspond directly to the ^ where Oj are local operators and the time-dependent states are qubits of the latter, and the local connectivity of the qubits is 1234567890():,; suited for the local form of the Hamiltonian. ψ ÀiHt^ ψ ; jiðtÞ ¼ e jið0Þ (2) In our simulations we achieve the time evolution using a Trotter 66,67 and where jiψð0Þ is the initial state, which differs globally from an decomposition of the unitary time evolution operator ^ ÀiHt^ eigenstate of H^. In other words, we can consider jiψð0Þ to be the UðtÞ¼e . Our simulation proceeds by the following steps. ground state of a (time-independent) preparation Hamiltonian, First, we create the initial state, which is done by applying Pauli-X ^ ^ ^ ^ operations to the default initial state of the IBM machine, H0 ¼ H À hV, where V is a global perturbation, and the perturba- tion strength h is instantaneously quenched from zero at time jiÁ Á Á """ Á Á Á . Second, we discretize time and the evolution becomes a product of discrete evolution operations t ¼ 0. ^ ^ Δ ^ Δ We consider one dimensional spin-1/2 chains, consisting of N UðtÞ¼Uð tÞÁÁÁUð tÞ. Note that in our plots we include fi additional data points by varying δt in the final discrete evolution spins, initially prepared in either a domain wall con guration, Δ jiÁ Á Á ###""" Á Á Á , or Néel state, jiÁ Á Á "#"#" Á Á Á . Quenches from step. Third, we trotterize the discrete operators Uð tÞ into a these initial states are particularly easy to prepare due to the local product of one- and two-qubit unitaries. Finally, we decompose tensor-product structure of the initial state and have been studied these unitaries into the CNOT and single qubit rotation gates that in cold atom experiments.32 The time evolution after the quantum can be directly applied on the IBM devices. Please see Fig. 1 for a quench will be governed by a Hamiltonian of the form schematic of this procedure, and see Methods for more details.
Recommended publications
  • Time Quasilattices in Dissipative Dynamical Systems Abstract Contents
    SciPost Phys. 5, 001 (2018) Time quasilattices in dissipative dynamical systems Felix Flicker1,2 1 Rudolph Peierls Centre for Theoretical Physics, University of Oxford, Department of Physics, Clarendon Laboratory, Parks Road, Oxford, OX1 3PU, UK 2 Department of Physics, University of California, Berkeley, California 94720 USA fl[email protected] Abstract We establish the existence of ‘time quasilattices’ as stable trajectories in dissipative dy- namical systems. These tilings of the time axis, with two unit cells of different durations, can be generated as cuts through a periodic lattice spanned by two orthogonal directions of time. We show that there are precisely two admissible time quasilattices, which we term the infinite Pell and Clapeyron words, reached by a generalization of the period- doubling cascade. Finite Pell and Clapeyron words of increasing length provide system- atic periodic approximations to time quasilattices which can be verified experimentally. The results apply to all systems featuring the universal sequence of periodic windows. We provide examples of discrete-time maps, and periodically-driven continuous-time dy- namical systems. We identify quantum many-body systems in which time quasilattices develop rigidity via the interaction of many degrees of freedom, thus constituting dissi- pative discrete ‘time quasicrystals’. Copyright F. Flicker. Received 30-10-2017 This work is licensed under the Creative Commons Accepted 15-06-2018 Check for Attribution 4.0 International License. Published 03-07-2018 updates Published
    [Show full text]
  • Arxiv:2005.03138V2 [Cond-Mat.Quant-Gas] 23 May 2020 Contents
    Condensed Matter Physics in Time Crystals Lingzhen Guo1 and Pengfei Liang2;3 1Max Planck Institute for the Science of Light (MPL), Staudtstrasse 2, 91058 Erlangen, Germany 2Beijing Computational Science Research Center, 100193 Beijing, China 3Abdus Salam ICTP, Strada Costiera 11, I-34151 Trieste, Italy E-mail: [email protected] Abstract. Time crystals are physical systems whose time translation symmetry is spontaneously broken. Although the spontaneous breaking of continuous time- translation symmetry in static systems is proved impossible for the equilibrium state, the discrete time-translation symmetry in periodically driven (Floquet) systems is allowed to be spontaneously broken, resulting in the so-called Floquet or discrete time crystals. While most works so far searching for time crystals focus on the symmetry breaking process and the possible stabilising mechanisms, the many-body physics from the interplay of symmetry-broken states, which we call the condensed matter physics in time crystals, is not fully explored yet. This review aims to summarise the very preliminary results in this new research field with an analogous structure of condensed matter theory in solids. The whole theory is built on a hidden symmetry in time crystals, i.e., the phase space lattice symmetry, which allows us to develop the band theory, topology and strongly correlated models in phase space lattice. In the end, we outline the possible topics and directions for the future research. arXiv:2005.03138v2 [cond-mat.quant-gas] 23 May 2020 Contents 1 Brief introduction to time crystals3 1.1 Wilczek's time crystal . .3 1.2 No-go theorem . .3 1.3 Discrete time-translation symmetry breaking .
    [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]
  • Creating Big Time Crystals with Ultracold Atoms
    New J. Phys. 22 (2020) 085004 https://doi.org/10.1088/1367-2630/aba3e6 PAPER Creating big time crystals with ultracold atoms OPEN ACCESS Krzysztof Giergiel1,TienTran2, Ali Zaheer2,ArpanaSingh2,AndreiSidorov2,Krzysztof RECEIVED 1 2 1 April 2020 Sacha and Peter Hannaford 1 Instytut Fizyki Teoretycznej, Universytet Jagiellonski, ulica Profesora Stanislawa Lojasiewicza 11, PL-30-348 Krakow, Poland REVISED 2 23 June 2020 Optical Sciences Centre, Swinburne University of Technology, Hawthorn, Victoria 3122, Australia ACCEPTED FOR PUBLICATION E-mail: [email protected] and [email protected] 8 July 2020 PUBLISHED Keywords: time crystals, Bose–Einstein condensate, ultracold atoms 17 August 2020 Original content from Abstract this work may be used under the terms of the We investigate the size of discrete time crystals s (ratio of response period to driving period) that Creative Commons Attribution 4.0 licence. can be created for a Bose–Einstein condensate (BEC) bouncing resonantly on an oscillating Any further distribution mirror. We find that time crystals can be created with sizes in the range s ≈ 20–100 and that such of this work must maintain attribution to big time crystals are easier to realize experimentally than a period-doubling (s=2) time crystal the author(s) and the because they require either a larger drop height or a smaller number of bounces on the mirror. We title of the work, journal citation and DOI. also investigate the effects of having a realistic soft Gaussian potential mirror for the bouncing BEC, such as that produced by a repulsive light-sheet, which is found to make the experiment easier to implement than a hard-wall potential mirror.
    [Show full text]
  • Quantum State Complexity in Computationally Tractable Quantum Circuits
    PRX QUANTUM 2, 010329 (2021) Quantum State Complexity in Computationally Tractable Quantum Circuits Jason Iaconis * Department of Physics and Center for Theory of Quantum Matter, University of Colorado, Boulder, Colorado 80309, USA (Received 28 September 2020; revised 29 December 2020; accepted 26 January 2021; published 23 February 2021) Characterizing the quantum complexity of local random quantum circuits is a very deep problem with implications to the seemingly disparate fields of quantum information theory, quantum many-body physics, and high-energy physics. While our theoretical understanding of these systems has progressed in recent years, numerical approaches for studying these models remains severely limited. In this paper, we discuss a special class of numerically tractable quantum circuits, known as quantum automaton circuits, which may be particularly well suited for this task. These are circuits that preserve the computational basis, yet can produce highly entangled output wave functions. Using ideas from quantum complexity theory, especially those concerning unitary designs, we argue that automaton wave functions have high quantum state complexity. We look at a wide variety of metrics, including measurements of the output bit-string distribution and characterization of the generalized entanglement properties of the quantum state, and find that automaton wave functions closely approximate the behavior of fully Haar random states. In addition to this, we identify the generalized out-of-time ordered 2k-point correlation functions as a particularly use- ful probe of complexity in automaton circuits. Using these correlators, we are able to numerically study the growth of complexity well beyond the scrambling time for very large systems. As a result, we are able to present evidence of a linear growth of design complexity in local quantum circuits, consistent with conjectures from quantum information theory.
    [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]
  • Arxiv:2007.08348V3
    Dynamical transitions and critical behavior between discrete time crystal phases 1 1,2, Xiaoqin Yang and Zi Cai ∗ 1Wilczek Quantum Center and Key Laboratory of Artificial Structures and Quantum Control, School of Physics and Astronomy, Shanghai Jiao Tong University, Shanghai 200240, China 2Shanghai Research Center for Quantum Sciences, Shanghai 201315, China In equilibrium physics, spontaneous symmetry breaking and elementary excitation are two con- cepts closely related with each other: the symmetry and its spontaneous breaking not only control the dynamics and spectrum of elementary excitations, but also determine their underlying struc- tures. In this paper, based on an exactly solvable model, we propose a phase ramping protocol to study an excitation-like behavior of a non-equilibrium quantum matter: a discrete time crystal phase with spontaneous temporal translational symmetry breaking. It is shown that slow ramp- ing could induce a dynamical transition between two Z2 symmetry breaking time crystal phases in time domain, which can be considered as a temporal analogue of the soliton excitation spacially sandwiched by two degenerate charge density wave states in polyacetylene. By tuning the ramping rate, we observe a critical value at which point the transition duration diverges, resembling the critical slowing down phenomenon in nonequilibrium statistic physics. We also discuss the effect of stochastic sequences of such phase ramping processes and its implication to the stability of the discrete time crystal phase against noisy perturbations. Usually, the ground state energy of an equilibrium sys- question is how to generalize such an idea into the non- tem does not have much to do with its observable behav- equilibirum quantum matters with intriguing SSB absent ior.
    [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]
  • Quantum Computation and Complexity Theory
    Quantum computation and complexity theory Course given at the Institut fÈurInformationssysteme, Abteilung fÈurDatenbanken und Expertensysteme, University of Technology Vienna, Wintersemester 1994/95 K. Svozil Institut fÈur Theoretische Physik University of Technology Vienna Wiedner Hauptstraûe 8-10/136 A-1040 Vienna, Austria e-mail: [email protected] December 5, 1994 qct.tex Abstract The Hilbert space formalism of quantum mechanics is reviewed with emphasis on applicationsto quantum computing. Standardinterferomeric techniques are used to construct a physical device capable of universal quantum computation. Some consequences for recursion theory and complexity theory are discussed. hep-th/9412047 06 Dec 94 1 Contents 1 The Quantum of action 3 2 Quantum mechanics for the computer scientist 7 2.1 Hilbert space quantum mechanics ..................... 7 2.2 From single to multiple quanta Ð ªsecondº ®eld quantization ...... 15 2.3 Quantum interference ............................ 17 2.4 Hilbert lattices and quantum logic ..................... 22 2.5 Partial algebras ............................... 24 3 Quantum information theory 25 3.1 Information is physical ........................... 25 3.2 Copying and cloning of qbits ........................ 25 3.3 Context dependence of qbits ........................ 26 3.4 Classical versus quantum tautologies .................... 27 4 Elements of quantum computatability and complexity theory 28 4.1 Universal quantum computers ....................... 30 4.2 Universal quantum networks ........................ 31 4.3 Quantum recursion theory ......................... 35 4.4 Factoring .................................. 36 4.5 Travelling salesman ............................. 36 4.6 Will the strong Church-Turing thesis survive? ............... 37 Appendix 39 A Hilbert space 39 B Fundamental constants of physics and their relations 42 B.1 Fundamental constants of physics ..................... 42 B.2 Conversion tables .............................. 43 B.3 Electromagnetic radiation and other wave phenomena .........
    [Show full text]
  • Quantum Inductive Learning and Quantum Logic Synthesis
    Portland State University PDXScholar Dissertations and Theses Dissertations and Theses 2009 Quantum Inductive Learning and Quantum Logic Synthesis Martin Lukac Portland State University Follow this and additional works at: https://pdxscholar.library.pdx.edu/open_access_etds Part of the Electrical and Computer Engineering Commons Let us know how access to this document benefits ou.y Recommended Citation Lukac, Martin, "Quantum Inductive Learning and Quantum Logic Synthesis" (2009). Dissertations and Theses. Paper 2319. https://doi.org/10.15760/etd.2316 This Dissertation is brought to you for free and open access. It has been accepted for inclusion in Dissertations and Theses by an authorized administrator of PDXScholar. For more information, please contact [email protected]. QUANTUM INDUCTIVE LEARNING AND QUANTUM LOGIC SYNTHESIS by MARTIN LUKAC A dissertation submitted in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY in ELECTRICAL AND COMPUTER ENGINEERING. Portland State University 2009 DISSERTATION APPROVAL The abstract and dissertation of Martin Lukac for the Doctor of Philosophy in Electrical and Computer Engineering were presented January 9, 2009, and accepted by the dissertation committee and the doctoral program. COMMITTEE APPROVALS: Irek Perkowski, Chair GarrisoH-Xireenwood -George ^Lendaris 5artM ?teven Bleiler Representative of the Office of Graduate Studies DOCTORAL PROGRAM APPROVAL: Malgorza /ska-Jeske7~Director Electrical Computer Engineering Ph.D. Program ABSTRACT An abstract of the dissertation of Martin Lukac for the Doctor of Philosophy in Electrical and Computer Engineering presented January 9, 2009. Title: Quantum Inductive Learning and Quantum Logic Synhesis Since Quantum Computer is almost realizable on large scale and Quantum Technology is one of the main solutions to the Moore Limit, Quantum Logic Synthesis (QLS) has become a required theory and tool for designing Quantum Logic Circuits.
    [Show full text]
  • Bohmian Mechanics Versus Madelung Quantum Hydrodynamics
    Ann. Univ. Sofia, Fac. Phys. Special Edition (2012) 112-119 [arXiv 0904.0723] Bohmian mechanics versus Madelung quantum hydrodynamics Roumen Tsekov Department of Physical Chemistry, University of Sofia, 1164 Sofia, Bulgaria It is shown that the Bohmian mechanics and the Madelung quantum hy- drodynamics are different theories and the latter is a better ontological interpre- tation of quantum mechanics. A new stochastic interpretation of quantum me- chanics is proposed, which is the background of the Madelung quantum hydro- dynamics. Its relation to the complex mechanics is also explored. A new complex hydrodynamics is proposed, which eliminates completely the Bohm quantum po- tential. It describes the quantum evolution of the probability density by a con- vective diffusion with imaginary transport coefficients. The Copenhagen interpretation of quantum mechanics is guilty for the quantum mys- tery and many strange phenomena such as the Schrödinger cat, parallel quantum and classical worlds, wave-particle duality, decoherence, etc. Many scientists have tried, however, to put the quantum mechanics back on ontological foundations. For instance, Bohm [1] proposed an al- ternative interpretation of quantum mechanics, which is able to overcome some puzzles of the Copenhagen interpretation. He developed further the de Broglie pilot-wave theory and, for this reason, the Bohmian mechanics is also known as the de Broglie-Bohm theory. At the time of inception of quantum mechanics Madelung [2] has demonstrated that the Schrödinger equa- tion can be transformed in hydrodynamic form. This so-called Madelung quantum hydrodynam- ics is a less elaborated theory and usually considered as a precursor of the Bohmian mechanics. The scope of the present paper is to show that these two theories are different and the Made- lung hydrodynamics is a better interpretation of quantum mechanics than the Bohmian me- chanics.
    [Show full text]
  • Q# Introduction
    Introduction to Q# Q# (Q-sharp) is a domain-specific and open-sourced programming language, part of Microsoft's Quantum Development Kit (QDK), used for expressing quantum algorithms. It is to be used for writing subroutines that execute on an adjunct quantum processing unit (QPU), under the control of a classical host program and computer. Q# can be installed on Windows 10, OSX and Linux. The instructions to install Q# can be found in the online documentation here. If you prefer not to install Q# on your local computer, you can use one of the machines in CSE’s Virtual Lab found here. The Windows 10 machines already have .Net Core SDK, Visual Studio and VS Code installed to get your started, you should still install the Q# extension to get syntax- highlighting, code complete, etc. To get help with Q# and the QDK, feel free to ask questions on our messages board, come to office hours as posted on the calendar, or ask in stackoverflow. The Q# team is constantly monitoring any questions posted there with the "q#" tag. Writing Q# programs. Operations and functions are the basic unit of execution in Q#. They are roughly equivalent to a function in C or C++ or Python, or a static method in C# or Java. A Q# operation is a quantum subroutine. That is, it is a callable routine that contains quantum operations. A Q# function is a classical subroutine used within a quantum algorithm. It may contain classical code but no quantum operations. Specifically, functions may not allocate or borrow qubits, nor may they call operations.
    [Show full text]