The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover

The Quantum Alternating Operator Ansatz is a generalization of the Quantum Approximate Optimization Algorithm (QAOA) designed for finding approximate solutions to combinatorial optimization problems with hard constraints. In this paper, we study Maximum k-Vertex Cover under this ansatz due to its modest complexity, while still being more complex than the well studied problems of Max-Cut and Max E3-LIN2. Our approach includes (i) a performance comparison between easy-to-prepare classical states and Dicke states as starting states, (ii) a performance comparison between two XY-Hamiltonian mixing operators: the ring mixer and the complete graph mixer, (iii) an analysis of the distribution of solutions via Monte Carlo sampling, and (iv) the exploration of efficient angle selection strategies. Our results are: (i) Dicke states improve performance compared to easy-to-prepare classical states, (ii) an upper bound on the simulation of the complete graph mixer, (iii) the complete graph mixer improves performance relative to the ring mixer, (iv) numerical results indicating the standard deviation of the distribution of solutions decreases exponentially in $p$ (the number of rounds in the algorithm), requiring an exponential number of random samples to find a better solution in the next round, and (v) a correlation of angle parameters which exhibit high quality solutions that behave similarly to a discretized version of the Quantum Adiabatic Algorithm.

[1]  Patrick J. Coles,et al.  Operator Sampling for Shot-frugal Optimization in Variational Algorithms , 2020, 2004.06252.

[2]  Pasin Manurangsi,et al.  A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation , 2018, SOSA.

[3]  V. Akshay,et al.  Reachability Deficits in Quantum Approximate Optimization , 2019, Physical review letters.

[4]  Michele Mosca,et al.  Quantum Networks for Generating Arbitrary Quantum States , 2001, OFC 2001.

[5]  Gavin E. Crooks,et al.  Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem , 2018, 1811.08419.

[6]  S. Dulman,et al.  Portfolio rebalancing experiments using the Quantum Alternating Operator Ansatz , 2019, 1911.05296.

[7]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[8]  E. Farhi,et al.  A Quantum Approximate Optimization Algorithm , 2014, 1411.4028.

[9]  Stephan Eidenbenz,et al.  Deterministic Preparation of Dicke States , 2019, FCT.

[10]  Prasad Raghavendra,et al.  Beating the random assignment on constraint satisfaction problems of bounded degree , 2015, Electron. Colloquium Comput. Complex..

[11]  Rupak Biswas,et al.  From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz , 2017, Algorithms.

[12]  E. Farhi,et al.  A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem , 2001, Science.

[13]  Hartmut Neven,et al.  Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle , 2016, ArXiv.

[14]  Nicolas Macris,et al.  Efficient Quantum Algorithms for GHZ and W States, and Implementation on the IBM Quantum Computer , 2018, Advanced Quantum Technologies.

[15]  Theodore J. Yoder,et al.  Fixed-point quantum search with an optimal number of queries. , 2014, Physical review letters.

[17]  Edward Farhi,et al.  Finding cliques by quantum adiabatic evolution , 2002, Quantum Inf. Comput..

[18]  Rosario Fazio,et al.  Quantum Annealing: a journey through Digitalization, Control, and hybrid Quantum Variational schemes , 2019, 1906.08948.

[19]  E. Farhi,et al.  A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem , 2014, 1412.6062.

[20]  Amarda Shehu,et al.  Basin Hopping as a General and Versatile Optimization Framework for the Characterization of Biological Macromolecules , 2012, Adv. Artif. Intell..

[21]  L. Brady,et al.  Optimal Protocols in Quantum Annealing and QAOA Problems , 2020, 2003.08952.

[22]  Andrew M. Childs,et al.  Black-box hamiltonian simulation and unitary implementation , 2009, Quantum Inf. Comput..

[23]  Lov K. Grover,et al.  Fixed-point quantum search. , 2005, Physical review letters.

[24]  Franco Nori,et al.  Efficient quantum algorithm for preparing molecular-system-like states on a quantum computer , 2009, 0902.1419.

[25]  Erez Petrank.  The hardness of approximation: Gap location , 2005, computational complexity.

[26]  Ruizhe Zhang,et al.  QED driven QAOA for network-flow optimization , 2020 .

[27]  Stephan Eidenbenz,et al.  Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation , 2020, 2020 IEEE International Conference on Quantum Computing and Engineering (QCE).

[28]  Andries E. Brouwer,et al.  The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters , 2017, J. Comb. Theory, Ser. B.

[29]  Tomás Babej,et al.  A quantum alternating operator ansatz with hard and soft constraints for lattice protein folding , 2018, 1810.13411.

[30]  Leo Zhou,et al.  Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices , 2018, Physical Review X.

[31]  E. Rieffel,et al.  XY mixers: Analytical and numerical results for the quantum alternating operator ansatz , 2020 .