English
Related papers

Related papers: Extensional Uniformity for Boolean Circuits

200 papers

Let $A$ be a unital separable amenable \CA and $C$ be a unital \CA with certain infinite property. We show that two full monomorphisms $h_1, h_2: A\to C$ are approximately unitarily equivalent if and only if $[h_1]=[h_2]$ in $KL(A,C).$ Let…

Operator Algebras · Mathematics 2007-05-23 Huaxin Lin

We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be…

Logic in Computer Science · Computer Science 2022-06-22 Tim Lyon , Jonas Karge

Let $\A$ be a unital separable nuclear $C^*$--algebra which belongs to the bootstrap category $\N$ and $\B$ be a separable stable $C^*$--algebra. In this paper, we consider the group $\Ext_u(\A,\B)$ consisting of the unitary equivalence…

Operator Algebras · Mathematics 2010-08-10 Yifeng Xue

We present necessary and sufficient conditions for an n\times n complex matrix B to be unitarily similar to a fixed unicellular (i.e., indecomposable by similarity) n\times n complex matrix A

Representation Theory · Mathematics 2015-03-17 Douglas Farenick , Tatiana G. Gerasimova , Nadya Shvai

We study properties of relational structures such as graphs that are decided by families of Boolean circuits. Circuits that decide such properties are necessarily invariant to permutations of the elements of the input structures. We focus…

Computational Complexity · Computer Science 2014-01-07 Matthew Anderson , Anuj Dawar

The paper is a brief informal introduction to C*-algebraic foundations of causal contextual subquantum theories. In particular, it is explained how the contextuality property (which is a necessary consistency condition of all causal…

Quantum Physics · Physics 2007-05-23 Micho Durdevich

Let $A$ be a unital separable \CA and $B=C\otimes {\cal K},$ where $C$ is a unital \CA. Let $\tau: A\to M(B)/B$ be a weakly unital full essential extensions of $A$ by $B.$ We show that there is a bijection between a quotient group of…

Operator Algebras · Mathematics 2007-05-23 Huaxin Lin

Duality is an indispensable tool for describing the strong-coupling dynamics of gauge theories. However, its actual realization is often quite subtle: quantities such as the partition function can transform covariantly, with degrees of…

High Energy Physics - Theory · Physics 2017-08-16 William Donnelly , Ben Michel , Aron Wall

We derive two types of sets of higher-order conditions for bipartite entanglement in terms of continuous variables. One corresponds to an extension of the well-known Duan inequalities from second to higher moments describing a kind of…

Quantum Physics · Physics 2016-03-23 E. Shchukin , P. van Loock

We deal with the boundedness properties of higher order commutators related to some generalizations of the multilinear fractional integral operator of order $m$, $I_\alpha ^m$, from a product of weighted Lebesgue spaces into adequate…

Classical Analysis and ODEs · Mathematics 2022-10-07 Fabio Berra , Gladis Pradolini , Jorgelina Recchi

The MAC-BC duality of information theory and wireless communications is an intriguing concept for efficient algorithm design. However, no concept is known so far for the important cellular channel. To make progress on this front, we…

Information Theory · Computer Science 2016-11-17 Rick Fritschek , Gerhard Wunder

Wave--particle duality is a cornerstone of quantum mechanics, traditionally formulated under definite causal order. We investigate how complementarity is modified when the temporal order of operations is coherently superposed, as in the…

Quantum Physics · Physics 2026-03-31 Mohd Asad Siddiqui , Md Qutubuddin , Tabish Qureshi

The robustness property of exponential dichotomies refers to the stability of this notion under small linear perturbations. In recent work~\cite{PPX}, the authors have identified a new class of perturbations under which the notion of a…

Dynamical Systems · Mathematics 2025-12-16 Davor Dragicevic

We characterize all maximally entangling bipartite unitary operators, acting on systems $A,B$ of arbitrary finite dimensions $d_A\le d_B$, when use of ancillary systems by both parties is allowed. Several useful and interesting consequences…

Quantum Physics · Physics 2014-08-07 Scott M. Cohen

We explore some of the special features with respect to Bredon cohomology of groups having all its finite subgroups either nilpotent or p-groups or cyclic p-groups. We get some results on dimensions and also a formula for the equivariant…

Group Theory · Mathematics 2013-03-13 Conchita Martínez-Pérez

We study uniform interpolation and forgetting in the description logic ALC. Our main results are model-theoretic characterizations of uniform inter- polants and their existence in terms of bisimula- tions, tight complexity bounds for…

Logic in Computer Science · Computer Science 2011-04-15 Carsten Lutz , Frank Wolter

We give new sufficient ergodicity conditions for two-state probabilistic cellular automata (PCA) of any dimension and any radius. The proof of this result is based on an extended version of the duality concept. Under these assumptions, in…

Dynamical Systems · Mathematics 2012-06-28 Cristian Coletti , Pierre Tisseur

Contextuality and entanglement are valuable resources for quantum computing and quantum information. Bell inequalities are used to certify entanglement; thus, it is important to understand why and how they are violated. Quantum mechanics…

Quantum Physics · Physics 2021-08-30 Marian Kupczynski

A strong-to-weak-coupling duality is established for the nonequilibrium interacting resonant-level model, describing tunneling through a single spinless level, capacitively coupled to two leads by a contact interaction. For large capacitive…

Strongly Correlated Electrons · Physics 2007-10-02 Avraham Schiller , Natan Andrei

The circuit equivalence problem of a finite algebra $\mathbf A$ is the computational problem of deciding whether two circuits over $\mathbf A$ define the same function or not. This problem not just generalises the equivalence problem for…

Computational Complexity · Computer Science 2019-09-27 Piotr Kawałek , Michael Kompatscher , Jacek Krzaczkowski