AQC 2016 - Max-k-SAT, Multi-Body Frustration, & Multi-Body Sampling on a Two Local Ising System

Subscribers:
349,000
Published on ● Video Link: https://www.youtube.com/watch?v=aC-6hg_h3EA



Duration: 18:58
648 views
4


A Google TechTalk, June 29, 2016, presented by Nicholas Chancellor (Durham University)
ABSTRACT: For some time it has been known how to encode satisfiability (SAT) problems and the physics analogue of finding the ground state of a frustrated spin system onto a two local Ising spin model. These previous constructions however do not necessarily yield the statement which satisfies the maximum number of clauses as the ground state (max-SAT), in the language of physics, they did not support frustration of the multi-body terms. Furthermore, the inability to accurately describe frustration means that these methods cannot be used for thermal sampling.

We propose a new method of encoding problems which does support max-SAT, frustration, and sampling. I will describe this method in detail, and show how a recent coupling proposal by a different group for unfrustrated Ising couplings is also compatible with frustration and can be made compatible with sampling applications. I will than discuss applications of our method including, direct embedding of max-SAT problems on a chimera graph, optimization with non-linear constraints, and particle simulation.

Stefan Zohren, Oxford University, Paul Warburton, UCL, Simon Benjamin, Oxford University, Stephen Roberts, Oxford University

Presented at the Adiabatic Quantum Computing Conference, June 26-29, 2016, at Google's Los Angeles office.




Other Videos By Google TechTalks


2016-12-06GTAC 2016: Selenium-based Test Automation for Windows and Windows Phone
2016-12-06GTAC 2016: Automating Telepresence Robot Driving
2016-12-06GTAC 2016 - Day 1 Keynote
2016-12-06GTAC 2016: Day 1 Opening Remarks
2016-11-21AQC 2016 - Controlled Interactions Between Superconducting Qubits for Adiabatic Quantum Simulations
2016-11-21AQC 2016 - Testing Adiabatic Quantum Computers Using Simple Quantum Simulation
2016-11-21AQC 2016 - A Quantum-Assisted Algorithm for Sampling Applications in Machine Learning
2016-11-10What is in Common Between Quantum Computer and Solar System?
2016-11-10Simulating the Quantum World on a Classical Computer
2016-10-20AQC 2016 - Coupled Quantum Fluctuations and Quantum Annealing
2016-10-20AQC 2016 - Max-k-SAT, Multi-Body Frustration, & Multi-Body Sampling on a Two Local Ising System
2016-10-20AQC 2016 - Boosting Quantum Annealer Performance via Quantum Persistence
2016-10-20AQC 2016 - Avoiding Negative Sign Problem in Simulation of Quantum Annealilng
2016-10-20AQC2016 - Classical Modeling of Quantum Tunneling
2016-10-20AQC 2016 - Adiabatic Quantum Computer vs. Diffusion Monte Carlo
2016-10-20AQC 2016 - Floquet Quantum Annealing with Superconducting Circuit
2016-10-20AQC 2016 - Simulated Annealing Comparison Between All-to-All Connectivity Schemes
2016-10-20AQC 2016 - Parity Adiabatic Quantum Computing
2016-10-20AQC 2016 - Towards Quantum Supremacy with Pre-Fault-Tolerant Devices
2016-10-20AQC 2016 - Scaling Analysis & Instantons for Thermally-Assisted Tunneling and Quantum MC Simulations
2016-10-20AQC 2016 - The Quantum Spin Glass Transition on the Regular Random Graph



Tags:
google techtalk
quantum computing