Portfolio Optimization via Quantum Zeno Dynamics on a Quantum Processor
Authors:
- Dylan HermanDHDylan Herman
- Ruslan ShaydulinRSRuslan Shaydulin
- Yue SunYSYue Sun
- Shouvanik ChakrabartiSCShouvanik Chakrabarti
- Shaohan HuSHShaohan Hu
- Pierre MinssenPMPierre Minssen
- Arthur RattewARArthur Rattew
- Romina YalovetzkyRYRomina Yalovetzky
- Marco PistoiaMPMarco Pistoia
Preprint
Abstract
Portfolio optimization is an important problem in mathematical finance, and a promising target for quantum optimization algorithms. The use cases solved daily in financial institutions are subject to many constraints that arise from business objectives and regulatory requirements, which make these problems challenging to solve on quantum computers. We introduce a technique that uses quantum Zeno dynamics to solve optimization problems with multiple arbitrary constraints, including inequalities. We show that the dynamics of the quantum optimization can be efficiently restricted to the in-constraint subspace via repeated projective measurements, requiring only a small number of auxiliary qubits and no post-selection. Our technique has broad applicability, which we demonstrate by incorporating it into the quantum approximate optimization algorithm (QAOA) and variational quantum circuits for optimization. We analytically show that achieving a constant minimum success probability in QAOA requires a number of measurements that is independent of the problem size for a specific choice of mixer operator. We evaluate our method numerically on the problem of portfolio optimization with multiple realistic constraints, and observe better solution quality and higher in-constraint probability than the state-of-the-art technique of enforcing constraints by introducing a penalty into the objective. We demonstrate the proposed method on the Quantinuum H1-2 trapped-ion quantum processor, observing performance improvements from circuits with two-qubit gate depths of up to 148.Keywords
All Related Versions
This publication has 32 references indexed in Scilit:
- Peptide conformational sampling using the Quantum Approximate Optimization Algorithmnpj Quantum Information, 2023
- Constrained quantum optimization for extractive summarization on a trapped-ion quantum computerScientific Reports, 2022
- Mixer-phaser Ansätze for quantum optimization with hard constraintsQuantum Machine Intelligence, 2022
- Approximate quantum Fourier transform with O(n log(n)) T gatesnpj Quantum Information, 2020
- mixers: Analytical and numerical results for the quantum alternating operator ansatzPhysical Review A, 2020
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problemsQuantum Information Processing, 2019
- Quantum Circuits for Floating-Point Arithmetic2018
- Quantum Zeno dynamics: mathematical and physical aspectsJournal of Physics A: Mathematical and Theoretical, 2008
- Dynamical suppression of decoherence in two-state quantum systemsPhysical Review A, 1998
- Measurement Quantum Mechanics and Experiments on Quantum Zeno EffectAnnals of Physics, 1996