相关论文: Constraint Qualification for Generic Parameter Fam…

Previous work has suggested that the structural restrictions of graphs from classes of bounded expansion--locally dense pockets in a globally sparse graph--naturally coincide with common properties of real-world networks such as clustering…

Consider (analytic, resp. algebraic) map-germs, Maps((k^n,o),(k^m,o)). These germs are traditionally studied up to the right, let-right and contact equivalences. Below G is one of these groups. An important tool in this study is the Artin…

Competency Questions (CQs) are pivotal in knowledge engineering, guiding the design, validation, and testing of ontologies. A number of diverse formulation approaches have been proposed in the literature, ranging from completely manual to…

In this paper, we apply the theory of cluster algebras to study minimal affinizations for the quantum affine algebra of type $F_4$. We show that the $q$-characters of a large family of minimal affinizations of type $F_4$ satisfy a system of…

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…

Quantum computing (QC) promises theoretical advantages, benefiting computational problems that would not be efficiently classically simulatable. However, much of this theoretical speedup depends on the quantum circuit design solving the…

Constraint satisfaction problems (CSPs) consist of a set of variables taking values from some finite domain and a set of local constraints on these variables. The objective is to find an assignment to the variables that maximizes the…

We consider the Mathematical Program with Complementarity Constraints (MPCC). One of the main challenges in solving this problem is the systematic failure of standard Constraint Qualifications (CQs). Carefully accounting for the…

Assuming the polynomial hierarchy is infinite, we prove a sufficient condition for determining if uniform and polynomial size quantum circuits over a non-universal gate set are not efficiently classically simulable in the weak…

Let $D$, called the domain, be a fixed finite set and let $\Gamma$, called the valued constraint language, be a fixed set of functions of the form $f:D^m\to\mathbb{Q}\cup\{\infty\}$, where different functions might have different arity $m$.…

We show that certain extensions of classifiable C*-algebra are strongly classified by the associated six-term exact sequence in K-theory together with the positive cone of K_{0}-groups of the ideal and quotient. We apply our result to give…

Constraint programming (CP) is a paradigm used to model and solve constraint satisfaction and combinatorial optimization problems. In CP, problems are modeled with constraints that describe acceptable solutions and solved with backtracking…

This is the fourth paper in our series of five in which we test the Master Constraint Programme for solving the Hamiltonian constraint in Loop Quantum Gravity. We now move on to free field theories with constraints, namely Maxwell theory…

We consider some classical and quantum approximate optimization algorithms with bounded depth. First, we define a class of "local" classical optimization algorithms and show that a single step version of these algorithms can achieve the…

Many applications in quantum simulation, quantum chemistry, and quantum machine learning require not a single quantum state but an ensemble of states characterizing the heterogeneity of a target system. Preparing such ensembles…

Several quantum algorithms for linear algebra problems, and in particular quantum machine learning problems, have been "dequantized" in the past few years. These dequantization results typically hold when classical algorithms can access the…

We develop theory of multiplicity maps for compact quantum groups, as an application, we obtain a complete classification of right coideal $C^*$-algebras of $C(SU_q(2))$ for $q\in [-1,1]\setminus \{0\}$. They are labeled with Dynkin…

The adeptness of Large Language Models (LLMs) in comprehending and following natural language instructions is critical for their deployment in sophisticated real-world applications. Existing evaluations mainly focus on fragmented…

Generalized quantum master equations (GQMEs) are an important tool in modeling chemical and physical processes. For a large number of problems it has been shown that exact and approximate quantum dynamics methods can be made dramatically…

We introduce the concept of quantum polymorphisms to the complexity theory of quantum constraint satisfaction. Via this notion, we build an algebraic framework of reductions between quantum CSPs, and we establish a Galois connection between…