Block Coordinate Descent for Dynamic Portfolio Optimization on Finite-Precision Coherent Ising Machines

• URL: http://arxiv.org/abs/2603.23200v1
• Date: Tue, 24 Mar 2026 13:47:01 GMT
• Title: Block Coordinate Descent for Dynamic Portfolio Optimization on Finite-Precision Coherent Ising Machines
• Abstract summary: Some platforms support only finite-precision inputs, and the required scaling and quantization can degrade solution quality.<n>We propose a block coordinate descent method that decomposes the DPO model along the time dimension and iteratively solves compact time-block subproblems.
• Score: 8.273133030924987
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Coherent Ising machines (CIMs) have emerged as specialized quantum hardware for large-scale combinatorial optimization. However, for large instances that remain challenging for classical methods, some platforms support only finite-precision inputs, and the required scaling and quantization can degrade solution quality. Dynamic portfolio optimization (DPO) can be formulated as a quadratic unconstrained binary optimization (QUBO) problem, but large instances are especially vulnerable to precision loss under global scaling. We propose a block coordinate descent method that decomposes the DPO model along the time dimension and iteratively solves compact time-block subproblems on the device. Experiments on finite-precision CIM hardware show that the method enables these instances to be solved under hardware precision limits, yields portfolios competitive with classical benchmark solvers, and reduces runtime through fast CIM solution of the resulting subproblems. These results demonstrate the promise of finite-precision CIMs as a practical and scalable approach to structured large-scale combinatorial optimization.

Related papers

• Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design [4.190898032627423]
  maximizing coverage while utilizing limited orbital resources is one of the critical design challenges for complex optimization problems.<n>The maximal covering location problem (MCLP), serves as a base for orbital coverage modeling, is NP-hard and computationally intractable for large-constellation instances.<n>This paper proposes a scalable quantum optimization framework for MCLP in satellite constellation design.
  arXiv  Detail & Related papers  (2026-07-09T04:39:44Z)
• Applying a Random-Key Optimizer on Mixed Integer Programs [0.36700088931938835]
  Mixed-Integer Programs (MIPs) are NP-hard optimization models that arise in a broad range of decision-making applications.<n>This paper explores the use of the Random-Key integer (RKO) framework as a flexible, metaheuristic alternative for computing high-quality solutions to MIPs.
  arXiv  Detail & Related papers  (2026-02-25T18:20:03Z)
• Divide and Learn: Multi-Objective Combinatorial Optimization at Scale [41.78439888126577]
  Multi-objective optimization seeks solutions over exponentially large discrete spaces.<n>We reformulate it as an online learning problem over a decomposed decision space, solving position-wise bandit subproblems.<n>On standard benchmarks, our method achieves 80--98% of specialized solvers performance.
  arXiv  Detail & Related papers  (2026-02-11T20:29:35Z)
• Tensor Network Assisted Distributed Variational Quantum Algorithm for Large Scale Combinatorial Optimization Problem [19.046113542182436]
  We propose the Distributed Variational Quantum Algorithm (DVQA) for solving Combinatorial Optimization Problems (COPs)<n>A key innovation of DVQA is its use of the truncated higher-order singular value decomposition to preserve inter-variable dependencies without relying on complex long-range entanglement.<n> Empirically, DVQA achieves state-of-the-art performance in simulations and has been experimentally validated on the Wu Kong quantum computer for portfolio optimization.
  arXiv  Detail & Related papers  (2026-01-20T13:31:02Z)
• Constraint-Aware Quantum Optimization via Hamming Weight Operators [1.1463843149836523]
  Constrained optimization with strict linear constraints underpins applications in drug discovery, power grids, logistics, and finance.<n>We introduce Hamming Weight Operators, a new class of constraint-aware operators that confine quantum evolution strictly within the feasible subspace.<n>We validate our approach on benchmark tasks from both finance and high-energy physics, specifically portfolio optimization and two-jet clustering with energy balance.
  arXiv  Detail & Related papers  (2026-01-04T12:58:04Z)
• MPQ-DMv2: Flexible Residual Mixed Precision Quantization for Low-Bit Diffusion Models with Temporal Distillation [74.34220141721231]
  We present MPQ-DMv2, an improved textbfMixed textbfPrecision textbfQuantization framework for extremely low-bit textbfDiffusion textbfModels.
  arXiv  Detail & Related papers  (2025-07-06T08:16:50Z)
• Efficient QAOA Architecture for Solving Multi-Constrained Optimization Problems [3.757262277494307]
  This paper proposes a novel combination of constraint encoding methods for the Quantum Approximate Optimization Ansatz.<n>One-hot constraints are enforced through $XY$-mixers that restrict the search space to the feasible sub-space naturally.<n>Since $XY$-mixers restrict the search space, specific state vector entries are always zero and can be omitted from the simulation, saving valuable memory and computing resources.
  arXiv  Detail & Related papers  (2025-06-03T17:46:53Z)
• Multiobjective variational quantum optimization for constrained problems: an application to Cash Management [45.82374977939355]
  We introduce a new method for solving optimization problems with challenging constraints using variational quantum algorithms. We test our proposal on a real-world problem with great relevance in finance: the Cash Management problem. Our empirical results show a significant improvement in terms of the cost of the achieved solutions, but especially in the avoidance of local minima.
  arXiv  Detail & Related papers  (2023-02-08T17:09:20Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Optimization on manifolds: A symplectic approach [127.54402681305629]
  We propose a dissipative extension of Dirac's theory of constrained Hamiltonian systems as a general framework for solving optimization problems. Our class of (accelerated) algorithms are not only simple and efficient but also applicable to a broad range of contexts.
  arXiv  Detail & Related papers  (2021-07-23T13:43:34Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38: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.