Pauli Encodings & Unclonable Encryption

• URL: http://arxiv.org/abs/2607.28602v2
• Date: Fri, 31 Jul 2026 15:12:25 GMT
• Title: Pauli Encodings & Unclonable Encryption
• Abstract summary: We study Pauli 556s, a simple class of one-bit encryption schemes whose ciphertexts are normalized eigenspace projectors of Pauli strings.<n>We prove a universal lower bound $1/2+1/(2sqrtK)$ on the optimal monogamy-of-entanglement winning probability.<n>We prove strong unclonable-indistinguishable security against bounded-local-dimension adversaries and strong indistinguishability security for several efficient Pauli families.
• Score: 6.983998742574596
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The unclonable bit question asks whether quantum encryption can prevent an adversary from producing two systems that both reveal the plaintext once the key is disclosed. We introduce and study Pauli Encodings, a simple class of one-bit encryption schemes whose ciphertexts are normalized eigenspace projectors of Pauli strings. For every Pauli Encoding with K Pauli strings, we prove a universal lower bound $1/2+1/(2\sqrt{K})$ on the optimal monogamy-of-entanglement winning probability, together with sharper bounds for several structured families. We then establish two limitations of natural approaches to unclonable security. First, if the Pauli strings are restricted to strings of X and Z of length n, the encoding is not secure. Second, we identify a universal 3/4 obstruction showing that arguments based only on pairwise guessing marginals cannot establish unclonable-indistinguishable security. When the Pauli strings all pairwise anticommute, the protocol becomes the one studied in [Quantum 10, 2157 (2026)]. We exploit the symmetry of this protocol to solve the third level of the natural semidefinite programming relaxation obtaining an asymptotic upper bound of approximately 0.5556 on the winning probability. Finally, we prove strong unclonable-indistinguishable security against bounded-local-dimension adversaries and strong indistinguishability security for several efficient Pauli families. First-level NPA computations provide additional numerical evidence towards the strong unclonable-indistinguishable security.

Related papers

• Keyless secrecy against bounded adversaries [2.064612766965483]
  We introduce a keyless coding/crypt computation primitive that asks for two guarantees at once.<n>Neither the sender nor the receiver holds a secret key, and no computational hardness is assumed.<n>We obtain the first efficient non-malleable code secure against global quantum tampering.
  arXiv  Detail & Related papers  (2026-09-10T22:17:06Z)
• Efficient Unclonable Encryption from Pauli Eigenstates [2.0305676256390934]
  We give, to our knowledge, the first plain-model, one-time information-theoretically secure, efficient unclonable encryption scheme for one bit.<n>The key is a uniformly random phase-free Pauli on $n$ qubits, and bit $a$ is encrypted as a random $(-1)a$ eigenstate of that Pauli.<n>We prove that the probability that both receivers recover the bit is at most $frac12+frac12sqrt2n/(4n-1)
  arXiv  Detail & Related papers  (2026-07-23T20:53:24Z)
• The uncloneable bit exists [0.5352699766206808]
  We establish quantum uncloneable encryption with unconditional security.<n>We prevent two non-communicating adversaries from simultaneously decrypting a single ciphertext $-$ even when both are given the key.
  arXiv  Detail & Related papers  (2026-03-09T20:33:33Z)
• 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)
• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs.<n>This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• Quantum many-body simulations with PauliStrings.jl [0.0]
  We present the Julia package PauliStrings for quantum many-body simulations.<n>It performs fast operations on the Pauli group by encoding Pauli strings in binary.<n>We show that this representation allows for easy encoding of any geometry.
  arXiv  Detail & Related papers  (2024-10-12T21:18:47Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• On the Feasibility of Unclonable Encryption, and More [16.64327673223307]
  We show that encryption schemes satisfying unclonable indistinguishability exist unconditionally in the quantum random oracle model. We also establish the feasibility of copy-protection for single-bit output point functions.
  arXiv  Detail & Related papers  (2022-07-14T01:03:56Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)
• 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)

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.