AQC 2016 - Boosting Quantum Annealer Performance via Quantum Persistence
696 views · Published 20 October 2016 · 22:47 · Indexed 26 October 2026
Channel: Google TechTalks · 2016 · Science & Technology
A Google TechTalk, June 29, 2016, presented by Gili Rosenberg (1QBit) ABSTRACT: We propose a novel method for reducing the number of variables in quadratic unconstrained binary optimization problems, using a quantum annealer to fix the state of a large portion of the variables to values with a high probability of being optimal. The method significantly increases the success rate when compared with calling the quantum annealer without using it. The results can be further enhanced by applying the method iteratively or combining it with classical pre-processing. We present results for both Chimera graph-structured problems and embedded problems from real-world applications. Hamed Karimi, 1QB Information Technologies (1QBit) Presented at the Adiabatic Quantum Computing Conference, June 26-29, 2016, at Google's Los Angeles office.
More from this channel
-
34:17
Thinglink - A Free Product Code for Creative Work
-
32:48
Thinking Beyond Borders
-
44:29
Understanding Urban Environments Through the Use of...
-
46:05
Customer Centric Web Decision Making
-
46:04
Customizable Scalable Compute Intensive Stream Queries
-
51:26
All The Government's Information
-
41:35
Combining Discriminative Features to Infer Complex...
-
59:42
Dimensions of Reputation in Electronic Markets