PPT-Quantum Hamiltonian Complexity

Fernando GSL Brand ão ETH Zürich Based on joint work with A Harrow and M Horodecki Quo Vadis Quantum Physics Natal 2013 Quantum is Hard Use of DoE supercomputers by area . simulation. Dominic Berry. Macquarie University. Richard Cleve. IQC. Rolando . Somma. . . LANL. Simulation of Hamiltonians. Quantum computers could give an . exponential. speedup in the simulation of quantum physical systems.. Dieter Jaksch. Outline. Lecture 1: Introduction. What defines a quantum simulator? Quantum simulator criteria. Strongly correlated quantum systems.. Lecture 2: Optical lattices. Bose-Einstein condensation, adiabatic loading of an optical lattice. Hamiltonian . Shirley Moore. CS4390/5390 Fall 2013. http://svmoore.pbworks.com/. August 29, 2013. 1. Agenda. Announcements (3 min). Recap previous class (6 min). Discuss . Fortnow. article (6 min). Reducibility (20 min). Fang Song. IQC, University of Waterloo. -- “Quantum-Friendly” Reductions. 2. How do . quantum . attacks change classical cryptography?. Crypto-systems based on the hardness of factoring and discrete-log are . AFOSR, DARPA, MURI . Takuya Kitagawa. Harvard University. Mark Rudner. Harvard University. Erez Berg. Harvard University. Yutaka Shikano. from Finite Correlation Length . Fernando . G.S.L. . Brand. ão. Microsoft Research. Quantum Spin Systems, Recent Advances, . Cergy. -. Pontoise. , 2015. based on joint work with . Marcus Cramer . University of Ulm. Vesal. . Hakami. October 30, 2010. Brief History. Basic Definitions, Initiatives, Sufficient Conditions, A Backtracking Algorithm . Chiba. & . Nishezeki. ’s. Linear Implementation for . Internally 4-Connected Plane. Dung Nguyen. Chicago 19. th. January. Content. Motivation . Quantum bit (qubit) vs Classical bit (bit). Quantum Computation . Quantum Communication. Conclusion. Motivation. The end of Moore’s law scaling in silicon (because of quantum effects of particle at scale smaller than 7nm).. Toniann. . Pitassi. University of Toronto. 2-Party Communication Complexity. [Yao]. 2-party communication: . each party has a dataset. . Goal . is to compute a function f(D. A. ,D. B. ). m. 1. m. 2. Alan . Cherne. DEFINITIONS. A . Hamilton path . is a path that contains all vertices of a graph. A . Hamilton cycle. is a cycle that contains all vertices of a graph. A . Hamiltonian graph . is a graph that contains a Hamilton cycle. ” Workshop is to discuss theoretical and experimental hot issues related to quantum physics, from foundational issues (such as findings and ideas to investigate quantum effects in biological systems. The Workshop is supported by . Pancharatnam phase. The Indian physicist S. Pancharatnam in 1956 introduced the concept of . a geometrical phase.. Let . H(ξ ) be an Hamiltonian which depends from some . parameters, represented by . Jordan Cotler. Harvard Society of Fellows. 2101.04634 [. Aharonov. , Cotler, Qi]. Introduction: what is an experiment?. Measuring constants of nature (speed of light, charge of electron). Quantifying dynamical properties (rate of a chemical reaction). Part 1. Outline. Introduction. Problems of classical physics. Black-body Radiation. experimental observations. Wien’s displacement law. Stefan – Boltzmann law. Rayleigh - Jeans. Wien’s radiation law.