2016
DOI: 10.1103/physrevb.93.224431
|View full text |Cite
|
Sign up to set email alerts
|

Quantum annealing speedup over simulated annealing on random Ising chains

Abstract: We show clear evidence of a quadratic speedup of a quantum annealing (QA) Schrödinger dynamics over a Glauber master-equation simulated annealing (SA) for a random Ising model in one dimension, via an equal-footing exact deterministic dynamics of the Jordan-Wigner fermionized problems. This is remarkable, in view of the arguments of Katzgraber et al., PRX 4, 021008 (2014), since SA does not encounter any phase transition, while QA does. We also find a second remarkable result: that a "quantum-inspired" imagina… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
20
2

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 19 publications
(23 citation statements)
references
References 55 publications
1
20
2
Order By: Relevance
“…The typical "slow-down" that SQA data with P → ∞ tend to show for large τ should also not necessarily be taken to imply that there is no quantum speed-up of any type against classical Simulated Annealing (SA). Indeed, based on theoretical arguments 4 , a coherent-QA is expected to show some improvement in the exponent of the logarithmic scaling, ε res (τ ) ∼ [log(γτ )] −ξ , against competing SA strategies: this improvement has been indeed verified on random Ising chains 39,43,44 and on infinitely connected p-spin Ising ferromagnets 52 . Moreover, quite remarkably, non-convex optimization problems are known 35 in which SQA, with the P → ∞ limit properly taken, is definitely much more efficient than its classical SA counterpart.…”
Section: Discussionmentioning
confidence: 97%
See 1 more Smart Citation
“…The typical "slow-down" that SQA data with P → ∞ tend to show for large τ should also not necessarily be taken to imply that there is no quantum speed-up of any type against classical Simulated Annealing (SA). Indeed, based on theoretical arguments 4 , a coherent-QA is expected to show some improvement in the exponent of the logarithmic scaling, ε res (τ ) ∼ [log(γτ )] −ξ , against competing SA strategies: this improvement has been indeed verified on random Ising chains 39,43,44 and on infinitely connected p-spin Ising ferromagnets 52 . Moreover, quite remarkably, non-convex optimization problems are known 35 in which SQA, with the P → ∞ limit properly taken, is definitely much more efficient than its classical SA counterpart.…”
Section: Discussionmentioning
confidence: 97%
“…where now σ z iσ z i+1 t = ψ(t)|σ z iσ z i+1 |ψ(t) is the quantum average with the time-evolving state |ψ(t) . It can be calculated through time-dependent Bogoljoubov-de Gennes (BdG) equations 39,44 . The residual energy at the end of the annealing is simply obtained as…”
Section: Model and Methodsmentioning
confidence: 99%
“…56, as recently applied on the random Ising chain problem in Ref. 57, we might transform a classical master equation into an equivalent imaginary-time Schrödinger problem with an appropriate effective Hamiltonian H σ,σ which effectively "symmetrizes" the rate matrix W σ,σ using DB; from there, one would then proceed to study such equivalent imaginary-time Schrödinger problem using the same "total spin technique" employed above for the quantum case. One might do that, but we will not do it here, for a reason that we briefly explain in Appendix B.…”
Section: A Quantum Annealing (Qa-rt)mentioning
confidence: 99%
“…The density of defects is then suppressed logarithmically with quench time d 1 ln Q 2 t , which is quadratically faster than simulated annealing, where defects scale as d 1 ln Q t [33,34]. The existence of these logarithmic scaling laws implies that one has to run exponentially long annealing times to reduce the residual energy of the final state.…”
Section: Causal Origin Of Topological Defectsmentioning
confidence: 99%