33 resultados para SEMISIMPLE FINITE-DIMENSIONAL JORDAN SUPERALGEBRA
Resumo:
A quadratic semigroup algebra is an algebra over a field given by the generators x_1, . . . , x_n and a finite set of quadratic relations each of which either has the shape x_j x_k = 0 or the shape x_j x_k = x_l x_m . We prove that a quadratic semigroup algebra given by n generators and d=(n^2+n)/4 relations is always infinite dimensional. This strengthens the Golod–Shafarevich estimate for the above class of algebras. Our main result however is that for every n, there is a finite dimensional quadratic semigroup algebra with n generators and d_n relations, where d_n is the first integer greater than (n^2+n)/4 . That is, the above Golod–Shafarevich-type estimate for semigroup algebras is sharp.
Resumo:
We establish a mapping between a continuous-variable (CV) quantum system and a discrete quantum system of arbitrary dimension. This opens up the general possibility to perform any quantum information task with a CV system as if it were a discrete system. The Einstein-Podolsky-Rosen state is mapped onto the maximally entangled state in any finite-dimensional Hilbert space and thus can be considered as a universal resource of entanglement. An explicit example of the map and a proposal for its experimental realization are discussed.
Resumo:
We present two strategies to enhance the dynamical entanglement transfer from continuous-variable (CV) to finite-dimensional systems by employing multiple qubits. First, we consider the entanglement transfer to a composite finite-dimensional system of many qubits simultaneously interacting with a bipartite CV field. We show that, considering realistic conditions in the generation of CV entanglement, a small number of qubits resonantly coupled to the CV system are sufficient for an almost complete dynamical transfer of the entanglement. Our analysis also sheds further light on the transition between the microscopic and macroscopic behaviors of composite finite-dimensional systems coupled to bosonic fields (like atomic clouds interacting with light). Furthermore, we present a protocol based on sequential interactions of the CV system with some ancillary qubit systems and on subsequent measurements, allowing us to probabilistically convert CV entanglement into "almost-perfect" Bell pairs of two qubits. Our proposals are suited for realizations in various experimental settings, ranging from cavity-QED to cavity-integrated superconducting devices.
Resumo:
An example of a sigma -compact infinite-dimensional pre-Hilbert space H is constructed such that any continuous linear operator T: H --> H is of the form T = lambdaI + F for some lambda is an element of R and for a finite-dimensional continuous linear operator F. A class of simple examples of pre-Hilbert spaces nonisomorphic to their closed hyperplanes is given. A sigma -compact pre-Hilbert space H isomorphic to H x R x R and nonisomorphic to H x R is also constructed.
Resumo:
In this work we characterise the C*-algebras $\mathcal{A}$ generated by projections with the property that every pair of projections in $\mathcal{A}$ has positive angle, as certain extensions of abelian algebras by algebras of compact operators. We show that this property is equivalent to a lattice theoretic property of projections and also to the property that the set of finite dimensional *-subalgebras of $\mathcal{A}$ is directed.
Resumo:
We study the question on whether the famous Golod–Shafarevich estimate, which gives a lower bound for the Hilbert series of a (noncommutative) algebra, is attained. This question was considered by Anick in his 1983 paper ‘Generic algebras and CW-complexes’, Princeton Univ. Press, where he proved that the estimate is attained for the number of quadratic relations $d\leq n^2/4$
and $d\geq n^2/2$, and conjectured that it is the case for any number of quadratic relations. The particular point where the number of relations is equal to $n(n-1)/2$ was addressed by Vershik. He conjectured that a generic algebra with this number of relations is finite dimensional. We announce here the result that over any infinite field, the Anick conjecture holds for $d \geq 4(n2+n)/9$ and an arbitrary number of generators. We also discuss the result that confirms the Vershik conjecture over any field of characteristic 0, and a series of related
asymptotic results.
Resumo:
We prove that a continuous linear operator T on a topological vector space X with weak topology is mixing if and only if the dual operator T' has no finite dimensional invariant subspaces. This result implies the characterization of hypercyclic operators on the space $\omega$ due to Herzog and Lemmert and implies the result of Bayart and Matheron, who proved that for any hypercyclic operator T on $\omega$, $T\oplus T$ is also hypercyclic.
Resumo:
A tuple $(T_1,\dots,T_n)$ of continuous linear operators on a topological vector space $X$ is called hypercyclic if there is $x\in X$ such that the the orbit of $x$ under the action of the semigroup generated by $T_1,\dots,T_n$ is dense in $X$. This concept was introduced by N.~Feldman, who have raised 7 questions on hypercyclic tuples. We answer those 4 of them, which can be dealt with on the level of operators on finite dimensional spaces. In
particular, we prove that the minimal cardinality of a hypercyclic tuple of operators on $\C^n$ (respectively, on $\R^n$) is $n+1$ (respectively, $\frac n2+\frac{5+(-1)^n}{4}$), that there are non-diagonalizable tuples of operators on $\R^2$ which possess an orbit being neither dense nor nowhere dense and construct a hypercyclic 6-tuple of operators on $\C^3$ such that every operator commuting with each member of the tuple is non-cyclic.
Resumo:
Radio-frequency (RF) impairments in the transceiver hardware of communication systems (e.g., phase noise (PN), high power amplifier (HPA) nonlinearities, or in-phase/quadrature-phase (I/Q) imbalance) can severely degrade the performance of traditional multiple-input multiple-output (MIMO) systems. Although calibration algorithms can partially compensate these impairments, the remaining distortion still has substantial impact. Despite this, most prior works have not analyzed this type of distortion. In this paper, we investigate the impact of residual transceiver hardware impairments on the MIMO system performance. In particular, we consider a transceiver impairment model, which has been experimentally validated, and derive analytical ergodic capacity expressions for both exact and high signal-to-noise ratios (SNRs). We demonstrate that the capacity saturates in the high-SNR regime, thereby creating a finite capacity ceiling. We also present a linear approximation for the ergodic capacity in the low-SNR regime, and show that impairments have only a second-order impact on the capacity. Furthermore, we analyze the effect of transceiver impairments on large-scale MIMO systems; interestingly, we prove that if one increases the number of antennas at one side only, the capacity behaves similar to the finite-dimensional case. On the contrary, if the number of antennas on both sides increases with a fixed ratio, the capacity ceiling vanishes; thus, impairments cause only a bounded offset in the capacity compared to the ideal transceiver hardware case.
Resumo:
Radio-frequency (RF) impairments, which intimately exist in wireless communication systems, can severely limit the performance of multiple-input-multiple-output (MIMO) systems. Although we can resort to compensation schemes to mitigate some of these impairments, a certain amount of residual impairments always persists. In this paper, we consider a training-based point-to-point MIMO system with residual transmit RF impairments (RTRI) using spatial multiplexing transmission. Specifically, we derive a new linear channel estimator for the proposed model, and show that RTRI create an estimation error floor in the high signal-to-noise ratio (SNR) regime. Moreover, we derive closed-form expressions for the signal-to-noise-plus-interference ratio (SINR) distributions, along with analytical expressions for the ergodic achievable rates of zero-forcing, maximum ratio combining, and minimum mean-squared error receivers, respectively. In addition, we optimize the ergodic achievable rates with respect to the training sequence length and demonstrate that finite dimensional systems with RTRI generally require more training at high SNRs than those with ideal hardware. Finally, we extend our analysis to large-scale MIMO configurations, and derive deterministic equivalents of the ergodic achievable rates. It is shown that, by deploying large receive antenna arrays, the extra training requirements due to RTRI can be eliminated. In fact, with a sufficiently large number of receive antennas, systems with RTRI may even need less training than systems with ideal hardware.