Noah Shutty
YOU?
Author Swipe
View article: Optimization by decoded quantum interferometry
Optimization by decoded quantum interferometry Open
Achieving superpolynomial speed-ups for optimization has long been a central goal for quantum algorithms1. Here we introduce decoded quantum interferometry (DQI), a quantum algorithm that uses the quantum Fourier transform to re…
View article: Quantum computation of molecular geometry via many-body nuclear spin echoes
Quantum computation of molecular geometry via many-body nuclear spin echoes Open
Quantum-information-inspired experiments in nuclear magnetic resonance spectroscopy may yield a pathway towards determining molecular structure and properties that are otherwise challenging to learn. We measure out-of-time-ordered correlat…
View article: Hamiltonian Decoded Quantum Interferometry
Hamiltonian Decoded Quantum Interferometry Open
We introduce Hamiltonian Decoded Quantum Interferometry (HDQI), a quantum algorithm that utilizes coherent Bell measurements and the symplectic representation of the Pauli group to reduce Gibbs sampling and Hamiltonian optimization to clas…
View article: Scaling and logic in the colour code on a superconducting quantum processor
Scaling and logic in the colour code on a superconducting quantum processor Open
View article: Scaling and logic in the color code on a superconducting quantum processor
Scaling and logic in the color code on a superconducting quantum processor Open
Quantum error correction is essential for bridging the gap between the error rates of physical devices and the extremely low logical error rates required for quantum algorithms. Recent error-correction demonstrations on superconducting pro…
View article: LUCI in the Surface Code with Dropouts
LUCI in the Surface Code with Dropouts Open
Recently, usage of detecting regions facilitated the discovery of new circuits for fault-tolerantly implementing the surface code. Building on these ideas, we present LUCI, a framework for constructing fault-tolerant circuits flexible enou…
View article: Optimization by Decoded Quantum Interferometry
Optimization by Decoded Quantum Interferometry Open
Achieving superpolynomial speedups for optimization has long been a central goal for quantum algorithms. Here we introduce Decoded Quantum Interferometry (DQI), a quantum algorithm that uses the quantum Fourier transform to reduce optimiza…
View article: Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums Open
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 from each surviving node. The total bandwidth resulting from these schemes is g…
View article: Efficient near-optimal decoding of the surface code through ensembling
Efficient near-optimal decoding of the surface code through ensembling Open
We introduce harmonization, an ensembling method that combines several "noisy" decoders to generate highly accurate decoding predictions. Harmonized ensembles of MWPM-based decoders achieve lower logical error rates than their individual c…
View article: Overcoming leakage in quantum error correction
Overcoming leakage in quantum error correction Open
View article: Overcoming leakage in scalable quantum error correction
Overcoming leakage in scalable quantum error correction Open
Leakage of quantum information out of computational states into higher energy states represents a major challenge in the pursuit of quantum error correction (QEC). In a QEC circuit, leakage builds over time and spreads through multi-qubit …
View article: Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories
Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories Open
Universal fault-tolerant quantum computers will require the use of efficient protocols to implement encoded operations necessary in the execution of algorithms. In this work, we show how SMT solvers can be used to automate the construction…
View article: Low-Bandwidth Recovery of Linear Functions of Reed-Solomon-Encoded Data
Low-Bandwidth Recovery of Linear Functions of Reed-Solomon-Encoded Data Open
We study the problem of efficiently computing on encoded data. More specifically, we study the question of low-bandwidth computation of functions F:F^k → F of some data 𝐱 ∈ F^k, given access to an encoding 𝐜 ∈ Fⁿ of 𝐱 under an error correc…
View article: Fault-Tolerant Qubit from a Constant Number of Components
Fault-Tolerant Qubit from a Constant Number of Components Open
With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major remaining obstacle to useful quantum computation is scaling, a challenge greatly amplified by the huge overhe…
View article: Learning Irreducible Representations of Noncommutative Lie Groups
Learning Irreducible Representations of Noncommutative Lie Groups Open
Recent work has constructed neural networks that are equivariant to continuous symmetry groups such as 2D and 3D rotations. This is accomplished using explicit group representations to derive the equivariant kernels and nonlinearities. We …
View article: Tight Limits on Nonlocality from Nontrivial Communication Complexity; a.k.a. Reliable Computation with Asymmetric Gate Noise
Tight Limits on Nonlocality from Nontrivial Communication Complexity; a.k.a. Reliable Computation with Asymmetric Gate Noise Open
It has long been known that the existence of certain superquantum nonlocal correlations would cause communication complexity to collapse. The absurdity of a world in which any nonlocal binary function could be evaluated with a constant amo…
View article: Computing Representations for Lie Algebraic Networks
Computing Representations for Lie Algebraic Networks Open
Recent work has constructed neural networks that are equivariant to continuous symmetry groups such as 2D and 3D rotations. This is accomplished using explicit Lie group representations to derive the equivariant kernels and nonlinearities.…
View article: Noise Thresholds for Amplification: From Quantum Foundations to Classical Fault-Tolerant Computation.
Noise Thresholds for Amplification: From Quantum Foundations to Classical Fault-Tolerant Computation. Open
View article: Reliable Computation by Formulas of Noisy AND Gates and Noiseless XOR Gates, with Applications to Quantum Mechanics
Reliable Computation by Formulas of Noisy AND Gates and Noiseless XOR Gates, with Applications to Quantum Mechanics Open
It has long been known that the existence of certain superquantum nonlocal correlations would cause complexity to collapse. The absurdity of a world in which any nonlocal binary function could be evaluated with a constant amount of in tu…
View article: MiX: a position sensitive dual-phase liquid xenon detector
MiX: a position sensitive dual-phase liquid xenon detector Open
The need for precise characterization of dual-phase xenon detectors has grown as the technology has matured into a state of high efficacy for rare event searches. The Michigan Xenon detector was constructed to study the microphysics of par…
View article: Polynomial identities on eigenforms
Polynomial identities on eigenforms Open