Related papers: Knuth's non-associative "group" on ${\mathcal P}(\…
The notion of a KU-valued function on a set is introduced and related properties are investigated. Codes generated by KU-valued functions are established. Moreover, we will provide an algorithm which allows us to find a KU-algebra starting…
Toeplitz quantization is defined in a general setting in which the symbols are the elements of a possibly non-commutative algebra with a conjugation and a possibly degenerate inner product. We show that the quantum group $SU_q(2)$ is such…
We consider a somehow peculiar Token/Bucket problem which at first sight looks confusing and difficult to solve. The winning approach to solve the problem consists in going back to the simple and traditional methods to solve computer…
We describe a technique for quantum information processing based on localized en sembles of nuclear spins. A qubit is identified as the presence or absence of a collective excitation of a mesoscopic ensemble of nuclear spins surrounding a…
The whole enterprise of spin compositions can be recast as simple enumerative combinatoric problems. We show here that enumerative combinatorics (EC)\citep{book:Stanley-2011} is a natural setting for spin composition, and easily leads to…
We present a novel, universal description of quantum entanglement using group theory and generalized characteristic functions. It leads to new reformulations of the separability problem, and the positivity of partial transpose (PPT)…
Let $(W,S)$ be a Coxeter system, and write $S=\{s_i:i\in I\}$, where $I$ is a finite index set. Fix a nonempty convex subset $\mathscr{L}$ of $W$. If $W$ is of type $A$, then $\mathscr{L}$ is the set of linear extensions of a poset, and…
We collect and organise known results and add some new ones of the following nature: if A is a bounded operator in a Hilbert or Banach space, does there exist a nonconstant polynomial p(z) such that p(A) is "simpler", "nicer" than A. The…
Quantization based model compression serves as high performing and fast approach for inference that yields models which are highly compressed when compared to their full-precision floating point counterparts. The most extreme quantization…
At present an algebra of strongly interacting fields is unknown. In this paper it is assumed that the operators of strongly nonlinear field can form a non-associative algebra. It is shown that such algebra can be described as an algebra of…
Using the classic two's complement notation of signed integers, the fundamental arithmetic operations of addition, subtraction, and multiplication are identical to those for unsigned binary numbers. We introduce a Fibonacci-equivalent of…
We study the possibility for a global unitary applied on an arbitrary number of qubits to be decomposed in a sequential unitary procedure, where an ancillary system is allowed to interact only once with each qubit. We prove that sequential…
Computational Group Theory is applied to indexed objects (tensors, spinors, and so on) with dummy indices. There are two groups to consider: one describes the intrinsic symmetries of the object and the other describes the interchange of…
This is a survey of several exciting recent results in which techniques originating in the area known as additive combinatorics have been applied to give results in other areas, such as group theory, number theory and theoretical computer…
These lecture notes are intended as an introduction to the theory of rational Dunkl operators and the associated special functions, with an emphasis on positivity and asymptotics. We start with an outline of the general concepts: Dunkl…
In the work we discuss the benefit of using bitwise operations in programming. Some interesting examples in this respect have been shown. What is described in detail is an algorithm for sorting an integer array with the substantial use of…
Quantum Hamiltonians containing nonseparable products of non-commuting operators, such as $\hat{\bf x}^m \hat{\bf p}^n$, are problematic for numerical studies using split-operator techniques since such products cannot be represented as a…
We give an elementary introduction to the notion of quantum entanglement between distinguishable parties and review a recent proposal about solid state quantum computation with spin-qubits in quantum dots. The indistinguishable character of…
Quantum computing for machine learning attracts increasing attention and recent technological developments suggest that especially adiabatic quantum computing may soon be of practical interest. In this paper, we therefore consider this…
We present an improvement of the interacting string bit theory proposed in hep-th/0206059, designed to reproduce the non-planar perturbative amplitudes between BMN operators in N=4 gauge theory. Our formalism incorporates the effect of…