Krenn-Gu conjecture verified for low-connectivity and cubic GHZ graphs; minimal counterexamples must be 4-connected.
Questions on the Structure of Perfect Matchings inspired by Quantum Physics
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We state a number of related questions on the structure of perfect matchings. Those questions are inspired by and directly connected to Quantum Physics. In particular, they concern the constructability of general quantum states using modern photonic technology. For that we introduce a new concept, denoted as inherited vertex coloring. It is a vertex coloring for every perfect matching. The colors are inherited from the color of the incident edge for each perfect matching. First, we formulate the concepts and questions in pure graph-theoretical language, and finally we explain the physical context of every mathematical object that we use. Importantly, every progress towards answering these questions can directly be translated into new understanding in quantum physics.
fields
quant-ph 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Krenn-Gu conjecture for sparse graphs
Krenn-Gu conjecture verified for low-connectivity and cubic GHZ graphs; minimal counterexamples must be 4-connected.