Fetching the paper…
Reading the bibliography…
Variational quantum algorithms, a class of quantum heuristics, are promising candidates for the demonstration of useful quantum computation.
P. Jordan and E. Wigner, “über das Paulische äquivalenzverbot,” Z. Phys
1928
Earlier work this paper cites.
J. Hubbard, “Electron correlations in narrow energy bands,” Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences
1963
Earlier work this paper cites.
H. J. Kushner, “A new method of locating the maximum point of an arbitrary multipeak curve in the presence of noise,” Journal of Basic Engineering
1964
Earlier work this paper cites.
J. A. Nelder and R. Mead, “A simplex method for function minimization,” The computer journal
1965
Earlier work this paper cites.
Université de Montréal, Département d’informatique et de recherche opérationnelle, 1990
Y. Bengio, S. Bengio, and J. Cloutier, Learning a synaptic learning rule · 1990
Earlier work this paper cites.
J. C. Spall et al
1992
Earlier work this paper cites.
D. Beasley, D. R. Bull, and R. R. Martin, “An overview of genetic algorithms: Part 1, fundamentals,” University computing
1993
Earlier work this paper cites.
H. J. Schulz, “Interacting fermions in one dimension: from weak to strong correlation,” arXiv e-prints
1993
Earlier work this paper cites.
Addison-Wesley, 1994
C. Papadimitriou, Computational complexity · 1994
Earlier work this paper cites.
Y. Bengio, P. Simard, P. Frasconi, et al
1994
Earlier work this paper cites.
R. H. Byrd, P. Lu, J. Nocedal, and C. Zhu, “A limited memory algorithm for bound constrained optimization,” SIAM Journal on Scientific Computing
1995
Earlier work this paper cites.
S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural computation
1997
Earlier work this paper cites.
S. Hochreiter, “The vanishing gradient problem during learning recurrent neural nets and problem solutions,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
1998
Earlier work this paper cites.
E. Jones, T. Oliphant, P. Peterson, et al
2001
Earlier work this paper cites.
R. Vilalta and Y. Drissi, “A perspective view and survey of meta-learning,” Artificial intelligence review
2002
Earlier work this paper cites.
P. Charbonneau, “An introduction to genetic algorithms for numerical optimization,” report, National Center for Atmospheric Research, 2002
2002
Earlier work this paper cites.
J. C. Spall, S. D. Hill, and D. R. Stark, “Theoretical framework for comparing several stochastic optimization approaches,” in Probabilistic and Randomized Methods for Design under Uncertainty
2006
Earlier work this paper cites.
R. Krauthgamer and U. Feige, “A polylogarithmic approximation of the minimum bisection,” SIAM review
2006
Earlier work this paper cites.
E. Knill, G. Ortiz, and R. D. Somma, “Optimal quantum measurements of expectation values of observables,” Physical Review A
2007
Earlier work this paper cites.
J. L. Berral, I. Goiri, R. Nou, F. Julia, J. Guitart, R. Gavalda, and J. Torres, “Towards energy-aware scheduling in data centers using machine learning,” Proceedings of the 1st International Conference on energy-Efficient Computing and Networking
2010
Earlier work this paper cites.
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
Earlier work this paper cites.
A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’brien, “A variational eigenvalue solver on a photonic quantum processor,” Nature communications
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv:1412.6980
2014
Earlier work this paper cites.
M. W. Libbrecht and W. S. Noble, “Machine learning applications in genetics and genomics,” Nature Reviews Genetics
2015
Earlier work this paper cites.
M. I. Jordan and T. M. Mitchell, “Machine learning: Trends, perspectives, and prospects,” Science
2015
Cited alongside, same era.
Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” nature
2015
Cited alongside, same era.
C. Lemke, M. Budka, and B. Gabrys, “Metalearning: a survey of trends and technologies,” Artificial intelligence review
2015
Cited alongside, same era.
M. Feurer, A. Klein, K. Eggensperger, J. Springenberg, M. Blum, and F. Hutter, “Efficient and robust automated machine learning,” in Advances in neural information processing systems
2015
Cited alongside, same era.
D. Wecker, M. B. Hastings, and M. Troyer, “Progress towards practical quantum variational algorithms,” Physical Review A
2015
Cited alongside, same era.
2017
Later among the works it cites.
P. Vidnerová and R. Neruda, “Evolution strategies for deep neural network models design,” CEUR Workshop Proceedings
2017
Later among the works it cites.
E. W. Huang, C. B. Mendl, S. Liu, S. Johnston, H.-C. Jiang, B. Moritz, and T. P. Devereaux, “Numerical evidence of fluctuating stripes in the normal state of high-tc cuprate superconductors,” Science
2017
Later among the works it cites.
A. Nichol, J. Achiam, and J. Schulman, “On first-order meta-learning algorithms,” arXiv:1803.02999
2018
Later among the works it cites.
J. Preskill, “Quantum computing in the nisq era and beyond,” Quantum
2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
B. Shahriari, K. Swersky, Z. Wang, R. P. Adams, and N. De Freitas, “Taking the human out of the loop: A review of bayesian optimization,” Proceedings of the IEEE
2015
Cited alongside, same era.
J. LeBlanc, A. E. Antipov, F. Becca, I. W. Bulik, G. K.-L. Chan, C.-M. Chung, Y. Deng, M. Ferrero, T. M. Henderson, and C. A. Jiménez-Hoyos, “Solutions of the two-dimensional hubbard model: benchmarks and results from a wide range of numerical algorithms,” Phys. Rev. X
2015
Cited alongside, same era.
M. Andrychowicz, M. Denil, S. Gomez, M. W. Hoffman, D. Pfau, T. Schaul, B. Shillingford, and N. De Freitas, “Learning to learn by gradient descent by gradient descent,” in Advances in Neural Information Processing Systems
2016
Cited alongside, same era.
K. Li and J. Malik, “Learning to optimize,” arXiv:1606.01885
2016
Cited alongside, same era.
S. Ravi and H. Larochelle, “Optimization as a model for few-shot learning,” 2016
2016
Cited alongside, same era.
A. Santoro, S. Bartunov, M. Botvinick, D. Wierstra, and T. Lillicrap, “Meta-learning with memory-augmented neural networks,” in International conference on machine learning
2016
Cited alongside, same era.
P. J. O’Malley, R. Babbush, I. D. Kivlichan, J. Romero, J. R. McClean, R. Barends, J. Kelly, P. Roushan, A. Tranter, N. Ding, et al
2016
Cited alongside, same era.
Later among the works it cites.
C. Hempel, C. Maier, J. Romero, J. McClean, T. Monz, H. Shen, P. Jurcevic, B. P. Lanyon, P. Love, R. Babbush, et al
2018
Later among the works it cites.
J. R. McClean, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, “Barren plateaus in quantum neural network training landscapes,” Nature communications
2018
Later among the works it cites.
N. Moll, P. Barkoutsos, L. S. Bishop, J. M. Chow, A. Cross, D. J. Egger, S. Filipp, A. Fuhrer, J. M. Gambetta, M. Ganzhorn, et al
2018
Later among the works it cites.
Z. Wang, S. Hadfield, Z. Jiang, and E. G. Rieffel, “Quantum approximate optimization algorithm for MaxCut: A fermionic view,” Physical Review A
2018
Later among the works it cites.
J. Romero, R. Babbush, J. R. McClean, C. Hempel, P. J. Love, and A. Aspuru-Guzik, “Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz,” Quantum Science and Technology
2018
Later among the works it cites.
A. Woitzik, “Entanglement in quantum-classical variational algorithms,” Master’s thesis, Albert-Ludwigs-Universit ät Freiburgm Germany, 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
P. Mehta, M. Bukov, C.-H. Wang, A. G. Day, C. Richardson, C. K. Fisher, and D. J. Schwab, “A high-bias, low-variance introduction to machine learning for physicists,” Physics Reports
2019
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.
G. G. Guerreschi and A. Matsuura, “QAOA for Max-Cut requires hundreds of qubits for quantum speed-up,” Scientific reports
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
G. Nannicini, “Performance of hybrid quantum-classical variational heuristics for combinatorial optimization,” Physical Review E
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
P. Krantz, M. Kjaergaard, F. Yan, T. P. Orlando, S. Gustavsson, and W. D. Oliver, “A quantum engineer’s guide to superconducting qubits,” Applied Physics Reviews
2019
Closest in time.
2019
Closest in time.
M. Schuld, V. Bergholm, C. Gogolin, J. Izaac, and N. Killoran, “Evaluating analytic gradients on quantum hardware,” Physical Review A
2019
Closest in time.
A. Woitzik, P. K. Barkoutsos, F. Wudarski, C. Fuchs, A. Buchleitner, and I. Tavernelli, “Entanglement requirements for hybrid quantum-classical algorithms,” In preparation
2019
Closest in time.