Matt Hastings: The Power of Adiabatic Quantum Computation with No Sign Problem

Channel:
United States QuICS
Subscribers:
2,450
Published on ● Video Link: https://www.youtube.com/watch?v=p6KxWwYLGGs


Duration: 1:06:33
441 views
0

Interference is an essential part of quantum mechanics. However, an important class of Hamiltonians considered are those with "no sign problem", where all off-diagonal matrix elements of the Hamiltonian are non-negative. This means that the ground state wave function can be chosen to have all amplitudes real and positive. In a sense, no destructive interference is possible for these Hamiltonians so that they are "almost classical", and there are several simulation algorithms which work well in practice on classical computers today. In this talk, I'll discuss what happens when one considers adiabatic evolution of such Hamiltonians, and show that they still have some power that cannot be efficiently simulated on a classical compute; to be precise and formal, I'll show this "relative to an oracle", which I will explain. I'll discuss implications for simulation of these problems and open questions.



Other Videos By QuICS


2021-03-12Michael DeMarco: A Commuting Projector Model for Hall Conductance
2021-03-09Daniel Stilck França: Limitations of optimization algorithms on noisy quantum devices
2021-03-09Robert Huang: Fundamental aspects of solving quantum problems with machine learning
2020-11-04Wolfgang Pfaff: Increasing connectivity and modularity in superconducting quantum circuits
2020-10-29Iordanis Kerenidis: Quantum Machine Learning: prospects and challenges
2020-10-21Urmila Mahadev: Classical homomorphic encryption for quantum circuits
2020-10-08Thomas Baker: Density functionals, Kohn-Sham potentials & Green’s functions from a quantum computer
2020-09-23James D. Whitfield: Limitations of Hartree-Fock with Quantum Resources
2020-09-18Mark Wilde: Quantum Renyi relative entropies and their use
2020-08-17Dmitry Green: A superconducting circuit realization of combinatorial gauge symmetry
2020-07-23Matt Hastings: The Power of Adiabatic Quantum Computation with No Sign Problem
2020-06-19William Slofstra: Arkhipov's theorem, games, groups, and graphs
2020-06-10Ramis Movassagh:Cayley path & quantum supremacy:Average case # P-Hardness of random circuit sampling
2020-06-04Steve Flammia: Characterization of Solvable Spin Models via Graph Invariants
2020-05-20Aram Harrow: Small Quantum Computers and Large Classical Data Sets
2020-02-05Dominik Hangleiter: (How) can we verify quantum supremacy?
2020-02-05Giacomo Torlai: Enhancing Quantum Simulators with Neural Networks
2019-11-21Felix Leditzky: Playing Games with Multiple Access Channels
2019-11-14Anand Natarajan: NEEXP ⊆ MIP*
2019-11-14Alex B. Grilo: Recent advances in Zero-knowledge proofs in the quantum setting
2019-10-03Andrea Coladangelo: A simple two-player dimension witness based on embezzlement


Tags:
quantum computing