activity
20202026
most citedOn the statistical complexity of quantum circuits

59 citations · 89 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LG2026

Jordan-RoPE: Non-Semisimple Relative Positional Encoding via Complex Jordan Blocks

Yaobo Zhang

Relative positional encodings determine which functions of query-key lag can enter the primitive attention logit. RoPE supplies a rotary phase, while ALiBi supplies an additive dis…

quant-ph2021★ 7 cited

Rademacher complexity of noisy quantum circuits

Kaifeng Bu, Dax Enshan Koh, Lu Li +2

Noise in quantum systems is a major obstacle to implementing many quantum algorithms on large quantum circuits. In this work, we study the effects of noise on the Rademacher comple…

quant-ph2021★ 17 cited

Effects of quantum resources on the statistical complexity of quantum circuits

Kaifeng Bu, Dax Enshan Koh, Lu Li +2

We investigate how the addition of quantum resources changes the statistical complexity of quantum circuits by utilizing the framework of quantum resource theories. Measures of sta…

quant-ph2021★ 59 cited

On the statistical complexity of quantum circuits

Kaifeng Bu, Dax Enshan Koh, Lu Li +2

In theoretical machine learning, the statistical complexity is a notion that measures the richness of a hypothesis space. In this work, we apply a particular measure of statistical…

cs.LG2020★ 6 cited

Depth-Width Trade-offs for Neural Networks via Topological Entropy

Kaifeng Bu, Yaobo Zhang, Qingxian Luo

One of the central problems in the study of deep learning theory is to understand how the structure properties, such as depth, width and the number of nodes, affect the expressivit…