Higher-order quantum computing with known input states
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866918202993278976 |
|---|---|
| author | Brzić, Vanessa Yoshida, Satoshi Murao, Mio Quintino, Marco Túlio |
| author_facet | Brzić, Vanessa Yoshida, Satoshi Murao, Mio Quintino, Marco Túlio |
| contents | In higher-order quantum computing (HOQC), one typically considers the universal transformation of unknown quantum operations, treated as blackboxes. It is also implicitly assumed that the resulting operation must act on arbitrary, and thus unknown, input states. In this work, we explore a variant of this framework in which the operation remains unknown, but the input state is fixed and known. We argue that this assumption is well-motivated in certain practical contexts, such as unitary programming, and show that classical knowledge of the input state can significantly enhance performance. We demonstrate that in the SAR protocol, this knowledge leads to an exponential advantage through a repeat-until-success strategy, highlighting the operational power of known-state higher-order transformations. Moreover, this assumption allows us to distinguish between protocols designed for pure, bipartite, and mixed states, which enables us to identify the class of mixed states for which deterministic and exact implementation becomes possible. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_20530 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Higher-order quantum computing with known input states Brzić, Vanessa Yoshida, Satoshi Murao, Mio Quintino, Marco Túlio Quantum Physics In higher-order quantum computing (HOQC), one typically considers the universal transformation of unknown quantum operations, treated as blackboxes. It is also implicitly assumed that the resulting operation must act on arbitrary, and thus unknown, input states. In this work, we explore a variant of this framework in which the operation remains unknown, but the input state is fixed and known. We argue that this assumption is well-motivated in certain practical contexts, such as unitary programming, and show that classical knowledge of the input state can significantly enhance performance. We demonstrate that in the SAR protocol, this knowledge leads to an exponential advantage through a repeat-until-success strategy, highlighting the operational power of known-state higher-order transformations. Moreover, this assumption allows us to distinguish between protocols designed for pure, bipartite, and mixed states, which enables us to identify the class of mixed states for which deterministic and exact implementation becomes possible. |
| title | Higher-order quantum computing with known input states |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2510.20530 |