SearcharxivSearch

arXiv subjects

Cédrick Perron

Publications and source records attributed to Cédrick Perron.

3 recordsLinked to original sources

Iterative Optimization with Partial Convergence Guarantees on Neutral Atom Quantum Computers

Neutral atom quantum computers (NAQCs) have emerged as a promising platform for solving the maximum weighted independent set (MWIS) problem. However, analog quantum approaches face two key limitations: constraints of the atomic layout on realizable graph geometries and the absence of performance guarantees. We introduce Lp-Quts, a hybrid quantum-classical framework that integrates an NAQC sampler into a classical cutting-plane algorithm. At each iteration, a relaxed linear program (RLP) bounds the MWIS and induces a reduced graph from which independent sets are sampled using an analog quantum sampler. A novel sample-informed separation problem guides odd-cycle cut selection and accelerates convergence. For t-perfect graphs, Lp-Quts inherits polynomial-time convergence guarantees from the classical theory of cutting planes. We evaluate our approach on instances with up to 300 vertices -- a scale that exceeds the capabilities of current NAQC hardware. In this regime, Lp-Quts reaches solutions within 5--10\% of optimality, outperforming direct analog quantum protocols and greedy baselines under equal sampling budgets. As expected, simulated annealing remains the strongest sample-based solver at this scale. These results demonstrate how quantum samplers can be effectively embedded within classical optimization frameworks to deliver near-optimal solutions with reduced quantum resources while preserving formal guarantees.

quant-ph

Leveraging Analog Neutral Atom Quantum Computers for Diversified Pricing in Hybrid Column Generation Frameworks

In this work, we develop new pulse designs and embedding strategies to improve the analog quantum subroutines of hybrid column generation (CG) algorithms based on neutral-atoms quantum computers (NAQCs). These strategies are designed to improve the quality and diversity of the samples generated. We apply these to an important combinatorial optimization (CO) problem in logistics, namely the fleet assignment. Depending on the instance tested, our quantum protocol has a performance that is either comparable or worse than the best classical method tested, both in terms of the number of iterations and final objective value. We identify the cause of these suboptimal solutions as a result of our quantum protocol often generating high-quality but degenerate samples. We address this limitation by introducing a greedy post-processing technique, Make\_Diff, which applies bit-wise modifications to degenerate samples in order to return a non-degenerate set. With this modification, our quantum protocol becomes competitive with an exact solver for the subproblem, all the while being resilient to state preparation and measurements (SPAM) errors. We also compare our CG scheme with a Gurobi solver and find that it performs better on over 50\% of our synthetic instances and that, despite Gurobi having a more extensive runtime. These improvements and benchmarks herald the potential of deploying hybrid CG schemes on NISQ devices for industrially relevant CO problems.

quant-ph

Self-interacting dark baryons

Using results from lattice QCD, it is possible to quantitatively design models of dark baryons leading to velocity-dependent self-interaction cross sections that match the values needed for solving small-scale structure problems of standard cold dark matter. However it is not obvious that the main dark matter component in such models will be nucleons rather than large nuclei, or dark pions or atoms, whose scattering properties would be different. We first identify the parameters of a dark SU(3) sector analogous to QCD -- the confinement scale $Λ$ and pion mass $m_π$ -- needed to reproduce desired self-interaction cross sections. Then we show that these values can generically be compatible with the absence of a sufficiently stable deuteron bound state, and hence leading to no heavier nuclei, thus establishing the consistency of the scenario for self-interacting dark nucleons. The range of dark photon masses needed to avoid dominant pion or atomic dark matter is determined, as well as allowed values for the kinetic mixing parameter. The dark proton might be detected directly in future searches, by dark photon exchange.

hep-ph