Related papers: Circuit equivalence in 2-nilpotent algebras

An A-infinity algebra is a generalization of a associative algebra, and an L-infinity algebra is a generalization of a Lie algebra. In this paper, we show that an L-infinity algebra with an invariant inner product determines a cycle in the…

We define a problem "exact non-identity check": Given a classical description of a quantum circuit with an ancilla system, determine whether it is strictly equivalent to the identity or not. We show that this problem is NQP-complete. In a…

For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is…

A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…

Verifying equivalence between two quantum circuits is a hard problem, that is nonetheless crucial in compiling and optimizing quantum algorithms for real-world devices. This paper gives a Turing reduction of the (universal) quantum circuits…

One of the central questions of universal algebraic geometry is: when two algebras have the same algebraic geometry? There are various interpretations of the sentence "Two algebras have the same algebraic geometry". One of these is…

We make a start on one of George McNulty's Dozen Easy Problems: "Which finite automatic algebras are dualizable?" We give some necessary and some sufficient conditions for dualizability. For example, we prove that a finite automatic algebra…

A differential algebra of finite type over a field k is a filtered algebra A, such that the associated graded algebra is finite over its center, and the center is a finitely generated k-algebra. The prototypical example is the algebra of…

A basic fact taught in undergraduate algebra courses is that every finite nilpotent group is a direct product of $p$-groups. Already Bruck observed that this does not generalize to loops. In particular, there exist nilpotent loops of size…

The calculus of classes and closure operations has proved to be a useful tool in group theory and has led to a deep theory in the study of finite soluble groups. More recently, parallel theories have started to be developed in various…

This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…

We prove that algebraic isomorphisms between limit algebras are automatically continuous, and consider consequences of this result. In particular, we give partial solutions to a conjecture of Power [Limit Algebras, Longman, 1992, Notes to…

In a recent preprint by Deutsch et al. [1995] the authors suggest the possibility of polynomial approximability of arbitrary unitary operations on $n$ qubits by 2-qubit unitary operations. We address that comment by proving strong lower…

We discuss the infinite dimensional algebras appearing in integrable perturbations of conformally invariant theories, with special emphasis in the structure of the consequent non-abelian infinite dimensional algebra generalizing $W_\infty$…

Let $A$ be a Nakayama algebra. We give a description of the singularity category of $A$ inside its stable module category. We prove that there is a duality between the singularity category of $A$ and the singularity category of its opposite…

In this paper we compute the cohomology of certain special cases of nilpotent algebras in a complex \zt-graded vector space of arbitrary finite dimension. These algebras are generalizations of the only two nontrivial complex 2-dimensional…

Implementing Boolean functions with circuits consisting of logic gates is fundamental in digital computer design. However, the implemented circuit must be exactly equivalent, which hinders generative neural approaches on this task due to…

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…

In this paper we classify up to affine equivalence all local tube realizations of real hyperquadrics in C^n. We show that this problem can be reduced to the classification, up to isomorphism, of commutative nilpotent real and complex…

Supernilpotence is a generalization of nilpotence using a recently developed theory of higher-arity commutators for universal algebras. Many important structural properties have been shown to be associated with supernilpotence, and the…