Pith. sign in

Quantum-enhanced markov chain monte carlo for combinatorial optimization

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it

fields

quant-ph 3

years

2026 3

representative citing papers

RL-Guided Quantum-ALNS for Constrained VRP

quant-ph · 2026-07-08 · conditional · novelty 6.0

A DQN-guided controller selectively invokes quantum sampling within ALNS repair for constrained VRP, finding quantum repair admissible in ~16% of states but beneficial in 29/36 matched-budget settings.

Iterative warm-start optimization with quantum imaginary time evolution

quant-ph · 2026-04-28 · unverdicted · novelty 6.0

An iterative nonvariational quantum algorithm using warm-start states and classically computed imaginary time evolution circuits achieves median solutions within 95% of optimal for MaxCut on small 3-regular graphs using only 100 shots, outperforming random and basic classical searches.

citing papers explorer

Showing 3 of 3 citing papers.

  • RL-Guided Quantum-ALNS for Constrained VRP quant-ph · 2026-07-08 · conditional · none · ref 25

    A DQN-guided controller selectively invokes quantum sampling within ALNS repair for constrained VRP, finding quantum repair admissible in ~16% of states but beneficial in 29/36 matched-budget settings.

  • Noise-Directed Adaptive Remapping for Integer Optimization: from qubits to (encoded) qudits quant-ph · 2026-06-26 · conditional · none · ref 67

    NDAR, a heuristic that turns device noise into a resource, is generalized to integer-domain optimization; qudit-native encodings are argued to be the best fit because their all-zeros attractor is always feasible and their gauge freedom is maximal.

  • Iterative warm-start optimization with quantum imaginary time evolution quant-ph · 2026-04-28 · unverdicted · none · ref 21

    An iterative nonvariational quantum algorithm using warm-start states and classically computed imaginary time evolution circuits achieves median solutions within 95% of optimal for MaxCut on small 3-regular graphs using only 100 shots, outperforming random and basic classical searches.