Résultats de recherche pour « Separable Operations »

Quantum supermaps are higher-order maps transforming quantum operations into quantum operations. Here we extend the theory of quantum supermaps, originally formulated in the finite dimensional setting, to the case of higher-order maps transforming quantum operations with input in a separable von Neumann algebra and output in the algebra of the bounded operators on a given separable Hilbert space. In this setting we prove two dilation theorems for quantum supermaps that are the analogues of the Stinespring and Radon-Nikodym theorems for quantum operations. Finally, we consider the case of quantum superinstruments, namely measures with values in the set of quantum supermaps, and derive a dilation theorem for them that is analogue to Ozawa's theorem for quantum instruments. The three dilation theorems presented here show that all the supermaps defined in this paper can be implemented by connecting devices in quantum circuits.

Separability is one of the most basic and important topological properties. In this paper, the separability in (strongly) topological gyrogroups is studied. It is proved that every first-countable left ω-narrow strongly topological gyrogroup is separable. Furthermore, it is shown that if a feathered strongly topological gyrogroup G is isomorphic to a subgyrogroup of a separable strongly topological gyrogroup, then G is separable. Therefore, if a metrizable strongly topological gyrogroup G is isomorphic to a subgyrogroup of a separable strongly topological gyrogroup, then G is separable, and if a locally compact strongly topological gyrogroup G is isomorphic to a subgyrogroup of a separable strongly topological gyrogroup, then G is separable.

As separable code (SC, IEEE Trans Inf Theory 57:4843-4851, 2011) and frameproof code (FPC, IEEE Trans Inf Theory 44:1897-1905, 1998) do in multimedia fingerprinting, strongly separable code (SSC, Des. Codes and Cryptogr.79:303-318, 2016) can be also used to construct anti-collusion codes. Furthermore, SSC is better than FPC and SC in the applications for multimedia fingerprinting since SSC has lower tracing complexity than that of SC (the same complexity as FPC) and weaker structure than that of FPC. In this paper, we first derive several upper bounds on the number of codewords of $\overline{t}$-SSC. Then we focus on $\overline{3}$-SSC with codeword length $3$, and obtain the following two main results: (1) An equivalence between an SSC and an SC. %Consequently a more tighter upper bound $(3q^2/4)$ and lower bound $(q^{3/2})$ on the number of codewords are obtained; (2) An improved lower bound $Ω(q^{5/3}+q^{4/3}-q)$ on the size of a $q$-ary SSC when $q=q_1^6$ for any prime power $q_1\equiv\ 1 \pmod 6$, better than the before known bound $\lfloor\sqrt{q}\rfloor^{3}$, which is obtained by means of difference matrix and the known result on the subset of $\mathbb{F}^{n}_q$ containing no three points on a line.

We study a relation between three different formulations of theorems on separable determination - one using the concept of rich families, second via the concept of suitable models and third, a new one, suggested in this paper, using the notion of $ω$-monotone mappings. In particular, we show that in Banach spaces all those formulations are in a sense equivalent and we give a positive answer to two questions of O. Kalenda and the author. Our results enable us to obtain new statements concerning separable determination of $σ$-porosity (and of similar notions) in the language of rich families; thus, not using any terminology from logic or set theory. Moreover, we prove that in Asplund spaces, generalized lushness is separably determined.

Given a finite group $G$ and a commutative ring $G$-spectrum $R$, we study the separable commutative algebras in the category of compact $R$-modules. We isolate three conditions on the geometric fixed points of $R$ which ensure that every separable commutative algebra is standard, i.e. arises from a finite $G$-set. In particular we show that all separable commutative algebras in the categories of compact objects in $G$-spectra and in derived $G$-Mackey functors are standard provided that $G$ is a $p$-group. In these categories we also show that for a general finite group $G$, not all separable commutative algebras are standard. We finally discuss how the classification of separable commutative algebras in compact $G$-spectra varies if we require the existence of multiplicative norms. We show that if $G$ is solvable, then any separable commutative algebra therein that is normed is automatically standard. However, if $G$ is not solvable, we provide examples of separable commutative algebras that are normed but not standard.