4 citations · 4 across the 3 of their papers we have counts for
3 papers
quant-ph2026
Efficient Classical Simulation of Low-Rank-Width Quantum Circuits Using ZX-Calculus
Fedor Kuyanov, Aleks Kissinger
In this paper, we introduce an algorithm for contracting (i.e. numerically evaluating) ZX-diagrams whose computational complexity is governed by rank-width, a structural graph para…
math.CO2024
Two lower bounds for maximum matching
Fedor Kuyanov
In this paper, we prove two lower bounds for the maximum matching size in an arbitrary undirected graph. Despite their simplicity, these results are not widely known. This article…
math-ph2022★ 4 cited
Feynman checkers: number-theoretic properties
Fedor Kuyanov, Alexey Slizkov
We study Feynman checkers, an elementary model of electron motion introduced by R. Feynman. In this model, a checker moves on a checkerboard, and we count the turns. Feynman checke…