1 citations · 2 across the 3 of their papers we have counts for
5 papers · 1 filter
Single-shot magic state factories for quantum LDPC codes
Varun Menon, Rohan Mehta, Andi Gu +8
Quantum low-density parity-check (qLDPC) codes can substantially reduce the qubit overhead of fault-tolerant quantum computation, but any useful architecture based on such codes al…
The practical cost of magic state cultivation
Rohan Mehta, Varun Menon, Hengyun Zhou +2
Magic state cultivation is a promising method for preparing high-fidelity non-Clifford resource states - a central component of fault-tolerant quantum computing - with low spacetim…
Efficient Logic with Ultra-High-Rate Quantum Codes
Nishad Maskara, Rohan Mehta, Zhiyang He +4
Quantum low-density parity-check (qLDPC) codes offer a promising route to reducing the qubit overhead of fault tolerance, with recent ultra-high-rate constructions achieving encodi…
Efficient fidelity simulation of high-rate magic distillation circuits
Xiao Xiao, Dominik Hangleiter, J. Pablo Bonilla Ataides +4
Non-Clifford gates are essential for avoiding classical simulability under the Gottesman-Knill theorem. An error-corrected circuit with non-Clifford gates will therefore be an impo…
Strategic Plan for Neutral Atom Quantum Computation
Adrian J. Menssen, Tout Wang, Michael Gullans +53
We present a strategic plan for neutral atom quantum computation, bringing together hardware development and theory advancements to achieve the goal of practical quantum advantage.…