5 papers · 1 filter
An Efficient Iterative Algorithm for Qubit Mapping via Layer-Weight Assignment and Search Space Reduction
Kang Xu, Zeyang Li, Xinjian Liu +2
Current quantum devices support interactions only between physically adjacent qubits, preventing quantum circuits from being directly executed on these devices. Therefore, SWAP gat…
RBM-Based Simulated Quantum Annealing for Graph Isomorphism Problems
Yukun Wang, Yingtong Shen, Zhichao Zhang +1
The graph isomorphism problem remains a fundamental challenge in computer science, driving the search for efficient decision algorithms. Due to its ambiguous computational complexi…
Hierarchical Quantum Optimization via Backbone-Driven Problem Decomposition: Integrating Tabu-Search with QAOA
Minhui Gou, Zeyang Li, Hong-Ze Xu +6
As quantum computing advances, quantum approximate optimization algorithms (QAOA) have shown promise in addressing combinatorial optimization problems. However, the limitations of…
TANGO: A Robust Qubit Mapping Algorithm via Two-Stage Search and Bidirectional Look
Kang Xu, Yukun Wang, Dandan Li
Current quantum devices typically lack full qubit connectivity, making it difficult to directly execute logical circuits on quantum devices. This limitation necessitates quantum ci…
DAPO-QAOA: An algorithm for solving combinatorial optimization problems by dynamically constructing phase operators
Yukun Wang, ZeYang Li, Linchun Wan
The Quantum Approximate Optimization Algorithm (QAOA) is a well-known hybrid quantum-classical algorithm for combinatorial optimization problems. Improving QAOA involves enhancing…