Fetching the paper…
Reading the bibliography…
We study the relationship between the Quantum Approximate Optimization Algorithm (QAOA) and the underlying symmetries of the objective function to be optimized.
Asymmetric graphs
Paul Erdős and Alfréd Rényi · 1963
Earlier work this paper cites.
Entropy and the complexity of graphs: I. an index of the relative complexity of a graph
Abbe Mowshowitz · 1968
Earlier work this paper cites.
Algebraic Graph Theory
Norman Biggs · 1974
Earlier work this paper cites.
Computing automorphisms and canonical labellings of graphs
Brendan D McKay · 1978
Earlier work this paper cites.
A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus
Ion Stefan Filotti and Jack N Mayer · 1980
Earlier work this paper cites.
Isomorphism testing for graphs of bounded genus
Gary Miller · 1980
Earlier work this paper cites.
Practical graph isomorphism
Brendan D McKay et al · 1981
Earlier work this paper cites.
Isomorphism of graphs of bounded valence can be tested in polynomial time
Eugene M Luks · 1982
Earlier work this paper cites.
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
Hans L Bodlaender · 1990
Earlier work this paper cites.
Optimization, approximation, and complexity classes
Christos H. Papadimitriou and Mihalis Yannakakis · 1991
Earlier work this paper cites.
Computer generation of automorphism groups of weighted graphs
K. Balasubramanian · 1994
Earlier work this paper cites.
A direct search optimization method that models the objective and constraint functions by linear interpolation
M. J. D. Powell · 1994
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X. Goemans and David P. Williamson · 1995
Earlier work this paper cites.
Graph entropy: a survey
Gábor Simonyi · 1995
Earlier work this paper cites.
Support vector regression machines
Harris Drucker, Christopher JC Burges, Linda Kaufman, Alex J Smola, and Vladimir Vapnik · 1997
Earlier work this paper cites.
Branch-and-price: Column generation for solving huge integer programs
Cynthia Barnhart, Ellis L Johnson, George L Nemhauser, Martin WP Savelsbergh, and Pamela H Vance · 1998
Earlier work this paper cites.
Direct search algorithms for optimization calculations
M. J. D. Powell · 1998
Earlier work this paper cites.
Polynomial time approximation schemes for dense instances of NP-hard problems
Sanjeev Arora, David Karger, and Marek Karpinski · 1999
Earlier work this paper cites.
On some tighter inapproximability results (extended abstract)
Piotr Berman and Marek Karpinski · 1999
Earlier work this paper cites.
Some optimal inapproximability results
Johan Håstad · 2001
Earlier work this paper cites.
SciPy: Open source scientific tools for Python, 2001–
Eric Jones, Travis Oliphant, Pearu Peterson, et al · 2001
Earlier work this paper cites.
On the asymmetry of random regular graphs and random graphs
Jeong Han Kim, Benny Sudakov, and Van H Vu · 2002
Earlier work this paper cites.
Upper bounds on the automorphism group of a graph
Ilia Krasikov, Arieh Lev, and Bhalchandra D Thatte · 2002
Earlier work this paper cites.
Exploiting structure in symmetry detection for CNF
Paul T Darga, Mark H Liffiton, Karem A Sakallah, and Igor L Markov · 2004
Earlier work this paper cites.
Lecture notes, 2007
V. Arving · 2007
Earlier work this paper cites.
Engineering an efficient canonical labeling tool for large and sparse graphs
Tommi Junttila and Petteri Kaski · 2007
Earlier work this paper cites.
Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?
Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O’Donnell · 2007
Cited alongside, same era.
Exploring network structure, dynamics, and function using NetworkX
Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart · 2008
Cited alongside, same era.
Symmetry in complex networks
Ben D. MacArthur, Rubén J. Sánchez-García, and James W. Anderson · 2008
Cited alongside, same era.
Search space contraction in canonical labeling of graphs
Adolfo Piperno · 2008
Cited alongside, same era.
An ensemble of weighted support vector machines for ordinal regression
Willem Waegeman and Luc Boullart · 2009
Cited alongside, same era.
A symmetry index for graphs
Abbe Mowshowitz and Matthias Dehmer · 2010
Leo Zhou, Sheng-Tao Wang, Soonwon Choi, Hannes Pichler, and Mikhail D. Lukin · 2018
Later among the works it cites.
Quantum supremacy using a programmable superconducting processor
Frank Arute et al · 2019
Later among the works it cites.
Bang-bang control as a design principle for classical and quantum optimization algorithms
Aniruddha Bapat and Stephen Jordan · 2019
Later among the works it cites.
Obstacles to state preparation and variational optimization from symmetry protection
Sergey Bravyi, Alexander Kliesch, Robert Koenig, and Eugene Tang · 2019
Later among the works it cites.
QAOA for max-cut requires hundreds of qubits for quantum speed-up
G. G. Guerreschi and A. Y. Matsuura · 2019
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.
Orbital branching
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, and Stefano Smriglio · 2011
Cited alongside, same era.
Scikit-learn: Machine learning in Python
F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay · 2011
Cited alongside, same era.
Automorphism group and diameter of a graph
Peter Dankelmann, David Erwin, Simon Mukwembi, Bernardo Gabriel Rodrigues, E Mwambene, and Gert Sabidussi · 2012
Cited alongside, same era.
Trivial low energy states for commuting Hamiltonians, and the quantum PCP conjecture
Matthew B. Hastings · 2013
Cited alongside, same era.
Approximation algorithms
Vijay V Vazirani · 2013
Cited alongside, same era.
Novel techniques to speed up the computation of the automorphism group of a graph
José Luis López-Presa, Luis F Chiroque, and Antonio Fernández Anta · 2014
Cited alongside, same era.
From the Quantum Approximate Optimization Algorithm to a quantum alternating operator ansatz
Stuart Hadfield, Zhihui Wang, Bryan O’Gorman, Eleanor Rieffel, Davide Venturelli, and Rupak Biswas · 2019
Later among the works it cites.
Classical and quantum bounded depth approximation algorithms
Matthew B. Hastings · 2019
Later among the works it cites.
Alibaba cloud quantum development platform: Applications to quantum algorithm design, 2019
Cupjin Huang, Mario Szegedy, Fang Zhang, Xun Gao, Jianxin Chen, and Yaoyun Shi · 2019
Later among the works it cites.
libEnsemble users manual, 2019
Stephen Hudson, Jeffrey Larson, Stefan M. Wild, and David Bindel · 2019
Later among the works it cites.
Learning to optimize variational quantum circuits to solve combinatorial problems
Sami Khairy, Ruslan Shaydulin, Lukasz Cincio, Yuri Alexeev, and Prasanna Balaprakash · 2019
Later among the works it cites.
Quantum annealing: a journey through digitalization, control, and hybrid quantum variational schemes
Glen Bigan Mbeng, Rosario Fazio, and Giuseppe Santoro · 2019
Later among the works it cites.
Engineering fast multilevel support vector machines
Ehsan Sadrfaridpour, Talayeh Razzaghi, and Ilya Safro · 2019
Later among the works it cites.
Evaluating quantum approximate optimization algorithm: A case study
Ruslan Shaydulin and Yuri Alexeev · 2019
Later among the works it cites.
Multistart methods for quantum approximate optimization
Ruslan Shaydulin, Ilya Safro, and Jeffrey Larson · 2019
Later among the works it cites.
What do QAOA energies reveal about graphs?
Mario Szegedy · 2019
Later among the works it cites.
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
Later among the works it cites.
Optimizing quantum heuristics with meta-learning
Max Wilson, Sam Stromswold, Filip Wudarski, Stuart Hadfield, Norm M Tubman, and Eleanor Rieffel · 2019
Later among the works it cites.
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
Frank Arute et al · 2020
Closest in time.
Improving variational quantum optimization using CVaR
Panagiotis Kl. Barkoutsos, Giacomo Nannicini, Anton Robert, Ivano Tavernelli, and Stefan Woerner · 2020
Closest in time.
Symmetries, graph properties, and quantum speedups
Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, and Daochen Wang · 2020
Closest in time.
Effective gaps are not effective: Quasipolynomial classical simulation of obstructed stoquastic hamiltonians
Jacob Bringewatt and Michael Jarret · 2020
Closest in time.
Grover mixers for QAOA: Shifting complexity from mixer design to state preparation
Andreas Bärtschi and Stephan Eidenbenz · 2020
Closest in time.
The Quantum Approximate Optimization Algorithm needs to see the whole graph: A typical case
Edward Farhi, David Gamarnik, and Sam Gutmann · 2020
Closest in time.
Tensor network quantum simulator with step-dependent parallelization
Danylo Lykov, Roman Schutski, Alexey Galda, Valerii Vinokur, and Yurii Alexeev · 2020
Closest in time.
Bounds on MaxCut QAOA performance for p>1
Jonathan Wurtz and Peter J. Love · 2020
Closest in time.
Elruna: Elimination rule-based network alignment
Zirou Qiu, Ruslan Shaydulin, Xiaoyuan Liu, Yuri Alexeev, Christopher S Henry, and Ilya Safro · 2021
Closest in time.