Related papers: Quantum Polymorphisms and the Complexity of Quantu…
We explain why, in a configuration space that is multiply connected, i.e., whose fundamental group is nontrivial, there are several quantum theories, corresponding to different choices of topological factors. We do this in the context of…
In the Constraint Satisfaction Problem (CSP for short) the goal is to decide the existence of a homomorphism from a given relational structure $G$ to a given relational structure $H$. If the structure $H$ is fixed and $G$ is the only input,…
Contextuality is a fundamental non-classical property of quantum theory, which has recently been proven to be a key resource for achieving quantum speed-ups in some leading models of quantum computation. However, which of the forms of…
Let $Q$ be a finite acyclic valued quiver. We define a bialgebra structure and an integration map on the Hall algebra associated to the morphism category of projective representations of $Q$. As an application, we recover the surjective…
Symmetric quantum states are fascinating objects. They correspond to multipartite systems that remain invariant under particle permutations. This symmetry is reflected in their compact mathematical characterisation but also in their unique…
Violation of a noncontextuality inequality or the phenomenon referred to `quantum contextuality' is a fundamental feature of quantum theory. In this article, we derive a novel family of noncontextuality inequalities along with their…
Building on a recent proposal for a quantum reduction to spherical symmetry from full loop quantum gravity, we investigate the relation between a quantisation of spherically symmetric general relativity and a reduction at the quantum level.…
We construct a cluster algebra structure within the quantum cohomology ring of a quiver variety associated with an $A$-type quiver. Specifically, let $Fl:=Fl(N_1,\ldots,N_{n+1})$ denote a partial flag variety of length $n$, and…
Quantum entanglement was first recognized as a feature of quantum mechanics in the famous paper of Einstein, Podolsky and Rosen [18]. Recently it has been realized that quantum entanglement is a key ingredient in quantum computation,…
After short historical overview we describe the difficulties with application of standard QFT methods in quantum gravity (QG). The incompatibility of QG with the use of classical continuous space-time required conceptually new approach. We…
In pursuit of a deeper understanding of Boolean Promise Constraint Satisfaction Problems (PCSPs), we identify a class of problems with restricted structural complexity, which could serve as a promising candidate for complete…
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether $S$ is a semigroup or has an identity element. If S is a monoid, we want to…
In \cite{rupel3},the authors defined algebra homomorphisms from the dual Ringel-Hall algebra of certain hereditary abelian category $\mathcal{A}$ to an appropriate $q$-polynomial algebra. In the case that $\mathcal{A}$ is the representation…
Gauge theories are important descriptions for many physical phenomena and systems in quantum computation. Automorphism of gauge group naturally gives global symmetries of gauge theories. In this work we study such symmetries in gauge…
We shift the QCSP (Quantified Constraint Satisfaction Problems) framework to the QCHR (Quantified Constraint Handling Rules) framework by enabling dynamic binder and access to user-defined constraints. QCSP offers a natural framework to…
We show that a collection of three-sorted set-theoretic formulae, denoted TLQSR and which admits a restricted form of quantification over individual and set variables, has a solvable satisfiability problem by proving that it enjoys a small…
The mathematical formalism of quantum theory exhibits significant effectiveness when applied to cognitive phenomena that have resisted traditional (set theoretical) modeling. Relying on a decade of research on the operational foundations of…
The 4-dimensional space-time is extended to pseudo-complex coordinates. Proposing the standard quantization rules in this extended space, the ones for the 4-dimensional sub-space acquire, as one solution, the commutation relations with…
Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable for fragments of bounded hypertreewidth. Approximating a hard CQ by a query from such a fragment can thus allow for an efficient approximate evaluation. While…
Quantum incompatibility, referred as the phenomenon that some quantum measurements cannot be performed simultaneously, is necessary for various quantum information processing tasks, such as nonlocality and steering. When these applications…