Benchmarking the performance of portfolio optimization with QAOA

DOI10.1007/s11128-022-03766-5OpenAlexW4286750594MaRDI QIDQ2686165

Yanyan Li

Publication date: 24 February 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.10555

zbMATH Keywords

quantum algorithmquantum computingquantum optimizationQAOA

Mathematics Subject Classification ID

Quantum computation (81P68) Portfolio theory (91G10)

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristic algorithms for the portfolio selection problem with minimum transaction lots
• Portfolio selection: a review
• Linear and mixed integer programming for portfolio optimization
• From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
• Quantum Computation and Quantum Information
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Coherence in Spontaneous Radiation Processes

This page was built for publication: Benchmarking the performance of portfolio optimization with QAOA