Abstracts

3 Algorithms for non-Clifford operators of CSS codes

Presenting Author: Mark Webster, University of Sydney
Contributing Author(s): Stephen Bartlett, Benjamin Brown

Finding fault-tolerant non-Clifford logical operators on stabiliser codes is important for realisation of universal quantum computing. This task is particularly challenging for LDPC codes. The XP formalism allows us to better understand the logical operator structure of stabiliser codes, including logical operators at various levels of the Clifford hierarchy. In this talk, I will present 3 algorithms for finding fault-tolerant non-Clifford logical operators of CSS codes

Read this article online: https://arxiv.org/abs/2203.00103

(Session 9c : Friday from 5:45 pm - 6:15 pm)

 

SQuInT Chief Organizer
Akimasa Miyake, Associate Professor
amiyake@unm.edu

SQuInT Co-Organizer
Hartmut Haeffner, Associate Professor, UC Berkeley
hhaeffner@berkeley.edu

SQuInT Administrator
Dwight Zier
d29zier@unm.edu
505 277-1850

SQuInT Program Committee
Alberto Alonso, Postdoc, UC Berkeley
Philip Blocher, Postdoc, UNM
Neha Yadav, Postdoc, UC Berkeley
Cunlu Zhou, Postdoc, UNM

SQuInT Founder
Ivan Deutsch, Regents' Professor, CQuIC Director
ideutsch@unm.edu

Tweet About SQuInT 2022!