.png){kind=icon}
.png){kind=icon}
Return
Improved Success Probability with Greater Circuit Depth for the Quantum Approximate Optimization Algorithm
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevApplied.14.034010.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Present-day, noisy, small or intermediate-scale quantum processors-although far from fault tolerant-support the execution of heuristic quantum algorithms, which might enable a quantum advantage, for example, when applied to combinatorial optimization problems. On small-scale quantum processors, validations of such algorithms serve as important technology demonstrators. We implement the quantum approximate optimization algorithm on our hardware platform, consisting of two superconducting transmon qubits and one parametrically modulated coupler. We solve small instances of the NP (nondeterministic polynomial time)-complete exact-cover problem, with 96.6% success probability, by iterating the algorithm up to level two.
Keywords:
SUPREMACY
QUBITS
GATE
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
7.1K
Citations:
2.8W