Mind the gap: achieving a super-Grover quantum speedup by jumping to the end
From MaRDI portal
Publication:6499293
DOI10.1145/3564246.3585203WikidataQ130906971 ScholiaQ130906971MaRDI QIDQ6499293
Alexander M. Dalzell, Nicola Pancotti, Fernando G. S. L. Brandão, Earl T. Campbell
Publication date: 8 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Performance of two different quantum annealing correction codes
- Solving satisfiability in less than \(2^ n\) steps
- The equivalence of the logarithmic Sobolev inequality and the Dobrushin- Shlosman mixing condition
- A probabilistic algorithm for \(k\)-SAT based on limited local search and restart
- Nested quantum search and NP-hard problems
- A spectral condition for spectral gap: fast mixing in high-temperature Ising models
- On the spectral gap of spherical spin glass dynamics
- Quantum dual adversary for hidden subgroups and beyond
- Rigorous RG algorithms and area laws for low energy eigenstates in 1D
- Anderson localization makes adiabatic quantum optimization fail
- Practical Implementation of a Quantum Backtracking Algorithm
- An improved exponential-time algorithm for k -SAT
- On the maximum satisfiability of random formulas
- The threshold for random k-SAT is 2 k (ln 2 - O(k))
- Adiabatic quantum state generation and statistical zero knowledge
- Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
- Faster k -SAT algorithms using biased-PPSZ
- Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
- Quantum speedup of Monte Carlo methods
- 3-SAT Faster and Simpler---Unique-SAT Bounds for PPSZ Hold in General
- The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach
This page was built for publication: Mind the gap: achieving a super-Grover quantum speedup by jumping to the end
