Rui Chao

dblp:29/7672 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
3since 2021 · last 2024
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021
YearPublicationVenuePosition
2024 A Classical Architecture for Digital Quantum Computers
abstract
Scaling bottlenecks the making of digital quantum computers, posing challenges from both the quantum and the classical components. We present a classical architecture to cope with a comprehensive list of the latter challenges all at once , and implement it fully in an end-to-end system by integrating a multi-core RISC-V CPU with our in-house control electronics. Our architecture enables scalable, high-precision control of large quantum processors and accommodates evolving requirements of quantum hardware. A central feature is a microarchitecture executing quantum operations in parallel on arbitrary predefined qubit groups. Another key feature is a reconfigurable quantum instruction set that supports easy qubit re-grouping and instructions extensions. As a demonstration, we implement the widely-studied surface code quantum computing workflow, which is instructive for being demanding on both the controllers and the integrated classical computation. Our design, for the first time, reduces instruction issuing and transmission costs to constants, which do not scale with the number of qubits, without adding any overheads in decoding or dispatching. Our system uses a dedicated general-purpose CPU for both qubit control and classical computation, including syndrome decoding. Implementing recent theoretical proposals as decoding firmware that parallelizes general inner decoders, we can achieve unprecedented decoding capabilities of up to distances 47 and 67 with the currently available systems-on-chips for physical error rate p = 0.001 and p = 0.0001, respectively, all in just 1 μs.
Rui Chao, Cupjin Huang, Linghang Kong, Guoyang Chen, Dawei Ding 0002, Haishan Feng, Yihuai Gao, Xiaotong Ni, Liwei Qiu, Yueming Yang, Yaoyun Shi, Weifeng Zhang 0003, Peng Zhou 0030
ACM Trans. Quantum Comput.3
2023 A review of wearable sensors based fall-related recognition systems
Xiaohu Li, Shanshan Huang 0004, Rui Chao, Zhidong Cao, Shu Wang 0005, Aiguo Wang 0002, Li Liu 0001
Eng. Appl. Artif. Intell.4
2021 EmoDialoGPT: Enhancing DialoGPT with Emotion
Yuxiang Jia, Changyong Niu, Yutuan Ma, Hongying Zan, Rui Chao, Weicong Zhang
NLPCC (2)6
2020 Permutation-Invariant Constant-Excitation Quantum Codes for Amplitude Damping
abstract
The increasing interest in using quantum error correcting codes in practical devices has heightened the need for designing quantum error correcting codes that can correct against specialized errors, such as that of amplitude damping errors which model photon loss. Although considerable research has been devoted to quantum error correcting codes for amplitude damping, not so much attention has been paid to having these codes simultaneously lie within the decoherence free subspace of their underlying physical system. One common physical system comprises of quantum harmonic oscillators, and constant-excitation quantum codes can be naturally stabilized within them. The purpose of this paper is to give constant-excitation quantum codes that not only correct amplitude damping errors, but are also immune against permutations of their underlying modes. To construct such quantum codes, we use the nullspace of a specially constructed matrix based on integer partitions.
Yingkai Ouyang, Rui Chao
IEEE Trans. Inf. Theory2
2017 Overlapping Qubits
abstract
An ideal system of $n$ qubits has $2^n$ dimensions. This exponential grants power, but also hinders characterizing the system's state and dynamics. We study a new problem: the qubits in a physical system might not be independent. They can "overlap," in the sense that an operation on one qubit slightly affects the others. We show that allowing for slight overlaps, $n$ qubits can fit in just polynomially many dimensions. (Defined in a natural way, all pairwise overlaps can be $\leq ε$ in $n^{O(1/ε^2)}$ dimensions.) Thus, even before considering issues like noise, a real system of $n$ qubits might inherently lack any potential for exponential power. On the other hand, we also provide an efficient test to certify exponential dimensionality. Unfortunately, the test is sensitive to noise. It is important to devise more robust tests on the arrangements of qubits in quantum devices.
Rui Chao, Ben Reichardt, Chris Sutherland, Thomas Vidick
ITCS1