Imagen de Portada

Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Onah, Chinonso, Michielsen, Kristel
Formato:	Preprint
Publicado:	2026
Materias:	Quantum Physics Computational Complexity Discrete Mathematics Information Theory Mathematical Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement
por: Onah, Chinonso, et al.
Publicado: (2025)

Empirical Quantum Advantage in Constrained Optimization from Encoded Unitary Designs
por: Onah, Chinonso, et al.
Publicado: (2025)

Finite-Depth, Finite-Shot Guarantees for Constrained Quantum Optimization via Fejér Filtering
por: Onah, Chinonso, et al.
Publicado: (2026)

QUEST: QUantum-Enhanced Shared Transportation
por: Onah, Chinonso, et al.
Publicado: (2025)

Requirements for Early Quantum Utility and Quantum Utility in the Capacitated Vehicle Routing Problem
por: Onah, Chinonso, et al.
Publicado: (2025)

Benford's Law from Turing Ensembles and Integer Partitions
por: Kolpakov, Alexander, et al.
Publicado: (2025)

Rational degree is polynomially related to degree
por: Kothari, Robin, et al.
Publicado: (2026)

Quantum Annealing-Based Algorithm for Efficient Coalition Formation Among LEO Satellites
por: Venkatesh, Supreeth Mysore, et al.
Publicado: (2024)

Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
por: Montanez-Barrera, Alejandro, et al.
Publicado: (2022)

On Worst-Case Optimal Polynomial Intersection
por: Sun, Yihang, et al.
Publicado: (2026)

Algorithmizing the Multiplicity Schwartz-Zippel Lemma
por: Bhandari, Siddharth, et al.
Publicado: (2021)

The Rate-Immediacy Barrier in Explicit Tree Code Constructions
por: Cohen, Gil, et al.
Publicado: (2025)

Improving Performance in Combinatorial Optimization Problems with Inequality Constraints: An Evaluation of the Unbalanced Penalization Method on D-Wave Advantage
por: Montanez-Barrera, J. A., et al.
Publicado: (2023)

Quantum Subroutines in Branch-Price-and-Cut for Vehicle Routing
por: Wagner, Friedrich, et al.
Publicado: (2024)

Efficient Algorithm for Sparse Fourier Transform of Generalized $q$-ary Functions
por: Tsui, Darin, et al.
Publicado: (2025)

Poincaré Duality and Multiplicative Structures on Quantum Codes
por: Li, Yiming, et al.
Publicado: (2025)

Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors
por: Dastbasteh, Reza, et al.
Publicado: (2025)

Parameterized Complexity of Segment Routing
por: Bazgan, Cristina, et al.
Publicado: (2025)

Undirected Multicast Network Coding Gaps via Locally Decodable Codes
por: Braverman, Mark, et al.
Publicado: (2025)

Unitary designs in nearly optimal depth
por: Cui, Laura, et al.
Publicado: (2025)

Scalable Hardware Maturity Probe for Quantum Accelerators via Harmonic Analysis of QAOA
por: Onah, Chinonso, et al.
Publicado: (2025)

Optimal Inapproximability of Promise Equations over Finite Groups
por: Butti, Silvia, et al.
Publicado: (2024)

Multivariate Analytic Combinatorics for Cost Constrained Channels
por: Lenz, Andreas, et al.
Publicado: (2021)

A Quantum Photonic Approach to Graph Coloring
por: Epequin, Jesua, et al.
Publicado: (2026)

Multipartite Entanglement Routing as a Hypergraph Immersion Problem
por: Tian, Yu, et al.
Publicado: (2024)

The Identity Problem in the special affine group of $\mathbb{Z}^2$
por: Dong, Ruiwen
Publicado: (2023)

Ordering groups and the Identity Problem
por: Bodart, Corentin, et al.
Publicado: (2024)

A polynomial-time classical algorithm for noisy quantum circuits
por: Schuster, Thomas, et al.
Publicado: (2024)

Permutation Entropy for Signal Analysis
por: Kay, Bill, et al.
Publicado: (2023)

Faster algorithms for graph homomorphism via tractable constraint satisfaction
por: Carbonnel, Clément
Publicado: (2026)

Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric
por: Bhattacharya, Sudatta, et al.
Publicado: (2025)

Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations
por: Bangachev, Kiril, et al.
Publicado: (2024)

A learning theory for quantum photonic processors and beyond
por: Rosati, Matteo
Publicado: (2022)

Diagonal Frobenius Number via Gomory's Relaxation and Discrepancy
por: Gribanov, Dmitry, et al.
Publicado: (2025)

Scalable Quantum-Inspired Optimization through Dynamic Qubit Compression
por: Tran, Co, et al.
Publicado: (2024)

No distributed quantum advantage for approximate graph coloring
por: Coiteux-Roy, Xavier, et al.
Publicado: (2023)

Quantum Gates from Wolfram Model Multiway Rewriting Systems
por: Dündar, Furkan Semih, et al.
Publicado: (2025)

An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
por: Marcille, Clara, et al.
Publicado: (2026)

$m$-Eternal Dominating Set Problem on Subclasses of Chordal Graphs
por: Rai, Ashutosh, et al.
Publicado: (2026)

On Closure Properties of Read-Once Oblivious Algebraic Branching Programs
por: Armand, Jules, et al.
Publicado: (2025)