.png){kind=icon}
Return
Training the quantum approximate optimization algorithm without access to a quantum processing unit
.png){kind=icon}
PRE
AI
DOI：10.1088/2058-9565/ab8c2b.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we eliminate the classical outer learning loop of the quantum approximate optimization algorithm (QAOA) and present a strategy to find good parameters for QAOA based on topological arguments of the problem graph and tensor network techniques. Starting from the observation of the concentration of control parameters of QAOA, we find a way to classically infer parameters which scales polynomially in the number of qubits and exponentially with the depth of the circuit. Using this strategy, the quantum processing unit (QPU) is only needed to sample from the final state of QAOA. This method paves the way for a variation-free version of QAOA and makes QAOA more practical for applications on NISQ devices. We investigate the performance of the proposed approach for the initial assumptions and its resilience with respect to situations where they are not fulfilled. Moreover, we investigate the applicability of our method beyond the scope of QAOA, in improving schedules for quantum annealing.
Keywords:
quantum algorithms
quantum computing
QAOA
tensor networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5
Papers:
1.4K
Citations:
5.1K
Organization
Cited Papers
ShareSave
ShareSaveShareSaveShareSaveBromination of molybdenum carbonyls revisited: oxo complexes and routes to new materials chemistry
PREAI
ShareSaveThe effect of fire-induced surface heterogeneity on rainfall-runoff-erosion relationships in an eastern Mediterranean ecosystem, Israel.png)
CATENA
CATENAIF0
PREAI
ShareSaveEffect of stress on the behavior and 5-HT system in Sprague-Dawley and Wistar Kyoto rat strains
PREAI
ShareSaveShareSave
View more