Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This paper refines the theoretical framework for identifying quantum gates by re-evaluating state texture within a broader family of resource theories. By establishing fixed-point instances for coherence, purity, and other resources, it clarifies monotonicity properties essential for characterizing non-classical features in universal circuits without relying on specific computational shortcuts. These advances deepen our understanding of the fundamental limits and measures required to distinguish genuine quantum operations from single-qubit noise or classical simulation.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Re-examining the Role of State Texture in Gate Identification and Fixed-Point Resource Theories

arXiv3 min read

arXiv:2602.22496v2 Announce Type: replace Abstract: A protocol for identifying controlled-NOT (CNOT) gates versus single-qubit-only gates in universal quantum circuits using randomized input states was recently shown to be intimately connected to the quantum resource of state texture. Here we revisit this gate identification protocol and demonstrate that a more general fidelity-based formulation succeeds for nearly all laboratory bases. We then examine a broader family of quantum resource theories, where a distinct resource theory can be defined for each choice of reference pure state, establishing core resource-theoretic requirements without the computational shortcut offered by the "grand sum" employed in the original formulation of state texture. By extending from single "resourceless" states to convex sets via a convex-roof construction, we recover single-qubit measures of known resource theories such as imaginarity and coherence. Finally, we introduce a family of "fixed-point resource theories" that includes fixed-point instances of the theories of state texture, genuine coherence, purity, and athermality. For these fixed-point resource theories we show that, under free operations, the fidelity-based lower bound is weakly monotonic, while specific violations of strong monotonicity are found for the convex-roof logarithmic measure.

Abstract:A protocol for identifying controlled-NOT (CNOT) gates versus single-qubit-only gates in universal quantum circuits using randomized input states was recently shown to be intimately connected to the quantum resource of state texture. Here we revisit this gate identification protocol and demonstrate that a more general fidelity-based formulation succeeds for nearly all laboratory bases. We then examine a broader family of quantum resource theories, where a distinct resource theory can be defined for each choice of reference pure state, establishing core resource-theoretic requirements without the computational shortcut offered by the "grand sum" employed in the original formulation of state texture. By extending from single "resourceless" states to convex sets via a convex-roof construction, we recover single-qubit measures of known resource theories such as imaginarity and coherence. Finally, we introduce a family of "fixed-point resource theories" that includes fixed-point instances of the theories of state texture, genuine coherence, purity, and athermality. For these fixed-point resource theories we show that, under free operations, the fidelity-based lower bound is weakly monotonic, while specific violations of strong monotonicity are found for the convex-roof logarithmic measure.

arXiv:2602.22496 [quant-ph]

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

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

https://doi.org/10.1103/83pf-837s Focus to learn more DOI(s) linking to related resources

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.

Full text under the publisher's open licence · 279 words

Related coverage