Related papers: Quantum Polymorphisms and the Complexity of Quantu…
An elegant characterization of the complexity of constraint satisfaction problems has emerged in the form of the the algebraic dichotomy conjecture of [BKJ00]. Roughly speaking, the characterization asserts that a CSP {\Lambda} is tractable…
In [1] we initiated an approach towards quantizing the Hamiltonian constraint in Loop Quantum Gravity (LQG) by requiring that it generates an anomaly-free representation of constraint algebra off-shell. We investigated this issue in the…
Constraint Satisfaction Problems (CSPs, for short) make up a class of problems with applications in many areas of computer science. The first classification of these problems was given by Schaeffer who showed that every CSP over the domain…
Quantum signal processing (QSP) is a framework which was proven to unify and simplify a large number of known quantum algorithms, as well as discovering new ones. QSP allows one to transform a signal embedded in a given unitary using…
We give a surprising classification for the computational complexity of the Quantified Constraint Satisfaction Problem over a constraint language $\Gamma$, QCSP$(\Gamma)$, where $\Gamma$ is a finite language over $3$ elements which contains…
There exist two conjectures for constraint satisfaction problems (CSPs) of reducts of finitely bounded homogeneous structures: the first one states that tractability of the CSP of such a structure is, when the structure is a model-complete…
Quantum signal processing (QSP) is a highly successful algorithmic primitive in quantum computing which leads to conceptually simple and efficient quantum algorithms using the block-encoding framework of quantum linear algebra. Multivariate…
A computational problem exhibits a "gap property" when there is no tractable boundary between two disjoint sets of instances. We establish a Gap Trichotomy Theorem for a family of constraint problem variants, completely classifying the…
The universal-algebraic approach has proved a powerful tool in the study of the complexity of CSPs. This approach has previously been applied to the study of CSPs with finite or (infinite) omega-categorical templates, and relies on two…
The paper presents an algebraic framework for optimization problems expressible as Valued Constraint Satisfaction Problems. Our results generalize the algebraic framework for the decision version (CSPs) provided by Bulatov et al. [SICOMP…
The constraint satisfaction problem (CSP) is concerned with homomorphisms between two structures. For CSPs with restricted left-hand side structures, the results of Dalmau, Kolaitis, and Vardi [CP'02], Grohe [FOCS'03/JACM'07], and Atserias,…
Generalized coherent states for shape invariant potentials are constructed using an algebraic approach based on supersymmetric quantum mechanics. We show this generalized formalism is able to: a) supply the essential requirements necessary…
With the growing interest in quantum programs, ensuring their correctness is a fundamental challenge. Although constraint-solving techniques can overcome some limitations of traditional testing and verification, they have not yet been…
In the framework of loop quantum gravity, we define a new Hilbert space of states which are solutions of a large number of components of the diffeomorphism constraint. On this Hilbert space, using the methods of Thiemann, we obtain a family…
We investigate the Constraint Satisfaction Problem (CSP) over templates with a group structure, and algorithms solving CSP that are equivariant, i.e. invariant under a natural group action induced by a template. Our main result is a method…
Valued constraint satisfaction problems (VCSPs) constitute a large class of computational optimization problems. It was shown recently that, over finite domains, every VCSP is in P or NP-complete, depending on the admitted cost functions.…
We study constraint satisfaction problems (CSPs) in the presence of counting quantifiers $\exists^{\geq j}$, asserting the existence of $j$ distinct witnesses for the variable in question. As a continuation of our previous (CSR 2012) paper,…
Quantum algebras (also called quantum groups) are deformed versions of the usual Lie algebras, to which they reduce when the deformation parameter q is set equal to unity. From the mathematical point of view they are Hopf algebras. Their…
Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer's framework in which the Fourier…
The predictions of quantum theory resist generalised noncontextual explanations. In addition to the foundational relevance of this fact, the particular extent to which quantum theory violates noncontextuality limits available quantum…