Fetching the paper…
Reading the bibliography…
In this paper, we eliminate the classical outer learning loop of the Quantum Approximate Optimization Algorithm (QAOA) and present a strategy to find good parameters for QAOA based on topological arguments of the problem graph and tensor network techniques.
On the computational complexity of ising spin glass models
Francisco Barahona · 1982
Earlier work this paper cites.
On the limited memory bfgs method for large scale optimization
Dong C Liu and Jorge Nocedal · 1989
Earlier work this paper cites.
Algorithms for quantum computation: Discrete logarithms and factoring
Peter W Shor · 1994
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
Lov K Grover · 1996
Earlier work this paper cites.
Simulating quantum computation by contracting tensor networks
Igor L Markov and Yaoyun Shi · 2008
Earlier work this paper cites.
Layered architecture for quantum computing
N Cody Jones, Rodney Van Meter, Austin G Fowler, Peter L McMahon, Jungsang Kim, Thaddeus D Ladd, and Yoshihisa Yamamoto · 2012
Earlier work this paper cites.
Qutip 2: A python framework for the dynamics of open quantum systems
J Robert Johansson, Paul D Nation, and Franco Nori · 2013
Earlier work this paper cites.
A variational eigenvalue solver on a photonic quantum processor
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L O’brien · 2014
Earlier work this paper cites.
A quantum approximate optimization algorithm
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Earlier work this paper cites.
A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Earlier work this paper cites.
Ising formulations of many np problems
Andrew Lucas · 2014
Earlier work this paper cites.
A practical introduction to tensor networks: Matrix product states and projected entangled pair states
Román Orús · 2014
Earlier work this paper cites.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba · 2014
Cited alongside, same era.
Algorithm engineering for a quantum annealing platform
Andrew D King and Catherine C McGeoch · 2014
Cited alongside, same era.
Qubit architecture with high coherence and fast tunable coupling
Yu Chen, C Neill, P Roushan, N Leung, M Fang, R Barends, J Kelly, B Campbell, Z Chen, B Chiaro, et al · 2014
Cited alongside, same era.
Quantum supremacy through the quantum approximate optimization algorithm
Edward Farhi and Aram W Harrow · 2016
Cited alongside, same era.
Demonstration of a small programmable quantum computer with atomic qubits
Shantanu Debnath, Norbert M Linke, Caroline Figgatt, Kevin A Landsman, Kevin Wright, and Christopher Monroe · 2016
Classification with quantum neural networks on near term processors
Edward Farhi and Hartmut Neven · 2018
Later among the works it cites.
Fernando GSL Brandao, Michael Broughton, Edward Farhi, Sam Gutmann, and Hartmut Neven · 2018
Later among the works it cites.
qtorch: The quantum tensor contraction handler
E Schuyler Fried, Nicolas PD Sawaya, Yudong Cao, Ian D Kivlichan, Jhonathan Romero, and Alán Aspuru-Guzik · 2018
Later among the works it cites.
opt \ \backslash _einsum-a python package for optimizing contraction order for einsum-like expressions
Daniel Smith and Johnnie Gray · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A quantum algorithm to train neural networks using low-depth circuits
Guillaume Verdon, Michael Broughton, and Jacob Biamonte · 2017
Cited alongside, same era.
Near-optimal quantum circuit for grover’s unstructured search using a transverse field
Zhang Jiang, Eleanor G Rieffel, and Zhihui Wang · 2017
Cited alongside, same era.
Quantum machine learning
Jacob Biamonte, Peter Wittek, Nicola Pancotti, Patrick Rebentrost, Nathan Wiebe, and Seth Lloyd · 2017
Cited alongside, same era.
Quantum circuit learning
Kosuke Mitarai, Makoto Negoro, Masahiro Kitagawa, and Keisuke Fujii · 2018
Cited alongside, same era.
Continuous-variable quantum neural networks
Nathan Killoran, Thomas R Bromley, Juan Miguel Arrazola, Maria Schuld, Nicolás Quesada, and Seth Lloyd · 2018
Cited alongside, same era.
Leo Zhou, Sheng-Tao Wang, Soonwon Choi, Hannes Pichler, and Mikhail D Lukin · 2018
Cited alongside, same era.
Bang-bang control as a design principle for classical and quantum optimization algorithms
Aniruddha Bapat and Stephen Jordan · 2018
Cited alongside, same era.
Madita Willsch, Dennis Willsch, Fengping Jin, Hans De Raedt, and Kristel Michielsen · 2019
Closest in time.
Glen Bigan Mbeng, Rosario Fazio, and Giuseppe Santoro · 2019
Closest in time.
Classical and quantum bounded depth approximation algorithms
Matthew B Hastings · 2019
Closest in time.
Comparison of QAOA with quantum and simulated annealing
Michael Streif and Martin Leib · 2019
Closest in time.
Learning to learn with quantum neural networks via classical neural networks
Guillaume Verdon, Michael Broughton, Jarrod R McClean, Kevin J Sung, Ryan Babbush, Zhang Jiang, Hartmut Neven, and Masoud Mohseni · 2019
Closest in time.
Optimizing quantum heuristics with meta-learning
Max Wilson, Sam Stromswold, Filip Wudarski, Stuart Hadfield, Norm M Tubman, and Eleanor Rieffel · 2019
Closest in time.
Making trotters sprint: A variational imaginary time ansatz for quantum many-body systems
Matthew JS Beach, Roger G Melko, Tarun Grover, and Timothy H Hsieh · 2019
Closest in time.