25 citations · 27 across the 6 of their papers we have counts for
6 papers · 1 filter
Modeling Quantum Error Detection with Transition Matrices
Rohan S. Kumar, Ben Foxman, Yongshan Ding
We construct an explicit transition matrix that exactly describes code-adapted basis-population dynamics of stabilizer codes under circuit-level stochastic Pauli noise. The matrix…
Quantum Lazy Sampling and Path Recording for Any Group
Ben Foxman, Alex Lombardi, Fermi Ma +2
A central challenge in quantum algorithms and cryptography is reasoning about algorithms with oracle access to a random group element (e.g. a random function, permutation, or unita…
Efficient Quantum Fourier Transforms For Semisimple Algebras
Ben Foxman, Barak Nehoran, Yongshan Ding
The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we extend the framework for the QFT from finite groups…
Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture
Kun Liu, Ben Foxman, Gian-Luca R. Anselmetti +1
Early modular fault tolerant quantum computers remain constrained by costly inter-module communication and limited magic state factory service. Understanding such bottlenecks and i…
Random Unitaries in Constant (Quantum) Time
Ben Foxman, Natalie Parham, Francisca Vasconcelos +1
Random unitaries are a central object of study in quantum information, with applications to quantum computation, quantum many-body physics, and quantum cryptography. Recent work ha…
Systems Architecture for Quantum Random Access Memory
Shifan Xu, Connor T. Hann, Ben Foxman +2
Operating on the principles of quantum mechanics, quantum algorithms hold the promise for solving problems that are beyond the reach of the best-available classical algorithms. An…