共 50 条
- [3] Lower bounds on circuit depth of the quantum approximate optimization algorithm [J]. Quantum Information Processing, 2021, 20
- [5] An Efficient Circuit Compilation Flow for Quantum Approximate Optimization Algorithm [J]. PROCEEDINGS OF THE 2020 57TH ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2020,
- [6] Improved Success Probability with Greater Circuit Depth for the Quantum Approximate Optimization Algorithm [J]. PHYSICAL REVIEW APPLIED, 2020, 14 (03):