Continuous-variable approximate unitary 2-design, with applications to unclonable encryption

• URL: http://arxiv.org/abs/2603.06393v1
• Date: Fri, 06 Mar 2026 15:40:20 GMT
• Title: Continuous-variable approximate unitary 2-design, with applications to unclonable encryption
• Abstract summary: We introduce an $varepsilon$-approximate unitary 2-design compatible with the structure of p- and q-quadratures in continuous-variable quantum systems.<n>Unitaries are defined on a finite-dimensional discretisation of the CV space and can be physically implemented as operations on the full CV space.<n>We propose an Unclonable Encryption scheme in which the encryption operators are given by the unitaries which constitute the approximate unitary design.
• Score: 0.18907108368038208
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce an $\varepsilon$-approximate unitary 2-design that is compatible with the structure of p- and q-quadratures in continuous-variable (CV) quantum systems. The design unitaries are defined on a finite-dimensional discretisation of the CV space and can be physically implemented as operations on the full CV space. This establishes the first approximate unitary design for CV systems. The design alternatingly acts with unitaries based on the quadrature operators $\hat q$ and $\hat p$. We prove that the parameter $\varepsilon$ is given by $1/d^\ell$, where $d$ is the dimension of the truncated Hilbert space and $\ell$ is the number of iterations. We propose an Unclonable Encryption scheme in which the encryption operators are given by the unitaries which constitute the approximate unitary design. We prove its security using recent results on decoupling. This establishes unclonable-indistinguishable security for a CV encryption for the first time.

Related papers

• Verified Pythagorean Composition for Adaptive Cryptographic Games: Noise Flooding in Homomorphic Encryption [45.00791460144501]
  Noise flooding is a standard defense against decryption attacks on approximate homomorphic encryption.<n>Our proof constructs a new relational program logic over SSProve semantics.
  arXiv  Detail & Related papers  (2026-08-14T00:40:29Z)
• SSTQ:Privacy-Preserving Vector Quantization via Subsampled Stochastic TurboQuant [79.24089819400126]
  Subsampled TurboQuant (SSTQ) is a framework that combines overcomplete equal-width tight frames, coordinate subsampling, and privacy-aware quantization.<n>SSTQ achieves mean squared error scaling while using only $lceil log N il + b$ bits per client, where $N = (d)$ is the frame size.<n>We also derive a surrogate privacy-aware codebook objective that reduces the codebook-dependent MSE scaling from $O(4b)$ to $O(2b)$.
  arXiv  Detail & Related papers  (2026-08-05T17:51:25Z)
• Group Representational Position Encoding [66.33026480082025]
  We present GRAPE, a unified framework for positional encoding based on group actions.<n>Two families of mechanisms: (i) multiplicative rotations (Multiplicative GRAPE) in $mathrmSO(d)$ and (ii) additive logit biases (Additive GRAPE) arising from unipotent actions in the general linear group $mathrmGL$.
  arXiv  Detail & Related papers  (2025-12-08T18:39:13Z)
• A Symmetric-Key Cryptosystem Based on the Burnside Ring of a Compact Lie Group [0.0]
  We propose a symmetric-key cryptosystem whose linear action takes place instead in the Burnside ring $A(G)$ of a compact Lie group $G$.<n>Messages of arbitrary finite length are encoded as finitely supported elements of $A(G)$ and encrypted via the Burnside product with $k$.<n>We show that any finite set of observations constrains the action only on a finite-rank submodule $W_Lsubset A(O(2))$, and we show information-theoretic non-identifiability of the key from such data.
  arXiv  Detail & Related papers  (2025-10-13T01:57:22Z)
• Fast computation of 2-isogenies in dimension 4 and cryptographic applications [0.0]
  We present algorithms to compute chains of $2$-isogenies between abelian varieties of dimension $ggeq 1$ with theta-coordinates of level $n=2$.<n>We are able to run a complete key recovery attack on SIDH when the endomorphism ring of the starting curve is unknown within a few seconds on a laptop.
  arXiv  Detail & Related papers  (2024-07-22T09:19:20Z)
• Perturb-and-Project: Differentially Private Similarities and Marginals [73.98880839337873]
  We revisit the input perturbations framework for differential privacy where noise is added to the input $Ain mathcalS$. We first design novel efficient algorithms to privately release pair-wise cosine similarities. We derive a novel algorithm to compute $k$-way marginal queries over $n$ features.
  arXiv  Detail & Related papers  (2024-06-07T12:07:16Z)
• Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs [56.237917407785545]
  We consider the problem of learning an $varepsilon$-optimal policy in a general class of continuous-space Markov decision processes (MDPs) having smooth Bellman operators. Key to our solution is a novel projection technique based on ideas from harmonic analysis. Our result bridges the gap between two popular but conflicting perspectives on continuous-space MDPs.
  arXiv  Detail & Related papers  (2024-05-10T09:58:47Z)
• 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)
• Continuous-variable quantum state designs: theory and applications [0.4999814847776097]
  We generalize the notion of quantum state designs to infinite-dimensional spaces. We first prove that, under the definition of continuous-variable (CV) state $t$-designs, no state designs exist for $tgeq2$. We propose an alternative definition for CV state designs, which we call rigged $t$-designs.
  arXiv  Detail & Related papers  (2022-11-09T19:00:00Z)
• 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)
• Epsilon-nets, unitary designs and random quantum circuits [0.11719282046304676]
  Epsilon-nets and approximate unitary $t$-designs are notions of unitary operations relevant for numerous applications in quantum information and quantum computing. We prove that for a fixed $d$ of the space, unitaries constituting $delta$-approx $t$-expanders form $epsilon$-nets for $tsimeqfracd5/2epsilon$ and $delta=left(fracepsilon3/2dright)d2$. We show that approximate tdesigns can be generated
  arXiv  Detail & Related papers  (2020-07-21T15:16:28Z)

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.