Solving the Optimal Trading Trajectory Problem Using Simulated Bifurcation

• URL: http://arxiv.org/abs/2009.08412v1
• Date: Thu, 17 Sep 2020 16:42:04 GMT
• Title: Solving the Optimal Trading Trajectory Problem Using Simulated Bifurcation
• Authors: Kyle Steinhauer, Takahisa Fukadai, Sho Yoshida
• Abstract summary: We use an optimization procedure based on simulated bifurcation (SB) to solve the integer portfolio and trading trajectory problem with an unprecedented computational speed. We show first numerical results for portfolios of up to 1000 assets, which already confirm the power of the SB algorithm for its novel use-case as a portfolio and trading trajectory-case.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We use an optimization procedure based on simulated bifurcation (SB) to solve the integer portfolio and trading trajectory problem with an unprecedented computational speed. The underlying algorithm is based on a classical description of quantum adiabatic evolutions of a network of non-linearly interacting oscillators. This formulation has already proven to beat state of the art computation times for other NP-hard problems and is expected to show similar performance for certain portfolio optimization problems. Inspired by such we apply the SB approach to the portfolio integer optimization problem with quantity constraints and trading activities. We show first numerical results for portfolios of up to 1000 assets, which already confirm the power of the SB algorithm for its novel use-case as a portfolio and trading trajectory optimizer.

Related papers

• Sum-of-Squares inspired Quantum Metaheuristic for Polynomial Optimization with the Hadamard Test and Approximate Amplitude Constraints [76.53316706600717]
  Recently proposed quantum algorithm arXiv:2206.14999 is based on semidefinite programming (SDP) We generalize the SDP-inspired quantum algorithm to sum-of-squares. Our results show that our algorithm is suitable for large problems and approximate the best known classicals.
  arXiv  Detail & Related papers  (2024-08-14T19:04:13Z)
• GloptiNets: Scalable Non-Convex Optimization with Certificates [61.50835040805378]
  We present a novel approach to non-cube optimization with certificates, which handles smooth functions on the hypercube or on the torus. By exploiting the regularity of the target function intrinsic in the decay of its spectrum, we allow at the same time to obtain precise certificates and leverage the advanced and powerful neural networks.
  arXiv  Detail & Related papers  (2023-06-26T09:42:59Z)
• Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors [48.68474702382697]
  Vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry. In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary variables.
  arXiv  Detail & Related papers  (2023-06-14T13:44:35Z)
• Backpropagation of Unrolled Solvers with Folded Optimization [55.04219793298687]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. One typical strategy is algorithm unrolling, which relies on automatic differentiation through the operations of an iterative solver. This paper provides theoretical insights into the backward pass of unrolled optimization, leading to a system for generating efficiently solvable analytical models of backpropagation.
  arXiv  Detail & Related papers  (2023-01-28T01:50:42Z)
• A Comparative Study On Solving Optimization Problems With Exponentially Fewer Qubits [0.0]
  We evaluate and improve an algorithm based on Variational Quantum Eigensolver (VQE) We highlight the numerical instabilities generated by encoding the problem into the variational ansatz. We propose a classical optimization procedure to find the ground-state of the ansatz in less iterations with a better objective.
  arXiv  Detail & Related papers  (2022-10-21T08:54:12Z)
• Portfolio optimization with discrete simulated annealing [0.0]
  We present an integer optimization method to find optimal portfolios in the presence of discretized convex and non- convex cost functions. This allows us to achieve a solution with a given quality.
  arXiv  Detail & Related papers  (2022-10-03T10:39:05Z)
• Benchmarking the performance of portfolio optimization with QAOA [0.12110562441696866]
  We present a detailed study of portfolio optimization using different versions of the quantum approximate optimization algorithm (QAOA) We will discuss several possible choices of the variational form and of different classical algorithms for finding the corresponding optimized parameters. We also analyze the influence of statistical sampling errors (due to a finite number of shots) and gate and readout errors (due to imperfect quantum hardware)
  arXiv  Detail & Related papers  (2022-07-21T15:53:46Z)
• Comparing Classical-Quantum Portfolio Optimization with Enhanced Constraints [0.0]
  We show how to add fundamental analysis to the portfolio optimization problem, adding in asset-specific and global constraints based on chosen balance sheet metrics. We analyze the current state-of-the-art algorithms for solving such a problem using D-Wave's Quantum Processor and compare the quality of the solutions obtained to commercially-available optimization software.
  arXiv  Detail & Related papers  (2022-03-09T17:46:32Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Hybrid quantum-classical optimization for financial index tracking [0.0]
  Tracking a financial index boils down to replicating its trajectory of returns for a well-defined time span by investing in a subset of the securities included in the benchmark. Picking the optimal combination of assets becomes a challenging weighted-hard problem even for moderately large indices consisting of dozens or hundreds of assets. We introduce a pruning algorithm to find weighted combinations of assets subject to cardinality constraints.
  arXiv  Detail & Related papers  (2020-08-27T10:59:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.