Imagen de Portada

Quantum Approaches to the Minimum Edge Multiway Cut Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Abbassi, Ali, Dujardin, Yann, Gourdin, Eric, Lacomme, Philippe, Prodhon, Caroline
Formato:	Preprint
Publicado:	2026
Materias:	Quantum Physics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Assessing Quantum Annealing to Solve the Minimum Vertex Multicut
por: Abbassi, Ali, et al.
Publicado: (2026)

A quantum feasibility preserving modeling for the min cut problem
por: Abbassi, Ali, et al.
Publicado: (2026)

Indirect Job-Shop coding using rank: application to QAOA (IQAOA)
por: Bourreau, Eric, et al.
Publicado: (2024)

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

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs
por: Johnson, Matthew, et al.
Publicado: (2022)

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

Application of the Quantum Approximate Optimization Algorithm in Solving the Total Domination Problem
por: Pan, Haoqian, et al.
Publicado: (2024)

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

Minimum Cut Representability of Stable Matching Problems
por: Faenza, Yuri, et al.
Publicado: (2025)

Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
por: Farhi, Edward, et al.
Publicado: (2025)

Multidimensional Electrical Networks and their Application to Exponential Speedups for Graph Problems
por: Li, Jianqiang, et al.
Publicado: (2023)

Multidimensional Quantum Walks, with Application to $k$-Distinctness
por: Jeffery, Stacey, et al.
Publicado: (2022)

Ancilla-free Quantum Adder with Sublinear Depth
por: Remaud, Maxime, 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)

Discrete-Time Open Quantum Walks for Vertex Ranking in Graphs
por: Dutta, Supriyo
Publicado: (2024)

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

End-to-End Speedup for Quantum Simulation-Based Optimization in Power Grid Management
por: Stein, Jonas, et al.
Publicado: (2025)

Quantum circuit model for discrete-time three-state quantum walks on Cayley graphs
por: Sarkar, Rohit Sarma, et al.
Publicado: (2024)

Solving General QUBOs with Warm-Start QAOA via a Reduction to Max-Cut
por: Bhattacharyya, Bikrant, et al.
Publicado: (2025)

Optimizing Tensor Contraction Paths: A Greedy Algorithm Approach With Improved Cost Functions
por: Orgler, Sheela, et al.
Publicado: (2024)

$ε$-Uniform Mixing in Discrete Quantum Walks
por: Zhan, Hanmeng
Publicado: (2023)

Toward Minimum Graphic Parity Networks
por: Cao, Yixin, et al.
Publicado: (2025)

A Scalable Lift-and-Project Differentiable Approach For the Maximum Cut Problem
por: Alkhouri, Ismail, et al.
Publicado: (2025)

Discrete Quantum Walks with Marked Vertices and Their Average Vertex Mixing Matrices
por: Mohan, Amulya, et al.
Publicado: (2024)

Planar #CSP Equality Corresponds to Quantum Isomorphism -- A Holant Viewpoint
por: Cai, Jin-Yi, et al.
Publicado: (2022)

Simple Quantum Coins Enable Pretty Good State Transfer on Every Hypercube
por: Zhan, Hanmeng
Publicado: (2024)

Quantum algorithms for optimizers
por: Nannicini, Giacomo
Publicado: (2024)

The 27-qubit Counterexample to the LU-LC Conjecture is Minimal
por: Claudet, Nathan
Publicado: (2026)

No-go theorem for quantum realization of extremal correlations
por: K, Sujan V., et al.
Publicado: (2025)

Block encoding the 3D heterogeneous Poisson equation with application to fracture flow
por: Pechan, Austin, et al.
Publicado: (2025)

Discrete quadratic model QUBO solution landscapes
por: Zaborniak, Tristan, et al.
Publicado: (2023)

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

Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial Time
por: Claudet, Nathan, et al.
Publicado: (2025)

Graph-theoretic insights on the constructability of complex entangled states
por: Chandran, L. Sunil, et al.
Publicado: (2023)

Covering a Graph with Minimal Local Sets
por: Claudet, Nathan, et al.
Publicado: (2024)

Local Equivalences of Graph States
por: Claudet, Nathan
Publicado: (2025)

Local equivalence of stabilizer states: a graphical characterisation
por: Claudet, Nathan, et al.
Publicado: (2024)

Vertex-minor universal graphs for generating entangled quantum subsystems
por: Cautrès, Maxime, et al.
Publicado: (2024)

An Algorithm for the Decomposition of Complete Graph into Minimum Number of Edge-disjoint Trees
por: Sinha, Antika, et al.
Publicado: (2024)

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