activity
20152026
most citedFlag fault-tolerant error correction, measurement, and quantum computation for cyclic CSS codes

41 citations · 105 across the 12 of their papers we have counts for

collaborators

12 papers

quant-ph2026

Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates

Theerapat Tansuwannont, Tim Chan, Ryuji Takagi

To build large-scale quantum computers while minimizing resource requirements, one may want to use high-rate quantum error-correcting codes that can efficiently encode information.…

quant-ph2025

Clifford gates with logical transversality for self-dual CSS codes

Theerapat Tansuwannont, Yugo Takada, Keisuke Fujii

Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers as they use physical qubits more efficiently than codes of the same dis…

quant-ph2024★ 2 cited

Boosting end-to-end entanglement fidelity in quantum repeater networks via hybridized strategies

Poramet Pathumsoot, Theerapat Tansuwannont, Naphan Benchasattabuse +5

Quantum networks are expected to enhance distributed quantum computing and quantum communication over long distances while providing security dependent upon physical effects rather…

quant-ph2024★ 4 cited

Concatenated Steane code with single-flag syndrome checks

Balint Pato, Theerapat Tansuwannont, Kenneth R. Brown

A fault-tolerant error correction (FTEC) protocol with a high error suppression rate and low overhead is very desirable for the near-term implementation of quantum computers. In th…

quant-ph2023★ 4 cited

Optimization tools for distance-preserving flag fault-tolerant error correction

Balint Pato, Theerapat Tansuwannont, Shilin Huang +1

Lookup table decoding is fast and distance-preserving, making it attractive for near-term quantum computer architectures with small-distance quantum error-correcting codes. In this…

quant-ph2023

A Hamming-Like Bound for Degenerate Stabilizer Codes

Andrew Nemec, Theerapat Tansuwannont

The quantum Hamming bound was originally put forward as an upper bound on the parameters of nondegenerate quantum codes, but over the past few decades much work has been done to sh…

quant-ph2023

Hybrid Error-Management Strategies in Quantum Repeater Networks

Poramet Pathumsoot, Theerapat Tansuwannont, Naphan Benchasattabuse +5

A quantum network is expected to enhance distributed quantum computing and quantum communication over a long distance while providing unconditional security. As quantum entanglemen…

quant-ph2022★ 20 cited

Adaptive syndrome measurements for Shor-style error correction

Theerapat Tansuwannont, Balint Pato, Kenneth R. Brown

The Shor fault-tolerant error correction (FTEC) scheme uses transversal gates and ancilla qubits prepared in the cat state in syndrome extraction circuits to prevent propagation of…

quant-ph2021★ 17 cited

Achieving fault tolerance on capped color codes with few ancillas

Theerapat Tansuwannont, Debbie Leung

Attaining fault tolerance while maintaining low overhead is one of the main challenges in a practical implementation of quantum circuits. One major technique that can overcome this…

quant-ph2020★ 14 cited

Fault-tolerant quantum error correction using error weight parities

Theerapat Tansuwannont, Debbie Leung

In quantum error correction using imperfect primitives, errors of high weight arising from a few faults are major concerns since they might not be correctable by the quantum error…

quant-ph2018★ 41 cited

Flag fault-tolerant error correction, measurement, and quantum computation for cyclic CSS codes

Theerapat Tansuwannont, Christopher Chamberland, Debbie Leung

Flag qubits have recently been proposed in syndrome extraction circuits to detect high-weight errors arising from fewer faults. The use of flag qubits allows the construction of fa…

quant-ph2015★ 3 cited

Quantum Phase Estimation Algorithm for Finding Polynomial Roots

Theerapat Tansuwannont, Surachate Limkumnerd, Sujin Suwanna +1

Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific…