Coogee '26 Talks - Anqi Gong (ETH Zurich)
Автор: Quantum @ Sydney
Загружено: 2026-02-17
Просмотров: 38
Описание:
Logical gates in some algebraic codes
Algebraic structures in quantum error-correcting codes can usually facilitate logical computation. Polynomial formalism provides a way to investigate the Clifford and non-Clifford gate possibilities in these codes. I will give two types of examples in this talk. The first is Reed-Muller codes; both the punctured versions encoding one logical qubit and a high-rate family but with prudent gauge-fixing will be presented. The latter enables one to implement arbitrary in-block logical CNOT gates through physical permutations only, thereby having the potential to speed up logical computation. The second type concerns small algebraic geometry codes. Based on these codes, we give various practically relevant magic state distillation protocols and propose their application in certain algorithm subroutines.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
