Table of Contents
Fetching ...

Hidden-State Proofs of Quantumness

Carl A. Miller

TL;DR

This work presents a proof of quantumness which maintains the same circuit structure as (Brakerski et al. 2018) while improving the robustness for noise, and proves an uncertainty principle over finite abelian groups which may be of independent interest.

Abstract

An experimental cryptographic proof of quantumness will be a vital milestone in the progress of quantum information science. Error tolerance is a persistent challenge for implementing such tests: we need a test that not only can be passed by an efficient quantum prover, but one that can be passed by a prover that exhibits a certain amount of computational error. (Brakerski et al. 2018) introduced an innovative two-round proof of quantumness based on the Learning With Errors (LWE) assumption. However, one of the steps in their protocol (the pre-image test) has low tolerance for error. In this work we present a proof of quantumness which maintains the same circuit structure as (Brakerski et al. 2018) while improving the robustness for noise. Our protocol is based on cryptographically hiding an extended Greenberger-Horne-Zeilinger (GHZ) state within a sequence of classical bits. Asymptotically, our protocol allows the total probability of error within the circuit to be as high as $1 - O ( λ^{-C} )$, where $λ$ is the security parameter and $C$ is a constant that can be made arbitrarily large. As part of the proof of this result, we also prove an uncertainty principle over finite abelian groups which may be of independent interest.

Hidden-State Proofs of Quantumness

TL;DR

This work presents a proof of quantumness which maintains the same circuit structure as (Brakerski et al. 2018) while improving the robustness for noise, and proves an uncertainty principle over finite abelian groups which may be of independent interest.

Abstract

An experimental cryptographic proof of quantumness will be a vital milestone in the progress of quantum information science. Error tolerance is a persistent challenge for implementing such tests: we need a test that not only can be passed by an efficient quantum prover, but one that can be passed by a prover that exhibits a certain amount of computational error. (Brakerski et al. 2018) introduced an innovative two-round proof of quantumness based on the Learning With Errors (LWE) assumption. However, one of the steps in their protocol (the pre-image test) has low tolerance for error. In this work we present a proof of quantumness which maintains the same circuit structure as (Brakerski et al. 2018) while improving the robustness for noise. Our protocol is based on cryptographically hiding an extended Greenberger-Horne-Zeilinger (GHZ) state within a sequence of classical bits. Asymptotically, our protocol allows the total probability of error within the circuit to be as high as , where is the security parameter and is a constant that can be made arbitrarily large. As part of the proof of this result, we also prove an uncertainty principle over finite abelian groups which may be of independent interest.
Paper Structure (27 sections, 22 theorems, 145 equations, 16 figures)

This paper contains 27 sections, 22 theorems, 145 equations, 16 figures.

Key Result

Theorem 1.1

Suppose that the LWE problem is hard. Then, Games $\mathbf{R}$ and $\mathbf{R}'$ satisfy the following:

Figures (16)

  • Figure 1: The nonlocal game $\mathbf{J}_d$.
  • Figure 2: The nonlocal game $\mathbf{J}'_d$.
  • Figure 3: Parameters for Section \ref{['sec:pfs']}. $q, Q, m, n, d, \tau$ are positive-integer valued functions of $\lambda$, and $\sigma$ is a function of $\lambda$ that takes on positive real values.
  • Figure 4: An encryption algorithm, in which $(A,v)$ is the ciphertext and $t$ is the secret key.
  • Figure 5: An Interactive Proof of Quantumness
  • ...and 11 more figures

Theorems & Definitions (51)

  • Theorem 1.1
  • Theorem 1.2
  • Remark 2.1
  • Proposition 2.1
  • Definition 2.1
  • Definition 2.2
  • Definition 2.3
  • Definition 2.4
  • Definition 2.5
  • Definition 2.6
  • ...and 41 more