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

This paper introduces Extended Detector Error Models (EDEMs) to address the runtime challenge of error correction in adaptive, fault-tolerant quantum programs. By enabling detector models to compose across circuit boundaries, the work facilitates symbolic precompilation and connects logical operation design with real-time decoding windows. This advancement is critical for scaling quantum software stacks that rely on dynamic execution paths.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Composing Detector Error Models

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

arXiv:2609.13087v1 Announce Type: new Abstract: Fault-tolerant quantum programs thread together reusable logical operations, yet correcting errors requires comparing measurements across operation boundaries. Correlations tie each operation's error analysis to the computation around it. Adaptive computation makes this a runtime challenge: measurement results determine which operation comes next, so the error analysis must keep pace with execution. We introduce extended detector error models (EDEMs), which compose in sequence and in parallel, mirroring the composition of physical realizations and their detector contracts. We prove how detectors, the measurement parities used to diagnose errors, can be split across circuit boundaries, and establish conditions under which composition recovers the assembled circuit's detector error model. This structure supports symbolic precompilation and analysis of entire families of circuits. It also defines error models for decoding windows and the boundary information through which committed corrections affect subsequent windows. The same interface thus connects the design of individual logical operations to the decoding of an unfolding quantum program.

Abstract:Fault-tolerant quantum programs thread together reusable logical operations, yet correcting errors requires comparing measurements across operation boundaries. Correlations tie each operation's error analysis to the computation around it. Adaptive computation makes this a runtime challenge: measurement results determine which operation comes next, so the error analysis must keep pace with execution. We introduce extended detector error models (EDEMs), which compose in sequence and in parallel, mirroring the composition of physical realizations and their detector contracts. We prove how detectors, the measurement parities used to diagnose errors, can be split across circuit boundaries, and establish conditions under which composition recovers the assembled circuit's detector error model. This structure supports symbolic precompilation and analysis of entire families of circuits. It also defines error models for decoding windows and the boundary information through which committed corrections affect subsequent windows. The same interface thus connects the design of individual logical operations to the decoding of an unfolding quantum program.

arXiv:2609.13087 [quant-ph]

(or arXiv:2609.13087v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.13087 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

induction_step.py

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 247 cuvinte

Subiecte conexe