Knowledge Graph

Graph explorer

Search resolved entities, walk their edges, and read the sentence behind every one.

Entities25 of 207,987

Entity

Lehmer code

technology1 mentionslast seen Oct 15, 2026

Permutation encoding that labels every tour and requires only ⌈log₂(N-1)!⌉ qubits without penalty terms.

Relationships 1

variational quantum Kolmogorov-Arnold networkdepends onLehmer code85% confidence1 source

Relationship

variational quantum Kolmogorov-Arnold networkdepends onLehmer code

85% confidence1 supporting mentions

Either name opens that entity’s relationships.

Sources 1

preprintarXivOct 14, 2026Solving the traveling salesman problem on $\lceil \log_2 (N-1)! \rceil$ qubits with a variational quantum Kolmogorov--Arnold network: exact-gradient CVaR training and generalization over time-dependent graphs
Permutation encodings that label every tour by its Lehmer code need only $\lceil \log_2 (N-1)! \rceil$ qubits and no penalty term, but variational solvers on them... A variational quantum Kolmogorov--Arnold network (VQKAN)