Efficient depth selection for the implementation of noisy quantum approximate optimization algorithm

DOI10.1016/J.JFRANKLIN.2022.10.027OpenAlexW4307956198MaRDI QIDQ2109217FDOQ2109217

Authors: Yu Pan, Yifan Tong, Shibei Xue, Guo-Feng Zhang 

Publication date: 20 December 2022

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.04263

Recommendations

• Lower bounds on circuit depth of the quantum approximate optimization algorithm
• Empirical performance bounds for quantum approximate optimization
• A study of the performance of classical minimizers in the quantum approximate optimization algorithm
• Benchmarking the performance of portfolio optimization with QAOA
• Benchmarking the quantum approximate optimization algorithm

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An introduction to statistical learning. With applications in R
• Model Selection and Multimodel Inference
• The theory of open quantum systems.
• Statistical learning theory: models, concepts, and results
• Empirical performance bounds for quantum approximate optimization
• Lower bounds on circuit depth of the quantum approximate optimization algorithm

Cited In (2)

• On the need for large Quantum depth
• Efficient quantum feature extraction for CNN-based learning

This page was built for publication: Efficient depth selection for the implementation of noisy quantum approximate optimization algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109217)