Reproduce “Ancilla-free randomized Toffoli gates and the T-count of Boolean oracles” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Arul Rhik Mazumder
The authors give an ancilla-free randomized Toffoli implementation for fault-tolerant quantum computation. Each call samples a fresh circuit that computes parity checks in place on the controls, using idle controls as borrowed work qubits; only the averaged channel approximates Toffoli. At 50 qubits and diamond error 10⁻¹⁰, a branch uses 352 T gates, more than a one-clean-ancilla comparison’s 279.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.