English
Related papers

Related papers: Zheghalkin-Boolean Calculus

200 papers

In this paper, we focus on the links between Boolean function theory and quantum computing. In particular, we study the notion of what we call fully-balanced functions and analyse the Fourier--Hadamard and Walsh supports of those functions…

Combinatorics · Mathematics 2024-05-08 Claude Carlet , Ulises Pastor-Díaz , José María Tornero

We describe right-hand skew Boolean algebras in terms of a class of presheaves of sets over Boolean algebras called Boolean sets, and prove a duality theorem between Boolean sets and etale spaces over Boolean spaces.

Category Theory · Mathematics 2013-03-26 Ganna Kudryavtseva , Mark V Lawson

The inequations of the delays of the asynchronous circuits are written, by making use of pseudo-Boolean differential calculus. We consider these efforts to be a possible starting point in the semi-formalized reconstruction of the digital…

Logic in Computer Science · Computer Science 2007-05-23 Serban E. Vlad

We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…

Information Theory · Computer Science 2014-04-11 E. Bellini , I. Simonetti , M. Sala

In the last two decades, many algebras of generalized functions have been constructed, particularly the so-called generalized Sobolev algebras. Our goal is to study the latter and some of their main properties. In this framework, we pose…

Functional Analysis · Mathematics 2016-08-16 Séverine Bernard , Silvère Paul Nuiro

Quasi-Boolean algebras were introduced as the generalization of Boolean algebras in the setting of quantum computation logic. In this paper, we investigate the completeness and congruences of quasi-Boolean algebras. First, we discuss the…

Logic · Mathematics 2025-10-28 Xiaohao Liu , Heyan Wang , Wenjuan Chen

We investigate the Boolean functions with essential arity gap 2. We use Full Conjunctive Normal Forms instead of Zhegalkin's polynomials, which allow us to simplify the proofs and to obtain several combinatorial results, concerning the…

Discrete Mathematics · Computer Science 2008-10-13 Slavcho Shtrakov

Based on Stokes' theorem we derive a non-holomorphic functional calculus for matrices, assuming sufficient smoothness near eigenvalues, corresponding to the size of related Jordan blocks. It is then applied to the complex conjugation…

Functional Analysis · Mathematics 2017-01-31 Olavi Nevanlinna

We describe the construction of quantum gates (unitary operators) from boolean functions and give a number of applications. Both non-reversible and reversible boolean functions are considered. The construction of the Hamilton operator for a…

Mathematical Software · Computer Science 2015-01-05 Yorick Hardy , Willi-Hans Steeb

We develop the foundations of Algebraic Stochastic Calculus, with an aim to replacing what is typically referred to as Stochastic Calculus by a purely categorical version thereof. We first give a sheaf theoretic reinterpretation of…

Algebraic Geometry · Mathematics 2014-07-28 Renaud Gauthier

We develop differential algebraic K-theory for rings of integers in number fields and we construct a cycle map from geometrized bundles of modules over such a ring to the differential algebraic K-theory. We also treat some of the…

K-Theory and Homology · Mathematics 2016-02-09 Ulrich Bunke , David Gepner

Gottesman-Knill theorem states that computations on stabilizer circuits can be simulated on a classical computer, conventional simulation algorithms extensively use linear algebra over bit strings. For instance, given a non-adaptive…

Quantum Physics · Physics 2025-11-10 Vsevolod I. Yashin

In \cite{Koe92}--\cite{Koe93c} the first author published an algorithm for the conversion of analytic functions for which derivative rules are given into their representing power series $\sum\limits_{k=0}^{\infty}a_{k}z^{k}$ at the origin…

Classical Analysis and ODEs · Mathematics 2009-09-25 Wolfram Koepf , Dieter Schmersau

Starting from the Colombeau's full generalized functions, the sharp topologies and the notion of generalized points, we introduce a new kind differential calculus (for functions between totally disconnected spaces). We study generalized…

Classical Analysis and ODEs · Mathematics 2017-06-12 Wagner Cortes , Antonio R. G. Garcia , Severino H. da Silva

Inspired by Solomonoffs theory of inductive inference, we propose a prior based on circuit complexity. There are several advantages to this approach. First, it relies on a complexity measure that does not depend on the choice of UTM. There…

Machine Learning · Computer Science 2023-06-27 Cole Wyeth , Carl Sturtivant

Boole polynomials play an important role in the area of number theory, algebra and umbral calculus. In this paper, we investigate some properties of Boole polynomials and consider Witt-type formulas for the Boole numbers and polynomials.…

Number Theory · Mathematics 2013-10-31 Dae San Kim , Taekyun Kim

Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…

Logic in Computer Science · Computer Science 2013-03-15 Ranjeet Kumar Rout , Pabitra Pal Choudhury , Sudhakar Sahoo

Foundations of the formal series $*$ -- calculus in deformation quantisation are discussed. Several classes of continuous linear functionals over algebras applied in classical and quantum physics are introduced. The notion of nonnegativity…

Quantum Physics · Physics 2019-02-08 Jaromir Tosiek , Michał Dobrski

Functions of several octonion variables are investigated and integral representation theorems for them are proved. With the help of them solutions of the ${\tilde {\partial}}$-equations are studied. More generally functions of several…

Complex Variables · Mathematics 2018-12-18 S. V. Ludkovsky

Most classical results in circuit complexity theory concern circuits over the Boolean domain. Besides their simplicity and the ease of comparing different languages, the actual architecture of computers is also an important motivating…

Computational Complexity · Computer Science 2026-04-24 Piotr Kawałek , Jacek Krzaczkowski