Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

analiza aiqbench

Researchers at Institut d'Optique Graduate School have developed new quantum group codes that reduce error correction decoding time from cubic to quasi-quadratic complexity. This breakthrough significantly lowers computational costs for magic-state distillation and enables parallelizable non-Clifford gates, addressing a critical bottleneck in scaling fault-tolerant quantum processors.
Sursă care acoperăQuantum Zeitgeist
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Institut d’Optique Graduate School: Researchers Develop Quantum Codes for Efficient Non-Clifford Gate Circuits

Quantum Zeitgeist5 min de cititArticolul și perspectiva sunt în engleză.

A decoding time reduced from cubic to quasi-quadratic represents a major step towards practical quantum computation. These new quantum group codes, built upon existing algebraic geometry codes, achieve this speed-up, easing a key bottleneck in building larger, more dependable quantum processors. This improvement also lowers the computational cost of essential protocols like magic-state distillation by nearly a linear factor.

Scientists at the University of Bordeaux, Jean Gasnier and Virgile Guémard, have investigated a new approach to quantum error correction utilising quantum group codes derived from classical quasi-group codes. They demonstrate a framework supporting transversal multi-control-$Z$ gates that are both addressable and parallelizable, enabling efficient implementation of circuits utilising non-Clifford gates. A lifting procedure constructs quantum group codes with improved decoding complexity, featuring a quasi-quadratic time decoder compared to the cubic-time decoders of previous quantum AG codes, and enhanced parallelizability of logical multi-control-$Z$ gates. These advancements promise a near-linear reduction in the time complexity of…

Extras afișat conform termenilor RSS ai publicației · 95 cuvinte · textul integral și figurile sunt pe site-ul publicației

Subiecte conexe