Simulating the quantum switch with quantum circuits is computationally hard
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914180663083008 |
|---|---|
| author | Bavaresco, Jessica Kristjánsson, Hlér Murao, Mio Odake, Tatsuki Quintino, Marco Túlio Taranto, Philip Yoshida, Satoshi |
| author_facet | Bavaresco, Jessica Kristjánsson, Hlér Murao, Mio Odake, Tatsuki Quintino, Marco Túlio Taranto, Philip Yoshida, Satoshi |
| contents | Higher-order transformations acting on input quantum channels in an indefinite causal order, such as the quantum switch, cannot be described by quantum circuits using the same number of calls to the input channels. A natural question is whether they can be simulated, i.e., whether their action can be exactly and deterministically reproduced by a quantum circuit with more calls to the input channels. Here, we prove that the quantum switch acting on two $n$-qubit channels cannot be simulated by any quantum circuit using $k$ calls to one channel and one to the other, if $k<2^n$. This establishes an exponential separation in quantum query complexity between processes with indefinite causal order and quantum circuits. Moreover, even with one extra call to both input channels, such a simulation remains impossible. We further demonstrate the robustness of this separation by extending the result to probabilistic and approximate simulations scenarios. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_18202 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Simulating the quantum switch with quantum circuits is computationally hard Bavaresco, Jessica Kristjánsson, Hlér Murao, Mio Odake, Tatsuki Quintino, Marco Túlio Taranto, Philip Yoshida, Satoshi Quantum Physics Higher-order transformations acting on input quantum channels in an indefinite causal order, such as the quantum switch, cannot be described by quantum circuits using the same number of calls to the input channels. A natural question is whether they can be simulated, i.e., whether their action can be exactly and deterministically reproduced by a quantum circuit with more calls to the input channels. Here, we prove that the quantum switch acting on two $n$-qubit channels cannot be simulated by any quantum circuit using $k$ calls to one channel and one to the other, if $k<2^n$. This establishes an exponential separation in quantum query complexity between processes with indefinite causal order and quantum circuits. Moreover, even with one extra call to both input channels, such a simulation remains impossible. We further demonstrate the robustness of this separation by extending the result to probabilistic and approximate simulations scenarios. |
| title | Simulating the quantum switch with quantum circuits is computationally hard |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2409.18202 |