Fetching the paper…
Reading the bibliography…
Quantum algorithms can deliver asymptotic speedups over their classical counterparts.
A computing procedure for quantification theory
M. Davis and H. Putnam · 1960
Earlier work this paper cites.
A machine program for theorem proving
M. Davis, G. Logemann, and D. Loveland · 1962
Earlier work this paper cites.
New methods to color the vertices of a graph
D. Brélaz · 1979
Earlier work this paper cites.
A graph coloring algorithm for large scheduling problems
F. Leighton · 1979
Earlier work this paper cites.
An average time analysis of backtracking
C. Brown and P. Purdom, Jr · 1981
Earlier work this paper cites.
The chromatic number of random graphs
B. Bollobás · 1988
Earlier work this paper cites.
Experimental evaluation of preprocessing techniques in constraint satisfaction problems
R. Dechter and I. Meiri · 1989
Earlier work this paper cites.
The priority-based coloring approach to register allocation
F. Chow and J. Hennessy · 1990
Earlier work this paper cites.
Where the really hard problems are
P. Cheeseman, B. Kanefsky, and W. Taylor · 1991
Earlier work this paper cites.
Planning as satisfiability
B. Selman and H. Kautz · 1992
Earlier work this paper cites.
On the efficiency of parallel backtracking
V. Rao and V. Kumar · 1993
Earlier work this paper cites.
Algorithms for quantum computation: discrete logarithms and factoring
P. W. Shor · 1994
Earlier work this paper cites.
A column generation approach for graph coloring
A. Mehrotra and M. Trick · 1996
Earlier work this paper cites.
An improved algorithm for exact graph coloring
E. Sewell · 1996
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani · 1997
Earlier work this paper cites.
Quantum mechanics helps in searching for a needle in a haystack
L. Grover · 1997
Earlier work this paper cites.
Quantum lower bounds by polynomials
R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf · 1998
Earlier work this paper cites.
Tight bounds on quantum searching
M. Boyer, G. Brassard, P. Høyer, and A. Tapp · 1998
Earlier work this paper cites.
Quantum algorithms revisited
R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca · 1998
Earlier work this paper cites.
Quantum amplitude amplification and estimation
G. Brassard, P. Høyer, M. Mosca, and A. Tapp · 2002
Earlier work this paper cites.
Universal quantum computation with ideal Clifford gates and noisy ancillas
S. Bravyi and A. Kitaev · 2005
Earlier work this paper cites.
A branch-and-cut algorithm for graph coloring
I. Méndez-Díaz and P. Zabala · 2005
Earlier work this paper cites.
A survey of recent advances in SAT-based formal verification
M. Prasad, A. Biere, and A. Gupta · 2005
Earlier work this paper cites.
A polynomial quantum algorithm for approximating the Jones polynomial
D. Aharonov, V. Jones, and Z. Landau · 2006
Earlier work this paper cites.
Graph domination, coloring and cliques in telecommunications
B. Balasundaram and S. Butenko · 2006
Earlier work this paper cites.
A logarithmic-depth quantum carry-lookahead adder
T. Draper, S. Kutin, E. Rains, and K. Svore · 2006
Earlier work this paper cites.
Another look at graph coloring via propositional satisfiability
A. Van Gelder · 2006
Earlier work this paper cites.
Threshold values of random K-SAT from the cavity method
S. Mertens, M. Mézard, and R. Zecchina · 2006
Earlier work this paper cites.
Architecture-dependent execution time of Shor’s algorithm
R. Van Meter, K. Itoh, and T. Ladd · 2006
Earlier work this paper cites.
Models and solution techniques for frequency assignment problems
K. Aardal, S. van Hoesel, A. Koster, C. Mannino, and A. Sassano · 2007
Earlier work this paper cites.
A note on the chromatic number of a dense random graph
K. Panagiotou and A. Steger · 2008
Cited alongside, same era.
A survey on vertex coloring problems
E. Malaguti and P. Toth · 2009
Cited alongside, same era.
Evaluating and improving modern variable and revision ordering strategies in CSPs
T. Balafoutis and K. Stergiou · 2010
Cited alongside, same era.
Efficient universal quantum circuits
D. Bera, S. Fenner, F. Green, and S. Homer · 2010
Cited alongside, same era.
On the relationship between continuous- and discrete-time quantum walk
A. Childs · 2010
Cited alongside, same era.
Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems
S. Mandrà, Gian Giacomo Guerreschi, and A. Aspuru-Guzik · 2016
Later among the works it cites.
The whole is less than the sum of its parts: Constructing more efficient lattice-based AKEs
R. Del Pino, V. Lyubashevsky, and D. Pointcheval · 2016
Later among the works it cites.
Hardware accelerated SAT solvers – a survey
A. Sohanghpurwala, M. Hassan, and P. Athanas · 2016
Later among the works it cites.
Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
A. Ambainis and M. Kokainis · 2017
Later among the works it cites.
Optimizing the number of gates in quantum search
S. Arunachalam and R. de Wolf · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. San Segundo · 2011
Cited alongside, same era.
Magic-state distillation with low overhead
S. Bravyi and J. Haah · 2012
Cited alongside, same era.
Time-optimal quantum computation, 2012
A. Fowler · 2012
Cited alongside, same era.
Surface codes: Towards practical large-scale quantum computation
A. Fowler, M. Mariantoni, J. Martinis, and A. Cleland · 2012
Cited alongside, same era.
Surface code quantum computing by lattice surgery
C. Horsman, A. Fowler, S. Devitt, and R. Van Meter · 2012
Cited alongside, same era.
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
M. Amy, D. Maslov, M. Mosca, and M. Roetteler · 2013
Cited alongside, same era.
Quantum walks and electric networks, 2013
A. Belovs · 2013
Cited alongside, same era.
Proceedings of SAT competition 2017: Solver and benchmark descriptions, 2017
T. Balyo, M. Heule, and M. Järvisalo · 2017
Later among the works it cites.
Roads towards robust and universal quantum computation
E. Campbell, B. Terhal, and C. Vuillot · 2017
Later among the works it cites.
Almost-linear time decoding algorithm for topological codes, 2017
N. Delfosse and N. Nickerson · 2017
Later among the works it cites.
Robustness of error-suppressing entangling gates in cavity-coupled transmon qubits
X.-H. Deng, E. Barnes, and S. Economou · 2017
Later among the works it cites.
Halving the cost of quantum addition, 2017
C. Gidney · 2017
Later among the works it cites.
Factoring using 2 n + 2 2n+2 qubits with Toffoli based modular multiplication
T. Häner, M. Roetteler, and K. Svore · 2017
Later among the works it cites.
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. Chow, and J. Gambetta · 2017
Later among the works it cites.
Quantum speedup of the traveling-salesman problem for bounded-degree graphs
D. Moylett, N. Linden, and A. Montanaro · 2017
Later among the works it cites.
Quantum computation with realistic magic-state factories
J. O’Gorman and E. Campbell · 2017
Later among the works it cites.
Unsupervised machine learning on a hybrid quantum computer, 2017
J. S. Otterbach, R. Manenti, N. Alidoust, A. Bestwick, M. Block, B. Bloom, S. Caldwell, N. Didier, E. Schuyler Fried, S. Hong, P. Karalekas, C. B. Osborn, A. Papageorge, E. C. Peterson, G. Prawiroatmodjo, N. Rubin, C. A. Ryan, D. Scarabelli, M. Scheer, E. A. Sete, P. Sivarajah, R. S. Smith, A. Staley, N. Tezak, W. J. Zeng, A. Hudson, B. R. Johnson, M. Reagor, M. P. da Silva, and C. Rigetti · 2017
Later among the works it cites.
Elucidating reaction mechanisms on quantum computers
M. Reiher, N. Wiebe, K. Svore, D. Wecker, and M. Troyer · 2017
Later among the works it cites.
Quantum resource estimates for computing elliptic curve discrete logarithms
M. Rötteler, M. Naehrig, K. Svore, and K. Lauder · 2017
Later among the works it cites.
Rapid high-fidelity single-shot dispersive readout of superconducting qubits
T. Walter, P. Kurpiers, S. Gasparinetti, P. Magnard, A. Potočnik, Y. Salathé, M. Pechal, M. Mondal, M. Oppliger, C. Eichler, and A. Wallraff · 2017
Later among the works it cites.
Quantum attacks on Bitcoin, and how to protect against them
D. Aggarwal, G. Brennen, T. Lee, M. Santha, and M. Tomamichel · 2018
Closest in time.
Encoding electronic spectra in quantum circuits with linear T complexity
R. Babbush, C. Gidney, D. Berry, N. Wiebe, J. McClean, A. Paler, A. Fowler, and H. Neven · 2018
Closest in time.
ebacs: Ecrypt benchmarking of cryptographic systems, accessed 27 June 2018
D. Bernstein and T. Lange (editors) · 2018
Closest in time.
Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness
C. Cade, A. Montanaro, and A. Belovs · 2018
Closest in time.
Magic state parity-checker with pre-distilled components
E. Campbell and M. Howard · 2018
Closest in time.
Toward the first quantum simulation with quantum speedup
A. Childs, D. Maslov, Y. Nam, N. Ross, and Y. Su · 2018
Closest in time.
Low overhead quantum computation using lattice surgery, 2018
A. Fowler and C. Gidney · 2018
Closest in time.
Improved quantum backtracking algorithms using effective resistance estimates
M. Jarret and K. Wan · 2018
Closest in time.
Quantum supremacy is both closer and farther than it appears, 2018
I. Markov, A. Fatima, S. Isakov, and S. Boixo · 2018
Closest in time.
Quantum-walk speedup of backtracking algorithms
A. Montanaro · 2018
Closest in time.
Fast quantum logic gates with trapped-ion qubits
V. Schäfer, C. Ballance, K. Thirumalai, L. Stephenson, T. Ballance, A. Steane, and D. Lucas · 2018
Closest in time.
A game of surface codes: Large-scale quantum computing with lattice surgery
D. Litinski · 2019
Closest in time.