59 citations · 178 across the 9 of their papers we have counts for
9 papers
Wasserstein Complexity of Quantum Circuits
Lu Li, Kaifeng Bu, Dax Enshan Koh +2
Given a unitary transformation, what is the size of the smallest quantum circuit that implements it? This quantity, known as the quantum circuit complexity, is a fundamental proper…
Complexity of quantum circuits via sensitivity, magic, and coherence
Kaifeng Bu, Roy J. Garcia, Arthur Jaffe +2
Quantum circuit complexity-a measure of the minimum number of gates needed to implement a given unitary transformation-is a fundamental concept in quantum computation, with widespr…
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…
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…
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…
Quantifying the resource content of quantum channels: An operational approach
Lu Li, Kaifeng Bu, Zi-Wen Liu
We propose a general method to operationally quantify the resourcefulness of quantum channels via channel discrimination, an important information processing task. A main result is…