Quantum circuit evolutionary framework applied on set partitioning problem

Abstract

Quantum algorithms are of great interest for their possible use in optimization problems. In particular, variational algorithms that use classical counterparts to optimize parameters hold promise for use in currently existing devices. However, convergence stagnation phenomena pose a challenge for such algorithms. Seeking to avoid such difficulties, we present a framework based on circuits with variable topology with two approaches, one based on ansatz-free evolutionary method known from literature and the other using an introduction of an ansatz with circuital structure inspired by the physics of the Hamiltonian related to the problem, considering a, named here, pseudo-counterdiabatic evolutionary term. The efficiency of the proposed framework was tested on several instances of the set partitioning problem. The two approaches were compared with the Variational Quantum Eigensolver in noisy and non-noisy scenarios. The results demonstrated that optimization using circuits with variable topology presented very encouraging results. Notably, the strategy employing a pseudo-counterdiabatic evolutionary term exhibited remarkable performance, avoiding convergence stagnation in most instances considered. This framework circumvents the need for classical optimizers, and, as a consequence, this procedure based on circuits with variable topology indicates an interesting path in the search for algorithms to solve integer optimization problems targeting efficient applications in larger-scale scenarios.

References in corpus (21)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Ising formulations of many NP problems
• Barren plateaus in quantum neural network training landscapes
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• The Variational Quantum Eigensolver: a review of methods and best practices
• Effect of barren plateaus on gradient-free optimization
• Challenges and Opportunities in Quantum Optimization
• Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
• Improved success probability with greater circuit depth for the quantum approximate optimization algorithm
• Controlling and exploring quantum systems by algebraic expression of adiabatic gauge potential
• Digitized-Counterdiabatic Quantum Optimization
• Comparative study of variations in quantum approximate optimization algorithms for the Traveling Salesman Problem
• Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems
• A novel approach to noisy gates for simulating quantum computers
• Quantum Circuit Evolution on NISQ Devices
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization
• Universal Counterdiabatic Driving
• Counterdiabatic Driving with Performance Guarantees