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 research identifies the Quad-$C_5$ graph as the optimal configuration for maximizing contextuality gaps in quantum systems, offering a more efficient test than existing benchmarks like the Wagner graph. By structuring measurements into four overlapping pentagons, this approach bridges minimal qutrit tests with stronger validations achievable in higher-dimensional systems. The findings advance foundational quantum mechanics by providing a compact framework for detecting non-classical behavior with fewer experimental constraints.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

The Quad-$C_5$ Graph: Maximum Contextuality Gap on Eight Vertices

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

arXiv:2605.12828v3 Announce Type: replace Abstract: Quantum measurements can exhibit contextuality: their outcomes cannot always be explained by assigning pre-existing values that are independent of which compatible measurements are performed together. The Klyachko-Can-Binicio\u{g}lu-Shumovsky (KCBS) inequality provides the canonical minimal test of this effect for a single three-level quantum system, or qutrit, using five measurement events arranged as a pentagon. Here we ask whether a larger but still compact set of measurement events can produce a stronger separation between quantum predictions and the corresponding noncontextual limit. We perform an exhaustive search over all 11,117 connected non-isomorphic graphs with eight vertices, where each vertex represents a measurement event and edges connect pairs of events that cannot occur together. We identify a sparse ten-edge graph, which we call Quad-$C_5$, as the unique maximizer of this separation at the reported numerical precision. The graph can be understood as four overlapping KCBS pentagons, with every edge shared by two pentagons. Quad-$C_5$ already demonstrates contextuality in a qutrit, for which we obtain an exact analytical result and find the same violation above the noncontextual bound as in the original KCBS test. The larger quantum-noncontextual separation allowed by the graph, however, becomes accessible in a four-level quantum system, where numerical optimization reaches the full graph-theoretic quantum bound and yields a larger contextuality gap than the standard eight-vertex Wagner-graph benchmark while requiring fewer pairwise constraints. Quad-$C_5$ therefore provides a compact connection between minimal qutrit contextuality and stronger contextuality tests available in higher-dimensional quantum systems.

Abstract:Quantum measurements can exhibit contextuality: their outcomes cannot always be explained by assigning pre-existing values that are independent of which compatible measurements are performed together. The Klyachko-Can-Binicioğlu-Shumovsky (KCBS) inequality provides the canonical minimal test of this effect for a single three-level quantum system, or qutrit, using five measurement events arranged as a pentagon. Here we ask whether a larger but still compact set of measurement events can produce a stronger separation between quantum predictions and the corresponding noncontextual limit. We perform an exhaustive search over all 11,117 connected non-isomorphic graphs with eight vertices, where each vertex represents a measurement event and edges connect pairs of events that cannot occur together. We identify a sparse ten-edge graph, which we call Quad-$C_5$, as the unique maximizer of this separation at the reported numerical precision. The graph can be understood as four overlapping KCBS pentagons, with every edge shared by two pentagons. Quad-$C_5$ already demonstrates contextuality in a qutrit, for which we obtain an exact analytical result and find the same violation above the noncontextual bound as in the original KCBS test. The larger quantum-noncontextual separation allowed by the graph, however, becomes accessible in a four-level quantum system, where numerical optimization reaches the full graph-theoretic quantum bound and yields a larger contextuality gap than the standard eight-vertex Wagner-graph benchmark while requiring fewer pairwise constraints. Quad-$C_5$ therefore provides a compact connection between minimal qutrit contextuality and stronger contextuality tests available in higher-dimensional quantum systems.

arXiv:2605.12828 [quant-ph]

(or arXiv:2605.12828v3 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2605.12828 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 · 329 cuvinte

Subiecte conexe