Fetching the paper…
Reading the bibliography…
One of the challenges of quantum computers in the near- and mid- term is the limited number of qubits we can use for computations.
“A Computing Procedure for Quantification Theory”
Martin Davis and Hilary Putnam · 1960
Earlier work this paper cites.
“A machine program for theorem-proving”
Martin Davis, George Logemann, and Donald W Loveland · 1961
Earlier work this paper cites.
“Complete problems for deterministic polynomial time”
Neil D. Jones and William T. Laaser · 1976
Earlier work this paper cites.
“Asymptotically tight bounds on time-space trade-offs in a pebble game”
Thomas Lengauer and Robert E Tarjan · 1982
Earlier work this paper cites.
“Time/space trade-offs for reversible computation”
Charles H Bennett · 1989
Earlier work this paper cites.
“Roughly sorting: Sequential and parallel approach”
T. Altman and Y. Igarashi · 1989
Earlier work this paper cites.
“Bounded-width polynomial-size branching programs recognize exactly those languages in NC1”
David A Barrington · 1989
Earlier work this paper cites.
“Limits to parallel computation: P-completeness theory”
Raymond Greenlaw, H James Hoover, Walter L Ruzzo, et al · 1995
Earlier work this paper cites.
“A fast quantum mechanical algorithm for database search”
Lov K Grover · 1996
Earlier work this paper cites.
“Semiclassical fourier transform for quantum computation”
Robert B. Griffiths and Chi-Sheng Niu · 1996
Earlier work this paper cites.
“A one-way quantum computer”
Robert Raussendorf and Hans J. Briegel · 2001
Earlier work this paper cites.
“Quantum computation and quantum information”
Michael A Nielsen and Isaac Chuang · 2002
Earlier work this paper cites.
“Quantum search algorithms”
Andris Ambainis · 2004
Earlier work this paper cites.
“Small quantum computers and large classical data sets” (2020) arXiv:2004.00026
Aram W. Harrow · 2004
Earlier work this paper cites.
“An improved exponential-time algorithm for k-SAT”
Ramamohan Paturi, Pavel Pudlák, Michael E Saks, and Francis Zane · 2005
Earlier work this paper cites.
“Abstract DPLL and abstract DPLL modulo theories”
Robert Nieuwenhuis, Albert Oliveras, and Cesare Tinelli · 2005
Cited alongside, same era.
“Derandomization of PPSZ for unique-k-SAT”
Daniel Rolf · 2005
Cited alongside, same era.
“Improved bound for the PPSZ/schoning-algorithm for 3-SAT”
Daniel Rolf · 2006
Cited alongside, same era.
“Handbook of satisfiability”
Armin Biere, Marijn Heule, and Hans van Maaren · 2009
Cited alongside, same era.
“Information, physics, and computation”
Marc Mezard, Marc Mezard, and Andrea Montanari · 2009
Cited alongside, same era.
“Satisfiability with index dependency”
Hong-Yu Liang and Jing He · 2012
Cited alongside, same era.
“Extending Sledgehammer with SMT solvers”
“Computational speedups using small quantum devices”
Vedran Dunjko, Yimin Ge, and J Ignacio Cirac · 2018
Later among the works it cites.
“Quantum-Walk Speedup of Backtracking Algorithms”
Ashley Montanaro · 2018
Later among the works it cites.
“Solver and benchmark descriptions”
Marijn JH Heule, Matti Juhani Järvisalo, Martin Suda, et al · 2018
Later among the works it cites.
“Improved quantum backtracking algorithms using effective resistance estimates”
Michael Jarret and Kianna Wan · 2018
Later among the works it cites.
“Quantum-assisted Helmholtz machines: A quantum–classical deep learning framework for industrial datasets in near-term devices”
Marcello Benedetti, John Realpe-Gómez, and Alejandro Perdomo-Ortiz · 2018
Later among the works it cites.
“Applying quantum algorithms to constraint satisfaction problems”
Earl Campbell, Ankur Khurana, and Ashley Montanaro · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jasmin Christian Blanchette, Sascha Böhme, and Lawrence C Paulson · 2013
Cited alongside, same era.
“Dequantizing Read-once Quantum Formulas”
Alessandro Cosentino, Robin Kothari, and Adam Paetznick · 2013
Cited alongside, same era.
“3-SAT faster and simpler—unique-SAT bounds for PPSZ hold in general”
Timon Hertli · 2014
Cited alongside, same era.
“Breaking the PPSZ barrier for unique 3-SAT”
Timon Hertli · 2014
Cited alongside, same era.
“Fixed-point quantum search with an optimal number of queries”
Theodore J Yoder, Guang Hao Low, and Isaac L Chuang · 2014
Cited alongside, same era.
“Trading classical and quantum computational resources”
Sergey Bravyi, Graeme Smith, and John A. Smolin · 2016
Cited alongside, same era.
Later among the works it cites.
“Faster k-sat algorithms using biased-ppsz”
Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, and Uri Zwick · 2019
Later among the works it cites.
“Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments”
Thomas E O’Brien, Brian Tarasinski, and Barbara M Terhal · 2019
Later among the works it cites.
“Solving SAT on noisy quantum computers”
Martijn Swenne · 2019
Later among the works it cites.
“A hybrid algorithm framework for small quantum computers with application to finding hamiltonian cycles”
Yimin Ge and Vedran Dunjko · 2020
Closest in time.
“Practical implementation of a quantum backtracking algorithm”
Simon Martiel and Maxime Remaud · 2020
Closest in time.
“Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems”
Akshay Ajagekar, Travis Humble, and Fengqi You · 2020
Closest in time.
“Simulating large quantum circuits on a small quantum computer”
Tianyi Peng, Aram W Harrow, Maris Ozols, and Xiaodi Wu · 2020
Closest in time.
“PPSZ is better than you think”
Dominik Scheder · 2022
Closest in time.