--- title: Quantum Classical Branch-and-Price url: https://www.emergentmind.com/topics/quantum-classical-branch-and-price-qcbp type: topic --- # Quantum Classical Branch-and-Price Quantum Classical Branch-and-Price (QCBP) denotes a family of hybrid optimization architectures that augment classical Branch-and-Price, or branch-price-and-cut, with quantum, quantum-annealing-inspired, or quantum-speedup subroutines for selected bottlenecks. In the current literature, those bottlenecks include solving restricted master problems as $0$–$1$ set-partitioning models, solving pricing subproblems, solving cut-separation subproblems, and accelerating branch-and-bound tree exploration itself. The unifying design principle is not a single fixed algorithmic template, but the retention of a classical decomposition-and-search backbone—column generation, branching, bounding, pruning, and incumbent management—while delegating structurally compatible subproblems to Ising-, QUBO-, or oracle-based quantum machinery [2103.15433], [2412.15665], [1906.10375], [2508.18887], [2603.21374]. ## 1. Classical substrate and problem structure The classical core of QCBP is Branch-and-Price (B\&P), which combines Column Generation (CG) and Branch-and-Bound (B\&B). In its canonical set-partitioning form, the master problem uses columns $j \in J$ representing feasible routes or patterns, rows $i \in I$ representing items to cover, and a binary incidence matrix $A=(a_{ij})$ with $a_{ij}\in\{0,1\}$. The master integer program is $$ \min \sum_{j \in J} c_j x_j $$ subject to exact coverage $$ \sum_{j \in J} a_{ij}x_j = 1 \quad \forall i\in I, $$ with $x_j \in \{0,1\}$. Its LP relaxation replaces integrality by $x_j \ge 0$. Solving the restricted master problem (RMP) yields dual variables $\pi_i$, and pricing generates columns with negative reduced cost $$ r_j = c_j - \boldsymbol{\pi}^{\top}\mathbf{a}_j = c_j - \sum_{i\in I} a_{ij}\pi_i. $$ CG iterates between solving the current RMP LP and solving pricing until no column with $r_j<0$ remains. If the LP-optimal master solution is fractional, branching recursively partitions the feasible RMP solution space; pruning occurs by bound, infeasibility, or integrality [2103.15433]. This substrate persists across application domains, but the master and pricing semantics vary. Tail Assignment uses a set-partitioning master over aircraft routes, with pricing formulated as an RCSPP under connection times, maintenance windows, curfews, and preassignments [2103.15433]. Vehicle Routing uses an exponentially sized set-cover or set-partitioning master over feasible capacity-respecting routes, together with rounded capacity cuts in a branch-price-and-cut setting [2412.15665]. Intra-day EV charging scheduling is modeled as a Partition Coloring Problem (PCP), where columns are independent sets of a conflict graph and the RMP minimizes makespan $\tau$ [2603.21374]. Vertex Coloring uses the standard set-partitioning master over all independent sets of a graph, with one column per color class [2508.18887]. A recurring misconception is that QCBP replaces Branch-and-Price by a quantum optimizer. The literature instead treats the classical decomposition as indispensable: dual extraction, lower-bound computation, incumbent management, and tree control remain classical in all practical variants currently described [2103.15433], [2412.15665]. ## 2. Algebraic formulations and quantum encodings In the Tail Assignment formulation, the quantum subroutine targets the RMP as a $0$–$1$ set-partitioning model. The paper encodes Set Partitioning or Exact Cover into a penalty Hamiltonian $$ H = H_{\text{obj}} + \lambda H_{\text{constr}}, $$ with $$ H_{\text{obj}} = \sum_j c_j x_j,\qquad H_{\text{constr}} = \sum_i\left(\sum_j a_{ij}x_j - 1\right)^2. $$ After expanding the quadratic penalties and applying the spin transformation $x_j=(1-s_j)/2$ with $s_j\in\{\pm1\}$, the model becomes an Ising Hamiltonian $$ H(s)=\sum_j h_j s_j + \sum_{j (n+1)\max_{ij\in E} t_{ij} + \sum_{v\in V}\bar{\pi}_v. $$ Rounded-capacity-cut separation is likewise encoded as a QUBO with subset variables $x_i$ and route-incidence variables $w_r$; for that formulation, $P>1$ suffices and the experiments use $P=2$ [2412.15665]. For Vertex Coloring, pricing is a Maximum-Weight Independent Set (MWIS) problem with reduced cost $$ \mathrm{rc}(S)=1-\sum_{i\in S}\pi_i, $$ so negative reduced cost is equivalent to $\sum_{i\in S}\pi_i>1$. The quantum implementation uses a Rydberg-atom Hamiltonian $$ H(t)=\sum_{i\in V}\Delta_i(t)n_i+\sum_{(i,j)\in E}U_{ij}n_in_j+\sum_{i\in V}\Omega_i(t)\sigma_i^x, $$ in which the Rydberg blockade enforces independence and site-dependent detunings encode the dual weights $w_i=\pi_i$ [2508.18887]. These encodings show that “QCBP” is not tied to one physics model. The literature spans Ising spin-glass mappings, generic QUBOs, and analog neutral-atom Hamiltonians. This suggests that the defining criterion is architectural placement within Branch-and-Price rather than a specific quantum ansatz. ## 3. Placement of the quantum subroutine The locus of quantum intervention varies substantially across QCBP instantiations. | Setting | Quantum target | Classical remainder | |---|---|---| | Tail Assignment | Integer solutions of the RMP via QAOA | CG, RCSPP pricing, branching, postprocessing [2103.15433] | | EV charging scheduling | Pricing as MIS QUBO via BSB or SimCIM | RMP by Gurobi, branching, repair, tree search [2603.21374] | | Vehicle Routing | Pricing and cut separation as QUBOs | RMP, exact fallback, branch-price-and-cut control [2412.15665] | | Vertex Coloring | MWIS pricing via QAA on neutral-atom QPU | RMP, branching on maximal ISs, primal heuristic [2508.18887] | | Oracle-based theoretical lift | Global tree search and counting | Classical B\&P semantics encoded in $U_{\text{branch}}$, $U_{\text{cost}}$, $U_{\text{mark}}$ [1906.10375] | In Tail Assignment, the quantum component is inserted as a primal heuristic at selected CG iterations. Given a promising RMP instance, the current master is encoded into a Hamiltonian and QAOA is run to sample integer RMP solutions. Feasible high-quality samples can tighten the incumbent upper bound, improve pruning by bound, and guide branching or fixing decisions. Pricing remains classical because, in that application, it is an RCSPP with intricate operational constraints [2103.15433]. In EV charging scheduling, QCBP places the nonclassical component in pricing rather than in the master. The RMP is solved by Gurobi, while pricing is cast as a MIS QUBO and handled by MindQuantum’s QAIA solvers, specifically ballistic simulated branching (BSB) and simulated coherent Ising machine (SimCIM). Branching constraints are propagated back into pricing by forbidding or forcing vertices and updating the conflict graph and partitions [2603.21374]. In Vehicle Routing, the same hybrid logic is extended to branch-price-and-cut. Pricing returns routes with negative reduced cost, and separation returns violated rounded capacity cuts. A distinctive design choice is to exploit the randomness of the quantum heuristic by accepting all distinct solutions below a cost threshold, not only the best one. This multi-solution strategy is used both for route generation and cut generation [2412.15665]. In the Vertex Coloring implementation, the quantum device is used only for MWIS pricing. Branching is performed exclusively on maximal independent sets discovered during pricing, and a classical primal heuristic builds feasible colorings from the accumulated column pool without extra ILP or QPU calls [2508.18887]. The theoretical formulation based on Montanaro’s branch-and-bound speedup differs from the heuristic variants. There, the branch-and-price node state is abstracted as a tree with a branch oracle and a monotone cost oracle, and quantum search and tree-size estimation are used to accelerate global exploration of the truncated tree [1906.10375]. ## 4. Representative problem classes and algorithmic workflows In Tail Assignment, feasible aircraft routes form the columns and flights are the rows. The master selects a set of legal routes that covers each flight exactly once at minimum cost, while pricing generates new legal routes with negative reduced cost using dual information from the master. The QCBP workflow keeps the column-generation machinery, pricing via RCSPP, dual stabilization, and branching or fixing heuristics classical, and uses QAOA only to solve the current RMP as a $0$–$1$ set-partitioning model. Preprocessing reduces RMP size, and postprocessing filters infeasible samples and optionally performs local improvements [2103.15433]. In intra-day EV charging scheduling, each vehicle induces a partition of feasible charging intervals, vertices represent intervals, and conflict edges encode either intra-vehicle exclusivity or inter-vehicle temporal overlap. The RMP minimizes the latest completion time $\tau$ over a dynamically growing family of independent-set columns. Column generation constructs dual-weighted vertex scores $\omega_v$, pricing solves the associated MIS QUBO, and repaired negative-reduced-cost independent sets are added back to the RMP. Branching includes subset-based branching, which forces or forbids an interval for a selected vehicle, and pairwise branching, which either adds a conflict edge or merges a co-occurring pair into a super-vertex [2603.21374]. In Vehicle Routing, the classical master contains route variables $y_r$ and may use either set-cover or set-partitioning semantics. Pricing seeks a route with minimum reduced cost, and cut separation seeks violated rounded capacity cuts. The QCBP formulation maps the pricing problem to a CPCTSP QUBO and the separation problem to a fractional-capacity-cut oracle QUBO. Each node of the branch-and-bound tree alternates between RMP solution, quantum pricing, quantum separation, and exact fallback if no improving column or cut is found. The accepted pricing outputs are $$ \mathcal{R}^{\mathrm{QA}(\Theta)}=\{r\mid \bar{c}_r\le \Theta\},\qquad \Theta\le 0, $$ which are filtered for feasibility, deduplicated, and added in batch [2412.15665]. In Vertex Coloring, the master problem chooses independent sets as color classes. Pricing is MWIS under dual weights, implemented by quantum adiabatic algorithms on neutral-atom registers. The workflow initializes the RMP with singletons or other feasible independent sets, solves the RMP LP, invokes QAA pricing, and adds all columns with negative reduced cost. If quantum pricing yields none, a classical MWIS solve with GLPK certifies that no improving column exists. Branching then fixes a selected maximal independent set to one color, removes its vertices and incident edges, and recurses on the reduced subgraph. The lower bound at a node of depth $d$ is $$ \mathrm{LB}_{\text{node}} = d + \max\{LB_{\text{RMP}},LB_{\text{H}},LB_{\text{EW}},LB_{\text{EE}}\}, $$ and pruning occurs if this bound is at least the current upper bound or if a duplicate subgraph has already been processed [2508.18887]. The theoretical oracle-based formulation lifts this workflow to a more abstract level. A QCBP node consists of the base constraint system, a sequence of branching decisions, and a current master LP model whose columns are an implicit subset of an exponentially large set. The cost oracle solves the LP relaxation via column generation to optimality, the branch oracle returns the children induced by the branching rule, and a marking oracle identifies feasible leaves within a cost threshold. Search and Count are then orchestrated as in quantum branch-and-bound [1906.10375]. ## 5. Empirical behavior, scaling, and performance diagnostics The Tail Assignment study simulates ideal QAOA with depths up to $p=40$ and qubit counts $n=6,8,10,12,14,20$. For Exact Cover, the required depth $p$ decreases as the number of feasible solutions increases for a fixed success probability of finding a feasible solution. For Set Partitioning, if the Hamiltonian is poorly balanced, the required depth for a fixed success probability of finding the optimal solution can increase with the number of feasible solutions, and in the worst case the depth requirement can be exponential in the problem size. Proper balancing of objective versus constraints significantly improves success probabilities and reduces required depth for most instances: $22$ of $29$ instances with more than one feasible solution benefited. Instances with a single feasible solution were best treated as Exact Cover. The paper also identifies the smallest nonzero energy gap relative to the maximum eigenvalue as a useful diagnostic, because increasing this ratio correlates with lower $p$ requirements [2103.15433]. The EV charging study uses synthetic instances on a Windows 10 machine with Intel Core i7-12700H and Python 3.10.18, with horizon $T=24$, fixed charging duration $d=3$, charger count $C\in\{5,10\}$, and a time limit of $3600$ s. On small and medium instances with $|V|\le 40$, all methods prove optimality with sub-second to tens-of-seconds runtimes. On large and hard instances with $|V|\ge 80$, the pure Gurobi-based baseline often hits the $3600$ s limit with non-zero gaps, whereas the QAIA-based variants close the gap and prove optimality within the same budget. The example instance v100c10k10s1 is reported explicitly: the Gurobi baseline terminates at $3600$ s with gap $\approx 35.71\%$, BSB reaches gap $=0$ in $\approx 965.76$ s, and SimCIM in $\approx 968.25$ s [2603.21374]. The Vehicle Routing study compares quantum annealing (QA), simulated annealing (SA), and classical exact subroutines. In pricing, SA reduces the number of exact pricing calls by an average of $72\%$ relative to pure IP, while QA reduces them by $31\%$. QA’s average per-pricing runtime is lower than SA on all but the smallest instance, but pure IP pricing is still fastest in the small-size regime. In separation, QA reduces integrality gaps more than CVRPSEP on two instances, while SA matches or exceeds QA on all instances. A central systems-level observation is that QPU time is about $10\%$ of total wall-clock time, so classical overhead dominates runtime [2412.15665]. The Vertex Coloring experiments report an emulation set of $140$ instances with $n=10,\dots,16$, including $78$ unit-disk and $62$ non-unit-disk graphs. QCBP solves $\approx 97.9\%$ optimally overall, compared with $\approx 67.9\%$ for HCG and $\approx 83.6\%$ for BBQ-mIS. The breakdown is $98.7\%$ on unit-disk instances and $96.8\%$ on non-unit-disk instances. Optimality gaps are usually $0$, with worst gap $\approx 0.033$; by contrast, HCG reaches gaps up to $\approx 0.208$ and BBQ-mIS up to $\approx 0.083$. QCBP typically uses fewer than $10^4$ shots per instance and often generates at most $10$ nodes while exploring at most $3$ [2508.18887]. These results do not support a uniform performance narrative. Some QCBP variants already outperform classical baselines on designated large-instance regimes, while others remain behind classical exact or heuristic competitors once orchestration overhead is counted. The empirical record is therefore application-specific and hardware-specific rather than universal. ## 6. Exactness, theory, limitations, and future directions Exactness in QCBP is conditional on where the quantum component is placed and whether heuristic outputs are eventually certified. In the EV charging framework, branch-and-price remains exact if the master provides valid lower bounds and column generation continues until no negative-reduced-cost column exists; if pricing is heuristic, periodic exact pricing checks or a final exact pricing call restore formal correctness [2603.21374]. The Vehicle Routing formulation makes the same point for both pricing and separation: heuristic QUBO solves can be interleaved with exact fallback, so optimality is still proved by the classical branch-and-bound framework [2412.15665]. By contrast, the Tail Assignment variant uses QAOA as a primal heuristic for integer RMP solutions, so its immediate role is incumbent improvement rather than exact certification [2103.15433]. The strongest complexity statement in the literature comes from the oracle-based quantum branch-and-bound formulation. Let $T$ be the full search tree of depth $d$, let $c_{\min}$ be the minimal cost of a valid solution, and let $T_{\min}$ be the size of the tree truncated at $c_{\min}$. Theorem 1 states that the quantum algorithm uses $$ O\!\left( \sqrt{T_{\min}d}\,\log c_{\max}\,\log\!\left(\frac{d\log c_{\max}}{\varepsilon}\right) \left( \log\!\left(\frac{d\log c_{\max}}{\varepsilon}\right)+d\log d \right) \right) $$ oracle calls and, except with failure probability at most $\varepsilon$, returns a minimal-cost solution if one exists, else “no solution.” This yields a near-quadratic speedup in the truncated tree size under the stated oracle assumptions. For the Sherrington–Kirkpatrick model, the paper reports a quantum runtime $O(2^{0.226n})$ on most instances, compared with Grover’s $O(2^{n/2})$ and a classical branch-and-bound bound of $O(2^{0.451n})$ with high probability [1906.10375]. The practical limitations are equally explicit. Tail Assignment notes that typical RMPs have $10^3$–$10^4$ columns, dense couplings imply many entangling gates, Hamiltonian construction for dense RMPs is $O(n^2)$, and success degrades under noise because the reported QAOA simulations are ideal and shot-free [2103.15433]. Vehicle Routing emphasizes sparse hardware connectivity, minor embedding overhead, chain errors, feasibility filtering, and the fact that dense QUBOs are limited by current annealer embedding capacity [2412.15665]. Vertex Coloring adds neutral-atom embedding constraints such as minimum spacing, maximum adjacency distance, and register diameter, and notes that non-unit-disk graphs may require approximate embeddings that effectively replace the target graph by a supergraph, potentially missing some columns [2508.18887]. EV charging highlights penalty calibration, hyperparameter sensitivity in BSB and SimCIM, and the possibility that heuristic pricing may miss a negative-reduced-cost column unless exact fallback is used [2603.21374]. Several future directions recur across the literature. These include extending QCBP to other large-scale ILPs with column-generation structure such as crew pairing, crew rostering, vehicle routing, and facility location; using alternative quantum subroutines such as quantum annealing, VQE, Grover-based search, or amplitude amplification; designing constraint-preserving mixers instead of penalty-only encodings; improving dual stabilization and warm-start schedules; and exploiting batch sampling more systematically to add many columns or cuts per iteration [2103.15433], [2412.15665], [2603.21374]. A plausible implication is that QCBP is best viewed not as a single algorithm with settled performance guarantees, but as a modular research program centered on one question: which subproblems inside Branch-and-Price are small enough, structured enough, and influential enough that a quantum or quantum-inspired coprocessor can improve the overall decomposition without destroying its bound structure or correctness semantics. Source: https://www.emergentmind.com/topics/quantum-classical-branch-and-price-qcbp