Variational Quantum Multi-Objective Optimization
arXiv:2312.14151 · doi:10.1103/PhysRevResearch.7.023141
Abstract
Solving combinatorial optimization problems on near-term quantum devices has gained a lot of attraction in recent years. Currently, most works have focused on single-objective problems, whereas many real-world applications need to consider multiple, mostly conflicting objectives, such as cost and quality. We present a variational quantum optimization algorithm to solve discrete multi-objective optimization problems on quantum computers. The proposed quantum multi-objective optimization (QMOO) algorithm incorporates all cost Hamiltonians representing the classical objective functions in the quantum circuit and produces a quantum state consisting of Pareto-optimal solutions in superposition. From this state we retrieve a set of solutions and utilize the widely applied hypervolume indicator to determine its quality as an approximation to the Pareto-front. The variational parameters of the QMOO circuit are tuned by maximizing the hypervolume indicator in a quantum-classical hybrid fashion. We show the effectiveness of the proposed algorithm on several benchmark problems with up to five objectives. We investigate the influence of the classical optimizer, the circuit depth and compare to results from classical optimization algorithms. We find that the algorithm is robust to shot noise and produces good results with as low as 128 measurement shots in each iteration. These promising result open the perspective to run the algorithm on near-term quantum hardware.
revision of text, added shot noise analysis
References in corpus (35)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Noisy intermediate-scale quantum (NISQ) algorithms
- Suppressing quantum errors by scaling a surface code logical qubit
- Logical quantum processor based on reconfigurable atom arrays
- Qudits and high-dimensional quantum computing
- A Review on Quantum Approximate Optimization Algorithm and its Variants
- A universal qudit quantum processor with trapped ions
- An Easy-to-use Real-world Multi-objective Optimization Problem Suite
- Obstacles to State Preparation and Variational Optimization from Symmetry Protection
- The Hypervolume Indicator: Problems and Algorithms
- Warm-starting quantum optimization
- Quantum Information Scrambling in a Superconducting Qutrit Processor
- Challenges and Opportunities in Quantum Optimization
- Native qudit entanglement in a trapped ion quantum processor
- Parameter Concentration in Quantum Approximate Optimization
- Computational speed-up in a single qudit NMR quantum information processor
- Computational speed-up with a single qudit
- Hybrid quantum-classical algorithms for approximate graph coloring
- Domain wall encoding of discrete variables for quantum annealing and QAOA
- A fast fault-tolerant decoder for qubit and qudit surface codes
- Kitaev's Z_d-Codes Threshold Estimates
- Graph neural network initialisation of quantum approximate optimisation
- Challenges of variational quantum optimization with measurement shot noise
- Quantum approximate optimization algorithm for qudit systems
- Universal quantum control in irreducible state-space sectors: application to bosonic and spin-boson systems
- Reconstructing complex states of a 20-qubit quantum simulator
- Approaches to Constrained Quantum Approximate Optimization
- Recursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement
- Data re-uploading with a single qudit
- On the role of entanglement in qudit-based circuit compression
- Multiobjective variational quantum optimization for constrained problems: an application to Cash Management
- Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
- Multi-Objective Optimization and Network Routing with Near-Term Quantum Computers
- Many-Qudit representation for the Travelling Salesman Problem Optimisation
- Qudit Machine Learning