3 citations · 5 across the 21 of their papers we have counts for
33 papers
Explicit Capacity-Achieving Quantum LDPC Codes List Decodable in Near-linear Time
William Gay, Fernando Granha Jeronimo, Abhi Shukul
In classical coding theory, the quest for explicit codes achieving list decoding capacity has been an important driving force. While random codes are easily shown to achieve capaci…
Quantum List Recovery and Decoding: Achievability and Limitations
Fernando Granha Jeronimo, Xiaojuan Ma
Quantum list recovery (QLR) and quantum list decoding (QLD) seek short lists of logically distinct Pauli corrections consistent with a syndrome and prescribed error constraints. Fo…
From Random Quantum Codes to Explicit qLDPC Codes via Local Properties
Fernando Granha Jeronimo, Xiaojuan Ma, Nikhil Shagrithaya
Constructing explicit codes matching the parameters of random codes has been a central and largely elusive question in coding theory. The quantum setting is even more challenging s…
Stable Regularity Lemmas: Efficient Algorithms and Essentially Tight Littlestone Bounds
Leonardo N. Coregliano, Fernando G. Jeronimo
In this paper, we determine the precise asymptotics of the number of parts of stable regularity equipartitions in terms of the Littlestone dimension: every graph of Littlestone…
Asymptotically Good Quantum Locally Testable Codes
William Gay, Fernando Granha Jeronimo
We construct explicit families of asymptotically good quantum locally testable codes over qubits. More precseily, we construct explicit quantum LDPC CSS codes over qubits having co…
PureSuperQMA(exp) = BellPureSymQMA(poly) = QMA via Dimension-Free Bosonic Argmax
William Gay, Fernando Granha Jeronimo, Lenny Liu +3
Pure-state consistency problems naturally lead to quantum proof systems in which a single pure witness must satisfy many acceptance constraints. The corresponding class $\mathsf{Pu…