Fetching the paper…
Reading the bibliography…
Mapping functions on bits to Hamiltonians acting on qubits has many applications in quantum computing.
G. Birkhoff and J. Von Neumann, “The logic of quantum mechanics,” Annals of mathematics
1936
Earlier work this paper cites.
Elsevier, 1977
F. J. MacWilliams and N. J. A. Sloane, The theory of error correcting codes · 1977
Earlier work this paper cites.
New York, NY, USA: W. H. Freeman & Co., 1979
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP–Completeness · 1979
Earlier work this paper cites.
F. Barahona, “On the computational complexity of ising spin glass models,” Journal of Physics A: Mathematical and General
1982
Earlier work this paper cites.
J. Kahn, G. Kalai, and N. Linial, “The influence of variables on Boolean functions,” in Proc. 29th IEEE Symposium on Foundations of Computer Science
1988
Earlier work this paper cites.
N. Linial, Y. Mansour, and N. Nisan, “Constant depth circuits, Fourier transform, and learnability,” Journal of the ACM (JACM)
1993
Earlier work this paper cites.
R. Beigel, “The polynomial method in circuit complexity,” in Proc. 8th Structure in Complexity Theory Conference
1993
Earlier work this paper cites.
N. Nisan and M. Szegedy, “On the degree of Boolean functions as real polynomials,” Computational complexity
1994
Earlier work this paper cites.
A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, “Elementary gates for quantum computation,” Physical review A
1995
Earlier work this paper cites.
Dover, 1996
A. Szabo and N. S. Ostlund, Modern Quantum Chemistry: Introduction to Advanced Electronic Structure Theory · 1996
Earlier work this paper cites.
M. A. Nielsen, “Computable functions, quantum measurements, and quantum dynamics,” Physical Review Letters
1997
Earlier work this paper cites.
T. Kadowaki and H. Nishimori, “Quantum annealing in the transverse Ising model,” Phys. Rev. E
1998
Earlier work this paper cites.
E. Knill and R. Laflamme, “Power of one bit of quantum information,” Physical Review Letters
1998
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, “Quantum computation by adiabatic evolution,” arXiv preprint quant-ph/0001106
2000
Earlier work this paper cites.
T. Hogg and D. Portnov, “Quantum optimization,” Information Sciences
2000
Earlier work this paper cites.
Cambridge UK: Cambridge University Press, 2000
M. Nielsen and I. Chuang, Quantum Computation and Quantum Information · 2000
Earlier work this paper cites.
R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. De Wolf, “Quantum lower bounds by polynomials,” Journal of the ACM (JACM)
2001
Earlier work this paper cites.
Clarendon Press, 2001
H. Nishimori, Statistical physics of spin glasses and information processing: an introduction · 2001
Earlier work this paper cites.
E. Boros and P. L. Hammer, “Pseudo-Boolean optimization,” Discrete applied mathematics
2002
Earlier work this paper cites.
N. Schuch and J. Siewert, “Programmable networks for quantum algorithms,” Physical review letters
2003
Earlier work this paper cites.
PhD thesis, Massachusetts Institute of Technology, 2004
A. M. Childs, Quantum information processing in continuous time · 2004
Cited alongside, same era.
E. Lieb, T. Schultz, and D. Mattis, “Two soluble models of an antiferromagnetic chain,” in Condensed Matter Physics and Exactly Soluble Models
2004
Cited alongside, same era.
A. Ambainis, “Polynomial degree vs. quantum query complexity,” Journal of Computer and System Sciences
2006
Cited alongside, same era.
J. Kempe, A. Kitaev, and O. Regev, “The complexity of the local Hamiltonian problem,” SIAM J. Comput
2006
Cited alongside, same era.
A. Montanaro and T. J. Osborne, “Quantum Boolean functions,” arXiv preprint arXiv:0810.2435
2008
Cited alongside, same era.
Cambridge University Press, 2014
R. O’Donnell, Analysis of Boolean functions · 2014
Later among the works it cites.
J. Welch, D. Greenbaum, S. Mostame, and A. Aspuru-Guzik, “Efficient quantum circuits for diagonal unitaries without ancillas,” New Journal of Physics
2014
Later among the works it cites.
Y. Filmus, H. Hatami, S. Heilman, E. Mossel, R. O’Donnell, S. Sachdeva, A. Wan, and K. Wimmer, “Real analysis in computer science: A collection of open problems,” Preprint available at https://simons. berkeley. edu/sites/default/files/openprobsmerged.pdf
2014
Later among the works it cites.
S. Gharibian, Y. Huang, Z. Landau, S. W. Shin, et al
2015
Later among the works it cites.
I. Hen and M. S. Sarandy, “Driver Hamiltonians for constrained optimization in quantum annealing,” Phys. Rev. A
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. De Wolf, “A brief introduction to Fourier analysis on the Boolean cube.,” Theory of Computing, Graduate Surveys
2008
Cited alongside, same era.
Springer Science & Business Media, 2008
S. Givant and P. Halmos, Introduction to Boolean Algebras · 2008
Cited alongside, same era.
J. Biamonte, “Nonperturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins,” Phys. Rev. A
2008
Cited alongside, same era.
Cambridge University Press, 2009
S. Arora and B. Barak, Computational Complexity - A Modern Approach · 2009
Cited alongside, same era.
I. J. Crosson, D. Bacon, and K. R. Brown, “Making classical ground-state spin computing fault-tolerant,” Phys. Rev. E
2010
Cited alongside, same era.
Z. Bian, F. Chudak, W. G. Macready, and G. Rose, “The Ising model: teaching an old problem new tricks,” tech. rep., D-Wave Systems, 2010
2010
Cited alongside, same era.
Springer Science & Business Media, 2012
G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, Complexity and approximation: Combinatorial optimization problems and their approximability properties · 2012
Cited alongside, same era.
I. Hen and F. M. Spedalieri, “Quantum annealing for constrained optimization,” Phys. Rev. Appl
2016
Later among the works it cites.
2017
Later among the works it cites.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, “Achieving quantum supremacy with sparse and noisy commuting quantum computations,” Quantum
2017
Later among the works it cites.
S. Hadfield, Z. Wang, E. G. Rieffel, B. O’Gorman, D. Venturelli, and R. Biswas, “Quantum approximate optimization with hard and soft constraints,” in Proceedings of the Second International Workshop on Post Moores Era Supercomputing
2017
Later among the works it cites.
Springer, 2017
P. Woit, Quantum Theory, Groups and Representations: An Introduction · 2017
Later among the works it cites.
2017
Later among the works it cites.
M. Amy, P. Azimzadeh, and M. Mosca, “On the controlled-not complexity of controlled-not–phase circuits,” Quantum Science and Technology
2018
Closest in time.
2018
Closest in time.
T. S. Cubitt, A. Montanaro, and S. Piddock, “Universal quantum hamiltonians,” Proceedings of the National Academy of Sciences
2018
Closest in time.
S. Bravyi, D. Gosset, and R. König, “Quantum advantage with shallow circuits,” Science
2018
Closest in time.
S. Hadfield, Z. Wang, B. O’Gorman, E. G. Rieffel, D. Venturelli, and R. Biswas, “From the quantum approximate optimization algorithm to a quantum alternating operator ansatz,” Algorithms
2019
Closest in time.
2019
Closest in time.
2020
Closest in time.
M. Ohzeki, “Breaking limitation of quantum annealer in solving optimization problems under constraints,” Scientific reports
2020
Closest in time.