Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Fold-Transversal Clifford Gates for Quantum Codes
Quantum ( IF 5.1 ) Pub Date : 2024-06-13 , DOI: 10.22331/q-2024-06-13-1372 Nikolas P. Breuckmann 1 , Simon Burton 2
Quantum ( IF 5.1 ) Pub Date : 2024-06-13 , DOI: 10.22331/q-2024-06-13-1372 Nikolas P. Breuckmann 1 , Simon Burton 2
Affiliation
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.
中文翻译:
用于量子代码的横向折叠克利福德门
通过考虑其中的某些二元性,我们将折叠的概念从表面代码推广到 CSS 代码。特别是,这给出了仅使用横向门和量子位排列在合适的 LDPC 量子码中实现逻辑运算的通用方法。
为了演示我们的方法,我们特别考虑了一个 [[30, 8, 3]] 双曲量子代码,称为 Bring 代码。此外,我们表明,通过将 Bring 代码的逻辑子空间限制为四个量子位,我们可以获得该子空间上的 $full$ Clifford 群。
更新日期:2024-06-14
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.
中文翻译:
用于量子代码的横向折叠克利福德门
通过考虑其中的某些二元性,我们将折叠的概念从表面代码推广到 CSS 代码。特别是,这给出了仅使用横向门和量子位排列在合适的 LDPC 量子码中实现逻辑运算的通用方法。
为了演示我们的方法,我们特别考虑了一个 [[30, 8, 3]] 双曲量子代码,称为 Bring 代码。此外,我们表明,通过将 Bring 代码的逻辑子空间限制为四个量子位,我们可以获得该子空间上的 $full$ Clifford 群。