A graph has a quantum perfect matching exactly when its line graph has a maximal projective packing, giving a new quantum graph property with combinatorial characterizations and an open hypergraph case.
Cameron, Ashley Montanaro, Michael W
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum Perfect Matchings
A graph has a quantum perfect matching exactly when its line graph has a maximal projective packing, giving a new quantum graph property with combinatorial characterizations and an open hypergraph case.