We introduce an ε-approximate unitary 2-design that is compatible with the structure of p- and qquadratures in continuous-variable (CV) quantum systems. The design unitaries are defined on a finitedimensional discretisation of the CV space and can be physically implemented as operations on the full V space. This establishes the first approximate unitary design for CV systems. The design alternatingly acts with unitaries based on the quadrature operators ˆq and ˆp. We prove that the parameter ε is given by 1/dℓ, where d is the dimension of the truncated Hilbert space and ℓ 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.
We introduce an ε-approximate unitary 2-design that is compatible with the structure of p- and qquadratures in continuous-variable (CV) quantum systems. The design unitaries are defined on a finitedimensional discretisation of the CV space and can be physically implemented as operations on the full V space. This establishes the first approximate unitary design for CV systems. The design alternatingly acts with unitaries based on the quadrature operators ˆq and ˆp. We prove that the parameter ε is given by 1/dℓ, where d is the dimension of the truncated Hilbert space and ℓ 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.
We introduce an ε-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 q^ and p^. We prove that the parameter ε is given by 1/dℓ, where d is the dimension of the truncated Hilbert space and ℓ 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.
We propose the first continuous-variable (CV) unclonable encryption scheme, extending the paradigm of quantum encryption of classical messages to CV systems. In our construction, a classical message is first encrypted classically and then encoded using an error-correcting code. Each bit of the codeword is mapped to a CV mode by creating a coherent state which is squeezed in the q or p quadrature direction, with a small displacement that encodes the bit. The squeezing directions are part of the encryption key. We prove unclonability in the framework introduced by Broadbent and Lord, via a reduction of the cloning game to a CV monogamy-of-entanglement game. Furthermore, we demonstrate that our scheme can be readily implemented with current technology. By incorporating realistic imperfections such as channel noise and detector inefficiencies, we show that the protocol remains robust under these conditions.
Unitary t -designs are the bread and butter of quantum information theory and beyond. An important issue in practice is that of efficiently constructing good approximations of such unitary t -designs. Building on results by Aubrun (Comm. Math. Phys. 2009), we prove that sampling dtpoly(t,logd,1/ϵ) unitaries from an exact t -design provides with positive probability an ϵ -approximate t -design, if the error is measured in one-to-one norm. As an application, we give a randomized construction of a quantum encryption scheme that has roughly the same key size and security as the quantum one-time pad, but possesses the additional property of being non-malleable against adversaries without quantum side information.
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 from [Blume-Kohout , ], no state designs exist for t≥2 . Similarly, we prove that no CV unitary t -designs exist for t≥2 . We propose an alternative definition for CV state designs, which we call rigged t -designs, and provide explicit constructions for t=2 . As an application of rigged designs, we develop a design-based shadow-tomography protocol for CV states. Using energy-constrained versions of rigged designs, we define an average fidelity for CV quantum channels and relate this fidelity to the CV entanglement fidelity. As an additional result of independent interest, we establish a connection between torus 2-designs and complete sets of mutually unbiased bases. Published by the American Physical Society 2024
We introduce the notion of nonmalleability of a quantum state encryption scheme (in dimension d): in addition to the requirement that an adversary cannot learn information about the state, here we demand that no controlled modification of the encrypted state can be effected. We show that such a scheme is equivalent to a unitary 2-design [Dankert, et al., e-print arXiv:quant-ph/0606161], as opposed to normal encryption which is a unitary 1-design. Our other main results include a new proof of the lower bound of (d2−1)2+1 on the number of unitaries in a 2-design [Gross, et al., J. Math. Phys. 48, 052104 (2007)], which lends itself to a generalization to approximate 2-design. Furthermore, while in prime power dimension there is a unitary 2-design with ≤d5 elements, we show that there are always approximate 2-designs with O(ϵ−2d4 log d) elements.
We give an unconditional construction of information-theoretically secure one-time private-key unclonable encryption for one-bit messages, with efficient encryption and decryption and exponentially small unclonable-indistinguishability advantage. Previous work by Bhattacharyya and Culf (Nature Physics, 2026) and Bhattacharyya, Broadbent, and Culf (arXiv:2603.08916) either only showed inverse-polynomial security loss or required inefficient encryption/decryption operations; we avoid both of these caveats.
Our scheme's key is a uniformly random non-identity phase-free Pauli on n qubits, and bit a is encrypted as a random (−1)a eigenstate of that Pauli. We prove that the probability that both receivers recover the bit is at most 1/2+O(2−n/2). By a lower bound due to Broadbent, Culf, and Rochette (arXiv:2510.00903), this is the best probability bound achievable with n-qubit ciphertexts while ensuring perfect correctness (up to the constant hidden in the O(⋅)).