2018
DOI: 10.1088/2058-9565/aac8b2
|View full text |Cite
|
Sign up to set email alerts
|

A deceptive step towards quantum speedup detection

Abstract: There have been multiple attempts to design synthetic benchmark problems with the goal of detecting quantum speedup in current quantum annealing machines. To date, classical heuristics have consistently outperformed quantum-annealing based approaches. Here we introduce a class of problems based on frustrated cluster loops -deceptive cluster loops -for which all currently known state-of-the-art classical heuristics are outperformed by the DW2000Q quantum annealing machine. While there is a sizable constant spee… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
83
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 80 publications
(86 citation statements)
references
References 36 publications
1
83
0
Order By: Relevance
“…While unlike the gate model adiabatic quantum evolution is inherently robust to path variations due to unitary control errors [11], there is as of yet no equivalent mechanism of error discretization or an analogous accuracy threshold theorem in this paradigm. Yet, at the same time quantum annealing offers a currently unparalleled opportunity to explore NISQ-era [12] quantum optimization with thousands of qubits [13,14]. It is thus of great importance to assess the role of analog control errors in QA, and to find ways to mitigate them.…”
Section: Introductionmentioning
confidence: 99%
“…While unlike the gate model adiabatic quantum evolution is inherently robust to path variations due to unitary control errors [11], there is as of yet no equivalent mechanism of error discretization or an analogous accuracy threshold theorem in this paradigm. Yet, at the same time quantum annealing offers a currently unparalleled opportunity to explore NISQ-era [12] quantum optimization with thousands of qubits [13,14]. It is thus of great importance to assess the role of analog control errors in QA, and to find ways to mitigate them.…”
Section: Introductionmentioning
confidence: 99%
“…where t run is the running time elapsed for a single run (either τ for forward or 2τ + ρ for reverse), and p is the probability of finding the optimum of the objective function in that single shot [1,27].…”
Section: Resultsmentioning
confidence: 99%
“…In the case of quantum annealing, it has been common to use spin-glass-like Hamiltonians as benchmark problems with the resources measured being the time it takes to solve an ensemble of problems as a function of the size of the input (here, the number of variables). Most recently, it has been argued [50] that energy should be included in such metrics. In addition, careful definitions of speedup are needed between quantum and classical paradigms.…”
Section: Quantum Annealing Vs Classical Simulationmentioning
confidence: 99%