This work implements for the first time all logical operations required for modular fault-tolerant universal quantum computing with a non-Calderbank-Shor-Steane (CSS) code, the perfect $[[5, 1, 3]]$ code, on a trapped-ion quantum computer, and demonstrates the smallest quantum error-correcting (QEC) code capable of cor...
R. Freund, F. Butt, Cesar Benito et al.· 0 citations
Magic-state injection is a standard route to realize universal fault-tolerant quantum computation. Whereas the set of Clifford gates in combination with the non-Clifford T gate is a widely used universal gate set, extending the available set of non-Clifford primitives can reduce compilation overhead, provided that the...
In quantum error correction, fast low-latency decoding is essential for fault-tolerant quantum computation, as delays in processing syndrome data can lead to the backlog problem. Existing decoders, including parallelizable approaches such as Union-Find, begin decoding only after all stabilizer measurement outcomes from...
Tommaso Peduzzi, Lukas Bödeker, M. Müller et al.· 0 citations
A scalable planar trivalent qubit architectures to host a surface-code-based logical quantum processor is proposed and a potential improvement of up to $\approx25\%$ for distance-three is found.
Lukas Bödeker, Luis Colmenarez, S. Blinov et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
