Search Results - "Shutty, Noah"
-
1
Fault-Tolerant Qubit from a Constant Number of Components
Published in PRX quantum (01-12-2021)“…With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major remaining obstacle to useful…”
Get full text
Journal Article -
2
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums
Published in IEEE transactions on information theory (22-08-2024)“…This paper presents two repair schemes for low-rate Reed-Solomon (RS) codes over prime fields that can repair any node by downloading a constant number of bits…”
Get full text
Journal Article -
3
Polynomial identities on eigenforms
Published in Journal of number theory (01-01-2016)Get full text
Journal Article -
4
Tight Limits on Nonlocality from Nontrivial Communication Complexity; a.k.a. Reliable Computation with Asymmetric Gate Noise
Published in 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (01-11-2020)“…It has long been known that the existence of certain superquantum nonlocal correlations would cause communication complexity to collapse. The absurdity of a…”
Get full text
Conference Proceeding -
5
Overcoming leakage in quantum error correction
Published in Nature physics (01-12-2023)“…The leakage of quantum information out of the two computational states of a qubit into other energy states represents a major challenge for quantum error…”
Get full text
Journal Article -
6
Explicit Bounds from the Alon-Boppana Theorem
Published in Experimental mathematics (02-10-2018)“…The purpose of this article is to give explicit methods for bounding the number of vertices of finite k-regular graphs with given second eigenvalue. Let X be a…”
Get full text
Journal Article -
7
Nonlocal Games, Distributed Storage, and Quantum Error Correction: Excursions in Fault-Tolerant Computation
Published 01-01-2022“…In this thesis, we consider three computing systems afflicted by noise, which causes their behavior to deviate unpredictably from idealized theoretical models…”
Get full text
Dissertation -
8
Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories
Published 09-08-2022“…Physical Review Applied 18, 014072 (2022) Universal fault-tolerant quantum computers will require the use of efficient protocols to implement encoded…”
Get full text
Journal Article -
9
Low-bandwidth recovery of linear functions of Reed-Solomon-encoded data
Published 25-01-2022“…We study the problem of efficiently computing on encoded data. More specifically, we study the question of low-bandwidth computation of functions…”
Get full text
Journal Article -
10
Magic state cultivation: growing T states as cheap as CNOT gates
Published 26-09-2024“…We refine ideas from Knill 1996, Jones 2016, Chamberland 2020, Gidney 2023+2024, Bombin 2024, and Hirano 2024 to efficiently prepare good $|T\rangle$ states…”
Get full text
Journal Article -
11
Efficient near-optimal decoding of the surface code through ensembling
Published 22-01-2024“…We introduce harmonization, an ensembling method that combines several "noisy" decoders to generate highly accurate decoding predictions. Harmonized ensembles…”
Get full text
Journal Article -
12
Computing Representations for Lie Algebraic Networks
Published 01-06-2020“…Recent work has constructed neural networks that are equivariant to continuous symmetry groups such as 2D and 3D rotations. This is accomplished using explicit…”
Get full text
Journal Article -
13
Tight Limits on Nonlocality from Nontrivial Communication Complexity; a.k.a. Reliable Computation with Asymmetric Gate Noise
Published 01-05-2023“…It has long been known that the existence of certain superquantum nonlocal correlations would cause communication complexity to collapse. The absurdity of a…”
Get full text
Journal Article -
14
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums
Published 04-02-2024“…This paper presents two repair schemes for low-rate Reed-Solomon (RS) codes over prime fields that can repair any node by downloading a constant number of bits…”
Get full text
Journal Article -
15
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums
Published in 2023 IEEE International Symposium on Information Theory (ISIT) (25-06-2023)“…This paper presents several repair schemes for lowrate Reed Solomon (RS) codes over prime fields that can repair any node by downloading a constant number of…”
Get full text
Conference Proceeding -
16
LUCI in the Surface Code with Dropouts
Published 18-10-2024“…Recently, usage of detecting regions facilitated the discovery of new circuits for fault-tolerantly implementing the surface code. Building on these ideas, we…”
Get full text
Journal Article -
17
Optimization by Decoded Quantum Interferometry
Published 15-08-2024“…We introduce Decoded Quantum Interferometry (DQI), a quantum algorithm for reducing classical optimization problems to classical decoding problems by…”
Get full text
Journal Article -
18
Fault-tolerant qubit from a constant number of components
Published 07-12-2021“…PRX Quantum 2, 040345 (2021) With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major…”
Get full text
Journal Article -
19
Polynomial Identities on Eigenforms
Published 17-12-2014“…In this paper, we fix a polynomial with complex coefficients and determine the eigenforms for SL2(Z) which can be expressed as the fixed polynomial evaluated…”
Get full text
Journal Article -
20
Explicit bounds from the Alon-Boppana theorem
Published 15-09-2017“…The purpose of this paper is to give explicit methods for bounding the number of vertices of finite $k$-regular graphs with given second eigenvalue. Let $X$ be…”
Get full text
Journal Article