Self-Testing Quantum Error Correcting Codes: Analyzing Computational Hardness

TL;DR

This paper extends self-testing methods to quantum error-correcting codes, demonstrating their properties using specific codes and analyzing the computational complexity of related problems.

Contribution

It introduces a framework for self-testing of quantum codespaces, generalizes to CSS stabilizers, and explores the complexity of the ISSELFTEST problem.

Findings

Self-testing schemes for specific quantum codes are developed.

A no-go theorem for qudit generalization is established.

The computational complexity of ISSELFTEST is analyzed.

Abstract

We present a generalization of the tilted Bell inequality for quantum [[n,k,d]] error-correcting codes and explicitly utilize the simplest perfect code, the [[5,1,3]] code, the Steane [[7,1,3]] code, and Shor's [[9,1,3]] code, to demonstrate the self-testing property of their respective codespaces. Additionally, we establish a framework for the proof of self-testing, as detailed in \cite{baccari2020device}, which can be generalized to the codespace of CSS stabilizers. Our method provides a self-testing scheme for $\cos\theta \lvert \bar{0} \rangle + \sin\theta \lvert \bar{1} \rangle$, where $\theta \in [0, \frac{\pi}{2}]$, and also discusses its experimental application. We also investigate whether such property can be generalized to qudit and show one no-go theorem. We then define a computational problem called ISSELFTEST and describe how this problem formulation can be interpreted as a statement that maximal violation of a specific Bell-type inequality can self-test a particular entanglement subspace. We also discuss the computational complexity of ISSELFTEST in comparison to other classical complexity challenges and some related open problems.