4 citations · 7 across the 5 of their papers we have counts for
6 papers
Non-Clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum LDPC codes via higher symmetries
Guanyu Zhu, Shehryar Sikander, Elia Portnoy +2
We study parallel fault-tolerant quantum computing for families of homological quantum low-density parity-check (LDPC) codes defined on 3-manifolds with constant or almost-constant…
On Freedman's link packings
Fedor Manin, Elia Portnoy
Recently, Freedman [arXiv:2301.00295] introduced the idea of packing a maximal number of links into a bounded region subject to geometric constraints, and produced upper bounds on…
Local Quantum Codes from Subdivided Manifolds
Elia Portnoy
For , we demonstrate the existence of quantum codes which are local in dimension with qubits, distance , and dimension , up t…
A Generalized Isoperimetric Inequality via Thick Embeddings of Graphs
Elia Portnoy
We prove a generalized isoperimetric inequality for a domain diffeomorphic to a sphere that replaces filling volume with -dilation. Suppose is an open set in …
A note on Kalai's Conjecture
Gregory R. Chambers, Elia Portnoy
Suppose that is a centrally symmetric -dimensional convex polytope; in 1989 Kalai conjectured that has at least facets. We prove this result if there are hyper…
Thick embeddings of graphs into symmetric spaces via coarse geometry
Benjamin Barrett, David Hume, Larry Guth +1
We prove estimates for the optimal volume of thick embeddings of finite graphs into symmetric spaces, generalising results of Kolmogorov-Barzdin and Gromov-Guth for embeddings into…