REVIEW 1 cited by
Fold-Transversal Clifford Gates for Quantum Codes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We generalize the concept of folding from surface codes to CSS codes by considering certain dualities within them. In particular, this gives a general method to implement logical operations in suitable LDPC quantum codes using transversal gates and qubit permutations only. To demonstrate our approach, we specifically consider a [[30, 8, 3]] hyperbolic quantum code called Bring's code. Further, we show that by restricting the logical subspace of Bring's code to four qubits, we can obtain the full Clifford group on that subspace.
Forward citations
Cited by 1 Pith paper
-
Targeted Clifford logical gates for hypergraph product codes
Targeted logical Clifford gates for any hypergraph product code can be built from simple physical gates with support and depth Θ(√n), without ancillas.
Discussion (0). Continue with ORCID to comment.