Fetching the paper…
Reading the bibliography…
We develop a framework for analyzing layered quantum algorithms such as quantum alternating operator ans\"atze.
Cambridge Univ. Press, 1966
L. J. Slater, Generalized hypergeometric functions · 1966
Earlier work this paper cites.
McGraw-Hill New York, NY, USA, 1978
S. Orszag and C. M. Bender, Advanced mathematical methods for scientists and engineers · 1978
Earlier work this paper cites.
S. Kirkpatrick and B. Selman, “Critical behavior in the satisfiability of random Boolean expressions,” Science
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.
J. Preskill, “Lecture notes for ph219/cs219: Quantum information,” Accesible via http://www. theory. caltech. edu/people/preskill/ph229
1997
Earlier work this paper cites.
D. Gottesman, “The Heisenberg representation of quantum computers,” arXiv preprint quant-ph/9807006
1998
Earlier work this paper cites.
T. Hogg, “Quantum search heuristics,” Physical Review A
2000
Earlier work this paper cites.
T. Hogg and D. Portnov, “Quantum optimization,” Information Sciences
2000
Earlier work this paper cites.
E. Boros and P. L. Hammer, “Pseudo-Boolean optimization,” Discrete applied mathematics
2002
Earlier work this paper cites.
N. Hatano and M. Suzuki, “Finding exponential product formulas of higher orders,” in Quantum annealing and other optimization methods
2005
Earlier work this paper cites.
S. Khot, G. Kindler, E. Mossel, and R. O’Donnell, “Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?,” SIAM Journal on Computing
2007
Earlier work this paper cites.
P. Austrin, “Balanced Max 2-Sat might not be the hardest,” in Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
2007
Earlier work this paper cites.
M. Hastings, “Observations outside the light cone: Algorithms for nonequilibrium and thermal states,” Physical Review B
2008
Earlier work this paper cites.
G. Evenbly and G. Vidal, “Algorithms for entanglement renormalization,” Physical Review B
2009
Earlier work this paper cites.
Cambridge University Press, 2010
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information · 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.
Springer, 2013
B. C. Hall, Quantum theory for mathematicians · 2013
Earlier work this paper cites.
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
S. Santra, G. Quiroz, G. Ver Steeg, and D. A. Lidar, “MAX 2-SAT with up to 108 qubits,” New Journal of Physics
2014
Earlier work this paper cites.
2016
Earlier work this paper cites.
D. Wecker, M. B. Hastings, and M. Troyer, “Training a quantum optimizer,” Physical Review A
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
I. Alekseev and S. O. Ivanov, “Higher Jacobi identities,” arXiv:1604.05281
2016
Earlier work this paper cites.
I. Hen and F. M. Spedalieri, “Quantum annealing for constrained optimization,” Physical Review Applied
2016
Earlier work this paper cites.
I. Hen and M. S. Sarandy, “Driver hamiltonians for constrained optimization in quantum annealing,” Physical Review A
2016
Earlier work this paper cites.
S. Hadfield, Z. Wang, B. O’Gorman, E. Rieffel, D. Venturelli, and R. Biswas, “Quantum approximate optimization with hard and soft constraints,” in Proceedings of the Second International Workshop on Post Moore’s Era Supercomputing (PMES)
2017
Earlier work this paper cites.
Z. C. Yang, A. Rahmani, A. Shabani, H. Neven, and C. Chamon, “Optimizing variational quantum algorithms using Pontryagin’s minimum principle,” Physical Review X
2017
Earlier work this paper cites.
Z. Jiang, E. G. Rieffel, and Z. Wang, “Near-optimal quantum circuit for Grover’s unstructured search using a transverse field,” Physical Review A
2017
Earlier work this paper cites.
2017
Cited alongside, same era.
2017
Cited alongside, same era.
Springer, 2017
P. Woit, Quantum theory, groups and representations · 2017
Cited alongside, same era.
Z. Wang, S. Hadfield, Z. Jiang, and E. G. Rieffel, “Quantum approximate optimization algorithm for MaxCut: A fermionic view,” Physical Review A
2018
Cited alongside, same era.
2018
2020
Later among the works it cites.
2020
Later among the works it cites.
T. Stollenwerk, S. Hadfield, and Z. Wang, “Toward quantum gate-model heuristics for real-world planning problems,” IEEE Transactions on Quantum Engineering
2020
Later among the works it cites.
M. Streif and M. Leib, “Training the quantum approximate optimization algorithm without access to a quantum processing unit,” Quantum Science and Technology
2020
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.
J. R. McClean, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, “Barren plateaus in quantum neural network training landscapes,” Nature communications
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
S. Lloyd, “Quantum approximate optimization is computationally universal,” arXiv:1812.11075
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
S. Bravyi, D. Gosset, and R. König, “Quantum advantage with shallow circuits,” Science
2018
Cited alongside, same era.
2021
Closest in time.
J. Wurtz and P. Love, “Maxcut quantum approximate optimization algorithm performance guarantees for p > 1 p>1 ,” Phys. Rev. A
2021
Closest in time.
M. Streif, M. Leib, F. Wudarski, E. Rieffel, and Z. Wang, “Quantum algorithms with local particle-number conservation: Noise effects and error correction,” Physical Review A
2021
Closest in time.
K. Marwaha, “Local classical MAX-CUT algorithm outperforms p = 2 p=2 QAOA on high-girth regular graphs,” Quantum
2021
Closest in time.
2021
Closest in time.
M. P. Harrigan et al
2021
Closest in time.
2021
Closest in time.
L. T. Brady, C. L. Baldwin, A. Bapat, Y. Kharkov, and A. V. Gorshkov, “Optimal protocols in quantum annealing and quantum approximate optimization algorithm problems,” Physical Review Letters
2021
Closest in time.
2021
Closest in time.
J. R. McClean, M. P. Harrigan, M. Mohseni, N. C. Rubin, Z. Jiang, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, “Low-depth mechanisms for quantum optimization,” PRX Quantum
2021
Closest in time.
S. Bravyi, D. Gosset, and R. Movassagh, “Classical algorithms for quantum mean values,” Nature Physics
2021
Closest in time.
A. Callison, M. Festenstein, J. Chen, L. Nita, V. Kendon, and N. Chancellor, “An energetic perspective on rapid quenches in quantum annealing,” PRX Quantum
2021
Closest in time.
S. Hadfield, “On the representation of Boolean and real functions as Hamiltonians for quantum computing,” ACM Transactions on Quantum Computing
2021
Closest in time.
M. Wilson, R. Stromswold, F. Wudarski, S. Hadfield, N. M. Tubman, and E. G. Rieffel, “Optimizing quantum heuristics with meta-learning,” Quantum Machine Intelligence
2021
Closest in time.
A. M. Childs, Y. Su, M. C. Tran, N. Wiebe, and S. Zhu, “Theory of Trotter error with commutator scaling,” Physical Review X
2021
Closest in time.
R. Shaydulin and S. M. Wild, “Exploiting symmetry reduces the cost of training QAOA,” IEEE Transactions on Quantum Engineering
2021
Closest in time.
S. Wang, E. Fontana, M. Cerezo, K. Sharma, A. Sone, L. Cincio, and P. J. Coles, “Noise-induced barren plateaus in variational quantum algorithms,” Nature communications
2021
Closest in time.
H. Leipold and F. M. Spedalieri, “Constructing driver Hamiltonians for optimization problems with linear constraints,” Quantum Science and Technology
2021
Closest in time.
2021
Closest in time.
E. Farhi, J. Goldstone, S. Gutmann, and L. Zhou, “The quantum approximate optimization algorithm and the Sherrington-Kirkpatrick model at infinite size,” Quantum
2022
Closest in time.
A. Ozaeta, W. van Dam, and P. L. McMahon, “Expectation values from the single-layer quantum approximate optimization algorithm on Ising problems,” Quantum Science and Technology
2022
Closest in time.
B. Barak and K. Marwaha, “Classical algorithms and quantum limitations for maximum cut on high-girth graphs,” in 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
2022
Closest in time.
K. Marwaha and S. Hadfield, “Bounds on approximating Max k k XOR with quantum and classical local algorithms,” Quantum
2022
Closest in time.
J. Wurtz and P. J. Love, “Counterdiabaticity and the quantum approximate optimization algorithm,” Quantum
2022
Closest in time.
L. Zhu, H. L. Tang, G. S. Barron, F. Calderon-Vargas, N. J. Mayhall, E. Barnes, and S. E. Economou, “Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer,” Physical Review Research
2022
Closest in time.