activity
20232026
most citedConstant-Overhead Magic State Distillation

4 citations · 8 across the 13 of their papers we have counts for

collaborators

15 papers

quant-ph2026

Symmetry and AI-assisted discovery of magic-state factories

Shubham P. Jain, Adam Wills, Shraddha Singh

Magic-state distillation is a major resource cost in fault-tolerant quantum computing. The cost of a magic-state factory depends strongly on its failure rate, which grows with the…

quant-ph2026

Classification of Generalised Triorthogonal Codes through Length 54

Adam Wills, Shubham P. Jain, Shraddha Singh

Magic state distillation is a widely considered primitive in fault-tolerant quantum computation for the preparation of high-fidelity non-Clifford resources. The most commonly consi…

quant-ph2026

Improved Quantum Codes with Transversal T Gates

Adam Wills

In this work, we study quantum CSS codes with transversal gates. Here, gate transversality is meant in the strongest sense; the application of physical to every physica…

quant-ph2026

Magic State Distillation via Codes over Binary Extension Fields

Anqi Gong, Christopher A. Pattison, Patrick Rall +1

Fault-tolerant quantum computation architectures are frequently bottlenecked by the overhead of producing high-fidelity magic states. In this work, we use algebraic geometric techn…

quant-ph2026

Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes

Adam Wills, Michael E. Beverland, Lev S. Bishop +4

Different quantum error correction schemes trade off overhead, error suppression, and hardware connectivity. Code concatenation can relax these tradeoffs by using an outer code who…

quant-ph2026

Forced Gap Post-Selection for Quantum LDPC Codes and their Operations

Adam Wills, Theodore J. Yoder, Isaac Chuang

We develop a simple and general post-selection strategy for high-rate quantum codes that is transferrable across decoders. After an initial baseline run, the decoder is re-run once…

quant-ph2026

A Review of Galois Qudits

Adam Wills

Galois qudits are -dimensional quantum systems whose choice of Pauli group encodes the arithmetic of some finite field . They differ from the more familiar modular…

quant-ph2026

Linear-Time Encodable and Decodable Quantum Error-Correcting Codes

Adam Wills, Ting-Chun Lin, Rachel Yun Zhang +1

Recent years have seen rapid development in the subject of quantum coding theory, with breakthroughs on many exciting classes of codes, including quantum LDPC codes, quantum locall…

quant-ph2024★ 2 cited

Almost Linear Decoder for Optimal Geometrically Local Quantum Codes

Quinten Eggerickx, Adam Wills, Ting-Chun Lin +2

Geometrically local quantum codes, which are error correction codes embedded in with checks acting only on qubits within a fixed spatial distance, have garnered sign…

quant-ph2024★ 4 cited

Constant-Overhead Magic State Distillation

Adam Wills, Min-Hsiu Hsieh, Hayata Yamasaki

Magic state distillation is a crucial yet resource-intensive process in fault-tolerant quantum computation. The protocol's overhead, defined as the number of input magic states req…

quant-ph2023

Efficient Algorithms for All Port-Based Teleportation Protocols

Adam Wills, Min-Hsiu Hsieh, Sergii Strelchuk

Port-based teleportation (PBT) is a form of quantum teleportation in which no corrective unitary is required on the part of the receiver. Two primary regimes exist - deterministic…

quant-ph2023★ 1 cited

Geometrically Local Quantum and Classical Codes from Subdivision

Ting-Chun Lin, Adam Wills, Min-Hsiu Hsieh

A geometrically local quantum code is an error correcting code situated within , where the checks only act on qubits within a fixed spatial distance. The main questio…

quant-ph2023

Tradeoff Constructions for Quantum Locally Testable Codes

Adam Wills, Ting-Chun Lin, Min-Hsiu Hsieh

In this work, we continue the search for quantum locally testable codes (qLTCs) of new parameters by presenting three constructions that can make new qLTCs from old. The first anal…

quant-ph2023

Generalised Coupling and An Elementary Algorithm for the Quantum Schur Transform

Adam Wills, Sergii Strelchuk

The quantum Schur transform is a fundamental building block that maps the computational basis to a coupled basis consisting of irreducible representations of the unitary and symmet…

quant-ph2023★ 1 cited

General Distance Balancing for Quantum Locally Testable Codes

Adam Wills, Ting-Chun Lin, Min-Hsiu Hsieh

In this paper, we prove a lower bound on the soundness of quantum locally testable codes under the distance balancing construction of Evra et al. arXiv:2004.07935 [quant-ph]. Our t…