Quantum states cannot be transmitted efficiently classically
We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to constant accuracy, must transmit at least $\Omega(2^n)$ bits....
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2019-06-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2019-06-28-154/pdf/ |
id |
doaj-3cc58a66ffb24a739d1da309fc06b3b6 |
---|---|
record_format |
Article |
spelling |
doaj-3cc58a66ffb24a739d1da309fc06b3b62020-11-25T00:16:15ZengVerein zur Förderung des Open Access Publizierens in den QuantenwissenschaftenQuantum2521-327X2019-06-01315410.22331/q-2019-06-28-15410.22331/q-2019-06-28-154Quantum states cannot be transmitted efficiently classicallyAshley MontanaroWe show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to constant accuracy, must transmit at least $\Omega(2^n)$ bits. This lower bound is optimal and matches the complexity of a simple protocol based on discretisation using an $\epsilon$-net. The proof is based on a lower bound on the classical communication complexity of a distributed variant of the Fourier sampling problem. We obtain two optimal quantum-classical separations as easy corollaries. First, a sampling problem which can be solved with one quantum query to the input, but which requires $\Omega(N)$ classical queries for an input of size $N$. Second, a nonlocal task which can be solved using $n$ Bell pairs, but for which any approximate classical solution must communicate $\Omega(2^n)$ bits.https://quantum-journal.org/papers/q-2019-06-28-154/pdf/ |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Ashley Montanaro |
spellingShingle |
Ashley Montanaro Quantum states cannot be transmitted efficiently classically Quantum |
author_facet |
Ashley Montanaro |
author_sort |
Ashley Montanaro |
title |
Quantum states cannot be transmitted efficiently classically |
title_short |
Quantum states cannot be transmitted efficiently classically |
title_full |
Quantum states cannot be transmitted efficiently classically |
title_fullStr |
Quantum states cannot be transmitted efficiently classically |
title_full_unstemmed |
Quantum states cannot be transmitted efficiently classically |
title_sort |
quantum states cannot be transmitted efficiently classically |
publisher |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften |
series |
Quantum |
issn |
2521-327X |
publishDate |
2019-06-01 |
description |
We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to constant accuracy, must transmit at least $\Omega(2^n)$ bits. This lower bound is optimal and matches the complexity of a simple protocol based on discretisation using an $\epsilon$-net. The proof is based on a lower bound on the classical communication complexity of a distributed variant of the Fourier sampling problem. We obtain two optimal quantum-classical separations as easy corollaries. First, a sampling problem which can be solved with one quantum query to the input, but which requires $\Omega(N)$ classical queries for an input of size $N$. Second, a nonlocal task which can be solved using $n$ Bell pairs, but for which any approximate classical solution must communicate $\Omega(2^n)$ bits. |
url |
https://quantum-journal.org/papers/q-2019-06-28-154/pdf/ |
work_keys_str_mv |
AT ashleymontanaro quantumstatescannotbetransmittedefficientlyclassically |
_version_ |
1725383736246140928 |