Table of Contents
Fetching ...

Correction of circuit faults in a stacked quantum memory using rank-metric codes

Nicolas Delfosse, Gilles Zémor

TL;DR

A quantum generalization of Gabidulin codes is proposed, which is one of the most popular family of rank-metric codes, and a protocol to correct faults in Clifford circuits applied to a stacked quantum memory based on these codes is designed.

Abstract

We introduce a model for a stacked quantum memory made with multi-qubit cells, inspired by multi-level flash cells in classical solid-state drive, and we design quantum error correction codes for this model by generalizing rank-metric codes to the quantum setting. Rank-metric codes are used to correct faulty links in classical communication networks. We propose a quantum generalization of Gabidulin codes, which is one of the most popular family of rank-metric codes, and we design a protocol to correct faults in Clifford circuits applied to a stacked quantum memory based on these codes. We envision potential applications to the optimization of stabilizer states and magic states factories, and to variational quantum algorithms. Further work is needed to make this protocol practical. It requires a hardware platform capable of hosting multi-qubit cells with low crosstalk between cells, a fault-tolerant syndrome extraction circuit for rank-metric codes and an associated efficient decoder.

Correction of circuit faults in a stacked quantum memory using rank-metric codes

TL;DR

A quantum generalization of Gabidulin codes is proposed, which is one of the most popular family of rank-metric codes, and a protocol to correct faults in Clifford circuits applied to a stacked quantum memory based on these codes is designed.

Abstract

We introduce a model for a stacked quantum memory made with multi-qubit cells, inspired by multi-level flash cells in classical solid-state drive, and we design quantum error correction codes for this model by generalizing rank-metric codes to the quantum setting. Rank-metric codes are used to correct faulty links in classical communication networks. We propose a quantum generalization of Gabidulin codes, which is one of the most popular family of rank-metric codes, and we design a protocol to correct faults in Clifford circuits applied to a stacked quantum memory based on these codes. We envision potential applications to the optimization of stabilizer states and magic states factories, and to variational quantum algorithms. Further work is needed to make this protocol practical. It requires a hardware platform capable of hosting multi-qubit cells with low crosstalk between cells, a fault-tolerant syndrome extraction circuit for rank-metric codes and an associated efficient decoder.

Paper Structure

This paper contains 8 sections, 6 theorems, 9 equations, 1 figure.

Key Result

Lemma 1

If $t$ edges of the network are faulty, then we have $\mathop{\mathrm{rank}}\nolimits({\cal Y} - {\cal Z}) \leqslant t$.

Figures (1)

  • Figure 1: Abstract representation of a $5 \times 4$ stacked memory.

Theorems & Definitions (12)

  • Lemma 1
  • proof
  • Theorem 1
  • Lemma 2
  • proof
  • Proposition 1
  • proof
  • Lemma 3
  • proof
  • Theorem 2
  • ...and 2 more