2017
DOI: 10.48550/arxiv.1701.04579
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Quantum Annealing amid Local Ruggedness and Global Frustration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
53
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 24 publications
(55 citation statements)
references
References 0 publications
2
53
0
Order By: Relevance
“…For this amino acid sequence (DAYAQWLK) we again generated the Hamiltonian using the turn ancilla encoding locally on our server. However, this time we split the large Hamiltonian into 2 12 subproblems and requested only five batches of 10000 readouts each from the quantum processor via cloud access. Again for verification purposes, the correct lattice fold was obtained with a classical Monte-Carlo solver on classical hardware.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…For this amino acid sequence (DAYAQWLK) we again generated the Hamiltonian using the turn ancilla encoding locally on our server. However, this time we split the large Hamiltonian into 2 12 subproblems and requested only five batches of 10000 readouts each from the quantum processor via cloud access. Again for verification purposes, the correct lattice fold was obtained with a classical Monte-Carlo solver on classical hardware.…”
Section: Resultsmentioning
confidence: 99%
“…In recent years, quantum annealers have been shown to be able to solve certain NP-hard problems more efficiently than classical computers [5,12,14]. For this reason, quantum annealing performed on real-world experimental devices might provide solutions to the problem of finding the lowest energy conformation for lattice proteins of sizes unreachable for classical hardware.…”
Section: Introductionmentioning
confidence: 99%
“…In this section we address whether our empirical results and reasonable agreement with a quantum theory of the KZM can also be understood using a purely classical approach. We first consider a Boltzmann distribution of the kink density of the classical Ising chain, then the classical spin-vector Monte Carlo model [80], which has been successfully applied to at least partially describe the outcomes of experiments using the D-Wave devices in past studies [8,13,56,66,67,71,81], and also in recent theoretical studies of quantum annealing [82,83].…”
Section: Tests Of Classicalitymentioning
confidence: 99%
“…Quantum simulations are emerging to be one of the important applications of quantum annealing [1][2][3][4], quite different, and arguably more natural, than the original intent of using such devices for optimization, the subject of many recent studies [5][6][7][8][9][10][11][12][13][14][15]. Prominent examples include the simulation of the Kosterlitz-Thouless topological phase transition [16,17] and three-dimensional spin glasses [18] using the D-Wave quantum annealing devices, that have successfully reproduced the behavior of various physical quantities and the structure of the phase diagram, as predicted by classical simulations.…”
Section: Introductionmentioning
confidence: 99%
“…(2.54) has some limitation due to the hardware graph of the D-Wave computer chip which is full graph nor a regular lattice as in [63]. This processor chip is an intermediate case between two types of mentioned graphs, see Figure 2.4 [149,150,151], and it is called a Chimera graph χ ij . Such graph imposes a hierarchical relation similar to this observed among investors [61].…”
Section: Simulated Annealing On the D-wave Machinementioning
confidence: 99%