An Adaptive Mixer Allocation Algorithm for the Quantum Alternating Operator Ansatz

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Ni, Xiao-Hui, Wu, Yu-Sen, Cai, Bin-Bin, Li, Wen-Min, Qin, Su-Juan, Gao, Fei
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909955476422656
author Ni, Xiao-Hui
Wu, Yu-Sen
Cai, Bin-Bin
Li, Wen-Min
Qin, Su-Juan
Gao, Fei
author_facet Ni, Xiao-Hui
Wu, Yu-Sen
Cai, Bin-Bin
Li, Wen-Min
Qin, Su-Juan
Gao, Fei
contents Recently, Hadfield et al. proposed the quantum alternating operator ansatz algorithm (QAOA+), an extension of the quantum approximate optimization algorithm (QAOA), to solve constrained combinatorial optimization problems (CCOPs). Compared with QAOA, QAOA+ enables the search for optimal solutions within a feasible solution space by encoding problem constraints into the mixer Hamiltonian, thereby reducing the search space and eliminating the possibility of yielding infeasible solutions. However, QAOA+ may incur high overall gate costs when the mixer is applied to all qubits in each layer, and each mixer is costly to implement. To address this challenge, an adaptive mixer allocation strategy is tailored for QAOA+. The resulting algorithm, which integrates this strategy into the original QAOA+ framework, is referred to as AMA-QAOA+. Unlike QAOA+, AMA-QAOA+ adaptively applies the mixer to a subset of qubits in each layer of the mixer unitary operator based on an evaluation function. The performance of AMA-QAOA+ is evaluated on the maximum independent set problem. Numerical simulation results show that, under the same number of optimization runs, AMA-QAOA+ achieves better solution quality than QAOA+, with the optimal approximation ratio improved by $5.30\%$ on ER random graphs and $5.41\%$ on 3-regular graphs. Moreover, AMA-QAOA+ significantly reduces the CNOT gate consumption, requiring only $15.30\%$ and $25.18\%$ of the CNOT gates used by QAOA+ on ER and 3-regular random graphs, respectively. These results demonstrate that AMA-QAOA+ enhances solution quality and computational efficiency, enabling the design of more compact and resource-efficient quantum circuits.
format Preprint
id arxiv_https___arxiv_org_abs_2412_19621
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle An Adaptive Mixer Allocation Algorithm for the Quantum Alternating Operator Ansatz
Ni, Xiao-Hui
Wu, Yu-Sen
Cai, Bin-Bin
Li, Wen-Min
Qin, Su-Juan
Gao, Fei
Quantum Physics
Recently, Hadfield et al. proposed the quantum alternating operator ansatz algorithm (QAOA+), an extension of the quantum approximate optimization algorithm (QAOA), to solve constrained combinatorial optimization problems (CCOPs). Compared with QAOA, QAOA+ enables the search for optimal solutions within a feasible solution space by encoding problem constraints into the mixer Hamiltonian, thereby reducing the search space and eliminating the possibility of yielding infeasible solutions. However, QAOA+ may incur high overall gate costs when the mixer is applied to all qubits in each layer, and each mixer is costly to implement. To address this challenge, an adaptive mixer allocation strategy is tailored for QAOA+. The resulting algorithm, which integrates this strategy into the original QAOA+ framework, is referred to as AMA-QAOA+. Unlike QAOA+, AMA-QAOA+ adaptively applies the mixer to a subset of qubits in each layer of the mixer unitary operator based on an evaluation function. The performance of AMA-QAOA+ is evaluated on the maximum independent set problem. Numerical simulation results show that, under the same number of optimization runs, AMA-QAOA+ achieves better solution quality than QAOA+, with the optimal approximation ratio improved by $5.30\%$ on ER random graphs and $5.41\%$ on 3-regular graphs. Moreover, AMA-QAOA+ significantly reduces the CNOT gate consumption, requiring only $15.30\%$ and $25.18\%$ of the CNOT gates used by QAOA+ on ER and 3-regular random graphs, respectively. These results demonstrate that AMA-QAOA+ enhances solution quality and computational efficiency, enabling the design of more compact and resource-efficient quantum circuits.
title An Adaptive Mixer Allocation Algorithm for the Quantum Alternating Operator Ansatz
topic Quantum Physics
url https://arxiv.org/abs/2412.19621