Recognition: unknown
Quantum Adiabatic Evolution Algorithms versus Simulated Annealing
read the original abstract
We explain why quantum adiabatic evolution and simulated annealing perform similarly in certain examples of searching for the minimum of a cost function of n bits. In these examples each bit is treated symmetrically so the cost function depends only on the Hamming weight of the n bits. We also give two examples, closely related to these, where the similarity breaks down in that the quantum adiabatic algorithm succeeds in polynomial time whereas simulated annealing requires exponential time.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
A Quantum Approximate Optimization Algorithm
A p-layer alternating-operator ansatz on n qubits yields approximation ratios that increase with p, achieving ≥0.6924 for MaxCut on 3-regular graphs at p=1 and approaching 1 in the p→∞ adiabatic limit.
-
BoolXLLM: LLM-Assisted Explainability for Boolean Models
BoolXLLM augments an existing Boolean rule learner with LLMs for feature selection, discretization thresholds, and natural-language rule translation to improve interpretability while preserving accuracy.
-
Encoding strategies for quantum enhanced fluid simulations: opportunities and challenges
Encoding strategies for quantum fluid simulations trade off compactness against practicality in state preparation, measurement, boundary conditions, and nonlinear operations, with no single approach being universally optimal.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.