Cover Image

A quantum feasibility preserving modeling for the min cut problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abbassi, Ali, Dujardin, Yann, Gourdin, Eric, Lacomme, Philippe, Prodhon, Caroline
Format:	Preprint
Published:	2026
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Quantum Approaches to the Minimum Edge Multiway Cut Problem
by: Abbassi, Ali, et al.
Published: (2026)

A technical note for the 91-clauses SAT resolution with Indirect QAOA based approach
by: Fleury, Gerard, et al.
Published: (2024)

Quantum circuit for exponentiation of Hamiltonians: an algorithmic description based on tensor products
by: Fleury, Gerard, et al.
Published: (2025)

Foundations of photonic quantum computation
by: Bombardelli, Martin, et al.
Published: (2025)

Comparative study of quantum methods in the resolution of track findings instances
by: Do, Duy Dao, et al.
Published: (2024)

Variational quantum algorithm-preserving feasible space for solving the uncapacitated facility location problem
by: Wang, Sha-Sha, et al.
Published: (2023)

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

Recoil heating of a dielectric particle illuminated by a linearly polarized plane wave within the Rayleigh regime
by: Abbassi, Mohammad Ali
Published: (2024)

Canonical partial ordering from min-cuts and quantum entanglement in random tensor networks
by: Hu, Miao, et al.
Published: (2025)

A Warm-start QAOA based approach using a swap-based mixer for the TSP: theoretical considerations,implementation and experiments
by: Bourreau, E., et al.
Published: (2025)

Probabilistic tensor optimization of quantum circuits for the max-$k$-cut problem
by: Paradezhenko, G. V., et al.
Published: (2023)

Assessing the feasibility of quantum learning algorithms for noisy linear problems
by: Kim, Minkyu, et al.
Published: (2024)

Is data-efficient learning feasible with quantum models?
by: Sakhnenko, Alona, et al.
Published: (2025)

Performance guarantees of light-cone variational quantum algorithms for the maximum cut problem
by: Wang, Xiaoyang, et al.
Published: (2025)

Revisiting Majumdar-Ghosh spin chain model and Max-cut problem using variational quantum algorithms
by: Britant, et al.
Published: (2024)

Exhaustive and feasible parametrisation with applications to the travelling salesperson problem
by: Schwiering, Marvin, et al.
Published: (2026)

Erasure cost of a quantum process: A thermodynamic meaning of the dynamical min-entropy
by: Badhani, Himanshu, et al.
Published: (2025)

Entanglement preservation in tripartite quantum systems under dephasing dynamics
by: Radhakrishnan, Chandrashekar, et al.
Published: (2023)

Solving k-SAT problems with generalized quantum measurement
by: Zhang, Yipei, et al.
Published: (2024)

Finite-key feasibility of geostationary quantum key distribution
by: Mannalath, Vaisakh, et al.
Published: (2026)

Constraint-preserving quantum algorithm for the multi-frequency antenna placement problem
by: Vandelli, Matteo, et al.
Published: (2025)

Success probability in Shor's Algorithm
by: Abbassi, Ali, et al.
Published: (2025)

A single layer representation of the scattered field for multiple scattering problems
by: Felbacq, Didier, et al.
Published: (2023)

On the feasibility of quantum teleportation protocols implemented with Silicon devices
by: Ryu, Junghee, et al.
Published: (2024)

Generative quantum eigensolver with constrained circuit-cutting overhead
by: Nakamura, Junya, et al.
Published: (2025)

The quantum smooth label cover problem is undecidable
by: Culf, Eric, et al.
Published: (2025)

Optimal quantum circuit cuts with application to clustered Hamiltonian simulation
by: Harrow, Aram W., et al.
Published: (2024)

Systematic improvement of the quantum approximate optimisation ansatz for combinatorial optimisation using quantum subspace expansion
by: Beaujeault-Taudière, Yann
Published: (2025)

Making the cut: two methods for breaking down a quantum algorithm
by: Murça, Miguel, et al.
Published: (2023)

On the feasibility of detecting quantum delocalization effects on relativistic time dilation in optical clocks
by: Hu, Yanglin, et al.
Published: (2023)

Comparing quantum channels using Hermitian-preserving trace-preserving linear maps: A physically meaningful approach
by: Mitra, Arindam, et al.
Published: (2025)

Exploring the feasibility of probabilistic and deterministic quantum gates between T centers in silicon
by: Taherizadegan, Shahrzad, et al.
Published: (2025)

CutQAS: Topology-aware quantum circuit cutting via reinforcement learning
by: Sadhu, Abhishek, et al.
Published: (2025)

Improved sampling bounds and scalable partitioning for quantum circuit cutting beyond bipartitions
by: Nakamura, Junya, et al.
Published: (2025)

Why cut-and-choose quantum state verification cannot be both efficient and secure
by: Wiesner, Fabian, et al.
Published: (2025)

Fidelity preserving and decoherence for mixed unitary quantum channels
by: Liu, Kai, et al.
Published: (2024)

Universal quantum state purification with energy-preserving operations
by: Guo, Xing-Chen, et al.
Published: (2026)

An introduction to variational quantum algorithms for combinatorial optimization problems
by: Grange, Camille, et al.
Published: (2022)

Fundamental limits on concentrating and preserving tensorized quantum resources
by: Lee, Jaehak, et al.
Published: (2021)