W-state graphs are precisely the matching-covered graphs with specific half-edge colorings whose 3-connected components are W-cones, enabling efficient recognition and ruling out simple graphs.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2roles
background 1polarities
background 1representative citing papers
Demonstrates Bell nonclassicality for path-identity-based interference in PDC processes by violating Clauser-Horne inequality via on-off switching of local processes, unlike phase-shift settings which admit a local realistic model.
citing papers explorer
-
W-state graphs: Structure and Algorithms
W-state graphs are precisely the matching-covered graphs with specific half-edge colorings whose 3-connected components are W-cones, enabling efficient recognition and ruling out simple graphs.
-
Unquestionable Bell theorem for interwoven frustrated down conversion processes
Demonstrates Bell nonclassicality for path-identity-based interference in PDC processes by violating Clauser-Horne inequality via on-off switching of local processes, unlike phase-shift settings which admit a local realistic model.