Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929522672140288 |
|---|---|
| author | Kristjánsson, Hlér Odake, Tatsuki Yoshida, Satoshi Taranto, Philip Bavaresco, Jessica Quintino, Marco Túlio Murao, Mio |
| author_facet | Kristjánsson, Hlér Odake, Tatsuki Yoshida, Satoshi Taranto, Philip Bavaresco, Jessica Quintino, Marco Túlio Murao, Mio |
| contents | Quantum theory is consistent with a computational model permitting black-box operations to be applied in an indefinite causal order, going beyond the standard circuit model of computation. The quantum switch -- the simplest such example -- has been shown to provide numerous information-processing advantages. Here, we prove that the action of the quantum switch on two $n$-qubit quantum channels cannot be simulated deterministically and exactly by any causally ordered quantum circuit that uses $M$ calls to one channel and one call to the other, if $M \leq \max(2, 2^n-1)$. This demonstrates an exponential separation in quantum query complexity of indefinite causal order compared to standard quantum circuits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_18420 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits Kristjánsson, Hlér Odake, Tatsuki Yoshida, Satoshi Taranto, Philip Bavaresco, Jessica Quintino, Marco Túlio Murao, Mio Quantum Physics Quantum theory is consistent with a computational model permitting black-box operations to be applied in an indefinite causal order, going beyond the standard circuit model of computation. The quantum switch -- the simplest such example -- has been shown to provide numerous information-processing advantages. Here, we prove that the action of the quantum switch on two $n$-qubit quantum channels cannot be simulated deterministically and exactly by any causally ordered quantum circuit that uses $M$ calls to one channel and one call to the other, if $M \leq \max(2, 2^n-1)$. This demonstrates an exponential separation in quantum query complexity of indefinite causal order compared to standard quantum circuits. |
| title | Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2409.18420 |