Xinyu Tan

Xinyu Tan

Auto-generated profile, based on publicly available information

Xinyu Tan

Department of Mathematics, Massachusetts Institute of Technology, Cambridge, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 December 2023 in PRX Quantum
Verified
Journal Article
Open access
PDF file
XTXinyu Tan
Xinyu Tan
FZFang Zhang
Fang Zhang
RCRui Chao
Rui Chao
YSYaoyun Shi
Yaoyun Shi
JCJianxin Chen
Jianxin Chen
Fast classical processing is essential for most quantum fault-tolerance architectures. We introduce a sliding-window decoding scheme that provides fast classical processing for the surface code through parallelism. Our scheme divides the syndromes in space-time into overlapping windows along the time direction, which can be decoded in parallel with any inner decoder. With this parallelism, our scheme can solve the backlog problem as the code scales up, even if the inner decoder is slow. When using minimum-weight perfect matching and union find as the inner decoders, we observe circuit-level thresholds of 0.68% and 0.55%, respectively, which are almost identical to those for the batch decoding.

30 October 2025 in Communications in Mathematical Physics
Verified
Journal Article
Closed access
PDF file
JHJeongwan Haah
Jeongwan Haah
YLYunchao Liu
Yunchao Liu
XTXinyu Tan
Xinyu Tan

14 April 2021 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
JCJessica Centers
Jessica Centers
XTXinyu Tan
Xinyu Tan
AHAhmed Hareedy
Ahmed Hareedy
RCRobert Calderbank
Robert Calderbank
In various practical systems, certain data patterns are prone to errors if written or transmitted. In magnetic recording and communication over transmission lines, data patterns causing consecutive transitions that are not sufficiently separated are prone to errors. In Flash memory with two levels per cell, data patterns causing high–low–high charge levels on adjacent cells are prone to errors. Constrained codes are used to eliminate error-prone patterns, and they can also achieve other goals. Recently, we introduced efficient binary symmetric lexicographically-ordered constrained (LOCO) codes and asymmetric LOCO (A-LOCO) codes to increase density in magnetic recording systems and lifetime in Flash systems by eliminating the relevant detrimental patterns. Due to their application, LOCO and A-LOCO codes are associated with level-based signaling. Studying the power spectrum of a random signal with certain properties is principal for any storage or transmission system. It reveals important properties such as the average signal power at DC, the bandwidth of the signal, and whether there are discrete power components at certain frequencies. In this paper, we first modify a framework from the literature in order to introduce a method to derive the power spectrum of a sequence of constrained data associated with level-based signaling. We apply our method to infinitely long sequences satisfying symmetric and asymmetric constraints. Next, we show how to generalize the method such that it works for a stream of finite-length codewords as well, thus demonstrating how to overcome the associated finite-length challenges. We use the generalized method to devise closed forms for the spectra of finite-length LOCO and A-LOCO codes from their transition diagrams. Our LOCO and A-LOCO spectral derivations can be performed for any code length and can be extended to other constrained codes. We plot these power spectra, and discuss various important spectral properties for both LOCO and A-LOCO codes. We also briefly discuss an alternative method for deriving the power spectrum and introduce an idea towards reaching the spectra of self-clocked codes.

30 September 2025 in arXiv
Verified
Preprint
Open access
PDF file
XTXinyu Tan
Xinyu Tan
We present a simple algorithm that implements an arbitrary $n$-qubit unitary operator using a Clifford+T circuit with T-count $O(2^{4n/3} n^{2/3})$. This improves upon the previous best known upper bound of $O(2^{3n/2} n)$, while the best known lower bound remains $Ω(2^n)$. Our construction is based on a recursive application of the cosine-sine decomposition, together with a generalization of the optimal diagonal unitary synthesis method by Gosset, Kothari, and Wu to multi-controlled $k$-qubit unitaries.

15 October 2024 in arXiv
Verified
Preprint
Open access
PDF file
ZHZhiyang He
Zhiyang He
LRLuke Robitaille
Luke Robitaille
XTXinyu Tan
Xinyu Tan
The Clifford hierarchy is a fundamental structure in quantum computation, classifying unitary operators based on their commutation relations with the Pauli group. Despite its significance, the mathematical structure of the hierarchy is not well understood at the third level and higher. In this work, we study permutations in the hierarchy: gates which permute the $2^n$ basis states. We fully characterize all the semi-Clifford permutation gates. Moreover, we prove that any permutation gate in the third level, not necessarily semi-Clifford, must be a product of Toffoli gates in what we define as staircase form, up to left and right multiplications of Clifford permutations. Finally, we show that the smallest number of qubits for which there exists a non-semi-Clifford permutation in the third level is $7$.

14 January 2022 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
XTXinyu Tan
Xinyu Tan
NRNarayanan Rengaswamy
Narayanan Rengaswamy
RCRobert Calderbank
Robert Calderbank