Metraipolis › archive › dc_fbb6e5f16c87

Secret-shared teleportation of a two-qudit gate with a deferred recipient — arXiv:2610.42150

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.42150
License (as archived)
CC0-1.0
Archived
2026-11-03T05:54:09.109Z
SHA-256 of the archived text
311580fef5918790b7c1ff88d3530db2956715fef887d4ebe225a4c082bbea06
Stable URL of this page
https://metraipolis.com/documento/dc_fbb6e5f16c87

How to cite

Secret-shared teleportation of a two-qudit gate with a deferred recipient — arXiv:2610.42150 — arXiv (en), https://arxiv.org/abs/2610.42150 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fbb6e5f16c87 (Metraipolis archive dc_fbb6e5f16c87, sha256 311580fef5918790b7c1ff88d3530db2956715fef887d4ebe225a4c082bbea06)
BibTeX
@misc{dcfbb6e5f16c87,
  title = {Secret-shared teleportation of a two-qudit gate with a deferred recipient — arXiv:2610.42150},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.42150},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fbb6e5f16c87; sha256 311580fef5918790b7c1ff88d3530db2956715fef887d4ebe225a4c082bbea06},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.42150. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

An unknown quantum operation, like an unknown quantum state, cannot be perfectly copied or stored for later use. A specific gate can be embedded in an entangled resource and teleported, but its destination is fixed when the resource is created. Here we show that the capability to apply a two-qudit entangling gate can instead be secret-shared among many parties: the shares are distributed in advance, and a later key release lets exactly one of them, chosen after distribution, exercise it. A provider encrypts half of a Bell pair held with a user into $n$ shares, one per candidate node. The selected node, given the key qudits, completes an exact non-local $\mathtt{CSUM}^{k}$ gate with the user's data, in every measurement branch and for any qudit dimension, with the power $k$ chosen by the user alone. Any coalition of fewer than $n$ candidate nodes, or the key register alone, holds no information, unselected nodes cannot tell whether a selection occurred, and the key cannot decrypt twice. For two candidates the registers form a $((3,5))$ threshold scheme. Encoder and decoder are explicit $O(n)$ circuits. The construction supports jointly authorized and anonymous gate application, advancing distributed quantum computing and quantum network capabilities.

Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.42150 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T05:36:32.313Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).