Table of Contents
Fetching ...

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

Arpan Akash Ray, Boris Skoric

TL;DR

An Unclonable Encryption scheme in which the encryption operators are given by the unitaries which constitute the approximate unitary design, which establishes unclonable-indistinguishable security for a CV encryption for the first time.

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.

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

TL;DR

An Unclonable Encryption scheme in which the encryption operators are given by the unitaries which constitute the approximate unitary design, which establishes unclonable-indistinguishable security for a CV encryption for the first time.

Abstract

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 and . We prove that the parameter is given by , where 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.
Paper Structure (17 sections, 12 theorems, 24 equations)

This paper contains 17 sections, 12 theorems, 24 equations.

Key Result

Lemma 2.1

Let $X\in\mathbb{C}^{d_1\times d_2}$. It holds that $\|X\|_1 \leq \sqrt{\min\{d_1,d_2\}}\,\|X\|_2$.

Theorems & Definitions (23)

  • Lemma 2.1
  • Lemma 2.2: Diamond vs $2\!\to\!2$ norm Low2010PseudorandonmessAL
  • Lemma 2.3: Gentle Measurement Lemma Winter1999Aar2004
  • Definition 2.4: Approximate unitary 2-design
  • Corollary 2.5
  • Lemma 3.1
  • proof
  • Lemma 3.2
  • proof
  • Corollary 3.3
  • ...and 13 more