On balanced sets of binary vectors
From MaRDI portal
Publication:6399540
arXiv2205.09222MaRDI QIDQ6399540FDOQ6399540
Authors: Claude Carlet, Ulises Pastor-Díaz, José María Tornero 
Publication date: 18 May 2022
Abstract: In this paper we present a combinatorial problem, in the context of binary vector spaces, with a simple setup and definition, but that becomes very interesting and complex when further analysing it: the problem of finding the balancing and constant sets of a given set of vectors. To get some information in this problem we use techniques from linear algebra and combinatorics, proving that many of the desired properties appear when the studied sets have some kind of linear or affine structure. One of these properties, which we study in detail, is that of fully balanced sets. The interest of this property arises from its applications to some problems in quantum computing, more specifically in the development of generalizations of the phase kick--back technique.
This page was built for publication: On balanced sets of binary vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6399540)
