Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2605.17628

A Penalty-Free Pipeline for Direct Quantum-Annealer Portfolio Optimization

Luis Lozano

quant-phmath.OCq-fin.PMSubmitted May 17, 2026• Announced May 19, 2026• 1 citation
v1 · May 17, 2026v2 · May 31, 2026
arXivHTMLPDF

Abstract

Direct quantum-annealer portfolio optimization is commonly formulated as a penalty-encoded QUBO and submitted to D-Wave hardware. We show that this standard formulation fails on current devices and identify the structural reason: the cardinality penalty contributes a dense rank-one term proportional to the all-ones matrix that makes the logical interaction graph complete regardless of the covariance structure. On Pegasus and Zephyr, chain-break fractions reach 83 percent at N equal to 24 and 92 percent at N equal to 49, producing no feasible samples. Attempting to fix this through topology-aware sparsification reveals a second problem: any sparsifier that removes off-diagonal entries also dilutes the cardinality constraint, so raw samples remain infeasible even when chains no longer break, and an ablation shows that for structurally favorable cases such as betting with settlement-graph priors the classical feasibility projector alone explains the result rather than the QPU. We propose dropping the penalty entirely: build an objective-only QUBO from the expected returns and the risk-scaled covariance, sample it on hardware, and enforce the cardinality constraint classically as a post-processing step. On D-Wave Advantage and Advantage2 for equities up to N equal to 49 and betting up to N equal to 48, mean chain-break fractions per sample averaged over reads drop from the range of 71 to 92 percent down to at most 0.04 percent. The QPU returns lower-energy feasible portfolios than the greedy heuristic on betting at N equal to 39 and 48, which is an energy comparison and not a proof of optimality, and the equity post-processed regret is at most 0.03 percent at all tested scales. These results establish that the penalty encoding, not the sparse hardware topology, is the binding constraint for direct QPU portfolio optimization at currently accessible scales.

Related papers

Where the Quantum Lives in D-Wave Hybrid Portfolio Optimization: An Operational Decomposition Audit

Luis Lozano

Hybrid quantum-classical solvers conceal how reported performance divides between quantum-processing-unit (QPU) access and other service time. We audit D-Wave's Leap service on cardinality-constrained mean-variance portfolio instances from N=10 to 640, comparing constraint-native CQMs, penalty-encoded BQMs, Gurobi MIQP, simulated annealing, and a matched-budget Tabu baseline, and we propose a four-metric operational audit of the exposed timing fields. LeapHybridCQM matches Gurobi's proven optimum on all 54 head-to-head instances at N<=120, yet its mean QPU access is 0.034 s: 0.68% of the nominal five-second budget; telemetry does not resolve the residual into classical computation, orchestration, or budget granularity. Across 108 fixed-seed five-second CPU runs on 36 instances, TabuSampler reaches CQM-level objectives with mean absolute delta 0.00078 (maximum 0.00798); at N in {400,640} the mean is 3.04e-5. This establishes classical objective achievability, not an internal QPU ablation. We prove that quadratic encoding of exact cardinality adds a dense rank-one term and, apart from isolated exact coefficient cancellations, yields a complete logical graph independent of covariance support, with a bounded-degree embedding lower bound; the resulting density collapse is consistent with hybrid-BQM degradation. A descriptive five-window Fama-French overlay of post-projection direct-QPU portfolios yields mean Sharpe 1.94 versus 2.22 for 1/N. These results do not establish a quantum-sampling advantage; they motivate reporting QPU wall-clock fraction, optimality gap, density amplification, service-output variance, and matched-budget classical controls, keeping operational accounting separate from causal attribution.

quant-pharXiv:2605.17623•May 19, 2026•1 citation

Where the Quantum Lives in D-Wave Hybrid Portfolio Optimization

Luis Lozano

We audit how much of D-Wave's hybrid quantum-classical portfolio-optimization service is actually quantum. On cardinality-constrained mean-variance-turnover instances spanning N = 10 to 640 with a Gurobi MIQP optimality anchor, the constraint-native LeapHybridCQM service matches Gurobi's proven optimum on all 54 instances where Gurobi proves optimality, but mean QPU access time is only 0.034 seconds out of a 5-second wall-clock budget, roughly 0.7% of the run. The remaining ~99% is the service's classical decomposition, sub-problem assembly, and feasibility-aware reassembly. The reported D-Wave hybrid win on this problem class is therefore a constraint-native classical pipeline with a small QPU contribution, not a quantum-sampling win. Two structural results sharpen this audit: (i) the cardinality penalty contributes a dense rank-one term that makes the penalty-encoded logical graph fully connected regardless of the original covariance density, collapsing the intended density benchmark axis for all penalty-encoded paths while leaving CQM's sparsity intact; (ii) the CQM service returns identical solutions at every tested wall-clock budget from 5 to 300 seconds and across 10 repeated calls, a determinism property of the service on this problem class. Together with two classical baselines (Gurobi MIQP and simulated annealing) and a comparison against the penalty-encoded LeapHybridBQM interface, these results extend the prior CQM-vs-BQM observation of Sakuler et al. (2025) from "CQM handles constraints natively" to the operational decomposition of where the win actually originates, a finding that reframes how D-Wave hybrid performance should be reported in quantum-finance benchmarks.

•May 10, 2026•0 citations

Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform

Loong Kuan Lee, Harsha Nagarajan, Thore Gerlach +3 more

We present a novel slack-free, penalty-based framework for reformulating constrained binary optimization as Quadratic Unconstrained Binary Optimization (QUBO) on near-term quantum annealing hardware. Given a user-chosen penalty function that most naturally captures a constraint---typically non-quadratic, such as a Heaviside-function surrogate---and a target probability measure over the Boolean hypercube, our method returns the weighted least-squares projection of the chosen penalty function onto the subspace spanned by linear and quadratic Walsh--Fourier characters that correspond to physically realizable couplings on the target hardware graph. Within this restricted family, the resulting quadratic surrogate is uniquely and optimally determined by the normal equations: unlike state-of-the-art approaches, it introduces no per-constraint penalty coefficients to tune and avoids dense all-pairs couplings by construction. Two practical consequences follow. First, the projected penalty respects device connectivity, reducing chain lengths and physical-qubit overhead after minor embedding. Second, we show empirically that this hardware-native surrogate can outperform denser full-pairwise projections, despite being drawn from a strictly smaller approximation space. This advantage widens once the QUBO is embedded and sampled on quantum annealers, yielding samples with the lowest worst-case and mean objective gaps compared to unbalanced penalization and a hardware-blind projection onto all quadratic terms.

quant-pharXiv:2607.26349•Jul 30, 2026•1 citation

Reproducible QUBO-QAOA Benchmark for Cardinality-Constrained Mean-Variance Portfolio Selection

Ata Sani Kılıç, Ercan Erkalkan

Cardinality-constrained mean-variance portfolio selection is a practical decision-support problem in finance and business analytics and a compact benchmark for combinatorial optimization. A Quadratic Unconstrained Binary Optimization (QUBO) model is derived using an equal-weight utility proxy and an instance-adaptive quadratic penalty that enforces a fixed number of selected assets. A depth-one Quantum Approximate Optimization Algorithm (QAOA) solver is evaluated on a classical statevector simulator and compared against an exact feasibleenumeration baseline on small problem sizes. A fully reproducible Python implementation is described, including QUBO construction, penalty calibration, and a$(\gamma, \beta)$grid-search protocol that minimizes expected energy, followed by a top-$M$post-processing rule for returning a feasible portfolio. Across 10 synthetic instances per problem size, feasibility is achieved in all runs for$N \in\{8,10,12\}$with$K=3$under the default setting$(\alpha=10$,$M=256$). An ablation quantifies that top-$M$post-processing is critical for maintaining feasibility under a standard mixer, while penalty scaling exhibits an explicit feasibility-quality trade-off at$N=12$. A simple classical greedy and random-$K$baseline is also reported to contextualize depth-one QAOA performance.

International Conference on Electrical, Computer and Energy Technologies (ICECET)•Jul 1, 2026•0 citations

Large-scale portfolio optimization on a trapped-ion quantum computer

Alejandro Gomez Cadavid, Ananth Kaushik, Pranav Chandarana +10 more

We present an end-to-end pipeline for large-scale portfolio selection with cardinality constraints and experimentally demonstrate it on trapped-ion quantum processors using hardware-aware decomposition. Building on RMT-based correlation-matrix denoising and community detection, we identify correlated asset groups and introduce a correlation-guided greedy splitting scheme that caps each cluster by the executable qubit budget. Each cluster defines a hardware-embeddable QUBO subproblem that we solve using bias-field digitized counterdiabatic quantum optimization (BF-DCQO), a non-variational method that avoids classical parameter-training loops. We recombine low-energy candidates into global portfolios and enforce feasibility with a two-stage post-processing routine: fast repair followed by a cardinality-preserving swap local search. We benchmark the workflow on a 250-asset universe taken from the S&P 500 and execute subproblems on a 64-qubit Barium development system similar to the forthcoming IonQ Tempo line. We observe that larger executable subproblem sizes reduce decomposition error and systematically improve final objective values and risk-return trade-offs relative to randomized baselines under identical post-processing. Overall, the results establish a hardware-tested route for scaling financial optimization problems, defined by a trade space in which executable problem size and circuit cost are balanced against the resulting solution quality.

quant-pharXiv:2602.23976•Mar 2, 2026•2 citations

Beyond Default Tuning: Persistence of Size-Dependent Direct-QPU Recovery Degradation in Fault-Tree QUBO Optimization

Devin Peters

Fault-tree analysis is a core component of probabilistic risk assessment (PRA), and quadratic unconstrained binary optimization (QUBO) provides a direct interface for evaluating fault-tree optimization problems on quantum annealers. A prior size-stratified study of an 80-instance fault-tree cohort observed sharp degradation in direct quantum-processing-unit (QPU) minimum-cardinality truth recovery as QUBO size increased, but the direct-QPU arms used a single anneal duration and did not isolate embedding, chain-strength, logical-variable relabelling, or chain-break explanations. This follow-on study prospectively pre-specified and SHA-256-locked a controlled robustness experiment on the same frozen penalty-QUBO cohort using D-Wave Advantage2 hardware. Eighty instances spanning 16, 25, 33, and 42 QUBO variables were evaluated across five forward-anneal durations and three deterministic fixed embeddings, with additional chain-strength controls on chained embeddings and four deterministic logical-variable relabelling diagnostics at 42 variables. The campaign completed 1,408 of 1,408 pre-specified conditions without execution or artifact failures and preserved 1,408,000 physical and 1,408,000 logical reads. Parameter selection affected recovery at smaller sizes: all 16- and 25-variable instances were truth-positive under at least one core condition. In contrast, only 18 of 20 33-variable instances and 3 of 20 42-variable instances were ever recovered across the fifteen anneal-time × embedding conditions, so 17 of 20 42-variable instances were never truth-positive. No tested anneal-time or chain-strength condition met the pre-specified material-rescue criterion, and four 42-variable relabelling diagnostics recovered zero instances. Only one of 1,408,000 logical reads exhibited a nonzero chain-break fraction, and that read was infeasible and not truth-positive. The results show size-dependent tuning leverage rather than parameter invariance: ordinary direct-QPU controls improve recovery within the smaller-size regime but do not materially rescue the large-size recovery frontier on this cohort and hardware epoch. Because the design fixes read count rather than QPU access time, anneal-duration comparisons are interpreted under equal read budgets rather than equal time. The study does not claim quantum advantage, universal formulation failure, full minimal-cut-set enumeration, or any time-to-solution or speedup result.

•Jul 27, 2026•0 citations
Direct quantum-annealer portfolio optimization is commonly formulated as a penalty-encoded QUBO and submitted to D-Wave hardware. We show that this standard formulation fails on current devices and identify the structural reason: the cardinality penalty contributes a dense rank-one term proportional to the all-ones matrix that makes the logical interaction graph complete regardless of the covariance structure. On Pegasus and Zephyr, chain-break fractions reach 83 percent at N equal to 24 and 92 percent at N equal to 49, producing no feasible samples. Attempting to fix this through topology-aware sparsification reveals a second problem: any sparsifier that removes off-diagonal entries also dilutes the cardinality constraint, so raw samples remain infeasible even when chains no longer break, and an ablation shows that for structurally favorable cases such as betting with settlement-graph priors the classical feasibility projector alone explains the result rather than the QPU. We propose dropping the penalty entirely: build an objective-only QUBO from the expected returns and the risk-scaled covariance, sample it on hardware, and enforce the cardinality constraint classically as a post-processing step. On D-Wave Advantage and Advantage2 for equities up to N equal to 49 and betting up to N equal to 48, mean chain-break fractions per sample averaged over reads drop from the range of 71 to 92 percent down to at most 0.04 percent. The QPU returns lower-energy feasible portfolios than the greedy heuristic on betting at N equal to 39 and 48, which is an energy comparison and not a proof of optimality, and the equity post-processed regret is at most 0.03 percent at all tested scales. These results establish that the penalty encoding, not the sparse hardware topology, is the binding constraint for direct QPU portfolio optimization at currently accessible scales.
Hybrid quantum-classical solvers conceal how reported performance divides between quantum-processing-unit (QPU) access and other service time. We audit D-Wave's Leap service on cardinality-constrained mean-variance portfolio instances from N=10 to 640, comparing constraint-native CQMs, penalty-encoded BQMs, Gurobi MIQP, simulated annealing, and a matched-budget Tabu baseline, and we propose a four-metric operational audit of the exposed timing fields. LeapHybridCQM matches Gurobi's proven optimum on all 54 head-to-head instances at N<=120, yet its mean QPU access is 0.034 s: 0.68% of the nominal five-second budget; telemetry does not resolve the residual into classical computation, orchestration, or budget granularity. Across 108 fixed-seed five-second CPU runs on 36 instances, TabuSampler reaches CQM-level objectives with mean absolute delta 0.00078 (maximum 0.00798); at N in {400,640} the mean is 3.04e-5. This establishes classical objective achievability, not an internal QPU ablation. We prove that quadratic encoding of exact cardinality adds a dense rank-one term and, apart from isolated exact coefficient cancellations, yields a complete logical graph independent of covariance support, with a bounded-degree embedding lower bound; the resulting density collapse is consistent with hybrid-BQM degradation. A descriptive five-window Fama-French overlay of post-projection direct-QPU portfolios yields mean Sharpe 1.94 versus 2.22 for 1/N. These results do not establish a quantum-sampling advantage; they motivate reporting QPU wall-clock fraction, optimality gap, density amplification, service-output variance, and matched-budget classical controls, keeping operational accounting separate from causal attribution.
We audit how much of D-Wave's hybrid quantum-classical portfolio-optimization service is actually quantum. On cardinality-constrained mean-variance-turnover instances spanning N = 10 to 640 with a Gurobi MIQP optimality anchor, the constraint-native LeapHybridCQM service matches Gurobi's proven optimum on all 54 instances where Gurobi proves optimality, but mean QPU access time is only 0.034 seconds out of a 5-second wall-clock budget, roughly 0.7% of the run. The remaining ~99% is the service's classical decomposition, sub-problem assembly, and feasibility-aware reassembly. The reported D-Wave hybrid win on this problem class is therefore a constraint-native classical pipeline with a small QPU contribution, not a quantum-sampling win. Two structural results sharpen this audit: (i) the cardinality penalty contributes a dense rank-one term that makes the penalty-encoded logical graph fully connected regardless of the original covariance density, collapsing the intended density benchmark axis for all penalty-encoded paths while leaving CQM's sparsity intact; (ii) the CQM service returns identical solutions at every tested wall-clock budget from 5 to 300 seconds and across 10 repeated calls, a determinism property of the service on this problem class. Together with two classical baselines (Gurobi MIQP and simulated annealing) and a comparison against the penalty-encoded LeapHybridBQM interface, these results extend the prior CQM-vs-BQM observation of Sakuler et al. (2025) from "CQM handles constraints natively" to the operational decomposition of where the win actually originates, a finding that reframes how D-Wave hybrid performance should be reported in quantum-finance benchmarks.
We present a novel slack-free, penalty-based framework for reformulating constrained binary optimization as Quadratic Unconstrained Binary Optimization (QUBO) on near-term quantum annealing hardware. Given a user-chosen penalty function that most naturally captures a constraint---typically non-quadratic, such as a Heaviside-function surrogate---and a target probability measure over the Boolean hypercube, our method returns the weighted least-squares projection of the chosen penalty function onto the subspace spanned by linear and quadratic Walsh--Fourier characters that correspond to physically realizable couplings on the target hardware graph. Within this restricted family, the resulting quadratic surrogate is uniquely and optimally determined by the normal equations: unlike state-of-the-art approaches, it introduces no per-constraint penalty coefficients to tune and avoids dense all-pairs couplings by construction. Two practical consequences follow. First, the projected penalty respects device connectivity, reducing chain lengths and physical-qubit overhead after minor embedding. Second, we show empirically that this hardware-native surrogate can outperform denser full-pairwise projections, despite being drawn from a strictly smaller approximation space. This advantage widens once the QUBO is embedded and sampled on quantum annealers, yielding samples with the lowest worst-case and mean objective gaps compared to unbalanced penalization and a hardware-blind projection onto all quadratic terms.
Cardinality-constrained mean-variance portfolio selection is a practical decision-support problem in finance and business analytics and a compact benchmark for combinatorial optimization. A Quadratic Unconstrained Binary Optimization (QUBO) model is derived using an equal-weight utility proxy and an instance-adaptive quadratic penalty that enforces a fixed number of selected assets. A depth-one Quantum Approximate Optimization Algorithm (QAOA) solver is evaluated on a classical statevector simulator and compared against an exact feasibleenumeration baseline on small problem sizes. A fully reproducible Python implementation is described, including QUBO construction, penalty calibration, and a(γ,β)(\gamma, \beta)(γ,β)grid-search protocol that minimizes expected energy, followed by a top-MMMpost-processing rule for returning a feasible portfolio. Across 10 synthetic instances per problem size, feasibility is achieved in all runs forN∈{8,10,12}N \in\{8,10,12\}N∈{8,10,12}withK=3K=3K=3under the default setting(α=10(\alpha=10(α=10,M=256M=256M=256). An ablation quantifies that top-MMMpost-processing is critical for maintaining feasibility under a standard mixer, while penalty scaling exhibits an explicit feasibility-quality trade-off atN=12N=12N=12. A simple classical greedy and random-KKKbaseline is also reported to contextualize depth-one QAOA performance.
We present an end-to-end pipeline for large-scale portfolio selection with cardinality constraints and experimentally demonstrate it on trapped-ion quantum processors using hardware-aware decomposition. Building on RMT-based correlation-matrix denoising and community detection, we identify correlated asset groups and introduce a correlation-guided greedy splitting scheme that caps each cluster by the executable qubit budget. Each cluster defines a hardware-embeddable QUBO subproblem that we solve using bias-field digitized counterdiabatic quantum optimization (BF-DCQO), a non-variational method that avoids classical parameter-training loops. We recombine low-energy candidates into global portfolios and enforce feasibility with a two-stage post-processing routine: fast repair followed by a cardinality-preserving swap local search. We benchmark the workflow on a 250-asset universe taken from the S&P 500 and execute subproblems on a 64-qubit Barium development system similar to the forthcoming IonQ Tempo line. We observe that larger executable subproblem sizes reduce decomposition error and systematically improve final objective values and risk-return trade-offs relative to randomized baselines under identical post-processing. Overall, the results establish a hardware-tested route for scaling financial optimization problems, defined by a trade space in which executable problem size and circuit cost are balanced against the resulting solution quality.
Fault-tree analysis is a core component of probabilistic risk assessment (PRA), and quadratic unconstrained binary optimization (QUBO) provides a direct interface for evaluating fault-tree optimization problems on quantum annealers. A prior size-stratified study of an 80-instance fault-tree cohort observed sharp degradation in direct quantum-processing-unit (QPU) minimum-cardinality truth recovery as QUBO size increased, but the direct-QPU arms used a single anneal duration and did not isolate embedding, chain-strength, logical-variable relabelling, or chain-break explanations. This follow-on study prospectively pre-specified and SHA-256-locked a controlled robustness experiment on the same frozen penalty-QUBO cohort using D-Wave Advantage2 hardware. Eighty instances spanning 16, 25, 33, and 42 QUBO variables were evaluated across five forward-anneal durations and three deterministic fixed embeddings, with additional chain-strength controls on chained embeddings and four deterministic logical-variable relabelling diagnostics at 42 variables. The campaign completed 1,408 of 1,408 pre-specified conditions without execution or artifact failures and preserved 1,408,000 physical and 1,408,000 logical reads. Parameter selection affected recovery at smaller sizes: all 16- and 25-variable instances were truth-positive under at least one core condition. In contrast, only 18 of 20 33-variable instances and 3 of 20 42-variable instances were ever recovered across the fifteen anneal-time × embedding conditions, so 17 of 20 42-variable instances were never truth-positive. No tested anneal-time or chain-strength condition met the pre-specified material-rescue criterion, and four 42-variable relabelling diagnostics recovered zero instances. Only one of 1,408,000 logical reads exhibited a nonzero chain-break fraction, and that read was infeasible and not truth-positive. The results show size-dependent tuning leverage rather than parameter invariance: ordinary direct-QPU controls improve recovery within the smaller-size regime but do not materially rescue the large-size recovery frontier on this cohort and hardware epoch. Because the design fixes read count rather than QPU access time, anneal-duration comparisons are interpreted under equal read budgets rather than equal time. The study does not claim quantum advantage, universal formulation failure, full minimal-cut-set enumeration, or any time-to-solution or speedup result.