PPT-Product-State Approximations to Quantum

Groundstates Fernando GSL Brand ão Imperial gt UCL Based on joint work with A Harrow Paris April 2013 Quantum ManyBody Systems Quantum Hamiltonian . 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 . 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 . Quantum Hamiltonian Complexity. Aram Harrow (MIT). Simons Institute. 16 Jan 2014. Entanglement. Original motivation for quantum computing. [Feynman ‘82]. Nature isn't classical, dammit, and if you want to make a simulation of Nature, you'd better make it quantum mechanical, and by golly it's a wonderful problem, because it doesn't look so easy.. and the monogamy of entanglement. Aram . Harrow (MIT). Brown SUMS. March 9, 2013. Quantum mechanics. QM has also explained:. the stability of atoms. the photoelectric effect. e. verything else we’ve looked at. Collection of two-state quantum systems (. qubits. ). Operations which manipulate isolated . qubits. or pairs of . qubits. Initialise. . qubit. to . single state. Detect . qubit. state. Large scale device:. and the monogamy of entanglement. Aram . Harrow. MIT (UCL until Jan 2015). Quantum mechanics. QM has also explained:. the stability of atoms. the photoelectric effect. e. verything else we’ve looked at. Quantum Hamiltonian Complexity. Aram Harrow (MIT). Simons Institute. 16 Jan 2014. Entanglement. Original motivation for quantum computing. [Feynman ‘82]. Nature isn't classical, dammit, and if you want to make a simulation of Nature, you'd better make it quantum mechanical, and by golly it's a wonderful problem, because it doesn't look so easy.. Aram Harrow. . based on joint work with . Fernando G.S.L. Brandão. (ETHZ->Imperial). PCP theorem. Classical k-CSPs:. Given constraints . C={C. i. }. , choose an assignment . σ. mapping . n. variables to an alphabet . Aram Harrow. . based on joint work with . Fernando G.S.L. Brandão. (ETHZ->Imperial). PCP theorem. Classical k-CSPs:. Given constraints . C={C. i. }. , choose an assignment . σ. mapping . n. variables to an alphabet . Monroe. University of Maryland. Quantum Simulations. with Atoms. Aarhus. Amherst. Basel. Berkeley. Bonn. Citadel. Clemson. Denison. Duke. Erlangen. ETH-Zurich. Freiburg. Georgia . Tech. Griffith . Hannover. Daniel Reitzner. Research Center for Quantum Information, Slovak Academy of Sciences. 1st . eduQUTE. school on quantum technologies. Bratislava 19-22/02/2018. Welcome notes. Do not hesitate to ask questions anytime during the talk if something will be unclear!. Fernando Brandão (UCL). Aram Harrow (MIT). arXiv:. 1310.0017. Constraint Satisfaction Problems. x. 1. c. 1. c. 2. c. 3. k. -CSP:. Variables . {x. 1. , …, . x. n. } in . Σ. n. . Alphabet . Σ. Constraints . University of Maryland. Department of Physics. National Institute of. Standards and Technology. Hardware. “. There's Plenty of Room . at . the Bottom. ” (1959. ) . “. When we get to the very, very small world – say circuits of . Tel Aviv University. Nir Bitansky. Omri Shmueli. Zero-Knowledge Protocols . [Goldwasser, . Micali. , . Rackoff. 85].  . .. .. .. Accept/Reject.  .  .  . This work:. ZK against quantum attacks. ..