相关论文: A Generalized Quantifier Concept in Computational …
The framework of generalized probabilistic theories is a powerful tool for studying the foundations of quantum physics. It provides the basis for a variety of recent findings that significantly improve our understanding of the rich physical…
Quantum computing with qudits, quantum systems with $d > 2$ levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several…
We develop a compositional framework for generalized reversible computing using copy-discard categories and resource theories. We introduce partitioned matrices between partitioned sets as subdistribution matrices which preserve the…
We consider questions related to quantizing complex valued functions defined on a locally compact topological group. In the case of bounded functions, we generalize R. Werner's approach to prove the characterization of the associated normal…
The structure of covariant instruments is studied and a general structure theorem is derived. A detailed characterization is given to covariant instruments in the case of an irreducible representation of a locally compact group.
We show that a separation between the class of all problems that can efficiently be solved on a quantum computer and those solvable using probabilistic classical algorithms in polynomial time implies the generalized contextuality of quantum…
The Hilbert space formalism of quantum mechanics is reviewed with emphasis on applications to quantum computing. Standard interferomeric techniques are used to construct a physical device capable of universal quantum computation. Some…
We define a semantic complexity class based on the model of quantum computing with just one pure qubit (as introduced by Knill and Laflamme) and discuss its computational power in terms of the problem of estimating the trace of a large…
Possible generalizations of quantum theory permitting to describe in a unique way the development of the quantum system and the measurement process are discussed. The approach to the problem based on the Lindblad's equation for the…
The formalism of quantum theory over discrete systems is extended in two significant ways. First, quantum evolutions are generalized to act over entire network configurations, so that nodes may find themselves in a quantum superposition of…
Generalized quantum cluster algebras introduced in [1] are quantum deformation of generalized cluster algebras of geometric types. In this paper, we prove that the Laurent phenomenon holds in these generalized quantum cluster algebras. We…
The study of complex systems through the lens of category theory consistently proves to be a powerful approach. We propose that cognition deserves the same category-theoretic treatment. We show that by considering a highly-compact cognitive…
The concept of quantum commutativity with respect to an action or coaction of a given Hopf algebra is used for the algebraic description of a system of particles and their interaction with certain quantum field. Graded commutativity and…
We generalize many results concerning the tractability of SAT and #SAT on bounded treewidth CNF-formula in the context of Quantified Boolean Formulas (QBF). To this end, we start by studying the notion of width for OBDD and observe that the…
A quantum physical projector is proposed for generally covariant theories which are derivable from a Lagrangian. The projector is the quantum analogue of the integral over the generators of finite one-parameter subgroups of the gauge…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
This paper summarises the current state-of-the art in the study of compositionality in distributional semantics, and major challenges for this area. We single out generalised quantifiers and intensional semantics as areas on which to focus…
Although classifiers/quantifiers (CQs) expressions appear frequently in everyday communications or written documents, they are described neither in classical bilingual paper dictionaries , nor in machine-readable dictionaries. The paper…
Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a…
After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…