Proper Cost Hamiltonian Design for Combinatorial Optimization Problems: A Boolean Function Approach

Advanced researches on the variational quantum algorithms are actively conducted. In particular, the quantum approximate optimization algorithm (QAOA) is one of the promising variational quantum algorithms and can be applied to various graph-based problems, and is a promising algorithm that shows good performance even in small quantum computers. As is widely known, QAOA obtains the approximate solution via the expectation value of the cost Hamiltonian on the parameterized state. Therefore, in addition to finding the optimal parameters, the proper design of the cost Hamiltonian is important. This paper designs the cost function of the combinatorial optimization problem via Boolean function and maps it to the proper cost Hamiltonian. The proposed cost Hamiltonian design method is applied to the maximum independent set (MIS) and minimum dominating set (MDS) problems.

[1]  W. Vinci,et al.  Optimally stopped variational quantum algorithms , 2017, 1710.05365.

[2]  S. Brierley,et al.  Accelerated Variational Quantum Eigensolver. , 2018, Physical review letters.

[3]  David Von Dollen,et al.  TensorFlow Quantum: A Software Framework for Quantum Machine Learning , 2020, ArXiv.

[4]  Alán Aspuru-Guzik,et al.  A variational eigenvalue solver on a photonic quantum processor , 2013, Nature Communications.

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

[6]  Jimmy Ba,et al.  Adam: A Method for Stochastic Optimization , 2014, ICLR.

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

[8]  J. Gambetta,et al.  Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets , 2017, Nature.

[9]  Joongheon Kim,et al.  Quantum Approximation for Wireless Scheduling , 2020, Applied Sciences.

[10]  Joongheon Kim,et al.  The Useful Quantum Computing Techniques for Artificial Intelligence Engineers , 2020, 2020 International Conference on Information Networking (ICOIN).

[11]  F. Duarte,et al.  On the probability amplitude of quantum entanglement and the Pauli matrices , 2020, Optical and Quantum Electronics.

[12]  John Preskill,et al.  Quantum Computing in the NISQ era and beyond , 2018, Quantum.

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

[14]  Joongheon Kim,et al.  Energy-Efficient Cluster Head Selection via Quantum Approximate Optimization , 2020, Electronics.

[15]  Lei Wang,et al.  Variational quantum eigensolver with fewer qubits , 2019, Physical Review Research.

[16]  Stuart Hadfield,et al.  On the Representation of Boolean and Real Functions as Hamiltonians for Quantum Computing , 2018, ACM Transactions on Quantum Computing.