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
Tharrmashastha SAPV

Tharrmashastha SAPV

Joined September 1, 2026

Karma 0

Overview
Last submissions
Datasets
Workspaces
Papers
Last comments
Last topics
Organizations

Quantum-Walk Inspired Spectral Metrics for Evaluating QAOA Mixers

Jasjyot Singh Gulati, Tharrmashastha SAPV

QAOA mixers play an important role in enabling exploration of the exponentially large solution space of binary optimization problems. However, the choice of mixer Hamiltonian is typically guided by convention and implementation or circuit constraints, rather than by a graph-topology-aware criterion. In this work, inspired by quantum-walk mixing theory, we propose two complementary spectral heuristics for characterizing QAOA mixer topologies. The first is the normalized minimum eigenvalue separation of the mixer Hamiltonian $H_M$, while the second is the long-time averaged minimum eigenvalue separation of the mixer unitary $U_M(β)=e^{-iβH_M}$. Both quantities are invariant under any positive rescaling of the mixer Hamiltonian and provide Hamiltonian- and unitary-level characterizations of the mixer's spectral structure. We use them as heuristic indicators of the mixer dynamics relevant to amplitude redistribution during QAOA evolution. We derive exact expressions and asymptotic bounds for the complete graph, hypercube, cycle, and balanced 2-D torus, revealing a broad spectral separation between the studied topology classes. We then compare these separations with empirical QAOA performance. For random permutation-invariant cost Hamiltonians, the observed performance ordering is broadly consistent with the spectral characterization. In contrast, for structured 1-D and 2-D Ising QUBOs, this ordering breaks down, indicating that mixer-cost alignment can become important. These results illustrate both the usefulness and the limitations of topology-level, cost-agnostic spectral heuristics for QAOA mixer selection.

quant-pharXiv:2610.40459•Oct 30, 2026•0 citations

Structural Bottlenecks in QAOA Mixer Design: Transport and Causal Reach

Jasjyot Singh Gulati, Tharrmashastha SAPV

The choice of mixer is a central design decision in the Quantum Approximate Optimization Algorithm (QAOA), yet different structural limitations of a mixer need not be captured by a single metric. We identify two complementary structural bottlenecks for shallow QAOA: configuration-space transport, which limits how strongly probability can concentrate on high-quality solutions, and finite-depth causal reach, which limits which parts of a problem instance can influence a local objective term. In Part I, we derive first-order mixer-dependent objective bounds in complementary small-$β$ and small-$γ$ regimes. For connected regular mixer graphs, the two leading-order expressions are exactly equivalent through a graph-Laplacian identity and reduce to the same cost-weighted Dirichlet energy. We then derive a non-perturbative upper envelope from the layer-wise $\ell_1$ spreading of the mixer unitary, yielding a cost-distribution-dependent necessary spreading condition for attaining a target approximation ratio. In Part II, we study the locality bottleneck for MaxCut by augmenting the transverse-field mixer with problem-graph-aligned two-local interactions. The resulting $k$-hop construction has causal radius at most $(k+1)p$ at depth $p$; for the $k=1$ architectures studied numerically, this gives radius $2p$. Across cycles, circular ladders, and high-girth regular bipartite graphs, $X{+}XX$ and $X{+}YY$ improve the best-found approximation ratios over the standard $X$ mixer at equal depth, while $X{+}YY$ at depth $p$ comes within about one approximation-ratio point of plain $X$ at depth $2p$ in the reach-matched cases examined. The unequal performance of the equal-reach $XX$ and $YY$ augmentations shows that satisfying a structural capability does not by itself guarantee performance. Together, the results provide complementary structural insights for mixer design.

quant-pharXiv:2610.40424•Oct 30, 2026•0 citations

Benchmarking Classical and Quantum Optimization Approaches for Rider-Order Assignment

Tharrmashastha SAPV, Surya Prakash Palanivel, Jasjyot Singh Gulati +1 more

The logistics industry is widely regarded as a promising application domain for emerging optimization paradigms, including quantum computing. The Rider-Order Assignment problem is a practically motivated optimization problem arising in online food delivery and related logistics applications. While the problem is closely related to the classical matching problem, the inclusion of realistic operational constraints renders it computationally challenging. In this work, we formulate the Rider-Order Assignment problem as a constrained binary optimization problem and perform a comparative analysis of classical, quantum-inspired, and gate-based quantum solvers for this problem across multiple instance sizes. Solver performance is assessed using solution quality, computational runtime, and constraint satisfaction, with a consistent post-processing procedure applied to ensure feasibility.

quant-pharXiv:2602.11895•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Feb 13, 2026•0 citations
QAOA mixers play an important role in enabling exploration of the exponentially large solution space of binary optimization problems. However, the choice of mixer Hamiltonian is typically guided by convention and implementation or circuit constraints, rather than by a graph-topology-aware criterion. In this work, inspired by quantum-walk mixing theory, we propose two complementary spectral heuristics for characterizing QAOA mixer topologies. The first is the normalized minimum eigenvalue separation of the mixer Hamiltonian HMH_MHM​, while the second is the long-time averaged minimum eigenvalue separation of the mixer unitary UM(β)=e−iβHMU_M(β)=e^{-iβH_M}UM​(β)=e−iβHM​. Both quantities are invariant under any positive rescaling of the mixer Hamiltonian and provide Hamiltonian- and unitary-level characterizations of the mixer's spectral structure. We use them as heuristic indicators of the mixer dynamics relevant to amplitude redistribution during QAOA evolution. We derive exact expressions and asymptotic bounds for the complete graph, hypercube, cycle, and balanced 2-D torus, revealing a broad spectral separation between the studied topology classes. We then compare these separations with empirical QAOA performance. For random permutation-invariant cost Hamiltonians, the observed performance ordering is broadly consistent with the spectral characterization. In contrast, for structured 1-D and 2-D Ising QUBOs, this ordering breaks down, indicating that mixer-cost alignment can become important. These results illustrate both the usefulness and the limitations of topology-level, cost-agnostic spectral heuristics for QAOA mixer selection.
The choice of mixer is a central design decision in the Quantum Approximate Optimization Algorithm (QAOA), yet different structural limitations of a mixer need not be captured by a single metric. We identify two complementary structural bottlenecks for shallow QAOA: configuration-space transport, which limits how strongly probability can concentrate on high-quality solutions, and finite-depth causal reach, which limits which parts of a problem instance can influence a local objective term. In Part I, we derive first-order mixer-dependent objective bounds in complementary small-βββ and small-γγγ regimes. For connected regular mixer graphs, the two leading-order expressions are exactly equivalent through a graph-Laplacian identity and reduce to the same cost-weighted Dirichlet energy. We then derive a non-perturbative upper envelope from the layer-wise ℓ1\ell_1ℓ1​ spreading of the mixer unitary, yielding a cost-distribution-dependent necessary spreading condition for attaining a target approximation ratio. In Part II, we study the locality bottleneck for MaxCut by augmenting the transverse-field mixer with problem-graph-aligned two-local interactions. The resulting kkk-hop construction has causal radius at most (k+1)p(k+1)p(k+1)p at depth ppp; for the k=1k=1k=1 architectures studied numerically, this gives radius 2p2p2p. Across cycles, circular ladders, and high-girth regular bipartite graphs, X+XXX{+}XXX+XX and X+YYX{+}YYX+YY improve the best-found approximation ratios over the standard XXX mixer at equal depth, while X+YYX{+}YYX+YY at depth ppp comes within about one approximation-ratio point of plain XXX at depth 2p2p2p in the reach-matched cases examined. The unequal performance of the equal-reach XXXXXX and YYYYYY augmentations shows that satisfying a structural capability does not by itself guarantee performance. Together, the results provide complementary structural insights for mixer design.
The logistics industry is widely regarded as a promising application domain for emerging optimization paradigms, including quantum computing. The Rider-Order Assignment problem is a practically motivated optimization problem arising in online food delivery and related logistics applications. While the problem is closely related to the classical matching problem, the inclusion of realistic operational constraints renders it computationally challenging. In this work, we formulate the Rider-Order Assignment problem as a constrained binary optimization problem and perform a comparative analysis of classical, quantum-inspired, and gate-based quantum solvers for this problem across multiple instance sizes. Solver performance is assessed using solution quality, computational runtime, and constraint satisfaction, with a consistent post-processing procedure applied to ensure feasibility.