Related papers: Knuth's non-associative "group" on ${\mathcal P}(\…
To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…
The concept of logarithmic representation of infinitesimal generators is introduced, and it is applied to clarify the algebraic structure of bounded and unbounded infinitesimal generators. In particular, by means of the logarithmic…
Following their resolution of the Erd\H{o}s $B+B+t$ problem, Kra Moreira, Richter, and Robertson posed a number of questions and conjectures related to infinite configurations in positive density subsets of the integers and other amenable…
Quantum information theory is used to analize various non-linear operations on quantum states. The universal disentanglement machine is shown to be impossible, and partial (negative) results are obtained in the state-dependent case. The…
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…
Optimization problems with discrete decisions are nonconvex and thus lack strong duality, which limits the usefulness of tools such as shadow prices and the KKT conditions. It was shown in Burer(2009) that mixed-binary quadratic programs…
In this work, we use tools from non-standard analysis to introduce infinite-dimensional quantum systems and quantum fields within the framework of Categorical Quantum Mechanics. We define a dagger compact category *Hilb suitable for the…
In this paper, we present Clifford+T gates based quantum circuit design of integer division having $n$ ancillary qubits. The proposed quantum circuit is based on restoring division algorithm. The proposed quantum circuit of integer division…
A system of unitary transformations providing two optimal copies of an arbitrary input cubit is obtained. An algorithm based on classical Boolean algebra and allowing one to find any unitary transformation realized by the quantum CNOT…
This is an introduction to algebraic combinatorics, written for a quarter-long graduate course. It starts with a rigorous introduction to formal power series with some combinatorial applications, then discusses integer partitions (proving…
We introduce a coarse algebraic invariant for coarse groups and use it to differentiate various coarsifications of the group of integers. This lets us answer two questions posed by Leitner and the second author. The invariant is obtained by…
A group is irreducibly represented if it has a faithful irreducible unitary representation. For countable groups, a criterion for irreducible representability is given, which generalises a result obtained for finite groups by W. Gasch\"utz…
We propose an approach to optical quantum computation in which a deterministic entangling quantum gate may be performed using, on average, a few hundred coherently interacting optical elements (beamsplitters, phase shifters, single photon…
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…
The semidirect product $\mathbb{G}=\mathbb{L}\rtimes \mathbb{K}$ attached to a compact-group action on a connected, simply-connected solvable Lie group has a dense set of compact elements precisely when the $s\in \mathbb{K}$ operating on…
We investigate near-ring properties that generalize nearfield properties about units. We study zero symmetric near-rings $N$ with identity with two interrelated properties: the units with zero form an additive subgroup of $(N,+)$; the units…
Finite group extensions offer a natural language to quantum computing. In a nutshell, one roughly describes the action of a quantum computer as consisting of two finite groups of gates: error gates from the general Pauli group P and…
We investigate the question of studying spectral clustering in a Hilbert space where the set of points to cluster are drawn i.i.d. according to an unknown probability distribution whose support is a union of compact connected components. We…
We reconstruct the explicit formalism of qubit quantum theory from elementary rules on an observer's information acquisition. Our approach is purely operational: we consider an observer O interrogating a system S with binary questions and…
For all positive integers $n$ and all homotopy modules $M_*$, we define certain operations $\underline{\operatorname{K}}^{\operatorname{MW}}_n \rightarrow M_*$ and show that these generate the $M_*(k)$-module of all (in general…