Graphical CSS Code Transformation Using ZX Calculus

07/05/2023
by   Jiaxin Huang, et al.
0

In this work, we present a generic approach to transform CSS codes by building upon their equivalence to phase-free ZX diagrams. Using the ZX calculus, we demonstrate diagrammatic transformations between encoding maps associated with different codes. As a motivating example, we give explicit transformations between the Steane code and the quantum Reed-Muller code, since by switching between these two codes, one can obtain a fault-tolerant universal gate set. To this end, we propose a bidirectional rewrite rule to find a (not necessarily transversal) physical implementation for any logical ZX diagram in any CSS code. We then focus on two code transformation techniques: code morphing, a procedure that transforms a code while retaining its fault-tolerant gates, and gauge fixing, where complimentary codes can be obtained from a common subsystem code (e.g., the Steane and the quantum Reed-Muller codes from the [[15,1,3,3]] code). We provide explicit graphical derivations for these techniques and show how ZX and graphical encoder maps relate several equivalent perspectives on these code transforming operations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/14/2022

Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit

This paper explores a new approach to fault-tolerant quantum computing, ...
research
10/21/2019

On Optimality of CSS Codes for Transversal T

In order to perform universal fault-tolerant quantum computation, one ne...
research
01/14/2020

Classical Coding Problem from Transversal T Gates

Universal quantum computation requires the implementation of a logical n...
research
06/01/2021

Connectivity constrains quantum codes

Quantum low-density parity-check (LDPC) codes are an important class of ...
research
10/01/2020

Avoiding coherent errors with rotated concatenated stabilizer codes

Coherent errors, which arise from collective couplings, are a dominant f...
research
04/27/2022

Divisible Codes for Quantum Computation

Divisible codes are defined by the property that codeword weights share ...
research
04/30/2018

A Formal Transformation Method for Automated Fault Tree Generation from a UML Activity Model

Fault analysis and resolution of faults should be part of any end-to-end...

Please sign up or login with your details

Forgot password? Click here to reset