analiza aiqbench
This research demonstrates how redundancy in quantum encrypted cloning schemes can be leveraged for one-shot fault diagnosis without revealing sensitive state information. By utilizing relational Pauli observables and a transformed input qubit, the study establishes a framework for identifying specific error classes to ensure safe state redemption paths. These findings advance the reliability of quantum encryption protocols by proving that deterministic checks can localize faults while preserving data privacy.
Encrypted Redundancy as a Diagnostic Resource: Relational Diagnosis in Quantum Encrypted Cloning
arXiv:2609.25043v1 Announce Type: new 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.
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.
33 pages, 2 figures, 3 tables. Companion to arXiv:2604.10155 and arXiv:2605.27421, whose reduced-state characterizations are used here; those preprints have been revised (v2) to correct a sign in a worked example, and the corrected sign is the one adopted throughout this paper
Quantum Physics (quant-ph); Cryptography and Security (cs.CR); Distributed, Parallel, and Cluster Computing (cs.DC)
arXiv:2609.25043 [quant-ph]
(or arXiv:2609.25043v1 [quant-ph] for this version)
Text integral sub licența deschisă a publicației · 333 cuvinte
Subiecte conexe
IonQ Superion 256 to Power NVIDIA Quantum Research Center
Explore Quantum · 23 sept. 2026
News
Quantum Computing Report · 7 iun. 2026
Transformer fault diagnosis using an efficient simulation-driven variational quantum classifier with domain-aware feature encoding
arXiv · 18 sept. 2026
News
Quantum Computing Report · 25 iul. 2026