Hybrid quantum investment optimization with minimal holding period

  title={Hybrid quantum investment optimization with minimal holding period},
  author={Samuel Mugel and Mario Abad and Miguel {\'A}ngel Bermejo and Javier S{\'a}nchez and Enrique Lizaso and Rom{\'a}n Or{\'u}s},
  journal={Scientific Reports},
In this paper we propose a hybrid quantum-classical algorithm for dynamic portfolio optimization with minimal holding period. Our algorithm is based on sampling the near-optimal portfolios at each trading step using a quantum processor, and efficiently post-selecting to meet the minimal holding constraint. We found the optimal investment trajectory in a dataset of 50 assets spanning a 1 year trading period using the D-Wave 2000Q processor. Our method is remarkably efficient, and produces… 

Comparing Classical-Quantum Portfolio Optimization with Enhanced Constraints

This paper formulate several real-world constraints for use in a Quantum Annealer (QA), extending the scenarios in which the algorithm can be implemented and shows how to add fundamental analysis to the portfolio optimization problem, adding in asset-specific and global constraints based on chosen balance sheet metrics.

Portfolio optimization with discrete simulated annealing

An integer simulated annealing method is presented to solve the problem of re-balancing in the presence of non-convex transaction costs, and it is found that the algorithm can minimize those terms.

NISQ-HHL: Portfolio Optimization for Near-Term Quantum Hardware

NISQ-HHL is introduced, the first hybrid formulation of HHL suitable for the end-to-end execution of small-scale portfolio-optimization problems on NISQ devices and is the first algorithm incorporating a QCL-enhanced version of Phase Estimation that was executed on real hardware.

FastHare: Fast Hamiltonian Reduction for Large-scale Quantum Annealing

FastHare, iteratively, detects and merges non-separable groups into single qubits and demonstrates a high level of effectiveness with an average of 62% qubits saving and 0.3s processing time, advocating for Hamiltonian reduction as an inexpensive necessity for QA.

Quantum Bohmian Inspired Potential to Model Non-Gaussian Events and the Application in Financial Markets

We have implemented quantum modeling mainly based on Bohmian Mechanics to study time series that contain strong coupling between their events. We firstly propose how compared to normal densities, our

Quantum annealing with special drivers for circuit fault diagnostics

It is found that degeneracy can help the performance of quantum annealing, especially for instances with a higher number of faults in their minimum fault diagnosis, which contrasts with theperformance of classical approaches based on brute force search that are used in industry for large scale circuits.

Hybrid Quantum-Classical Algorithms for Loan Collection Optimization with Loan Loss Provisions

Jirawat Tangpanitanon, 2, ∗ Jirawat Saiphet, † Pantita Palittapongarnpim, Poompong Chaiwongkhot, Pinn Prugsanapan, Nuntanut Raksasri, Yarnvith Raksri, Pairash Thajchayapong, and Thiparat Chotibut ‡

Problem solving dynamics for gate-model quantum computers

This work studies the model of adaptive problem solving dynamics in gate-model quantum computers, which can be realized in near-term experimental implementations of quantum computers.

Resource optimization for the quantum Internet

Methods and procedures of resource prioritization and resource balancing for the quantum Internet are defined to optimize the resource allocation mechanisms and to reduce the resource consumptions of the network entities.

Unraveling the Effect of COVID-19 on the Selection of Optimal Portfolio Using Hybrid Quantum-Classical Algorithms

The results show that the companies’ stocks were growing steadily more on a sideways movement from 2016-2017 and the stocks start to pick momentum from 2018-2019 and in 2020 early months as dip can be observed, however all the stocks recover to normal levels and even reaching lifetime highs from second half of 2020.



Dynamic Portfolio Optimization with Real Datasets Using Quantum Processors and Quantum-Inspired Tensor Networks

A number of quantum and quantum-inspired algorithms on different hardware platforms are implemented to solve the problem of dynamic portfolio optimization using real data from daily prices over 8 years of 52 assets, and a detailed comparison of the obtained Sharpe ratios, profits and computing times is done.

Portfolio Optimization of 40 Stocks Using the DWave Quantum Annealer

We investigate the use of quantum computers for building a portfolio out of a universe of U.S. listed, liquid equities that contains an optimal set of stocks. Starting from historical market data, we

Benchmarking Quantum Annealing Controls with Portfolio Optimization

This work compares empirical results from the D-Wave 2000Q quantum annealer to the computational ground truth for a variety of portfolio optimization instances and identifies control variations that yield optimal performance in terms of probability of success and probability of chain breaks.

Financial Portfolio Management using D-Wave’s Quantum Optimizer: The Case of Abu Dhabi Securities Exchange

Financial portfolio selection is the problem of optimal allocation of a fixed budget to a collection of assets (commodities, bonds, securities etc.) which produces random returns over time. The word

Use Cases of Quantum Optimization for Finance

This paper discusses the prediction of financial crashes as well as dynamic portfolio optimization using quantum strategies based on quantum annealers, universal gate-based quantum processors, and quantum-inspired Tensor Networks.

The emerging commercial landscape of quantum computing

The recent growth in the commercial QC market is examined through the lens of dominant product design, and emerging strategies for developing the QC market are contrasted.

Complexity-Theoretic Foundations of Quantum Supremacy Experiments

General theoretical foundations are laid for how to use special-purpose quantum computers with 40--50 high-quality qubits to demonstrate "quantum supremacy": that is, a clear quantum speedup for some task, motivated by the goal of overturning the Extended Church-Turing Thesis as confidently as possible.

Quantum State Optimization and Computational Pathway Evaluation for Gate-Model Quantum Computers

A state determination method that finds a target system state for a quantum computer at a given target objective function value is proved and is convenient for gate-model quantum computations and the near-term quantum devices of the quantum Internet.

Demonstrating a Continuous Set of Two-Qubit Gates for Near-Term Quantum Algorithms.

This work implements two gate families: an imaginary swap-like (iSWAP-like) gate to attain an arbitrary swap angle, θ, and a controlled-phase gate that generates an arbitrary conditional phase, ϕ that can provide a threefold reduction in circuit depth as compared to a standard decomposition.