Showing 1–20 of 28 results
/ Date/ Name
May 18, 2020The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case ExamplesMar 6, 2001An example of the difference between quantum and classical random walksNov 18, 1997Quantum Mechanical Square Root Speedup in a Structured Search ProblemDec 18, 2014A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint ProblemSep 30, 2010Unstructured Randomness, Small Gaps and LocalizationJul 19, 2000A Numerical Study of the Performance of a Quantum Adiabatic Evolution Algorithm for SatisfiabilityAug 21, 2002Quantum Adiabatic Evolution Algorithms with Different PathsJan 11, 2022Conditional Probability of Derangements and Fixed PointsDec 19, 2005How to Make the Quantum Adiabatic Algorithm FailJun 12, 1995Using Classical Probability To Guarantee Properties of Infinite Quantum SequencesApr 30, 1993Correlation functions of the One-Dimensional Random Field Ising Model at Zero TemperatureOct 17, 2019The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite SizeSep 25, 2009Quantum Adiabatic Algorithms, Small Gaps, and Different PathsApr 3, 2002Quantum search by measurementDec 19, 2000Finding cliques by quantum adiabatic evolutionApr 26, 2001A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete ProblemJan 8, 2002Quantum Adiabatic Evolution Algorithms versus Simulated AnnealingJan 28, 2000Quantum Computation by Adiabatic EvolutionJul 11, 2022The QAOA gets stuck starting from a good classical stringDec 11, 2018For Fixed Control Parameters the Quantum Approximate Optimization Algorithm's Objective Function Value Concentrates for Typical Instances