Full characterization of informative subsets in Quantum Encrypted Cloning

• URL: http://arxiv.org/abs/2605.27421v1
• Date: Tue, 19 May 2026 11:59:12 GMT
• Title: Full characterization of informative subsets in Quantum Encrypted Cloning
• Abstract summary: Quantum encrypted cloning is a protocol that distributes an unknown input qubit into multiple encrypted signal-noise pairs.<n>In previous work we showed that unauthorized subsets of the storage register are not, in general, completely uninformative.<n>We extend the analysis to subsets that also include the transformed source qubit A.
• Score: 2.0071079975427284
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• C$^{2}$R: Cross-sample Consistency Regularization Mitigates Feature Splitting and Absorption in Sparse Autoencoders [56.67585330425431]
  Sparse Autoencoders (SAEs) are widely used to interpret large language models by decomposing activations into sparse, human-understandable features.<n>These issues stem from inconsistent latent assignment across samples.<n>We introduce C$2$R, which penalizes the co-activation of directionally similar latents.
  arXiv  Detail & Related papers  (2026-06-29T17:45:31Z)
• Encrypted Cloning, Absolute Maximal Entanglement and Quantum Secret Sharing [0.0]
  We develop a framework for arbitrary dimensions based on Weyl-Heisenberg displacement operators.<n>We prove that an encrypted qudit system comprising two signal-noise qudit pairs is equivalent to a five-party AME state in any dimension.
  arXiv  Detail & Related papers  (2026-05-26T11:24:54Z)
• Classification of informative subsets in quantum encrypted cloning on qudits [6.632912569027217]
  We systematically classify the informative subsets of the storage register in the qudit encrypted-cloning protocol.<n>We show that the presence or absence of information leakage is determined by the solution set of a system of congruences.<n>Our results extend the parity-based classification known for qubits to arbitrary finite dimensions.
  arXiv  Detail & Related papers  (2026-05-12T07:04:10Z)
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning [1.9201151941485035]
  We classify subsets of the encrypted-clone storage register into authorized, completely non-informative, and partially informative sets.<n>We show that intermediate non-authorized subsets may retain only a restricted residual dependence on the input state.
  arXiv  Detail & Related papers  (2026-04-11T11:02:06Z)
• Cloning Games, Black Holes and Cryptography [50.022147589030304]
  We introduce a new toolkit for analyzing cloning games.<n>This framework allows us to analyze a new cloning game based on binary phase states.<n>We show that the binary phase variantally optimal bound offers quantitative insights into information scrambling in idealized models of black holes.
  arXiv  Detail & Related papers  (2024-11-07T14:09:32Z)
• Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates [49.126395046088014]
  We consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets.<n>Our main findings are that the maximum length of messages thus identifiable scales superlinearly as $R,nlog n$ with the block length $n$.<n>We show that it is sufficient to ensure pairwise reliable distinguishability of the output distributions to construct a DI code.
  arXiv  Detail & Related papers  (2024-02-14T11:59:30Z)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00:20Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• Entanglement purification by counting and locating errors with entangling measurements [62.997667081978825]
  We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble.
  arXiv  Detail & Related papers  (2020-11-13T19:02:33Z)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)
• From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography [0.0]
  We first conjecture on the basis of experimental data that the entropy of the posterior is minimized by the constant strings. We then establish a connection between covert communication and deniability to propose DC-QKE. We present an efficient coercion-resistant and quantum-secure voting scheme, based on fully homomorphic encryption.
  arXiv  Detail & Related papers  (2020-03-25T22:20:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.