Quantum Dropout: On and Over the Hardness of Quantum Approximate Optimization Algorithm

Abstract

A combinatorial optimization problem becomes very difficult in situations where the energy landscape is rugged, and the global minimum locates in a narrow region of the configuration space. When using the quantum approximate optimization algorithm (QAOA) to tackle these harder cases, we find that difficulty mainly originates from the QAOA quantum circuit instead of the cost function. To alleviate the issue, we selectively dropout the clauses defining the quantum circuit while keeping the cost function intact. Due to the combinatorial nature of the optimization problems, the dropout of clauses in the circuit does not affect the solution. Our numerical results confirm improvements in QAOA's performance with various types of quantum-dropout implementation.

15 pages, 16 figures

References in corpus (3)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Non-convex Optimization for Machine Learning

Cited by in corpus (9)

• A perspective on protein structure prediction using quantum computers
• Training variational quantum algorithms with random gate activation
• A General Approach to Dropout in Quantum Neural Networks
• Efficient and quantum-adaptive machine learning with fermion neural networks
• Quantum approximate optimization algorithm with random and subgraph phase operators
• Dropout is all you need: robust two-qubit gate with reinforcement learning
• Imaginary Hamiltonian variational ansatz for combinatorial optimization problems
• Escaping Local Minima with Quantum Coherent Cooling
• Constraint-Aware Quantum Optimization via Hamming Weight Operators