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 study establishes a fundamental no-go theorem proving that no 2-slot higher-order operation can universally purify single-qubit unitaries under depolarizing noise. The authors demonstrate that a minimal 3-slot parallel architecture is required to achieve non-trivial purification, utilizing ancillary qubits as quantum memory to absorb errors and surpass trivial strategies. These findings define strict theoretical boundaries for robust gate design and offer immediate architectural insights for mitigating dynamic errors in noisy quantum hardware.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Distilling Unitary Operations: A No-Go Theorem and Minimal Realization

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

arXiv:2604.01048v2 Announce Type: replace Abstract: Quantum gates executed on physical hardware are inevitably degraded by environmental noise. While state purification effectively distills static quantum resources, the dynamic execution of quantum algorithms requires a higher-order approach to mitigate errors on the operations themselves. In this work, we investigate universal unitary purification: the task of utilizing a quantum higher-order operation to partially restore the ideal action of an unknown unitary corrupted by a known noise model. Focusing on canonical depolarizing noise, we first reveal a fundamental operational obstruction. We prove that within the indefinite causal order framework, no nontrivial 2-slot higher-order operation can universally purify the set of single-qubit unitaries. Overcoming this strict limitation, we establish that a 3-slot parallel architecture provides the minimal realization for non-trivial purification. We analytically derive the optimal average fidelity within the parallel 3-slot class, demonstrating that it strictly surpasses trivial strategies by systematically utilizing ancillary qubits as a quantum memory to absorb errors. Furthermore, we provide a concrete quantum circuit construction attaining this parallel optimum. Our results establish the strict theoretical boundaries of distilling clean operations from noisy gates, offering immediate architectural insights for robust gate design.

Abstract:Quantum gates executed on physical hardware are inevitably degraded by environmental noise. While state purification effectively distills static quantum resources, the dynamic execution of quantum algorithms requires a higher-order approach to mitigate errors on the operations themselves. In this work, we investigate universal unitary purification: the task of utilizing a quantum higher-order operation to partially restore the ideal action of an unknown unitary corrupted by a known noise model. Focusing on canonical depolarizing noise, we first reveal a fundamental operational obstruction. We prove that within the indefinite causal order framework, no nontrivial 2-slot higher-order operation can universally purify the set of single-qubit unitaries. Overcoming this strict limitation, we establish that a 3-slot parallel architecture provides the minimal realization for non-trivial purification. We analytically derive the optimal average fidelity within the parallel 3-slot class, demonstrating that it strictly surpasses trivial strategies by systematically utilizing ancillary qubits as a quantum memory to absorb errors. Furthermore, we provide a concrete quantum circuit construction attaining this parallel optimum. Our results establish the strict theoretical boundaries of distilling clean operations from noisy gates, offering immediate architectural insights for robust gate design.

12 pages, 5+2 figures. Comments are welcome

arXiv:2604.01048 [quant-ph]

(or arXiv:2604.01048v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2604.01048 Focus to learn more arXiv-issued DOI via DataCite

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 · 282 cuvinte

Subiecte conexe