Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2303.11465 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914863437053952 |
|---|---|
| author | Goodenough, Kenneth de Bone, Sébastian Addala, Vaishnavi L. Krastanov, Stefan Jansen, Sarah Gijswijt, Dion Elkouss, David |
| author_facet | Goodenough, Kenneth de Bone, Sébastian Addala, Vaishnavi L. Krastanov, Stefan Jansen, Sarah Gijswijt, Dion Elkouss, David |
| contents | Noisy hardware forms one of the main hurdles to the realization of a near-term quantum internet. Distillation protocols allows one to overcome this noise at the cost of an increased overhead. We consider here an experimentally relevant class of distillation protocols, which distill $n$ to $k$ end-to-end entangled pairs using bilocal Clifford operations, a single round of communication and a possible final local operation depending on the observed measurement outcomes. In the case of permutationally invariant depolarizing noise on the input states, we find a correspondence between these distillation protocols and graph codes. We leverage this correspondence to find provably optimal distillation protocols in this class for several tasks important for the quantum internet. This correspondence allows us to investigate use cases for so-called non-trivial measurement syndromes. Furthermore, we detail a recipe to construct the circuit used for the distillation protocol given a graph code. We use this to find circuits of short depth and small number of two-qubit gates. Additionally, we develop a black-box circuit optimization algorithm, and find that both approaches yield comparable circuits. Finally, we investigate the teleportation of encoded states and find protocols which jointly improve the rate and fidelities with respect to prior art. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2303_11465 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Near-term $n$ to $k$ distillation protocols using graph codes Goodenough, Kenneth de Bone, Sébastian Addala, Vaishnavi L. Krastanov, Stefan Jansen, Sarah Gijswijt, Dion Elkouss, David Quantum Physics Noisy hardware forms one of the main hurdles to the realization of a near-term quantum internet. Distillation protocols allows one to overcome this noise at the cost of an increased overhead. We consider here an experimentally relevant class of distillation protocols, which distill $n$ to $k$ end-to-end entangled pairs using bilocal Clifford operations, a single round of communication and a possible final local operation depending on the observed measurement outcomes. In the case of permutationally invariant depolarizing noise on the input states, we find a correspondence between these distillation protocols and graph codes. We leverage this correspondence to find provably optimal distillation protocols in this class for several tasks important for the quantum internet. This correspondence allows us to investigate use cases for so-called non-trivial measurement syndromes. Furthermore, we detail a recipe to construct the circuit used for the distillation protocol given a graph code. We use this to find circuits of short depth and small number of two-qubit gates. Additionally, we develop a black-box circuit optimization algorithm, and find that both approaches yield comparable circuits. Finally, we investigate the teleportation of encoded states and find protocols which jointly improve the rate and fidelities with respect to prior art. |
| title | Near-term $n$ to $k$ distillation protocols using graph codes |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2303.11465 |