Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 50 min ago
PreprintarXiv licencearXiv

Encrypted Redundancy as a Diagnostic Resource: Relational Diagnosis in Quantum Encrypted Cloning

Abstract

Quantum encrypted cloning encodes an unknown state into several encrypted components, each offering an alternative way to recover it later. We show that this redundancy can also serve for one-shot fault diagnosis: instead of inspecting the encrypted state, we measure relational Pauli observables testing consistency conditions imposed by the encoding. The canonical Yamaguchi--Kempf scheme encodes the input into n signal--key pairs, all carrying the same coherent Bell label, plus a transformed copy of the input qubit. Comparing the labels of two pairs yields a deterministic check that localizes an anomalous pair and identifies its Pauli-error class without revealing the label. Such checks cannot tell whether the signal or the key of that pair is faulty, and no measurement on the pairs can (we prove that they already generate the whole group of deterministic state-blind observables supported there, of rank 2(n−1)). This ambiguity matters: a faulty signal costs one redemption path, a faulty key threatens them all. However, retaining also the transformed input qubit contributes exactly two further independent checks, at any multiplicity, and these suffice to identify any single fault drawn from the single-qubit Pauli set. For three clones this gives six checks in all, and we prove that no smaller set of state-blind observables achieves the same resolution. Across clone multiplicities, parity governs how many components must be measured jointly to reach this resolution, not the resolution itself. These findings are then abstracted into a general framework --- state-blind observables, deterministic healthy references, syndrome-induced fault partitions, redemption-oriented sufficiency --- yielding \textit{relational diagnosability}: a syndrome need not identify every fault, only enough of it to select a safe redemption path.

Related

  1. Encrypted cloning of qubits is able to serve as a quantum primitive, already on non-error-corrected quantum hardware
    Koji Yamaguchi, Leon Rullkötter, Ibrahim Shehzad +3
    Physical Review ResearchPeer-reviewedPublisher termsAtomic, molecular & optical physicsCrossref
  2. Noise Propagation and Effective Channels in Encrypted Quantum Cloning
    Yun-Fei Li, Fei-Hao Yang, Qing Chen +1
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  3. Four-Channel Amplitude-Phase-Janus-Encrypted Acoustic Meta-Hologram
    Haohan Zeng, Zhenyu He, Tianxiang Zhang +12
    Advanced Functional MaterialsPeer-reviewedCC BY 4.0Full text2 citedGeneral physicsHAL
  4. Beyond Maximal Entanglement: Exact Resources for Multiparty Encrypted Quantum Cloning
    Pritam Roy, Shashank Gupta
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  5. Impact of population heterogeneity on the redundancy principle
    Sergei Fedotov, Daniel Fears, Daniel Han
    Physical Review ResearchPeer-reviewedCC BY 4.0Condensed matterCrossref
BibTeX
@misc{gianini2026encrypted,
  title = {{Encrypted Redundancy as a Diagnostic Resource: Relational Diagnosis in Quantum Encrypted Cloning}},
  author = {Gabriele Gianini and Omar Hasan and Stelvio Cimato and Ernesto Damiani},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.25043},
  eprint = {2609.25043},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.25043},
}
RIS
TY  - UNPB
TI  - Encrypted Redundancy as a Diagnostic Resource: Relational Diagnosis in Quantum Encrypted Cloning
AU  - Gabriele Gianini
AU  - Omar Hasan
AU  - Stelvio Cimato
AU  - Ernesto Damiani
PY  - 2026
DA  - 2026/09/01
PB  - arXiv
DO  - 10.48550/arxiv.2609.25043
UR  - https://arxiv.org/abs/2609.25043
AB  - Quantum encrypted cloning encodes an unknown state into several encrypted components, each offering an alternative way to recover it later. We show that this redundancy can also serve for one-shot fault diagnosis: instead of inspecting the encrypted state, we measure relational Pauli observables testing consistency conditions imposed by the encoding. The canonical Yamaguchi--Kempf scheme encodes the input into n signal--key pairs, all carrying the same coherent Bell label, plus a transformed copy of the input qubit. Comparing the labels of two pairs yields a deterministic check that localizes an anomalous pair and identifies its Pauli-error class without revealing the label. Such checks cannot tell whether the signal or the key of that pair is faulty, and no measurement on the pairs can (we prove that they already generate the whole group of deterministic state-blind observables supported there, of rank 2(n−1)). This ambiguity matters: a faulty signal costs one redemption path, a faulty key threatens them all. However, retaining also the transformed input qubit contributes exactly two further independent checks, at any multiplicity, and these suffice to identify any single fault drawn from the single-qubit Pauli set. For three clones this gives six checks in all, and we prove that no smaller set of state-blind observables achieves the same resolution. Across clone multiplicities, parity governs how many components must be measured jointly to reach this resolution, not the resolution itself. These findings are then abstracted into a general framework --- state-blind observables, deterministic healthy references, syndrome-induced fault partitions, redemption-oriented sufficiency --- yielding \textit{relational diagnosability}: a syndrome need not identify every fault, only enough of it to select a safe redemption path.
ER  -