3 papers
quant-ph2026
Learning Clifford-structured quantum unitaries and Hamiltonians
Arkopal Dutt, Dale Jacobs, John Jeang +2
Learning algorithms for structured quantum unitaries and Hamiltonians have primarily considered classes of processes that are local or sparse in the Pauli basis. We turn our attent…
cs.FL2024
Complexity Aspects of the Extension of Wagner's Hierarchy to -Partitions
Vladimir Podolskii, Victor Selivanov
It is known that the Wadge reducibility of regular -languages is efficiently decidable (Krishnan et al., 1995), (Wilke, Yoo, 1995). In this paper we study analogous problem for…
cs.CC2024
Nearest Neighbor Complexity and Boolean Circuits
Mason DiCicco, Vladimir Podolskii, Daniel Reichman
A nearest neighbor representation of a Boolean function is a set of vectors (anchors) labeled by or such that if and only if the closest anchor to $\ve…