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 aiqbenchScris de un model AI; poate conține erori — verifică sursa.Calcul cuantic

analiza aiqbench

This is a theoretical complexity result, not a hardware or deployment milestone. The protocol proves that a classical verifier can check certain quantum computations beyond the Polynomial Hierarchy, with perfect completeness and soundness error of at most 1/4, but only relative to a classical oracle. Readers should treat it as a step in the theory of verifiable quantum computing, not as evidence that practical classical verification of quantum systems is available.
Surse care acoperăQuantum Zeitgeist, arXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Researchers Verify Quantum Computation Beyond Polynomial Hierarchy

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

A language decidable in quantum polynomial time can now be verified classically with an error rate of just one in four, despite existing outside established limits of interactive proof systems. This verification protocol operates relative to a classical oracle and represents the first demonstration of this kind beyond the Polynomial Hierarchy. Achieving optimality in message count, within a constant factor of any other system for the same language, opens new avenues for exploring classical validation of quantum computation.

A new method exists for verifying quantum computations using a classical computer; certain calculations, decided exactly in quantum time and existing beyond the Polynomial Hierarchy, can be checked by a standard computer with minimal error. This verification protocol uses public communication between the computers and achieves perfect completeness while maintaining soundness error of at most one quarter. A new method details how to classically verify computations performed by quantum computers; specifically it demonstrates that…

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

Subiecte conexe