Performance of quantum approximate optimization with quantum error detection
Abstract The quantum approximate optimization algorithm (QAOA) is a promising candidate for scaling up to tackle real-world applications. However, achieving better-than-classical performance with QAOA is believed to require fault tolerance. In this paper, we demonstrate a partially fault-tolerant im...
Saved in:
| Main Authors: | Zichang He, David Amaro, Ruslan Shaydulin, Marco Pistoia |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-05-01
|
| Series: | Communications Physics |
| Online Access: | https://doi.org/10.1038/s42005-025-02136-8 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
End-to-end protocol for high-quality quantum approximate optimization algorithm parameters with few shots
by: Tianyi Hao, et al.
Published: (2025-08-01) -
Non-variational quantum random access optimization with alternating operator ansatz
by: Zichang He, et al.
Published: (2025-08-01) -
Quantifying the impact of precision errors on quantum approximate optimization algorithms
by: Gregory Quiroz, et al.
Published: (2025-06-01) -
Extracting error thresholds through the framework of approximate quantum error correction condition
by: Yuanchen Zhao, et al.
Published: (2024-12-01) -
Decomposition pipeline for large-scale portfolio optimization with applications to near-term quantum computing
by: Atithi Acharya, et al.
Published: (2025-05-01)