filmov
tv
AQC 2016 - Simulated Annealing Comparison Between All-to-All Connectivity Schemes
Показать описание
A Google TechTalk, June 29, 2016, presented by Tameem Albash (USC)
ABSTRACT: Quantum annealing aims to exploit quantum mechanics to speed up the solution to optimization problems. Most problems exhibit complete connectivity between the logical spin variables after they are mapped to the Ising spin Hamiltonian of quantum annealing. To account for hardware constraints of current and future physical quantum annealers, methods enabling the embedding of fully connected graphs of logical spins into a constant-degree graph of physical spins are therefore essential. Here, we compare the recently proposed embedding scheme for quantum annealing with all-to-all connectivity due to Lechner, Hauke and Zoller (LHZ) [Science Advances 1 (2015)] to the commonly used minor embedding (ME) scheme.
Using both simulated quantum annealing and parallel tempering simulations, we find that for a set of instances randomly chosen from a class of fully connected, random Ising problems, the ME scheme outperforms the LHZ scheme when using identical simulation parameters, despite the fault tolerance of the latter to weakly correlated spin-flip noise. This result persists even after we introduce several decoding strategies for the LHZ scheme, including a minimum-weight decoding algorithm that results in substantially improved performance over the original LHZ scheme. We explain the better performance of the ME scheme in terms of more efficient spin updates, which allows it to better tolerate the correlated spin-flip errors that arise in our model of quantum annealing. Our results leave open the question of whether the performance of the two embedding schemes can be improved using scheme-specific parameters and new error correction approaches.
Presented at the Adiabatic Quantum Computing Conference, June 26-29, 2016, at Google's Los Angeles office.
ABSTRACT: Quantum annealing aims to exploit quantum mechanics to speed up the solution to optimization problems. Most problems exhibit complete connectivity between the logical spin variables after they are mapped to the Ising spin Hamiltonian of quantum annealing. To account for hardware constraints of current and future physical quantum annealers, methods enabling the embedding of fully connected graphs of logical spins into a constant-degree graph of physical spins are therefore essential. Here, we compare the recently proposed embedding scheme for quantum annealing with all-to-all connectivity due to Lechner, Hauke and Zoller (LHZ) [Science Advances 1 (2015)] to the commonly used minor embedding (ME) scheme.
Using both simulated quantum annealing and parallel tempering simulations, we find that for a set of instances randomly chosen from a class of fully connected, random Ising problems, the ME scheme outperforms the LHZ scheme when using identical simulation parameters, despite the fault tolerance of the latter to weakly correlated spin-flip noise. This result persists even after we introduce several decoding strategies for the LHZ scheme, including a minimum-weight decoding algorithm that results in substantially improved performance over the original LHZ scheme. We explain the better performance of the ME scheme in terms of more efficient spin updates, which allows it to better tolerate the correlated spin-flip errors that arise in our model of quantum annealing. Our results leave open the question of whether the performance of the two embedding schemes can be improved using scheme-specific parameters and new error correction approaches.
Presented at the Adiabatic Quantum Computing Conference, June 26-29, 2016, at Google's Los Angeles office.
0:33:31
AQC 2016 - Simulated Annealing Comparison Between All-to-All Connectivity Schemes
0:36:55
AQC 2016 - Simulated Quantum Annealing Can Be Exponentially Faster Than Classical
0:33:20
AQC 2016 - Quantum Monte Carlo Simulations and Quantum Annealing
0:25:26
AQC 2016 - Avoiding Negative Sign Problem in Simulation of Quantum Annealilng
0:32:28
AQC 2016 - What is the Computational Value of Finite Range Tunneling?
0:28:32
Hidetoshi Nishimori - Is quantum annealing equivalent to simulated annealing?
0:38:17
AQC - 2016 Quantum vs. Classical Optimization - A Status Report on the Arms Race
1:23:58
Catherine McGeoch - Quantum Annealing: Theory and Practice
0:20:08
AQC 2016 - Floquet Quantum Annealing with Superconducting Circuit
0:17:29
AQC 2016 - Opening Remarks: Why We Believe Quantum Annealing Will Succeed
0:19:46
AQC 2016 - Scaling Analysis & Instantons for Thermally-Assisted Tunneling and Quantum MC Simulat...
0:25:30
AQC 2016 - Quantum Annealing via Environment-Mediated Quantum Diffusion
0:25:09
AQC 2016 - An Optimal Stopping Approach for Benchmarking Probabilistic Optimizers
0:33:10
AQC 2016 - Testing Adiabatic Quantum Computers Using Simple Quantum Simulation
0:26:40
AQC 2016 - Coupled Quantum Fluctuations and Quantum Annealing
0:31:03
AQC 2016 - Building Quantum Annealer v2.0
0:22:47
AQC 2016 - Boosting Quantum Annealer Performance via Quantum Persistence
0:23:58
Simulated quantum annealing can be exponentially faster than classical simulated annealing
0:36:46
AQC 2016 - Quantum Monte Carlo vs Tunneling vs. Adiabatic Optimization
0:21:46
AQC2017:1-10.Helmut G Katzgraber
0:29:43
AQC 2016 - A Fully-Programmable Measurement-Feedback OPO Ising Machine with All-to-All Connectivity
0:15:16
The challenge of quantum annealing in a nutshell
1:01:03
CS3 lecture 42: Heuristics - Simulated Annealing - Richard Buckland (draft) UNSW COMP2911
0:37:01
AQC 2016 - Parity Adiabatic Quantum Computing
Комментарии