1 citations · 1 across the 3 of their papers we have counts for
5 papers
Quantum circuit compilation with constant overhead
Chenyi Zhang, Xinyu Tan, Robin Kothari +2
Compiling a continuous gate set to a discrete universal gate set generally incurs an overhead. A circuit composed of arbitrary one- and two-qubit gates can be -approximated…
Fairy2i: Training Complex LLMs from Real LLMs with All Parameters in
Feiyu Wang, Xinyu Tan, Bokai Huang +4
Large language models (LLMs) have revolutionized artificial intelligence, yet their massive memory and computational demands necessitate aggressive quantization, increasingly pushi…
Characterization of permutation gates in the third level of the Clifford hierarchy
Zhiyang He, Luke Robitaille, Xinyu Tan
The Clifford hierarchy is a fundamental structure in quantum computation whose mathematical properties are not fully understood. In this work, we characterize permutation gates --…
Unitary synthesis with fewer T gates
Xinyu Tan
We present a simple algorithm that implements an arbitrary -qubit unitary operator using a Clifford+T circuit with T-count . This improves upon the previous…
Permutation gates in the third level of the Clifford hierarchy
Zhiyang He, Luke Robitaille, 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 signi…