Cover Image

Application of the Quantum Approximate Optimization Algorithm in Solving the Total Domination Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pan, Haoqian, Yuan, Hang, Liu, Yang, Lu, Changhong, Chen, Wanfang, Wang, Shiyue
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Solving the Independent Domination Problem by Quantum Approximate Optimization Algorithm
by: Pan, Haoqian, et al.
Published: (2024)

Exploring the Potential of Quantum Approximate Optimization Algorithm in Tackling the Perfect Domination Problem
by: Pan, Haoqian, et al.
Published: (2024)

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

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

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

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

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

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

Algorithms for the Global Domination Problem
by: Inza, Ernesto Parra, et al.
Published: (2023)

Ancilla-free Quantum Adder with Sublinear Depth
by: Remaud, Maxime, et al.
Published: (2025)

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

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

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

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

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

QUBO Formulations for Variation of Domination Problem
by: Pan, Haoqian, et al.
Published: (2024)

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

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

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

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

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

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

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

Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs
by: Paul, Kaustav, et al.
Published: (2024)

Efficient Classical Computation of Single-Qubit Marginal Measurement Probabilities to Simulate Certain Classes of Quantum Algorithms
by: Pradata, Santana Y., et al.
Published: (2024)

A Copositive Framework for Analysis of Hybrid Ising-Classical Algorithms
by: Brown, Robin, et al.
Published: (2022)

Quantum algorithms for optimizers
by: Nannicini, Giacomo
Published: (2024)

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

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

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

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

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

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

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

Local Equivalences of Graph States
by: Claudet, Nathan
Published: (2025)

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

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

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

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

Enigma: Application-Layer Privacy for Quantum Optimization on Untrusted Computers
by: Ayanzadeh, Ramin, et al.
Published: (2023)