Quantum Algorithms for Many-Body Systems: A chemistry and materials science perspective. Matthias Troyer
|
|
- Victor Flynn
- 5 years ago
- Views:
Transcription
1 Quantum Algorithms for Many-Body Systems: A chemistry and materials science perspective Matthias Troyer
2 International Journal of Theoretical Physics, VoL 21, Nos. 6/7, 1982 Simulating Physics with Computers Richard P. Feynman Department of Physics, California Institute of Technology, Pasadena, California Received May 7, 1981 Feynman proposed to use quantum computers to simulate quantum physics
3 Simulating quantum computers on classical computers Simulating a quantum gate acting on N qubits needs O(2 N ) memory and operations Qubits Memory Time for one operation kbyte microseconds on a smartwatch MByte milliseconds on smartphone GByte seconds on laptop TByte seconds on cluster PByte minutes on top supercomputers? EByte hours on exascale supercomputer? ZByte days on hypothetical future supercomputer? 250 size of visible universe age of the universe
4 Simulating a quantum gate acting on N qubits needs O(2 N ) memory and operations
5 First applications that reached a petaflop on ORNL Domain area Code name Institution # of cores Performance Notes Source: T. Schulthess Materials DCA++ ORNL 213, PF Materials WL-LSMS ORNL/ETH 223, PF Chemistry NWChem PNNL/ORNL 224, PF Materials DRC ETH/UTK 186, PF Nanoscience OMEN Duke 222,720 > 1 PF Biomedical MoBo GaTech 196, TF Chemistry MADNESS UT/ORNL 140, TF Materials LS3DF LBL 147, TF Seismology SPECFEM3D USA (multiple) 149, TF Combustion S3D SNL 147, TF 2008 Gordon Bell Prize Winner 2009 Gordon Bell Prize Winner 2008 Gordon Bell Prize Finalist 2010 Gordon Bell Prize Hon. Mention 2010 Gordon Bell Prize Finalist 2010 Gordon Bell Prize Winner 2008 Gordon Bell Prize Winner 2008 Gordon Bell Prize Finalist
6 The Theory of Everything Laughlin & Pines PNAS 2000 The N-body Schrödinger equation i! Ψ(" r 1,..., " r N,t) t = HΨ( " r 1,..., " r N,t) Describes (almost) everything we encounter in daily life with a very simple Hamilton H = 1 Δ 2m i +V ext ( r! i ) + i i q i q j! r i! r j It is a simple linear partial differential equation (PDE) But is exponentially complex since it lives in 3N dimensions i,j
7 Density functional theory and quantum chemistry Approximates the N-body Schrödinger by a tractable 1-body problem E 0 = min ρ(! r )!!! F[ρ]+ d 3 rv( r )ρ( r ) ( ) Successful in calculating properties many metals, insulators, semiconductors Band structure of silicon Walter Kohn John A. Pople 1998 Nobel prize in chemistry J.R.Chelikowsky and M.L.Cohen, PRB (1974)
8 Cuprate high temperature superconductors Undoped materials: half-filled band and metal according to DFT but antiferromagnetic insulator in experiment! Band structure calculation breaks down! Doped materials: high-temperature superconductors What causes superconductivity? Are there room temperature superconductors? Fermi level Band structure of La2CuO4
9 Preparing the ground state On a classical computer Imaginary time projection Power method or other iterative eigensolver Ψ GS Ψ GS = lim τ e τ H Ψ T = lim n (H Λ) n Ψ T On a quantum computer Imaginary time evolution Power method Unitary operations + measurements: prepare trial state projectively measure energy obtain the ground state if the ground state energy was measured Ψ T Ψ T φ n with H φ n = E n φ n φ n picked with propability φ n Ψ T 2
10 Quantum phase estimation Energy can be measured through the phase of a wave function after unitary time evolution U φ n e iht φ n = e ie n t φ n = e iφ φ n We can only measure relative phases, thus do a controlled evolution 0 φ n 1 2 ( ) φ n 1 2 ( 0 φ n +U 1 φ n ) = 1 2 ( 0 +e iφ 1 ) φ n 1 ( 2 (1+e iφ ) 0 +(1 e iφ ) 1 ) φ n Measure the ancilla qubit to obtain the phase
11 Solving quantum chemistry on a quantum computer 1. Select a finite (generally non-orthogonal) basis set 2. Perform a Hartree-Fock calculation to get an approximate solution get an orthogonal basis set 3. Find the true ground state of the Hamiltonian in this new basis set H = c p c q + pq t pq V pqrs exact classical approach: full-configuration interaction exponential complexity! pqrs c p c q c r c r
12 Solving quantum chemistry on a quantum computer 1. Select a finite (generally non-orthogonal) basis set 2. Perform a Hartree-Fock calculation to get an approximate solution get an orthogonal basis set 3. Find the true ground state of the Hamiltonian in this new basis set H = c p c q + 4. Prepare a good guess for the ground state 5. Perform quantum phase estimation to get the ground state wave function and energy pq t pq pqrs V pqrs c p c q c r c r
13 Representing fermion terms by quantum circuits Map the occupation of each spin-orbital to the states of one qubit 0 = 1 = Density operators get mapped to Pauli matrices n i = σ z i Hopping terms get mapped to spin flips with Jordan-Wigner strings c p c q =σ p ( ) Time evolution gets mapped to circuits built from unitary gates q 1 σ z + σ i p i=p+1 e iθ ( c c p q +c q c p ) =
14 Guessing a good trial state Mean field approximation Hartree-Fock Density functional theory Variational approaches: fit parameters in variational ansatz Configuration-Interaction Variational Monte Carlo Tensor network methods (e.g. DMRG) McMillan, Phys. Rev (1965) White, Phys. Rev. Lett. (1992) Neural network states Carleo & Troyer, Science (2017)
15 Preparing a good trial state Adiabatic evolution from a simple initial Hamiltonian H 0 with known ground state to the desired Hamiltonian H 1 Good starting Hamiltonians H(s)=(1-s)H 0 +sh 1 Mean-field approximation (with right broken symmetry) Non-interacting particles (in the right symmetry sector)
16 Cooling into a good trial state Evolve the system coupled to a heat bath that is being cooled See e.g. Kaplan, Klco, Roggero, arxiv: Monte Carlo sampling with the quantum Metropolis algorithm Use a unitary update + phase estimation to propose a new energy eigenstate Accept or reject according to the Metropolis algorithm Solves the sign problem of QMC by working with energy eigenstates Temme et al, Nature (2011)
17 Simulating time evolution on quantum computers There are O(N 4 ) interaction terms in an N-electron system H = t pq c p c q + V pqrs c p c q c r c r H m pq pqrs We need to evolve separately under each of them Efficient circuits available for each of the N 4 terms M m=1 M = O(N 4 ) terms e iδth M e iδτ H m m=1 Runtime estimates turn out to be O(NM 2 ) = O(N 9 ) It s efficient since it s polynomial!
18 The polynomial time quantum shock Estimates for a benchmark molecule: Fe 2 S 2 with 118 spin-orbitals Gate count Parallel circuit depth Run 100ns gate time 300 years We cannot declare victory proving the existence of polynomial time algorithms We need quantum software engineers to develop better algorithms and implementations
19 The result of quantum software optimization Estimates for a benchmark molecule: Fe 2 S 2 with 118 spin-orbitals Gate count Parallel circuit depth Reduced gate count Parallel circuit depth Run 100ns gate time 300 years Run 100ns gate time 20 minutes Attempting to reduce the horrendous runtime estimates we achieved Wecker et al., PRA (2014), Hastings et al., QIC (2015), Poulin et al., QIC (2015) Reuse of computations: Parallelization of terms: Optimizing circuits: Smart interleaving of terms: Multi-resolution time evolution: Better phase estimation algorithms: O(N) reduction in gates O(N) reduction in circuit depth 4x reduction in gates 10x reduction in time steps 10x reduction in gates 4x reduction in rotation gates
20 Improvements in algorithms Original circuit Improved circuit
21 Reducing the number of terms Reduce the number of terms in the evolution from O(N 4 ) to O(N 2 ) by using real-space representations and quantum Fourier transforms First quantized formulation requires expensive quantum arithmetic Kivlichan, Wiebe, et al, J. Phys. A (2017) Plane wave basis Babbush, Wiebe, et al, arxiv: requires much larger number of basis states Can the asymptotic advantages be realized with reasonable runtimes?
22 Avoiding the Trotter breakup New quantum algorithms based on series expansions into sums of unitary operators have exponentially better error scaling K e ih U k M K α k U = β m V m m=1 Childs & Wiebe, QIC (2012) Berry et al, STOC 14 Low & Chuang, PRL (2017). Are these methods advantageous given the unavoidable errors due to finite basis sets/lattice spacings?
23 Nitrogen fixation Fertilizer production using Haber-Bosch process needs 3% of the world s natural gas production But bacteria can do it in the soil without a huge factory!
24 Understanding biological nitrogen fixation Intractable on classical supercomputers But a 200-qubit quantum computer will let us understand it
25 Simulation strategy
26 Quantum developer tools Learn quantum programming Develop quantum algorithms Estimate runtime and memory needs MICROSOFT.COM/QUANTUM
27 Total cost with error correction We want very good qubits! Better algorithms! Better error correction and gate synthesis
28 Steps in software development for quantum applications quantum software engineers 6. Embed into specific hardware and check runtime 5. Add error correction and check overhead and resources 4. Optimize code until logical circuit depth < Check for quantum speedup 2. Implement all oracles and subroutines 1. Find quantum algorithm with quantum speedup 7. Run the quantum algorithm to solve the problem
29 Coming soon: Quantum programming language Visual Studio extensions Quantum simulator Learn more & sign up at: MICROSOFT.COM/QUANTUM
Accelerating QMC on quantum computers. Matthias Troyer
Accelerating QMC on quantum computers Matthias Troyer International Journal of Theoretical Physics, VoL 21, Nos. 6/7, 1982 Simulating Physics with Computers Richard P. Feynman Department of Physics, California
More informationWhat Can We Do with a Quantum Computer? Matthias Troyer Station Q, ETH Zurich
What Can We Do with a Quantum Computer? Station Q, ETH Zurich 1 Classical computers have come a long way Antikythera mechanism ENIAC astronomical positions (1946) (100 BC) Kelvin s harmonic analyzer prediction
More informationHigh Performance Quantum Computing
High Performance Quantum Computing 1 How long will Moore s law continue? sum of top 500 #1 #500 CPU cores: 1024 8 192 3 120 000 Power: 1 MW 3 MW 20 MW Amdahl s law: 99.99993% parallel 1 MW 1 M / year 2
More informationQuantum High Performance Computing. Matthias Troyer Station Q QuArC, Microsoft
Quantum High Performance Computing Station Q QuArC, Microsoft 2000 2006 Station Q A worldwide consortium Universi ty Partner s ETH Zurich University of Copenhagen TU Delft University of Sydney QuArC Station
More information30 qubits 40 qubits 50 qubits Exponential Scaling Simulating 260 qubits requires more memory than there are atoms in the universe RSA-2048 Challenge Problem 251959084756578934940271832400483985714292821262040
More informationSimulating 250 interacting qubits requires ~ classical bits! State of N interacting qubits: ~ 2 N bits of info!
Hours (on Cray XE6) Simulating 250 interacting qubits requires ~ classical bits! State of N interacting qubits: ~ 2 N bits of info! Time to Factor N-bit Number RSA-2048 Challenge Problem Number of bits
More informationSimulating Chemistry using Quantum Computers, Annu. Rev. Phys. Chem. 62, 185 (2011).
I. Kassal, J. D. Whitfield, A. Perdomo-Ortiz, M-H. Yung, A. Aspuru-Guzik, Simulating Chemistry using Quantum Computers, Annu. Rev. Phys. Chem. 6, 185 (011). Martes Cuántico Universidad de Zaragoza, 19th
More informationwww.microsoft.stationq.com REDMOND SYDNEY, DELFT, COPENHAGEN SANTA BARBARA Basic unit: bit = 0 or 1 Computing: logical operation Basic unit: qubit = unit vector α 0 + β 1 Computing: unitary operation 0
More informationQuantum computing with superconducting qubits Towards useful applications
Quantum computing with superconducting qubits Towards useful applications Stefan Filipp IBM Research Zurich Switzerland Forum Teratec 2018 June 20, 2018 Palaiseau, France Why Quantum Computing? Why now?
More informationQuantum Convolutional Neural Networks
Quantum Convolutional Neural Networks Iris Cong Soonwon Choi Mikhail D. Lukin arxiv:1810.03787 Berkeley Quantum Information Seminar October 16 th, 2018 Why quantum machine learning? Machine learning: interpret
More informationQuantum computing and quantum information KAIS GROUP
Quantum computing and quantum information KAIS GROUP Main themes Quantum algorithms. In particular for quantum chemistry arxiv:1004.2242 [cs.ne] arxiv:1009.5625 [quant-ph] arxiv:1307.7220 [quant-ph] arxiv:1302.1946
More informationEfficient time evolution of one-dimensional quantum systems
Efficient time evolution of one-dimensional quantum systems Frank Pollmann Max-Planck-Institut für komplexer Systeme, Dresden, Germany Sep. 5, 2012 Hsinchu Problems we will address... Finding ground states
More informationSolving strongly correlated electron models on a quantum computer
Solving strongly correlated electron models on a quantum computer Dave Wecker, 1 Matthew B. Hastings, 2, 1 Nathan Wiebe, 1 Bryan K. Clark, 2, 3 Chetan Nayak, 2 and Matthias Troyer 4 1 Quantum Architectures
More informationQuantum Annealing in spin glasses and quantum computing Anders W Sandvik, Boston University
PY502, Computational Physics, December 12, 2017 Quantum Annealing in spin glasses and quantum computing Anders W Sandvik, Boston University Advancing Research in Basic Science and Mathematics Example:
More informationAlgorithmic challenges in quantum simulation. Andrew Childs University of Maryland
Algorithmic challenges in quantum simulation Andrew Childs University of Maryland nature isn t classical, dammit, and if you want to make a simulation of nature, you d better make it quantum mechanical,
More informationQuantum Computing at IBM
Quantum Computing at IBM Ivano Tavernelli IBM Research - Zurich Quantum Computing for High Energy Physics CERN -Geneva November 5-6, 2018 Outline Why quantum computing? The IBM Q Hardware The IBM Q Software
More informationQuantum simulation with string-bond states: Joining PEPS and Monte Carlo
Quantum simulation with string-bond states: Joining PEPS and Monte Carlo N. Schuch 1, A. Sfondrini 1,2, F. Mezzacapo 1, J. Cerrillo 1,3, M. Wolf 1,4, F. Verstraete 5, I. Cirac 1 1 Max-Planck-Institute
More informationQuantum Mechanical Simulations
Quantum Mechanical Simulations Prof. Yan Wang Woodruff School of Mechanical Engineering Georgia Institute of Technology Atlanta, GA 30332, U.S.A. yan.wang@me.gatech.edu Topics Quantum Monte Carlo Hartree-Fock
More informationQuantum Computing: the Majorana Fermion Solution. By: Ryan Sinclair. Physics 642 4/28/2016
Quantum Computing: the Majorana Fermion Solution By: Ryan Sinclair Physics 642 4/28/2016 Quantum Computation: The Majorana Fermion Solution Since the introduction of the Torpedo Data Computer during World
More informationAlgorithmic challenges in quantum simulation. Andrew Childs University of Maryland
Algorithmic challenges in quantum simulation Andrew Childs University of Maryland nature isn t classical, dammit, and if you want to make a simulation of nature, you d better make it quantum mechanical,
More informationarxiv: v2 [quant-ph] 19 Dec 2013
Adiabatic Quantum Simulation of Quantum Chemistry Ryan Babbush, 1 Peter J. Love, 2 and Alán Aspuru-Guzik 1, 1 Department of Chemistry and Chemical Biology, Harvard University, Cambridge, MA 02138 USA 2
More informationLogical error rate in the Pauli twirling approximation
Logical error rate in the Pauli twirling approximation Amara Katabarwa and Michael R. Geller Department of Physics and Astronomy, University of Georgia, Athens, Georgia 30602, USA (Dated: April 10, 2015)
More informationWORKSHOP ON QUANTUM ALGORITHMS AND DEVICES FRIDAY JULY 15, 2016 MICROSOFT RESEARCH
Workshop on Quantum Algorithms and Devices Friday, July 15, 2016 - Microsoft Research Building 33 In 1981, Richard Feynman proposed a device called a quantum computer that would take advantage of methods
More informationQuantum many-body systems and tensor networks: simulation methods and applications
Quantum many-body systems and tensor networks: simulation methods and applications Román Orús School of Physical Sciences, University of Queensland, Brisbane (Australia) Department of Physics and Astronomy,
More informationIntroduction to Density Functional Theory
Introduction to Density Functional Theory S. Sharma Institut für Physik Karl-Franzens-Universität Graz, Austria 19th October 2005 Synopsis Motivation 1 Motivation : where can one use DFT 2 : 1 Elementary
More informationQuantum Monte Carlo methods
Quantum Monte Carlo methods Lubos Mitas North Carolina State University Urbana, August 2006 Lubos_Mitas@ncsu.edu H= 1 2 i i 2 i, I Z I r ii i j 1 r ij E ion ion H r 1, r 2,... =E r 1, r 2,... - ground
More informationQuantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar
Quantum Computing Lecture 3 Principles of Quantum Mechanics Anuj Dawar What is Quantum Mechanics? Quantum Mechanics is a framework for the development of physical theories. It is not itself a physical
More informationQuantum and classical annealing in spin glasses and quantum computing. Anders W Sandvik, Boston University
NATIONAL TAIWAN UNIVERSITY, COLLOQUIUM, MARCH 10, 2015 Quantum and classical annealing in spin glasses and quantum computing Anders W Sandvik, Boston University Cheng-Wei Liu (BU) Anatoli Polkovnikov (BU)
More informationSimulated Quantum Computation of Molecular. Energies
Simulated Quantum Computation of Molecular Energies Alán Aspuru-Guzik* a, Anthony D. Dutoi* a, Peter J. Love c and Martin Head-Gordon a,b a Department of Chemistry, University of California, Berkeley b
More informationClassical Monte Carlo Simulations
Classical Monte Carlo Simulations Hyejin Ju April 17, 2012 1 Introduction Why do we need numerics? One of the main goals of condensed matter is to compute expectation values O = 1 Z Tr{O e βĥ} (1) and
More informationOptimal Hamiltonian Simulation by Quantum Signal Processing
Optimal Hamiltonian Simulation by Quantum Signal Processing Guang-Hao Low, Isaac L. Chuang Massachusetts Institute of Technology QIP 2017 January 19 1 Physics Computation Physical concepts inspire problem-solving
More informationRenormalization of Tensor- Network States Tao Xiang
Renormalization of Tensor- Network States Tao Xiang Institute of Physics/Institute of Theoretical Physics Chinese Academy of Sciences txiang@iphy.ac.cn Physical Background: characteristic energy scales
More informationTime Evolving Block Decimation Algorithm
Time Evolving Block Decimation Algorithm Application to bosons on a lattice Jakub Zakrzewski Marian Smoluchowski Institute of Physics and Mark Kac Complex Systems Research Center, Jagiellonian University,
More informationQuantum Metropolis Sampling. K. Temme, K. Vollbrecht, T. Osborne, D. Poulin, F. Verstraete arxiv:
Quantum Metropolis Sampling K. Temme, K. Vollbrecht, T. Osborne, D. Poulin, F. Verstraete arxiv: 09110365 Quantum Simulation Principal use of quantum computers: quantum simulation Quantum Chemistry Determination
More informationTime-dependent DMRG:
The time-dependent DMRG and its applications Adrian Feiguin Time-dependent DMRG: ^ ^ ih Ψ( t) = 0 t t [ H ( t) E ] Ψ( )... In a truncated basis: t=3 τ t=4 τ t=5τ t=2 τ t= τ t=0 Hilbert space S.R.White
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Part I Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 12, 2011 Overview Outline What is quantum computing? Background Caveats Fundamental differences
More informationFermionic tensor networks
Fermionic tensor networks Philippe Corboz, ETH Zurich / EPF Lausanne, Switzerland Collaborators: University of Queensland: Guifre Vidal, Roman Orus, Glen Evenbly, Jacob Jordan University of Vienna: Frank
More informationComplexity of the quantum adiabatic algorithm
Complexity of the quantum adiabatic algorithm Peter Young e-mail:peter@physics.ucsc.edu Collaborators: S. Knysh and V. N. Smelyanskiy Colloquium at Princeton, September 24, 2009 p.1 Introduction What is
More informationSimulated Quantum Annealing For General Ising Models
Simulated Quantum Annealing For General Ising Models Thomas Neuhaus Jülich Supercomputing Centre, JSC Forschungszentrum Jülich Jülich, Germany e-mail : t.neuhaus@fz-juelich.de November 23 On the Talk Quantum
More informationFermionic tensor networks
Fermionic tensor networks Philippe Corboz, Institute for Theoretical Physics, ETH Zurich Bosons vs Fermions P. Corboz and G. Vidal, Phys. Rev. B 80, 165129 (2009) : fermionic 2D MERA P. Corboz, R. Orus,
More informationAlgorithm for Quantum Simulation
Applied Mathematics & Information Sciences 3(2) (2009), 117 122 An International Journal c 2009 Dixie W Publishing Corporation, U. S. A. Algorithm for Quantum Simulation Barry C. Sanders Institute for
More informationarxiv: v2 [quant-ph] 25 May 2016
Elucidating Reaction Mechanisms on Quantum Computers Markus Reiher, 1 Nathan Wiebe, 2 Krysta M. Svore, 2 Dave Wecker, 2 3, 2, 4 and Matthias Troyer 1 Laboratorium für Physikalische Chemie, ETH Zurich,
More informationSecond Lecture: Quantum Monte Carlo Techniques
Second Lecture: Quantum Monte Carlo Techniques Andreas Läuchli, New states of quantum matter MPI für Physik komplexer Systeme - Dresden http://www.pks.mpg.de/~aml aml@pks.mpg.de Lecture Notes at http:www.pks.mpg.de/~aml/leshouches
More informationDiagrammatic Monte Carlo simulation of quantum impurity models
Diagrammatic Monte Carlo simulation of quantum impurity models Philipp Werner ETH Zurich IPAM, UCLA, Jan. 2009 Outline Continuous-time auxiliary field method (CT-AUX) Weak coupling expansion and auxiliary
More informationLecture 4: Postulates of quantum mechanics
Lecture 4: Postulates of quantum mechanics Rajat Mittal IIT Kanpur The postulates of quantum mechanics provide us the mathematical formalism over which the physical theory is developed. For people studying
More informationIntroduction to Density Functional Theory
1 Introduction to Density Functional Theory 21 February 2011; V172 P.Ravindran, FME-course on Ab initio Modelling of solar cell Materials 21 February 2011 Introduction to DFT 2 3 4 Ab initio Computational
More informationTensor network simulation of QED on infinite lattices: learning from (1 + 1)d, and prospects for (2 + 1)d
Tensor network simulation of QED on infinite lattices: learning from (1 + 1)d, and prospects for (2 + 1)d Román Orús University of Mainz (Germany) K. Zapp, RO, Phys. Rev. D 95, 114508 (2017) Goal of this
More informationMagnets, 1D quantum system, and quantum Phase transitions
134 Phys620.nb 10 Magnets, 1D quantum system, and quantum Phase transitions In 1D, fermions can be mapped into bosons, and vice versa. 10.1. magnetization and frustrated magnets (in any dimensions) Consider
More informationHamiltonian Simula,on of Discrete and Con,nuous- Variable Quantum Systems
Hamiltonian Simula,on of Discrete and Con,nuous- Variable Quantum Systems Rolando D. Somma Los Alamos Na*onal Laboratory, Los Alamos, NM Berry, Childs, Cleve, Kothari, RS, PRL 114, 090502 (2015) Berry,
More informationMulti-Scale Modeling from First Principles
m mm Multi-Scale Modeling from First Principles μm nm m mm μm nm space space Predictive modeling and simulations must address all time and Continuum Equations, densityfunctional space scales Rate Equations
More information2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information
QSIT09.L03 Page 1 2.0 Basic Elements of a Quantum Information Processor 2.1 Classical information processing 2.1.1 The carrier of information - binary representation of information as bits (Binary digits).
More informationAdvanced Computation for Complex Materials
Advanced Computation for Complex Materials Computational Progress is brainpower limited, not machine limited Algorithms Physics Major progress in algorithms Quantum Monte Carlo Density Matrix Renormalization
More informationQuantum Theory and Group Representations
Quantum Theory and Group Representations Peter Woit Columbia University LaGuardia Community College, November 1, 2017 Queensborough Community College, November 15, 2017 Peter Woit (Columbia University)
More informationChapter 10. Quantum algorithms
Chapter 10. Quantum algorithms Complex numbers: a quick review Definition: C = { a + b i : a, b R } where i = 1. Polar form of z = a + b i is z = re iθ, where r = z = a 2 + b 2 and θ = tan 1 y x Alternatively,
More informationErrata list, Nielsen & Chuang. rrata/errata.html
Errata list, Nielsen & Chuang http://www.michaelnielsen.org/qcqi/errata/e rrata/errata.html Part II, Nielsen & Chuang Quantum circuits (Ch 4) SK Quantum algorithms (Ch 5 & 6) Göran Johansson Physical realisation
More informationCharacterizing Quantum Supremacy in Near-Term Devices
Characterizing Quantum Supremacy in Near-Term Devices S. Boixo S. Isakov, V. Smelyanskiy, R. Babbush, M. Smelyanskiy, N. Ding, Z. Jiang, M. J. Bremner, J. Martinis, H. Neven Google January 19th Beyond-classical
More informationComputational strongly correlated materials R. Torsten Clay Physics & Astronomy
Computational strongly correlated materials R. Torsten Clay Physics & Astronomy Current/recent students Saurabh Dayal (current PhD student) Wasanthi De Silva (new grad student 212) Jeong-Pil Song (finished
More informationGeneralized Unitary Coupled Cluster. Wavefunctions for Quantum Computation
Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation arxiv:1810.02327v2 [quant-ph] 4 Jan 2019 Joonho Lee,,, William J. Huggins,,, Martin Head-Gordon,, and K. Birgitta Whaley, Department
More informationThe Mott Metal-Insulator Transition
Florian Gebhard The Mott Metal-Insulator Transition Models and Methods With 38 Figures Springer 1. Metal Insulator Transitions 1 1.1 Classification of Metals and Insulators 2 1.1.1 Definition of Metal
More informationExtreme scale simulations of high-temperature superconductivity. Thomas C. Schulthess
Extreme scale simulations of high-temperature superconductivity Thomas C. Schulthess T [K] Superconductivity: a state of matter with zero electrical resistivity Heike Kamerlingh Onnes (1853-1926) Discovery
More informationSuperfluidity near the Mott transition of cold bosonic atoms: validating a quantum simulator
Superfluidity near the Mott transition of cold bosonic atoms: validating a quantum simulator Collaborators Simulations of bosons Lode Pollet (Harvard) Boris Svistunov (UMass) Nikolay Prokof ev (UMass)
More informationClassical and quantum simulation of dissipative quantum many-body systems
0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 0 20 32 Classical and quantum simulation of dissipative quantum many-body systems
More informationKevin Driver 1 Shuai Zhang 1 Burkhard Militzer 1 R. E. Cohen 2.
Quantum Monte Carlo Simulations of a Single Iron Impurity in MgO Kevin Driver 1 Shuai Zhang 1 Burkhard Militzer 1 R. E. Cohen 2 1 Department of Earth & Planetary Science University of California, Berkeley
More informationDensity Functional Theory. Martin Lüders Daresbury Laboratory
Density Functional Theory Martin Lüders Daresbury Laboratory Ab initio Calculations Hamiltonian: (without external fields, non-relativistic) impossible to solve exactly!! Electrons Nuclei Electron-Nuclei
More informationElectron Correlation
Electron Correlation Levels of QM Theory HΨ=EΨ Born-Oppenheimer approximation Nuclear equation: H n Ψ n =E n Ψ n Electronic equation: H e Ψ e =E e Ψ e Single determinant SCF Semi-empirical methods Correlation
More informationReversible and Quantum computing. Fisica dell Energia - a.a. 2015/2016
Reversible and Quantum computing Fisica dell Energia - a.a. 2015/2016 Reversible computing A process is said to be logically reversible if the transition function that maps old computational states to
More informationOn The Power Of Coherently Controlled Quantum Adiabatic Evolutions
On The Power Of Coherently Controlled Quantum Adiabatic Evolutions Maria Kieferova (RCQI, Slovak Academy of Sciences, Bratislava, Slovakia) Nathan Wiebe (QuArC, Microsoft Research, Redmond, WA, USA) [arxiv:1403.6545]
More informationPh 219b/CS 219b. Exercises Due: Wednesday 22 February 2006
1 Ph 219b/CS 219b Exercises Due: Wednesday 22 February 2006 6.1 Estimating the trace of a unitary matrix Recall that using an oracle that applies the conditional unitary Λ(U), Λ(U): 0 ψ 0 ψ, 1 ψ 1 U ψ
More informationHamiltonian simulation with nearly optimal dependence on all parameters
Hamiltonian simulation with nearly optimal dependence on all parameters Dominic Berry + Andrew Childs obin Kothari ichard Cleve olando Somma Quantum simulation by quantum walks Dominic Berry + Andrew Childs
More informationQuantum computing! quantum gates! Fisica dell Energia!
Quantum computing! quantum gates! Fisica dell Energia! What is Quantum Computing?! Calculation based on the laws of Quantum Mechanics.! Uses Quantum Mechanical Phenomena to perform operations on data.!
More informationQuantum Computing: Great Expectations
Quantum Computing: Great Expectations Quantum Computing for Nuclear Physics Workshop Dave Bacon dabacon@google.com In a Galaxy Seven Years Ago... 0.88 fidelity 0.78 fidelity (2010) fidelities: 14 qubits:
More informationarxiv: v1 [quant-ph] 16 Aug 2017
Noname manuscript No. (will be inserted by the editor) Combinatorial Optimization on Gate Model Quantum Computers: A Survey Ehsan Zahedinejad Arman Zaribafiyan arxiv:1708.05294v1 [quant-ph] 16 Aug 2017
More information3 Symmetry Protected Topological Phase
Physics 3b Lecture 16 Caltech, 05/30/18 3 Symmetry Protected Topological Phase 3.1 Breakdown of noninteracting SPT phases with interaction Building on our previous discussion of the Majorana chain and
More informationComplex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where
Chapter 0 Quantum algorithms Complex numbers: a quick review / 4 / 4 Definition: C = { a + b i : a, b R } where i = Polar form of z = a + b i is z = re iθ, where r = z = a + b and θ = tan y x Alternatively,
More informationQuantum simulations, adiabatic transformations,
Quantum simulations, adiabatic transformations, and resonating valence bond states Aspen June 2009 Simon Trebst Microsoft Station Q UC Santa Barbara Ulrich Schollwöck Matthias Troyer Peter Zoller High
More informationThe Gutzwiller Density Functional Theory
The Gutzwiller Density Functional Theory Jörg Bünemann, BTU Cottbus I) Introduction 1. Model for an H 2 -molecule 2. Transition metals and their compounds II) Gutzwiller variational theory 1. Gutzwiller
More informationNumerical Studies of the Quantum Adiabatic Algorithm
Numerical Studies of the Quantum Adiabatic Algorithm A.P. Young Work supported by Colloquium at Universität Leipzig, November 4, 2014 Collaborators: I. Hen, M. Wittmann, E. Farhi, P. Shor, D. Gosset, A.
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 1: Quantum circuits and the abelian QFT
Quantum algorithms (CO 78, Winter 008) Prof. Andrew Childs, University of Waterloo LECTURE : Quantum circuits and the abelian QFT This is a course on quantum algorithms. It is intended for graduate students
More informationMind the gap Solving optimization problems with a quantum computer
Mind the gap Solving optimization problems with a quantum computer A.P. Young http://physics.ucsc.edu/~peter Work supported by Talk at Saarbrücken University, November 5, 2012 Collaborators: I. Hen, E.
More informationQuantum Simulation with Rydberg Atoms
Hendrik Weimer Institute for Theoretical Physics, Leibniz University Hannover Blaubeuren, 23 July 2014 Outline Dissipative quantum state engineering Rydberg atoms Mesoscopic Rydberg gates A Rydberg Quantum
More informationMulti-reference Density Functional Theory. COLUMBUS Workshop Argonne National Laboratory 15 August 2005
Multi-reference Density Functional Theory COLUMBUS Workshop Argonne National Laboratory 15 August 2005 Capt Eric V. Beck Air Force Institute of Technology Department of Engineering Physics 2950 Hobson
More informationHigh-precision quantum algorithms. Andrew Childs
High-precision quantum algorithms Andrew hilds What can we do with a quantum computer? Factoring Many problems with polynomial speedup (combinatorial search, collision finding, graph properties, oolean
More informationHamiltonian simulation and solving linear systems
Hamiltonian simulation and solving linear systems Robin Kothari Center for Theoretical Physics MIT Quantum Optimization Workshop Fields Institute October 28, 2014 Ask not what you can do for quantum computing
More informationModeling the Atomic Nucleus. Theoretical bag of tricks
Modeling the Atomic Nucleus Theoretical bag of tricks The nuclear many-body problem The Nuclear Many-Body Problem H ˆ = T ˆ + V ˆ ˆ T = A 2 p ˆ " i, V ˆ = 2m i i=1 one-body H ˆ " = E" " V ˆ 2b (i, j) +
More informationDensity Functional Theory
Density Functional Theory March 26, 2009 ? DENSITY FUNCTIONAL THEORY is a method to successfully describe the behavior of atomic and molecular systems and is used for instance for: structural prediction
More informationH ψ = E ψ. Introduction to Exact Diagonalization. Andreas Läuchli, New states of quantum matter MPI für Physik komplexer Systeme - Dresden
H ψ = E ψ Introduction to Exact Diagonalization Andreas Läuchli, New states of quantum matter MPI für Physik komplexer Systeme - Dresden http://www.pks.mpg.de/~aml laeuchli@comp-phys.org Simulations of
More information4 Matrix product states
Physics 3b Lecture 5 Caltech, 05//7 4 Matrix product states Matrix product state (MPS) is a highly useful tool in the study of interacting quantum systems in one dimension, both analytically and numerically.
More informationPreface Introduction to the electron liquid
Table of Preface page xvii 1 Introduction to the electron liquid 1 1.1 A tale of many electrons 1 1.2 Where the electrons roam: physical realizations of the electron liquid 5 1.2.1 Three dimensions 5 1.2.2
More informationSimulating Subatomic Physics on a Quantum Frequency Processor
Simulating Subatomic Physics on a Quantum Frequency Processor Pavel Lougovski 1 1 Quantum Information Science Group Oak Ridge National Lab PfQ Rochester, NY Pavel Lougovski (ORNL) 1/24/2019 1 / 42 How
More informationStorage of Quantum Information in Topological Systems with Majorana Fermions
Storage of Quantum Information in Topological Systems with Majorana Fermions Leonardo Mazza Scuola Normale Superiore, Pisa Mainz September 26th, 2013 Leonardo Mazza (SNS) Storage of Information & Majorana
More informationMind the gap Solving optimization problems with a quantum computer
Mind the gap Solving optimization problems with a quantum computer A.P. Young http://physics.ucsc.edu/~peter Work supported by Talk at the London Centre for Nanotechnology, October 17, 2012 Collaborators:
More informationPh 219b/CS 219b. Exercises Due: Wednesday 4 December 2013
1 Ph 219b/CS 219b Exercises Due: Wednesday 4 December 2013 4.1 The peak in the Fourier transform In the period finding algorithm we prepared the periodic state A 1 1 x 0 + jr, (1) A j=0 where A is the
More informationQuantum Cluster Methods (CPT/CDMFT)
Quantum Cluster Methods (CPT/CDMFT) David Sénéchal Département de physique Université de Sherbrooke Sherbrooke (Québec) Canada Autumn School on Correlated Electrons Forschungszentrum Jülich, Sept. 24,
More informationExchange-Correlation Functional
Exchange-Correlation Functional Aiichiro Nakano Collaboratory for Advanced Computing & Simulations Depts. of Computer Science, Physics & Astronomy, Chemical Engineering & Materials Science, and Biological
More informationStatistics and Quantum Computing
Statistics and Quantum Computing Yazhen Wang Department of Statistics University of Wisconsin-Madison http://www.stat.wisc.edu/ yzwang Workshop on Quantum Computing and Its Application George Washington
More informationNoncollinear spins in QMC: spiral Spin Density Waves in the HEG
Noncollinear spins in QMC: spiral Spin Density Waves in the HEG Zoltán Radnai and Richard J. Needs Workshop at The Towler Institute July 2006 Overview What are noncollinear spin systems and why are they
More informationNeural Network Representation of Tensor Network and Chiral States
Neural Network Representation of Tensor Network and Chiral States Yichen Huang ( 黄溢辰 ) 1 and Joel E. Moore 2 1 Institute for Quantum Information and Matter California Institute of Technology 2 Department
More informationMomentum-space and Hybrid Real- Momentum Space DMRG applied to the Hubbard Model
Momentum-space and Hybrid Real- Momentum Space DMRG applied to the Hubbard Model Örs Legeza Reinhard M. Noack Collaborators Georg Ehlers Jeno Sólyom Gergely Barcza Steven R. White Collaborators Georg Ehlers
More informationI. QUANTUM MONTE CARLO METHODS: INTRODUCTION AND BASICS
I. QUANTUM MONTE CARLO METHODS: INTRODUCTION AND BASICS Markus Holzmann LPMMC, UJF, Grenoble, and LPTMC, UPMC, Paris markus@lptl.jussieu.fr http://www.lptl.jussieu.fr/users/markus (Dated: January 24, 2012)
More informationarxiv: v2 [quant-ph] 16 Apr 2012
Quantum Circuit Design for Solving Linear Systems of Equations arxiv:0.3v [quant-ph] 6 Apr 0 Yudong Cao, Anmer Daskin, Steven Frankel, and Sabre Kais 3, Department of Mechanical Engineering, Purdue University
More information