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 ETH Zurich and MIT have introduced a quasilinear quantum computation verifier that allows classical computers to validate quantum results with resources scaling linearly rather than exponentially. This breakthrough relies on the Learning With Errors assumption and enables practical remote verification of BQP-class computations without fully trusting the quantum hardware. The advancement significantly lowers the barrier for delegating complex quantum tasks to untrusted devices while maintaining rigorous mathematical guarantees.
Sursă care acoperăQuantum Zeitgeist
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Researchers Build Quasilinear Quantum Computation Verifier

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

Delegating quantum computations previously demanded verifier resources that grew exponentially with circuit size. Now, verifiable computation within BQP achieves total resource requirements scaling linearly with gate count ‘g’, specifically O(poly(λ, log g) · g). This advance enables practical remote verification using only classical communication and relies on the established learning with errors assumption.

Can a classical computer reliably check computations performed on a quantum processor without fully trusting that processor? Researchers at ETH Zurich and MIT have now created the first argument system enabling such verification within the BQP complexity class; it allows a standard computer to confirm calculations carried out by a single quantum prover. This new system establishes verifiable delegation of quantum circuits, requiring computational resources which scale linearly with circuit size, a significant improvement over previous methods. Researchers…

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

Subiecte conexe