Cargando…
Experimental demonstration of quantum advantage for one-way communication complexity surpassing best-known classical protocol
Demonstrating a quantum advantage with currently available experimental systems is of utmost importance in quantum information science. While this remains elusive for quantum computation, the field of communication complexity offers the possibility to already explore and showcase this advantage for...
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/PMC6742668/ https://www.ncbi.nlm.nih.gov/pubmed/31515513 http://dx.doi.org/10.1038/s41467-019-12139-z |
_version_ | 1783451142264455168 |
---|---|
author | Kumar, Niraj Kerenidis, Iordanis Diamanti, Eleni |
author_facet | Kumar, Niraj Kerenidis, Iordanis Diamanti, Eleni |
author_sort | Kumar, Niraj |
collection | PubMed |
description | Demonstrating a quantum advantage with currently available experimental systems is of utmost importance in quantum information science. While this remains elusive for quantum computation, the field of communication complexity offers the possibility to already explore and showcase this advantage for useful tasks. Here, we define such a task, the Sampling Matching problem, which is inspired by the Hidden Matching problem and features an exponential gap between quantum and classical protocols in the one-way communication model. Our problem allows by its conception a photonic implementation based on encoding in the phase of coherent states of light, the use of a fixed size linear optic circuit, and single-photon detection. This enables us to demonstrate in a proof-of-principle experiment an advantage in the transmitted information resource over the best known classical protocol, something impossible to reach for the original Hidden Matching problem. Our demonstration has implications in quantum verification and cryptographic settings. |
format | Online Article Text |
id | pubmed-6742668 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2019 |
publisher | Nature Publishing Group UK |
record_format | MEDLINE/PubMed |
spelling | pubmed-67426682019-09-16 Experimental demonstration of quantum advantage for one-way communication complexity surpassing best-known classical protocol Kumar, Niraj Kerenidis, Iordanis Diamanti, Eleni Nat Commun Article Demonstrating a quantum advantage with currently available experimental systems is of utmost importance in quantum information science. While this remains elusive for quantum computation, the field of communication complexity offers the possibility to already explore and showcase this advantage for useful tasks. Here, we define such a task, the Sampling Matching problem, which is inspired by the Hidden Matching problem and features an exponential gap between quantum and classical protocols in the one-way communication model. Our problem allows by its conception a photonic implementation based on encoding in the phase of coherent states of light, the use of a fixed size linear optic circuit, and single-photon detection. This enables us to demonstrate in a proof-of-principle experiment an advantage in the transmitted information resource over the best known classical protocol, something impossible to reach for the original Hidden Matching problem. Our demonstration has implications in quantum verification and cryptographic settings. Nature Publishing Group UK 2019-09-12 /pmc/articles/PMC6742668/ /pubmed/31515513 http://dx.doi.org/10.1038/s41467-019-12139-z 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 Kumar, Niraj Kerenidis, Iordanis Diamanti, Eleni Experimental demonstration of quantum advantage for one-way communication complexity surpassing best-known classical protocol |
title | Experimental demonstration of quantum advantage for one-way communication complexity surpassing best-known classical protocol |
title_full | Experimental demonstration of quantum advantage for one-way communication complexity surpassing best-known classical protocol |
title_fullStr | Experimental demonstration of quantum advantage for one-way communication complexity surpassing best-known classical protocol |
title_full_unstemmed | Experimental demonstration of quantum advantage for one-way communication complexity surpassing best-known classical protocol |
title_short | Experimental demonstration of quantum advantage for one-way communication complexity surpassing best-known classical protocol |
title_sort | experimental demonstration of quantum advantage for one-way communication complexity surpassing best-known classical protocol |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6742668/ https://www.ncbi.nlm.nih.gov/pubmed/31515513 http://dx.doi.org/10.1038/s41467-019-12139-z |
work_keys_str_mv | AT kumarniraj experimentaldemonstrationofquantumadvantageforonewaycommunicationcomplexitysurpassingbestknownclassicalprotocol AT kerenidisiordanis experimentaldemonstrationofquantumadvantageforonewaycommunicationcomplexitysurpassingbestknownclassicalprotocol AT diamantieleni experimentaldemonstrationofquantumadvantageforonewaycommunicationcomplexitysurpassingbestknownclassicalprotocol |