Cargando…
QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
Computational quantum technologies are entering a new phase in which noisy intermediate-scale quantum computers are available, but are still too small to benefit from active error correction. Even with a finite coherence budget to invest in quantum information processing, noisy devices with about 50...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6502860/ https://www.ncbi.nlm.nih.gov/pubmed/31061384 http://dx.doi.org/10.1038/s41598-019-43176-9 |
_version_ | 1783416304672178176 |
---|---|
author | Guerreschi, G. G. Matsuura, A. Y. |
author_facet | Guerreschi, G. G. Matsuura, A. Y. |
author_sort | Guerreschi, G. G. |
collection | PubMed |
description | Computational quantum technologies are entering a new phase in which noisy intermediate-scale quantum computers are available, but are still too small to benefit from active error correction. Even with a finite coherence budget to invest in quantum information processing, noisy devices with about 50 qubits are expected to experimentally demonstrate quantum supremacy in the next few years. Defined in terms of artificial tasks, current proposals for quantum supremacy, even if successful, will not help to provide solutions to practical problems. Instead, we believe that future users of quantum computers are interested in actual applications and that noisy quantum devices may still provide value by approximately solving hard combinatorial problems via hybrid classical-quantum algorithms. To lower bound the size of quantum computers with practical utility, we perform realistic simulations of the Quantum Approximate Optimization Algorithm and conclude that quantum speedup will not be attainable, at least for a representative combinatorial problem, until several hundreds of qubits are available. |
format | Online Article Text |
id | pubmed-6502860 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2019 |
publisher | Nature Publishing Group UK |
record_format | MEDLINE/PubMed |
spelling | pubmed-65028602019-05-20 QAOA for Max-Cut requires hundreds of qubits for quantum speed-up Guerreschi, G. G. Matsuura, A. Y. Sci Rep Article Computational quantum technologies are entering a new phase in which noisy intermediate-scale quantum computers are available, but are still too small to benefit from active error correction. Even with a finite coherence budget to invest in quantum information processing, noisy devices with about 50 qubits are expected to experimentally demonstrate quantum supremacy in the next few years. Defined in terms of artificial tasks, current proposals for quantum supremacy, even if successful, will not help to provide solutions to practical problems. Instead, we believe that future users of quantum computers are interested in actual applications and that noisy quantum devices may still provide value by approximately solving hard combinatorial problems via hybrid classical-quantum algorithms. To lower bound the size of quantum computers with practical utility, we perform realistic simulations of the Quantum Approximate Optimization Algorithm and conclude that quantum speedup will not be attainable, at least for a representative combinatorial problem, until several hundreds of qubits are available. Nature Publishing Group UK 2019-05-06 /pmc/articles/PMC6502860/ /pubmed/31061384 http://dx.doi.org/10.1038/s41598-019-43176-9 Text en © The Author(s) 2019 Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/. |
spellingShingle | Article Guerreschi, G. G. Matsuura, A. Y. QAOA for Max-Cut requires hundreds of qubits for quantum speed-up |
title | QAOA for Max-Cut requires hundreds of qubits for quantum speed-up |
title_full | QAOA for Max-Cut requires hundreds of qubits for quantum speed-up |
title_fullStr | QAOA for Max-Cut requires hundreds of qubits for quantum speed-up |
title_full_unstemmed | QAOA for Max-Cut requires hundreds of qubits for quantum speed-up |
title_short | QAOA for Max-Cut requires hundreds of qubits for quantum speed-up |
title_sort | qaoa for max-cut requires hundreds of qubits for quantum speed-up |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6502860/ https://www.ncbi.nlm.nih.gov/pubmed/31061384 http://dx.doi.org/10.1038/s41598-019-43176-9 |
work_keys_str_mv | AT guerreschigg qaoaformaxcutrequireshundredsofqubitsforquantumspeedup AT matsuuraay qaoaformaxcutrequireshundredsofqubitsforquantumspeedup |