The paper introduces an eigenvalue-based graph rewiring algorithm, QFERN, to optimize bottlenecks in quantum DAGs, but the derivation is flawed and the result is not substantiated.
Lov ´asz, Random walks on graphs: A survey, Combinatorics, Paul Erd˝os I, Keszthely
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.QA 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Optimization of Bottlenecks in Quantum Graphs Guided by Fiedler Vector-Based Spectral Derivatives
The paper introduces an eigenvalue-based graph rewiring algorithm, QFERN, to optimize bottlenecks in quantum DAGs, but the derivation is flawed and the result is not substantiated.