Particle Swarm Optimization for Quantum Circuit Synthesis: Performance Analysis and Insights
This is an incremental improvement for researchers in quantum computing and optimization, focusing on faster convergence in a specific synthesis task.
The paper tackles the problem of synthesizing quantum circuits for the MaxOne problem using particle swarm optimization (PSO), finding that PSO converges more quickly to the optimal solution compared to a genetic algorithm.
This paper discusses how particle swarm optimization (PSO) can be used to generate quantum circuits to solve an instance of the MaxOne problem. It then analyzes previous studies on evolutionary algorithms for circuit synthesis. With a brief introduction to PSO, including its parameters and algorithm flow, the paper focuses on a method of quantum circuit encoding and representation as PSO parameters. The fitness evaluation used in this paper is the MaxOne problem. The paper presents experimental results that compare different learning abilities and inertia weight variations in the PSO algorithm. A comparison is further made between the PSO algorithm and a genetic algorithm for quantum circuit synthesis. The results suggest PSO converges more quickly to the optimal solution.