Universal quantum computation with group surface codes скачать в хорошем качестве

Universal quantum computation with group surface codes

Title：Universal quantum computation with group surface codes Time：March 6, 2026 09:00（Beijing） Organizer：NUS Physics Condensed Matter Seminar Series Speaker: Tyler Ellison from Purdue University Abstract: The surface code is one of the leading approaches to building a fault-tolerant quantum computer. However, a central challenge for the surface code is implementing non-Clifford operations -- unitaries which map Pauli operators to non-Pauli operators. In this talk, I will introduce group surface codes, which are a natural generalization of the usual Z_2 surface code. I will show that group surface codes, for suitably chosen groups, can be leveraged to perform non-Clifford gates in the Z_2 surface code. Time permitting, I will describe three strategies for completing a universal gate set using group surface codes: through transversal non-Clifford gates, sliding surface codes, and magic state preparation. These strategies extend recent efforts in performing universal quantum computation in topological orders without the braiding of anyons. Moreover, they show how certain group surface codes allow us to bypass the restrictions set by the Bravyi-König theorem, which limits the computational power of topological Pauli stabilizer models.