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 also requires an efficient mechanism to implement non-Clifford gates in a fault-tolerant manner. We introduce a space-time-efficient magic sta...
Varun Menon, Rohan Mehta, An-Di Gu et al.· 2 citations
Fast and parallel logical computation methods for ultra-high-rate quantum codes are developed, revealing a tradeoff between logical control and the spacetime resources required for fault tolerance and highlighting the crucial role structured parallelism plays in reducing overhead.
N. Maskara, Rohan Mehta, Zhiyang He et al.· 2 citations· ⚡1
This work develops and analyzes principles for exploring this design space, and uses them to design compact code constructions with improved performance, and develops symmetry-informed strategies for identifying low-weight logical bases.
Jong-Ye-On Lee, K. Okada, N. Maskara et al.· 9 citations
It is demonstrated that matrix product state (MPS) techniques can handle many QEC circuits exactly and without restriction on gate types, and it is found that MPS efficiency depends sensitively on implementation choices.
A. Orioli, Chen Zhao, G. Masella et al.· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.