3 citations · 7 across the 10 of their papers we have counts for
Showing 2021 · quant-phShow all
2 papers · 2 filters
quant-ph2021★ 1 cited
Kolmogorov complexity of unitary transformations in quantum computing
Alexei Kaltchenko
We introduce a notion of Kolmogorov complexity of unitary transformation, which can (roughly) be understood as the least possible amount of information required to fully describe a…
quant-ph2021
Classical Complexity of Unitary Transformations
Alexei Kaltchenko
We discuss a classical complexity of finite-dimensional unitary transformations, which can been seen as a computable approximation of classical descriptional complexity of a unitar…