Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.38240

Noise Propagation and Effective Channels in Encrypted Quantum Cloning

Yun-Fei Li, Fei-Hao Yang, Qing Chen, Liu-Jun Wang

quant-phSubmitted Oct 28, 2026• Announced Oct 29, 2026• 0 citations
arXivHTMLPDF

Abstract

We investigate noise propagation in encrypted quantum cloning by formulating the protocol in terms of effective recovery channels. For local single-qubit completely positive trace-preserving noise, a Pauli-basis expansion of the Kraus operators reveals a strong dependence on the location of the physical channel. Noise on an auxiliary signal qubit leaves the reduced recovered state unchanged, whereas noise on an auxiliary key qubit induces a Pauli-diagonal effective channel on the recovered qubit. For the core qubits, the error propagation additionally depends on the parity of the number of entangled pairs. In particular, for noise on the core key qubit with odd parity, distinct physical Pauli sectors merge into the same effective sector, converting isotropic depolarizing noise into an anisotropic recovery channel. We also relate Werner-type resource imperfections to local depolarizing noise and distinguish distributed product depolarization from genuine global depolarization. The results demonstrate that the effective recovery noise is governed not only by noise strength, but also by its physical location and by the structure of the encryption-decryption protocol.

AI Summary

The paper asks how noise between encryption and decryption in encrypted quantum cloning becomes an effective channel on the recovered qubit. It analyzes ideal encryption and decryption with initially perfect Bell resources, then connects local depolarization of key qubits to Werner-type resource imperfections. The method expands physical Kraus operators in the Pauli basis, conjugates them through decryption, and traces out the unrecovered subsystems. For local single-qubit CPTP noise, the resulting channel depends only on diagonal Pauli-process weights $q_a$. Noise on an auxiliary signal qubit has no effect on the recovered state, while auxiliary-key noise induces a Pauli channel with weights equal to the physical channel’s Choi-state Bell populations. Core-signal noise permutes Pauli sectors depending on the parity of the number $n$ of Bell pairs. Core-key noise also permutes sectors for even $n$, but for odd $n$ merges them, giving $(q_0+q_2)\rho+(q_1+q_3)Y\rho Y$. Consequently, core-key depolarization with parameter $p$ becomes a $Y$-error channel for odd $n$, preserving $Y$ eigenstates and giving average recovery fidelity $(2+p)/3$. A specified distributed depolarization model yields effective parameter $\prod_jp_j$, versus $P$ for global depolarization; matching these parameters does not equate the physical channels. The analysis assumes noiseless encryption and decryption. General correlated noise is formulated but not systematically classified: coherences between multiqubit Pauli strings can survive recovery, requiring the full process matrix. Operational imperfections, noise with memory, and channel-distance characterizations are left for further study.

Some signs of AI-generated textIncremental

Error found: For the allowed case n=1, coherent Y-rotation noise on the core signal qubit survives recovery coherently, contradicting both the blanket elimination of local Pauli cross terms and the core-signal effective-channel formula in Eq. (S1_odd).

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
13 pages, 2 figures; supplemental material included as an ancillary file

Related papers

Beyond Maximal Entanglement: Exact Resources for Multiparty Encrypted Quantum Cloning

Pritam Roy, Shashank Gupta

Encrypted quantum cloning distributes an unknown $k$-qubit state among $m$ encrypted clones so that no individual clone reveals the input, yet the state can be recovered from any one clone together with a common quantum key. We ask the inverse question: for a fixed encoding architecture, which multipartite pure states can serve as exact resources for this task? For $m\ge2$, we completely characterize the pure resources compatible with a sector-wise two-Pauli encoder, with necessity holding for arbitrary completely positive trace-preserving (CPTP) recovery maps. For even $m$, exact recovery requires maximal entanglement across the signal--noise cut. For odd $m$, less entanglement can suffice, provided that the surviving signal correlations have the structure selected by the encoder. We further show, without fixing the encoder, that exact recovery from every authorized subsystem already implies perfect concealment of each individual signal and requires at least $(m-1)k$ ebits of signal--noise entanglement. For graph states, the resource classification reduces to an exact condition on the kernel of the signal--noise cut matrix, leading to binary certification and constructive Clifford recovery. We identify rank-deficient graph resources that attain the architecture-independent entanglement bound and prove that the entire Dicke family, including $W$ states, is excluded for every sector-wise two-Pauli encoder. Our results show that encrypted recovery depends not only on how much entanglement a resource contains, but also on how its correlations are organized relative to the encoder.

quant-pharXiv:2609.28241•Sep 24, 2026•0 citations

Entanglement Fidelity in Standard Quantum Channels

Niccolò Zanieri, Marios Kountouris

Entanglement fidelity quantifies how well a quantum channel preserves the correlations between a transmitted system and an inaccessible reference system. We derive closed-form expressions for the entanglement fidelity associated with several standard quantum noise models, including the random Pauli-X, dephasing, depolarizing, Werner-Holevo, generalized Pauli (Weyl), and amplitude-damping channels. For each model, we express the entanglement fidelity in terms of a general input density operator $ρ$, using Schumacher's Kraus-operator approach, which provides a channel-agnostic recipe applicable to any completely positive trace-preserving (CPTP) map with a finite Kraus representation. We then specialize to a communication scenario in which the source emits a two-letter parametric alphabet, thereby making explicit the dependence of entanglement preservation on both channel and source parameters. The resulting expressions enable direct comparisons of channel performance and rankings for representative families of input states, including common qubit states.

quant-pharXiv:2603.07761•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 10, 2026•0 citations

Beyond Maximal Entanglement: Exact Resources for Multiparty Encrypted Quantum Cloning — E8 Intelligence Research

Andrew Stewart Caldin

Encrypted quantum cloning distributes an unknown $k$-qubit state among $m$ encrypted clones so that no individual clone reveals the input, yet the state can be recovered from any one clone together with a common quantum key. We ask the inverse question: for a fixed encoding architecture, which multipartite pure states can serve as exact resources for this task? For $m\ge2$, we completely characterize the pure resources compatible with a sector-wise two-Pauli encoder, with necessity holding for arbitrary completely positive trace-preserving (CPTP) recovery maps. For even $m$, exact recovery requires maximal entanglement across the signal--noise cut. For odd $m$, less entanglement can suffice, provided that the surviving signal correlations have the structure selected by the encoder. We further show, without fixing the encoder, that exact recovery from every authorized subsystem already implies perfect concealment of each individual signal and requires at least $(m-1)k$ ebits of signal-- Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 11, 2026•0 citations

Full characterization of informative subsets in Quantum Encrypted Cloning

Gabriele Gianini, Stelvio Cimato, Jianyi Lin +2 more

Quantum encrypted cloning, introduced by Yamaguchi and Kempf, is a Pauli-based protocol that distributes an unknown input qubit into multiple encrypted signal-noise pairs in such a way that redundancy is created without violating the no-cloning theorem, since at most one clone can later be perfectly recovered through an appropriate decoding procedure. In previous work we showed that unauthorized subsets of the storage register are not, in general, completely uninformative, and we identified a parity-dependent leakage pattern. In the present work we extend the analysis to subsets that also include the transformed source qubit A. Exploiting the purity of the global encoded state and the complementarity between storage-only subsets and subsets containing A, we derive a full classification of the informativeness of all sets of the form $H=\{A\}\cup C$. We show that these subsets are fully informative in the generic case. Two exceptions arise. First, if all pairs are incomplete and |C|<n, then the reduced state is completely uninformative. Second, if |C|=n, n is odd, and the number q of signal qubits in C is even, then the reduced state is partially informative. In this latter case, the residual dependence on the input state is confined to the y-component of the Bloch vector. These results provide a complete parity-based characterization of leakage for subsets containing the transformed input qubit.

quant-pharXiv:2605.27421•May 20, 2026•6 citations

The Effects of Quantum Error Correction on Noisy Systems

Stefanie J. Beale

Full accuracy simulations of quantum systems are very costly, and as a result most studies \nof quantum error correction assume a probabilistic Pauli error model, largely because such \nerrors can be e ciently simulated. Therefore, the behaviour of more general noise in a \nquantum error correcting code is poorly characterized. In this thesis, we present results which \ndemonstrate the scaling of the logical noise with respect to the physical delity, and argue \nthat the e ective logical noise approaches a Pauli channel as the code distance increases, \neven when no recovery operations are applied. As a result, we argue that the average logical \n delity can be used to accurately quantify the e ective logical noise, and to select recovery \noperations appropriate to the system. We further demonstrate that when physical noise \nacts on fewer than d qubits in an [[n; k; d]] code, the resultant noise is Pauli, and develop \na method for approximating the dominant contributions to the e ective logical noise up to \na speci ed precision in terms of the physical in delity. We derive conditions under which \nsets of recovery operations will produce equivalent logical noise channels, with examples of \nequivalencies in the 3 qubit repetition code, the 5 qubit code, the Steane code, and the Shor \ncode. We also provide a general expression for the e ective logical noise when the physical \nqubits undergo depolarizing or Pauli noise in a quantum error correcting code, examine the \nbehaviour of depolarizing noise under concatenation of the 5 qubit and Steane codes, and \npresent an algorithm for soft decoding which is not subject to statistical sampling, with an \nemphasis on the e ective behaviour of a concatenated 5 qubit code undergoing depolarizing \nnoise after applying a specialized version our soft decoding algorithm.

•Aug 23, 2018•0 citations

Characterizing Local and Correlated Pauli Noise in Quantum Teleportation Circuits

L. Anjos, Jose Alfredo de Leon, R. S. Sarthour +1 more

We analytically characterize how the location and the local or correlated structure of stochastic Pauli errors affect a three-qubit coherent quantum-teleportation circuit. Independent local channels and a fully correlated two-qubit channel are inserted separately in six configurations. Propagating each Pauli-error realization through the Clifford circuit yields the effective channel on Bob's qubit and analytical expressions for the average and state-resolved fidelities. Under a common ordered-pair probability convention, the six configurations form three pairs that induce equivalent reduced channels on Bob. Within each pair, corresponding Pauli-error realizations have the same probabilities and produce the same effective Pauli operator on Bob's output state. The equivalence therefore holds for every input state within the stochastic Pauli models considered here, rather than only for the average fidelity. Correlated Z errors do not affect the output for the first pair; local X and Z errors exhibit complementary qubit sensitivity for the second; and correlated same-axis Pauli errors cancel for the third. These results classify the error response of the selected circuit configurations and show that it depends jointly on the error statistics, Pauli axis, and position within the protocol.

quant-pharXiv:2610.24840•Oct 20, 2026•0 citations
We investigate noise propagation in encrypted quantum cloning by formulating the protocol in terms of effective recovery channels. For local single-qubit completely positive trace-preserving noise, a Pauli-basis expansion of the Kraus operators reveals a strong dependence on the location of the physical channel. Noise on an auxiliary signal qubit leaves the reduced recovered state unchanged, whereas noise on an auxiliary key qubit induces a Pauli-diagonal effective channel on the recovered qubit. For the core qubits, the error propagation additionally depends on the parity of the number of entangled pairs. In particular, for noise on the core key qubit with odd parity, distinct physical Pauli sectors merge into the same effective sector, converting isotropic depolarizing noise into an anisotropic recovery channel. We also relate Werner-type resource imperfections to local depolarizing noise and distinguish distributed product depolarization from genuine global depolarization. The results demonstrate that the effective recovery noise is governed not only by noise strength, but also by its physical location and by the structure of the encryption-decryption protocol.
The paper asks how noise between encryption and decryption in encrypted quantum cloning becomes an effective channel on the recovered qubit. It analyzes ideal encryption and decryption with initially perfect Bell resources, then connects local depolarization of key qubits to Werner-type resource imperfections.
The method expands physical Kraus operators in the Pauli basis, conjugates them through decryption, and traces out the unrecovered subsystems. For local single-qubit CPTP noise, the resulting channel depends only on diagonal Pauli-process weights qaq_aqa​. Noise on an auxiliary signal qubit has no effect on the recovered state, while auxiliary-key noise induces a Pauli channel with weights equal to the physical channel’s Choi-state Bell populations. Core-signal noise permutes Pauli sectors depending on the parity of the number nnn of Bell pairs. Core-key noise also permutes sectors for even nnn, but for odd nnn merges them, giving (q0+q2)ρ+(q1+q3)YρY(q_0+q_2)\rho+(q_1+q_3)Y\rho Y(q0​+q2​)ρ+(q1​+q3​)YρY.
Consequently, core-key depolarization with parameter ppp becomes a YYY-error channel for odd nnn, preserving YYY eigenstates and giving average recovery fidelity (2+p)/3(2+p)/3(2+p)/3. A specified distributed depolarization model yields effective parameter ∏jpj\prod_jp_j∏j​pj​, versus PPP for global depolarization; matching these parameters does not equate the physical channels.
The analysis assumes noiseless encryption and decryption. General correlated noise is formulated but not systematically classified: coherences between multiqubit Pauli strings can survive recovery, requiring the full process matrix. Operational imperfections, noise with memory, and channel-distance characterizations are left for further study.
Encrypted quantum cloning distributes an unknown kkk-qubit state among mmm encrypted clones so that no individual clone reveals the input, yet the state can be recovered from any one clone together with a common quantum key. We ask the inverse question: for a fixed encoding architecture, which multipartite pure states can serve as exact resources for this task? For m≥2m\ge2m≥2, we completely characterize the pure resources compatible with a sector-wise two-Pauli encoder, with necessity holding for arbitrary completely positive trace-preserving (CPTP) recovery maps. For even mmm, exact recovery requires maximal entanglement across the signal--noise cut. For odd mmm, less entanglement can suffice, provided that the surviving signal correlations have the structure selected by the encoder. We further show, without fixing the encoder, that exact recovery from every authorized subsystem already implies perfect concealment of each individual signal and requires at least (m−1)k(m-1)k(m−1)k ebits of signal--noise entanglement. For graph states, the resource classification reduces to an exact condition on the kernel of the signal--noise cut matrix, leading to binary certification and constructive Clifford recovery. We identify rank-deficient graph resources that attain the architecture-independent entanglement bound and prove that the entire Dicke family, including WWW states, is excluded for every sector-wise two-Pauli encoder. Our results show that encrypted recovery depends not only on how much entanglement a resource contains, but also on how its correlations are organized relative to the encoder.
Entanglement fidelity quantifies how well a quantum channel preserves the correlations between a transmitted system and an inaccessible reference system. We derive closed-form expressions for the entanglement fidelity associated with several standard quantum noise models, including the random Pauli-X, dephasing, depolarizing, Werner-Holevo, generalized Pauli (Weyl), and amplitude-damping channels. For each model, we express the entanglement fidelity in terms of a general input density operator ρρρ, using Schumacher's Kraus-operator approach, which provides a channel-agnostic recipe applicable to any completely positive trace-preserving (CPTP) map with a finite Kraus representation. We then specialize to a communication scenario in which the source emits a two-letter parametric alphabet, thereby making explicit the dependence of entanglement preservation on both channel and source parameters. The resulting expressions enable direct comparisons of channel performance and rankings for representative families of input states, including common qubit states.
Encrypted quantum cloning distributes an unknown kkk-qubit state among mmm encrypted clones so that no individual clone reveals the input, yet the state can be recovered from any one clone together with a common quantum key. We ask the inverse question: for a fixed encoding architecture, which multipartite pure states can serve as exact resources for this task? For m≥2m\ge2m≥2, we completely characterize the pure resources compatible with a sector-wise two-Pauli encoder, with necessity holding for arbitrary completely positive trace-preserving (CPTP) recovery maps. For even mmm, exact recovery requires maximal entanglement across the signal--noise cut. For odd mmm, less entanglement can suffice, provided that the surviving signal correlations have the structure selected by the encoder. We further show, without fixing the encoder, that exact recovery from every authorized subsystem already implies perfect concealment of each individual signal and requires at least (m−1)k(m-1)k(m−1)k ebits of signal-- Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Quantum encrypted cloning, introduced by Yamaguchi and Kempf, is a Pauli-based protocol that distributes an unknown input qubit into multiple encrypted signal-noise pairs in such a way that redundancy is created without violating the no-cloning theorem, since at most one clone can later be perfectly recovered through an appropriate decoding procedure. In previous work we showed that unauthorized subsets of the storage register are not, in general, completely uninformative, and we identified a parity-dependent leakage pattern. In the present work we extend the analysis to subsets that also include the transformed source qubit A. Exploiting the purity of the global encoded state and the complementarity between storage-only subsets and subsets containing A, we derive a full classification of the informativeness of all sets of the form H={A}∪CH=\{A\}\cup CH={A}∪C. We show that these subsets are fully informative in the generic case. Two exceptions arise. First, if all pairs are incomplete and |C|<n, then the reduced state is completely uninformative. Second, if |C|=n, n is odd, and the number q of signal qubits in C is even, then the reduced state is partially informative. In this latter case, the residual dependence on the input state is confined to the y-component of the Bloch vector. These results provide a complete parity-based characterization of leakage for subsets containing the transformed input qubit.
Full accuracy simulations of quantum systems are very costly, and as a result most studies \nof quantum error correction assume a probabilistic Pauli error model, largely because such \nerrors can be e ciently simulated. Therefore, the behaviour of more general noise in a \nquantum error correcting code is poorly characterized. In this thesis, we present results which \ndemonstrate the scaling of the logical noise with respect to the physical delity, and argue \nthat the e ective logical noise approaches a Pauli channel as the code distance increases, \neven when no recovery operations are applied. As a result, we argue that the average logical \n delity can be used to accurately quantify the e ective logical noise, and to select recovery \noperations appropriate to the system. We further demonstrate that when physical noise \nacts on fewer than d qubits in an [[n; k; d]] code, the resultant noise is Pauli, and develop \na method for approximating the dominant contributions to the e ective logical noise up to \na speci ed precision in terms of the physical in delity. We derive conditions under which \nsets of recovery operations will produce equivalent logical noise channels, with examples of \nequivalencies in the 3 qubit repetition code, the 5 qubit code, the Steane code, and the Shor \ncode. We also provide a general expression for the e ective logical noise when the physical \nqubits undergo depolarizing or Pauli noise in a quantum error correcting code, examine the \nbehaviour of depolarizing noise under concatenation of the 5 qubit and Steane codes, and \npresent an algorithm for soft decoding which is not subject to statistical sampling, with an \nemphasis on the e ective behaviour of a concatenated 5 qubit code undergoing depolarizing \nnoise after applying a specialized version our soft decoding algorithm.
We analytically characterize how the location and the local or correlated structure of stochastic Pauli errors affect a three-qubit coherent quantum-teleportation circuit. Independent local channels and a fully correlated two-qubit channel are inserted separately in six configurations. Propagating each Pauli-error realization through the Clifford circuit yields the effective channel on Bob's qubit and analytical expressions for the average and state-resolved fidelities. Under a common ordered-pair probability convention, the six configurations form three pairs that induce equivalent reduced channels on Bob. Within each pair, corresponding Pauli-error realizations have the same probabilities and produce the same effective Pauli operator on Bob's output state. The equivalence therefore holds for every input state within the stochastic Pauli models considered here, rather than only for the average fidelity. Correlated Z errors do not affect the output for the first pair; local X and Z errors exhibit complementary qubit sensitivity for the second; and correlated same-axis Pauli errors cancel for the third. These results classify the error response of the selected circuit configurations and show that it depends jointly on the error statistics, Pauli axis, and position within the protocol.