Quantum Computation with Bose-Einstein Condensation and. Capable of Solving NP-Complete and #P Problems. Abstract
|
|
|
- Drusilla Hart
- 10 years ago
- Views:
Transcription
1 Quantum Computation with Bose-Einstein Condensation and Capable of Solving NP-Complete and #P Problems Yu Shi Cavendish Laboratory, University of Cambridge, Cambridge CB3 0HE, United Kingdom Abstract It is proposed that quantum computation can be implemented on the basis of macroscopic quantum coherence of a many-body system, especially the Bose- Einstein condensation. Since a Bose-Einstein condensate is described by a non-linear Schrödinger equation, and the non-linearity is tunable, in principle one may build a quantum computer composed of both linear and non-linear gates. Consequently NP-complete and #P problems can be solved. This idea is illustrated by representing the qubit as the atomic Bose-Einstein condensate trapped in a double-well potential. PACS numbers: Lx,03.75.Fi 1 Typeset using REVTEX
2 Because of quantum parallelism of many branches superposing a quantum state, a quantum computer is much more efficient than a classical computer in solving certain problems [1,2]. Experimental implementations are pursued or proposed in various physical systems [3 8]. Nevertheless, whether quantum computer, based on linear quantum mechanics, can solve all problems in class NP was shown to be unlikely to be resolved without a major breakthrough in complexity theory [9]. It was found that supplemented by nonlinear quantum gates, quantum computer can solve in polynomial time NP-complete and #P problems [10]. However, up to now it largely remained as an academic interest since elementary quantum mechanics is accurately confirmed to be linear. Here we point out that this problem can be turned to be a practicality by exploiting macroscopic quantum coherence. Because of the spontaneous gauge symmetry breaking, a Bose-Einstein condensate is described by aschrödinger equation which may be non-linear. This non-linearity is due to interaction between the bosons composing the condensate. As an emergent entity, a Bose-Einstein condensate can represent a qubit as far as a two-state system is constructed for it. Hence one may build a quantum computer consisting of both linear and non-linear gates. We illustrate this idea by using atomic Bose-Einstein condensate trapped in a double-well potential. In most of the experimental implementations of quantum computation up to now, a qubit is represented by a single or a few particles. But representing qubits in terms of macroscopic quantum coherence of a many-body system, such as superconducting state or Bose-Einstein condensation, may have various advantages, including the simplification of the operations, easier manipulation, and being robust against some microscopic details and thus reduces errors. While quantum computation based on Josephson-junction [7] involves superconducting states, atomic Bose-Einstein condensates are more controllable at present day. The class of NP-complete problems is a foundation of the computational complexity theory. This unfortunately includes thousands of practically interesting problems, such as travelling salesman, satisfiability, etc. NP stands for non-deterministic polynomial time. NP-complete problems are those for which a potential solution can be verified in polynomial 2
3 time, yet finding a solution appears to require exponential time in the worst case. The completeness means that if an efficient, i.e. polynomial-time, algorithm could be found for solving one of these problems, one would immediately have an efficient algorithm for all NP-complete problems. A fundamental conjecture in classical computation is that no such efficient algorithm exists. Abrams and Lloyd found that together with both linear and nonlinear gates, a quantum computer can solve NP-complete problem by efficiently determining if there exists an x for which f(x) = 1, and can solve #P problems (including oracle problems) by efficiently determining the number of solutions [10]. However, it is an experimental fact that elementary quantum mechanics is linear to the available accuracy [11], while nonlinear elementary quantum theory [12] usually violates the second law of thermodynamics [13] and the theory of relativity [14]. On the other hand, their algorithm requires both linear and nonlinear operations, hence this requirement would not be satisfied as well by a nonlinear elementary quantum theory, which would exclude linear operation. We will show that a quantum computer composed of both linear and non-linear gates can be constructed based on macroscopic wavefunction, or spontaneous gauge symmetry breaking [15], because non-linearity can be tuned in this case. For a Bose gas consisting of many bosons, one can define a boson field operator ˆψ(r) = kâku k,wherekis the momentum, â k is the annihilation operator, u k is the single particle wavefunction. Because of Bose-Einstein statistics, at a low temperature, there may be a finite density of bosons in the zero-momentum (k = 0) state. It is known that a general criterion for Bose-Einstein condensation is [16] ˆψ (x) ˆψ(y) ψ(x) ψ(y),for x y, (1) where ψ(x) = Φ(x) 0 is the macroscopic wavefunction of the condensate, is thermal average. Broken gauge symmetry refers to the fact that when the condensate wavefunction is nonzero, the ground state depends on its phase, although the original many-particle Hamiltonian is invariant under a global (constant) phase change of ˆψ(r) [15,16]. The manybody Hamiltonian is 3
4 H = dr ˆψ (r)[ h2 2 2m + V (r)] ˆψ(r)+ 1 2 drdr r ˆψ (r) ˆψ (r r )U(r r ) ˆψ(r r ) ˆψ(r), (2) where m is the mass of the boson, V (r) is the external potential, i.e. the trapping potential in case of the trapped atoms. The macroscopic wavefunction of the condensate Φ(r) is governed by a nonlinear Schrödinger equation, known as Gross-Pitaevskii equation: i h Φ(r,t) t =( h2 2 2m +V(r)+g Φ(r,t) 2 )Φ(r,t), (3) where g = dru(r) =4π h 2 a/m, a is the s-wave scattering length of a binary collision. The origin of the nonlinearity is the mean-field interaction energy between individual bosons. Therefore although the underlying fundamental quantum mechanics is linear, the macroscopic wavefunction of the Bose-Einstein condensate, as an emergent entity, isgovernedby the Gross-Pitaevskii equation. The main purpose of this letter is to point out the idea that this can be exploited to do quantum computation. The details below only serve as examples; there may be alternative schemes. The algorithm given by Abram and Lloyd is based on the usual linear gates together with a one-bit nonlinear gate, whose repeated application drives nearby states apart exponentially rapidly; or two one-bit nonlinear gates, one of which maps both 0 and 1 to 0, while the other maps x 0 + y 1 (for given x and y) to 0. By using many different Bose-Einstein condensates, each of which represents a qubit, we may build a quantum computer. Recently it was demonstrated experimentally by Ketterle s group at Massachusetts Institute of Technology that the nonlinearity in the Gross-Pitaevskii equation, i.e. the inter-atom interactions, can be tuned [17]. Therefore we can build both linear and nonlinear gates in terms of Bose-Einstein condensates. To represent the qubit, we need to construct a two-state system for each individual condensate. One way is to use a Mexican-hat-like symmetric double-well trapping potential V (r) (FIG. 1), which was formed in the experiments [18]. The tunneling effect of the condensate has been investigated theoretically by numerous authors [19], and the work of Milburn et al. [20] is directly relevant to our situation. We may represent 0 as the localised 4
5 state at one of the two wells, 1 as that at the other. Thus 0 = φ 0 (r) =v(r r 0 ), 1 = φ 1 (r) =v(r r 1 ), where v(r r i )(i=0,1) is the ground state for the local potential at the vicinity of the minimum of the the well i, which may be a parabolic one Ṽ (2) (r r i ). Note that because of the finiteness of the barrier in the double-well, 0 and 1 are not strictly orthogonal, but can be very nearly so, i.e = ɛ<<1. A general qubit n(t) is the superposition of 0 and 1, i.e. n(t) = c 0 (t) 0 + c 1 (t) 1, c 0 (t) and can be represented as a matrix. In this case, the Gross-Pitaevskii equation c 1 (t) can be transformed to a two-component equation: i h t n(t) =[EÎ+Ωσ x +κî C 0 2 ] n(t), (4) C where σ x = is the Pauli matrix, Ω = drφ 0 (r)[v(r) Ṽ(r r 0 ]φ 1 (r) represents 10 the tunneling effect, κ = g dr φ 0 (r) 4, E is the ground state energy of each local potential near the vicinity of the minimum of the well, corresponding to v(r r i ). When the inter-atom interaction is turned off, κ = 0, Eq.(4) leads to an arbitrary one-bit unitary transformation, depending on the time span τ: n(τ) exp[ i(eî Ωσ x )τ/ h] n(0). Therefore we can build 1-bit linear gates. When the inter-atom interaction turned on, we have κ 0 in Eq. (4), which represents a twisting rotation in the state space spanned by 0 and 1. By choosing appropriate time span, this can be exploited to build the nonlinear 1-bit gates which are needed. To have a 2-bit linear gate, we need to introduce a coupling between two condensates, both without inter-atom interactions. This may be done by using dipole-dipole interaction between the two condensates. We may put together two double wells, each of which confines a condensate. We let wells close to each other in a face-to-face way, i.e., 0 1 is close to 0 2,and 1 1 is close to 1 2. If the condensates are trapped in optical traps, they have parallel electric dipole moments. If they are trapped in magnetic traps, they have parallel magnetic moments. In either case, because of the repulsion interaction between the electric 5
6 dipole moments or magnetic moments, the two condensates tend to move apart, i.e. the states and are more favorable than and Therefore the total Hamiltonian of the two-bit system is Ĥ = E 1 +Ω 1 σ 1 x +E2 +Ω 2 σ 2 x +Jσ1 z σ2 z, (5) 1 0 where σ z =. For generality, we have distinguished E and Ω between the two 0 1 double-wells, of course they may be respectively equal. Depending on the time span, and combined with the 1-bit linear operation, one can generate a universal 2-bit linear gate, which can further compose any required linear gate. Alternatively the one-bit and two-bit operations controlled by Eq. (4), with κ = 0, and Eq. (5) can provide any required linear gate. So far we have outlined the basic scheme of building a quantum computer capable of solving NP-complete and #P problem, by using Bose-Einstein condensates in double-wells. The two-state system of a condensate may also be provided by the internal hyperfine states, represented as 0 and 1. A general qubit is then m(t) = b b 1 1 =. b 0 (t). b 1 (t) Without coupling between the internal and spatial degrees of freedom, coupling the internal states with an electromagnetic field leads to [21] i h t m(t) =[ h 2 ωσ x + h 2 δσ z] m(t), (6) where ω is the Rabi frequency, δ is the detuning. The 2-bit gates may be built by using a method similar to that for the trapped ions [3]. A satisfactory way of introducing the nonlinearity is not clear, maybe an effective nonlinearity for the evolution of internal state could be constructed by using the coupling with the spatial degree of freedom. But further investigation is needed to see whether this coupling is an advantage or a disadvantage. To summarize, I suggest using macroscopic quantum coherence, especially the Bose- Einstein condensation, to do quantum computation. The condensate, as an emergent entity, is described by a non-linear Schödinger equation, and the non-linearity is tunable. Therefore 6
7 in principle one can build a quantum computer composed of both linear and non-linear gates, consequently the NP-complete and #P problems can be solved. The qubit, i.e. the two-state system of a condensate, may be constructed based on the condensate trapped in a double-well potential. One may also exploit the internal hyperfine states of a condensate to construct a qubit, but further investigation is needed to see whether this is feasible. While detailed implementation remains to be explored, the general idea of using macroscopic quantum coherence to do quantum computation, including non-linear operation, may well be turned to a reality with the rapid advance of technique of manipulating the atomic Bose-Einstein condensation. I thank S. L. Braunstein and S. Lloyd for discussions. 7
8 FIGURES FIG. 1. A qubit: a Bose-Einstein condensate trapped in a double-well potential. 0 is represented by the localized state at one well, while 1 is that at the other well. 8
9 REFERENCES [1] P. Shor, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, edited by S. Goldwasser (IEEE Computer Society, Los Alamos, CA, 1994), p [2] For reviews, see, e.g., C. H. Bennett, Phys. Today 48(10), 24 (1995); D. P. DiVincenzo, Science 269, 255 (1995); S. Lloyd, Sci. Am. 273(4), 140 (1995); A. Steane, Rep. Prog. Phys. 61, 117 (1998). [3]J.I.CiracandP.Zoller,Phys.Rev.Lett.74, 4091 (1995). [4] B. E. King et al. Phys. Rev. Lett. 81, 1525 (1998); H.-J. Briegel et al., quantph/ ; [5] I. L. Chuang, N. A. Gershenfeld and R. H. Hansen, Phys. Rev. Lett. 80, 3408 (1998); D. G. Cory et al. Phys. Rev. Lett. 81, 2152 (1998); J. A. Jones, M. Mosca and R. H. Hansen, Nature 393, 344 (1998). [6] Q. A. Turchetteet al. Phys. Rev. Lett. 75, 4710 (1995). [7] A. Shnirman, G. Schön and Z. Hermon, Phys. Rev. Lett. 79, 2371 (1997); D. V. Averin, Solid State Commun. 105, 659 (1998). V. Bouchiat et al. Phys. Scripta T 6, 165 (1998); A. Shnirman, G. Schön and A. Shnirman, Nature 398, 305 (1999); L. B. Ioffe it et al. Nature 398, 679 (1999); J. E. Mooij et al. Science 285, 1036 (1999). [8] D. Loss and D. P. DiVincenco, Phys. Rev. A 57, 3457 (1997); B. E. Kane, Nature 393, 133 (1998). [9]C.H.Bennettet al., SIAM Journal of Computing (1997). [10] D. S. Abrams and S. Lloyd, Phys. Rev. Lett. 81, 3992 (1998). [11] P. K. Majumder et al., Phys. Rev. Lett. 65, 2931 (1990); R. L. Walsworth et al., Phys. 9
10 Rev. Lett. 64, 2599 (1990); T. E. Chupp and R. J. Hoare, Phys. Rev. Lett. 64, (1990); J. J. Bollinger et al., Phys. Rev. Lett. 63, 1031 (1989). [12] S. Weinberg, Phys. Rev. Lett. 62, 485 (1989); Ann. Phys. (N.Y.) 194, 336 (1989). [13] A. Peres, Phys. Rev. Lett. 63, 1114 (1989). [14] N. Gisin, Phys. Lett. A 113, 1 (1990); J. Polchinski, Phys. Rev. Lett. 66, 397 (1991). [15] P. W. Anderson, Basic Notions of Condensed Matter Physics (Addison-Wesley, Reading, MA, 1984). [16] K. Huang, Bose-Einstein Condensation, edited by A. Griffin, D. W. Snoke and S. Stringari (Cambridge University Press, Camridge, 1995) P.31; A. J. Leggett, ibid, p [17]Y.Castin,R.DumandA.Sinatra,Phys. World 12(8), 37 (1999). [18] K. B. Davis et al., Phys. Rev. Lett (1995); M. R. Andrews, Science 275, 637 (1997). [19] For reviews, see A. S. Parkins and D. F. Walls, Phys. Rep. 303, 1 (1998); F. Dalfovo et al., Rev.Mod.Phys (1999). [20] G. J. Milburn et al., Phys.Rev.A55, 4318 (1997). [21] J. Williams et al., cond-mat/
How To Solve An Npa-Complete Problems With Quantum Computing And Chaotic Dynamics
CDMTCS Research Report Series A New Quantum Algorithm for NP-complete Problems Masanori Ohya Igor V. Volovich Science University of Tokyo Steklov Mathematical Institute CDMTCS-194 September 00 Centre for
Introduction to Quantum Computing
Introduction to Quantum Computing Javier Enciso [email protected] Joint Advanced Student School 009 Technische Universität München April, 009 Abstract In this paper, a gentle introduction to Quantum Computing
The Limits of Adiabatic Quantum Computation
The Limits of Adiabatic Quantum Computation Alper Sarikaya June 11, 2009 Presentation of work given on: Thesis and Presentation approved by: Date: Contents Abstract ii 1 Introduction to Quantum Computation
Quantum Computing and Grover s Algorithm
Quantum Computing and Grover s Algorithm Matthew Hayward January 14, 2015 1 Contents 1 Motivation for Study of Quantum Computing 3 1.1 A Killer App for Quantum Computing.............. 3 2 The Quantum Computer
Quantum Computing. Robert Sizemore
Quantum Computing Robert Sizemore Outline Introduction: What is quantum computing? What use is quantum computing? Overview of Quantum Systems Dirac notation & wave functions Two level systems Classical
Keywords Quantum logic gates, Quantum computing, Logic gate, Quantum computer
Volume 3 Issue 10 October 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Introduction
The Role of Electric Polarization in Nonlinear optics
The Role of Electric Polarization in Nonlinear optics Sumith Doluweera Department of Physics University of Cincinnati Cincinnati, Ohio 45221 Abstract Nonlinear optics became a very active field of research
arxiv:cond-mat/0308498v1 [cond-mat.soft] 25 Aug 2003
1 arxiv:cond-mat/38498v1 [cond-mat.soft] 2 Aug 23 Matter-wave interference, Josephson oscillation and its disruption in a Bose-Einstein condensate on an optical lattice Sadhan K. Adhikari Instituto de
Open Problems in Quantum Information Processing. John Watrous Department of Computer Science University of Calgary
Open Problems in Quantum Information Processing John Watrous Department of Computer Science University of Calgary #1 Open Problem Find new quantum algorithms. Existing algorithms: Shor s Algorithm (+ extensions)
"in recognition of the services he rendered to the advancement of Physics by his discovery of energy quanta". h is the Planck constant he called it
1 2 "in recognition of the services he rendered to the advancement of Physics by his discovery of energy quanta". h is the Planck constant he called it the quantum of action 3 Newton believed in the corpuscular
Physics 9e/Cutnell. correlated to the. College Board AP Physics 1 Course Objectives
Physics 9e/Cutnell correlated to the College Board AP Physics 1 Course Objectives Big Idea 1: Objects and systems have properties such as mass and charge. Systems may have internal structure. Enduring
Quantum Computing with NMR
Quantum Computing with NMR Sabine Keiber, Martin Krauÿ June 3, 2009 Sabine Keiber, Martin Krauÿ Quantum Computing with NMR June 3, 2009 1 / 46 1 A Short Introduction to NMR 2 Di Vincenzo's Requirements
Assessment Plan for Learning Outcomes for BA/BS in Physics
Department of Physics and Astronomy Goals and Learning Outcomes 1. Students know basic physics principles [BS, BA, MS] 1.1 Students can demonstrate an understanding of Newton s laws 1.2 Students can demonstrate
Theory of electrons and positrons
P AUL A. M. DIRAC Theory of electrons and positrons Nobel Lecture, December 12, 1933 Matter has been found by experimental physicists to be made up of small particles of various kinds, the particles of
MASTER OF SCIENCE IN PHYSICS MASTER OF SCIENCES IN PHYSICS (MS PHYS) (LIST OF COURSES BY SEMESTER, THESIS OPTION)
MASTER OF SCIENCE IN PHYSICS Admission Requirements 1. Possession of a BS degree from a reputable institution or, for non-physics majors, a GPA of 2.5 or better in at least 15 units in the following advanced
Classical and Quantum Logic Gates:
Classical and Quantum Logic Gates: An Introduction to Quantum Computing Quantum Information Seminar Friday, Sep. 3, 999 Ashok Muthukrishnan Rochester Center for Quantum Information (RCQI) I. Classical
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem arxiv:quant-ph/0104129v1 26 Apr 2001 Edward Farhi, Jeffrey Goldstone Center for Theoretical Physics, Massachusetts
Numerical analysis of Bose Einstein condensation in a three-dimensional harmonic oscillator potential
Numerical analysis of Bose Einstein condensation in a three-dimensional harmonic oscillator potential Martin Ligare Department of Physics, Bucknell University, Lewisburg, Pennsylvania 17837 Received 24
Bits Superposition Quantum Parallelism
7-Qubit Quantum Computer Typical Ion Oscillations in a Trap Bits Qubits vs Each qubit can represent both a or at the same time! This phenomenon is known as Superposition. It leads to Quantum Parallelism
A Quantum Full Adder for a. Scalable Nuclear Spin Quantum Computer
A Quantum Full Adder for a Scalable Nuclear Spin Quantum Computer G.P. Berman 1,G.D.Doolen 1, G.V. López 2, and V.I. Tsifrinovich 3 1 T-13 and CNLS, Los Alamos National Laboratory, Los Alamos, New Mexico
Computational complexity theory
Computational complexity theory Goal: A general theory of the resources needed to solve computational problems What types of resources? Time What types of computational problems? decision problem Decision
Quantum Monte Carlo and the negative sign problem
Quantum Monte Carlo and the negative sign problem or how to earn one million dollar Matthias Troyer, ETH Zürich Uwe-Jens Wiese, Universität Bern Complexity of many particle problems Classical 1 particle:
QUANTUM INFORMATION, COMPUTATION AND FUNDAMENTAL LIMITATION
Arun K. Pati Theoretical Physics Division QUANTUM INFORMATION, COMPUTATION AND FUNDAMENTAL LIMITATION Introduction Quantum information theory is a marriage between two scientific pillars of the twentieth
The Quantum Harmonic Oscillator Stephen Webb
The Quantum Harmonic Oscillator Stephen Webb The Importance of the Harmonic Oscillator The quantum harmonic oscillator holds a unique importance in quantum mechanics, as it is both one of the few problems
Quantum Computers. And How Does Nature Compute? Kenneth W. Regan 1 University at Buffalo (SUNY) 21 May, 2015. Quantum Computers
Quantum Computers And How Does Nature Compute? Kenneth W. Regan 1 University at Buffalo (SUNY) 21 May, 2015 1 Includes joint work with Amlan Chakrabarti, U. Calcutta If you were designing Nature, how would
Contents. Goldstone Bosons in 3He-A Soft Modes Dynamics and Lie Algebra of Group G:
... Vlll Contents 3. Textures and Supercurrents in Superfluid Phases of 3He 3.1. Textures, Gradient Energy and Rigidity 3.2. Why Superfuids are Superfluid 3.3. Superfluidity and Response to a Transverse
arxiv:quant-ph/9607009v1 11 Jul 1996
Distillability of Inseparable Quantum Systems Micha l Horodecki Department of Mathematics and Physics University of Gdańsk, 80 952 Gdańsk, Poland arxiv:quant-ph/9607009v1 11 Jul 1996 Pawe l Horodecki Faculty
arxiv:quant-ph/9809016 v2 19 Jan 2000
An Introduction to Quantum Computing for Non-Physicists arxiv:quant-ph/9809016 v 19 Jan 000 Eleanor Rieffel FX Palo Alto Labratory and Wolfgang Polak Consultant FX Palo Alto Laboratory, 3400 Hillview Avenue,
Introduction to computer science
Introduction to computer science Michael A. Nielsen University of Queensland Goals: 1. Introduce the notion of the computational complexity of a problem, and define the major computational complexity classes.
Perpetual motion and driven dynamics of a mobile impurity in a quantum fluid
and driven dynamics of a mobile impurity in a quantum fluid Oleg Lychkovskiy Russian Quantum Center Seminaire du LPTMS, 01.12.2015 Seminaire du LPTMS, 01.12.2015 1 / Plan of the talk 1 Perpetual motion
Quantum control of individual electron and nuclear spins in diamond lattice
Quantum control of individual electron and nuclear spins in diamond lattice Mikhail Lukin Physics Department, Harvard University Collaborators: L.Childress, M.Gurudev Dutt, J.Taylor, D.Chang, L.Jiang,A.Zibrov
Unamended Quantum Mechanics Rigorously Implies Awareness Is Not Based in the Physical Brain
Unamended Quantum Mechanics Rigorously Implies Awareness Is Not Based in the Physical Brain Casey Blood, PhD Professor Emeritus of Physics, Rutgers University www.quantummechanicsandreality.com [email protected]
230483 - QOT - Quantum Optical Technologies
Coordinating unit: Teaching unit: Academic year: Degree: ECTS credits: 2015 230 - ETSETB - Barcelona School of Telecommunications Engineering 739 - TSC - Department of Signal Theory and Communications
QUANTUM COMPUTER ELEMENTS BASED ON COUPLED QUANTUM WAVEGUIDES
Ó³ Ÿ. 2007.. 4, º 2(138).. 237Ä243 Š Œ œ ƒˆˆ ˆ ˆŠˆ QUANTUM COMPUTER ELEMENTS BASED ON COUPLED QUANTUM WAVEGUIDES M. I. Gavrilov, L. V. Gortinskaya, A. A. Pestov, I. Yu. Popov 1, E. S. Tesovskaya Department
Instability, dispersion management, and pattern formation in the superfluid flow of a BEC in a cylindrical waveguide
Instability, dispersion management, and pattern formation in the superfluid flow of a BEC in a cylindrical waveguide Michele Modugno LENS & Dipartimento di Fisica, Università di Firenze, Italy Workshop
Quantum Systems for Information Technology
Lecture Quantum Systems for Information Technology fall term (HS) 2010 Lecturer: e Andreas Wallraff office: HPF D 8/9, ETH Hoenggerberg email: [email protected] What is this lecture about? Quantum
NDSU Department of Physics. Graduate Student Handbook
NDSU Department of Physics Graduate Student Handbook Department of Physics North Dakota State University Fargo, ND 58108-6050 History Draft: August 24, 2014 Table of Contents 1. Contact 2 2. Graduate Program
Quantum Computing for Beginners: Building Qubits
Quantum Computing for Beginners: Building Qubits Suzanne Gildert Condensed Matter Physics Research (Quantum Devices Group) University of Birmingham 28/03/2007 Overview of this presentation What is a Qubit?
DISTANCE DEGREE PROGRAM CURRICULUM NOTE:
Bachelor of Science in Electrical Engineering DISTANCE DEGREE PROGRAM CURRICULUM NOTE: Some Courses May Not Be Offered At A Distance Every Semester. Chem 121C General Chemistry I 3 Credits Online Fall
PHYS 1624 University Physics I. PHYS 2644 University Physics II
PHYS 1624 Physics I An introduction to mechanics, heat, and wave motion. This is a calculus- based course for Scientists and Engineers. 4 hours (3 lecture/3 lab) Prerequisites: Credit for MATH 2413 (Calculus
European Benchmark for Physics Bachelor Degree
European Benchmark for Physics Bachelor Degree 1. Summary This is a proposal to produce a common European Benchmark framework for Bachelor degrees in Physics. The purpose is to help implement the common
Analysis of Electromagnetic Propulsion on a Two-Electric-Dipole System
Electronics and Communications in Japan, Part 2, Vol. 83, No. 4, 2000 Translated from Denshi Joho Tsushin Gakkai Ronbunshi, Vol. J82-C-I, No. 6, June 1999, pp. 310 317 Analysis of Electromagnetic Propulsion
What is Nanophysics: Survey of Course Topics. Branislav K. Nikolić
What is Nanophysics: Survey of Course Topics Branislav K. Nikolić Department of Physics and Astronomy, University of Delaware, Newark, DE 19716, U.S.A. http://wiki.physics.udel.edu/phys824 Definition of
The Physics Degree. Graduate Skills Base and the Core of Physics
The Physics Degree Graduate Skills Base and the Core of Physics Version date: September 2011 THE PHYSICS DEGREE This document details the skills and achievements that graduates of accredited degree programmes
Computer Algorithms. NP-Complete Problems. CISC 4080 Yanjun Li
Computer Algorithms NP-Complete Problems NP-completeness The quest for efficient algorithms is about finding clever ways to bypass the process of exhaustive search, using clues from the input in order
Online Courses for High School Students 1-888-972-6237
Online Courses for High School Students 1-888-972-6237 PHYSICS Course Description: This course provides a comprehensive survey of all key areas: physical systems, measurement, kinematics, dynamics, momentum,
Infrared Spectroscopy: Theory
u Chapter 15 Infrared Spectroscopy: Theory An important tool of the organic chemist is Infrared Spectroscopy, or IR. IR spectra are acquired on a special instrument, called an IR spectrometer. IR is used
Université Lille 1 Sciences et Technologies, Lille, France Lille Laboratoire de Physique des Lasers, Atomes et Molécules Équipe Chaos Quantique
Université Lille 1 Sciences et Technologies, Lille, France Lille Laboratoire de Physique des Lasers, Atomes et Molécules Équipe Chaos Quantique FRISNO 11 Aussois 1/4/011 Quantum simulators: The Anderson
A Recent Improvements in Quantum Model and Counter Measures in Quantum Computing
A Recent Improvements in Quantum Model and Counter Measures in Quantum Computing J.Senthil Murugan 1, V.Parthasarathy 2, S.Sathya 3, M.Anand 4 Assistant Professor, VelTech HighTech Dr.Rangarajan Dr.Sakunthala
Quantum Computers vs. Computers Security. @veorq http://aumasson.jp
Quantum Computers vs. Computers Security @veorq http://aumasson.jp Schrodinger equation Entanglement Bell states EPR pairs Wave functions Uncertainty principle Tensor products Unitary matrices Hilbert
Particle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 7 : Symmetries and the Quark Model. Introduction/Aims
Particle Physics Michaelmas Term 2011 Prof Mark Thomson Handout 7 : Symmetries and the Quark Model Prof. M.A. Thomson Michaelmas 2011 206 Introduction/Aims Symmetries play a central role in particle physics;
Quantum Computing Architectures
Quantum Computing Architectures 1:-2: Fred Chong (UCD) - Intro, quantum algorithms, and error correction 2:-2:3 Break and discussion 2:3-3:3 Ike Chuang (MIT) - Device technology and implementation issues
Lecture 1 Version: 14/08/28. Frontiers of Condensed Matter San Sebastian, Aug. 28-30, 2014. Dr. Leo DiCarlo [email protected] dicarlolab.tudelft.
Introduction to quantum computing (with superconducting circuits) Lecture 1 Version: 14/08/28 Frontiers of Condensed Matter San Sebastian, Aug. 28-30, 2014 Dr. Leo DiCarlo [email protected] dicarlolab.tudelft.nl
Generally Covariant Quantum Mechanics
Chapter 15 Generally Covariant Quantum Mechanics by Myron W. Evans, Alpha Foundation s Institutute for Advance Study (AIAS). ([email protected], www.aias.us, www.atomicprecision.com) Dedicated to the Late
Applications of Quantum Chemistry HΨ = EΨ
Applications of Quantum Chemistry HΨ = EΨ Areas of Application Explaining observed phenomena (e.g., spectroscopy) Simulation and modeling: make predictions New techniques/devices use special quantum properties
The New Approach of Quantum Cryptography in Network Security
The New Approach of Quantum Cryptography in Network Security Avanindra Kumar Lal 1, Anju Rani 2, Dr. Shalini Sharma 3 (Avanindra kumar) Abstract There are multiple encryption techniques at present time
NMR and IR spectra & vibrational analysis
Lab 5: NMR and IR spectra & vibrational analysis A brief theoretical background 1 Some of the available chemical quantum methods for calculating NMR chemical shifts are based on the Hartree-Fock self-consistent
Quantum Machine Learning Algorithms: Read the Fine Print
Quantum Machine Learning Algorithms: Read the Fine Print Scott Aaronson For twenty years, quantum computing has been catnip to science journalists. Not only would a quantum computer harness the notorious
Quantum Algorithms in NMR Experiments. 25 th May 2012 Ling LIN & Michael Loretz
Quantum Algorithms in NMR Experiments 25 th May 2012 Ling LIN & Michael Loretz Contents 1. Introduction 2. Shor s algorithm 3. NMR quantum computer Nuclear spin qubits in a molecule NMR principles 4. Implementing
Electric Dipole moments as probes of physics beyond the Standard Model
Electric Dipole moments as probes of physics beyond the Standard Model K. V. P. Latha Non-Accelerator Particle Physics Group Indian Institute of Astrophysics Plan of the Talk Parity (P) and Time-reversal
Université Lille 1 Sciences et Technologies, Lille, France Laboratoire de Physique des Lasers, Atomes et Molécules Équipe Chaos Quantique
Université Lille 1 Sciences et Technologies, Lille, France Laboratoire de Physique des Lasers, Atomes et Molécules Équipe Chaos Quantique 16 years of experiments on the atomic kicked rotor! Chaos, disorder
P versus NP, and More
1 P versus NP, and More Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 If you have tried to solve a crossword puzzle, you know that it is much harder to solve it than to verify
- particle with kinetic energy E strikes a barrier with height U 0 > E and width L. - classically the particle cannot overcome the barrier
Tunnel Effect: - particle with kinetic energy E strikes a barrier with height U 0 > E and width L - classically the particle cannot overcome the barrier - quantum mechanically the particle can penetrated
Three Pictures of Quantum Mechanics. Thomas R. Shafer April 17, 2009
Three Pictures of Quantum Mechanics Thomas R. Shafer April 17, 2009 Outline of the Talk Brief review of (or introduction to) quantum mechanics. 3 different viewpoints on calculation. Schrödinger, Heisenberg,
Quantum Computability and Complexity and the Limits of Quantum Computation
Quantum Computability and Complexity and the Limits of Quantum Computation Eric Benjamin, Kenny Huang, Amir Kamil, Jimmy Kittiyachavalit University of California, Berkeley December 7, 2003 This paper will
Numerical Model for the Study of the Velocity Dependence Of the Ionisation Growth in Gas Discharge Plasma
Journal of Basrah Researches ((Sciences)) Volume 37.Number 5.A ((2011)) Available online at: www.basra-science -journal.org ISSN 1817 2695 Numerical Model for the Study of the Velocity Dependence Of the
Universality in the theory of algorithms and computer science
Universality in the theory of algorithms and computer science Alexander Shen Computational models The notion of computable function was introduced in 1930ies. Simplifying (a rather interesting and puzzling)
Solving NP-Hard Problems on an Adiabatic Quantum Computer. Dan Padilha [email protected]
UNSW AUSTRALIA SCHOOL OF MECHANICAL AND MANUFACTURING ENGINEERING Solving NP-Hard Problems on an Adiabatic Quantum Computer by Dan Padilha [email protected] Student ID: z3291677 Thesis submitted
Factoring by Quantum Computers
Factoring by Quantum Computers Ragesh Jaiswal University of California, San Diego A Quantum computer is a device that uses uantum phenomenon to perform a computation. A classical system follows a single
Darrick Chang ICFO The Institute of Photonic Sciences Barcelona, Spain. April 2, 2014
Darrick Chang ICFO The Institute of Photonic Sciences Barcelona, Spain April 2, 2014 ICFO The Institute of Photonic Sciences 10 minute walk 11 years old 22 Research Groups 300 people Research themes: Quantum
Bevezetés a kvantum-informatikába és kommunikációba 2014/2015 tavasz. Mérés, NCT, kvantumállapot. 2015. március 12.
Bevezetés a kvantum-informatikába és kommunikációba 2014/2015 tavasz Mérés, NCT, kvantumállapot 2015. március 12. Tegnap még összefonódtam, mára megmértek 2015.03.18. 2 Slides for Quantum Computing and
NMR for Physical and Biological Scientists Thomas C. Pochapsky and Susan Sondej Pochapsky Table of Contents
Preface Symbols and fundamental constants 1. What is spectroscopy? A semiclassical description of spectroscopy Damped harmonics Quantum oscillators The spectroscopic experiment Ensembles and coherence
arxiv:quant-ph/0404128v1 22 Apr 2004
How to teach Quantum Mechanics arxiv:quant-ph/0404128v1 22 Apr 2004 Oliver Passon Fachbereich Physik, University of Wuppertal Postfach 100 127, 42097 Wuppertal, Germany E-mail: [email protected] In
Orbital Dynamics coupled with Jahn-Teller phonons in Strongly Correlated Electron System
The 5 th Scienceweb GCOE International Symposium 1 Orbital Dynamics coupled with Jahn-Teller phonons in Strongly Correlated Electron System Department of Physics, Tohoku University Joji Nasu In collaboration
FLAP P11.2 The quantum harmonic oscillator
F L E X I B L E L E A R N I N G A P P R O A C H T O P H Y S I C S Module P. Opening items. Module introduction. Fast track questions.3 Ready to study? The harmonic oscillator. Classical description of
