Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.23376 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917060331700224 |
|---|---|
| author | Sedlák, Michal Stárek, Robert Horová, Nikola Mičuda, Michal Fiurášek, Jaromir Bisio, Alessandro |
| author_facet | Sedlák, Michal Stárek, Robert Horová, Nikola Mičuda, Michal Fiurášek, Jaromir Bisio, Alessandro |
| contents | We address the fundamental task of converting $n$ uses of an unknown unitary transformation into a quantum state (i.e., storage) and later retrieval of the transformation. Specifically, we consider the case where the unknown unitary is selected with equal prior probability from two options. First, we prove that the optimal storage strategy involves the sequential application of the $n$ uses of the unknown unitary, and it produces the optimal state for discrimination between the two possible unitaries. Next, we show that incoherent "measure-and-prepare" retrieval achieves the maximum fidelity between the retrieved operation and the original (qubit) unitary. We then identify the retrieval strategy that maximizes the probability of successfully and perfectly retrieving the unknown transformation. In the regime in which the fidelity between the two possible unitaries is large the probability of success scales as $ P_{succ} = 1 - \mathcal{O}(n^{-2} ) $, which is a quadratic improvement with respect to the case in which the unitaries are drawn from the entire unitary group $U(d)$ with uniform prior probability. Finally, we present an optical experiment for this approach and assess the storage and retrieval quality using quantum tomography of states and processes. The results are discussed in relation to non-optimal measure-and-prepare strategy, highlighting the advantages of our protocol. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_23376 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Storage and retrieval of two unknown unitary channels Sedlák, Michal Stárek, Robert Horová, Nikola Mičuda, Michal Fiurášek, Jaromir Bisio, Alessandro Quantum Physics We address the fundamental task of converting $n$ uses of an unknown unitary transformation into a quantum state (i.e., storage) and later retrieval of the transformation. Specifically, we consider the case where the unknown unitary is selected with equal prior probability from two options. First, we prove that the optimal storage strategy involves the sequential application of the $n$ uses of the unknown unitary, and it produces the optimal state for discrimination between the two possible unitaries. Next, we show that incoherent "measure-and-prepare" retrieval achieves the maximum fidelity between the retrieved operation and the original (qubit) unitary. We then identify the retrieval strategy that maximizes the probability of successfully and perfectly retrieving the unknown transformation. In the regime in which the fidelity between the two possible unitaries is large the probability of success scales as $ P_{succ} = 1 - \mathcal{O}(n^{-2} ) $, which is a quadratic improvement with respect to the case in which the unitaries are drawn from the entire unitary group $U(d)$ with uniform prior probability. Finally, we present an optical experiment for this approach and assess the storage and retrieval quality using quantum tomography of states and processes. The results are discussed in relation to non-optimal measure-and-prepare strategy, highlighting the advantages of our protocol. |
| title | Storage and retrieval of two unknown unitary channels |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2410.23376 |