987 resultados para Rotated lattices
Resumo:
We show that, if M is a subspace lattice with the property that the rank one subspace of its operator algebra is weak* dense, L is a commutative subspace lattice and P is the lattice of all projections on a separable Hilbert space, then L⊗M⊗P is reflexive. If M is moreover an atomic Boolean subspace lattice while L is any subspace lattice, we provide a concrete lattice theoretic description of L⊗M in terms of projection valued functions defined on the set of atoms of M . As a consequence, we show that the Lattice Tensor Product Formula holds for AlgM and any other reflexive operator algebra and give several further corollaries of these results.
Resumo:
The different quantum phases appearing in strongly correlated systems as well as their transitions are closely related to the entanglement shared between their constituents. In 1D systems, it is well established that the entanglement spectrum is linked to the symmetries that protect the different quantum phases. This relation extends even further at the phase transitions where a direct link associates the entanglement spectrum to the conformal field theory describing the former. For 2D systems much less is known. The lattice geometry becomes a crucial aspect to consider when studying entanglement and phase transitions. Here, we analyze the entanglement properties of triangular spin lattice models by also considering concepts borrowed from quantum information theory such as geometric entanglement.
Resumo:
Lattice-based cryptography has gained credence recently as a replacement for current public-key cryptosystems, due to its quantum-resilience, versatility, and relatively low key sizes. To date, encryption based on the learning with errors (LWE) problem has only been investigated from an ideal lattice standpoint, due to its computation and size efficiencies. However, a thorough investigation of standard lattices in practice has yet to be considered. Standard lattices may be preferred to ideal lattices due to their stronger security assumptions and less restrictive parameter selection process. In this paper, an area-optimised hardware architecture of a standard lattice-based cryptographic scheme is proposed. The design is implemented on a FPGA and it is found that both encryption and decryption fit comfortably on a Spartan-6 FPGA. This is the first hardware architecture for standard lattice-based cryptography reported in the literature to date, and thus is a benchmark for future implementations.
Additionally, a revised discrete Gaussian sampler is proposed which is the fastest of its type to date, and also is the first to investigate the cost savings of implementing with lamda_2-bits of precision. Performance results are promising in comparison to the hardware designs of the equivalent ring-LWE scheme, which in addition to providing a stronger security proof; generate 1272 encryptions per second and 4395 decryptions per second.
Resumo:
We show that a self-generated set of combinatorial games, S, may not be hereditarily closed but, strong self-generation and hereditary closure are equivalent in the universe of short games. In [13], the question “Is there a set which will give an on-distributive but modular lattice?” appears. A useful necessary condition for the existence of a finite non-distributive modular L(S) is proved. We show the existence of S such that L(S) is modular and not distributive, exhibiting the first known example. More, we prove a Representation Theorem with Games that allows the generation of all finite lattices in game context. Finally, a computational tool for drawing lattices of games is presented.
Resumo:
We show that a self-generated set of combinatorial games, S. may not be hereditarily closed but, strong self-generation and hereditary closure are equivalent in the universe of short games. In [13], the question "Is there a set which will give a non-distributive but modular lattice?" appears. A useful necessary condition for the existence of a finite non-distributive modular L(S) is proved. We show the existence of S such that L(S) is modular and not distributive, exhibiting the first known example. More, we prove a Representation Theorem with Games that allows the generation of all finite lattices in game context. Finally, a computational tool for drawing lattices of games is presented. (C) 2014 Elsevier B.V. All rights reserved.
Resumo:
Monte Carlo Simulations were carried out using a nearest neighbour ferromagnetic XYmodel, on both 2-D and 3-D quasi-periodic lattices. In the case of 2-D, both the unfrustrated and frustrated XV-model were studied. For the unfrustrated 2-D XV-model, we have examined the magnetization, specific heat, linear susceptibility, helicity modulus and the derivative of the helicity modulus with respect to inverse temperature. The behaviour of all these quatities point to a Kosterlitz-Thouless transition occuring in temperature range Te == (1.0 -1.05) JlkB and with critical exponents that are consistent with previous results (obtained for crystalline lattices) . However, in the frustrated case, analysis of the spin glass susceptibility and EdwardsAnderson order parameter, in addition to the magnetization, specific heat and linear susceptibility, support a spin glass transition. In the case where the 'thin' rhombus is fully frustrated, a freezing transition occurs at Tf == 0.137 JlkB , which contradicts previous work suggesting the critical dimension of spin glasses to be de > 2 . In the 3-D systems, examination of the magnetization, specific heat and linear susceptibility reveal a conventional second order phase transition. Through a cumulant analysis and finite size scaling, a critical temperature of Te == (2.292 ± 0.003) JI kB and critical exponents of 0:' == 0.03 ± 0.03, f3 == 0.30 ± 0.01 and I == 1.31 ± 0.02 have been obtained.
Resumo:
We consider the stability properties of spatial and temporal periodic orbits of one-dimensional coupled-map lattices. The stability matrices for them are of the block-circulant form. This helps us to reduce the problem of stability of spatially periodic orbits to the smaller orbits corresponding to the building blocks of spatial periodicity, enabling us to obtain the conditions for stability in terms of those for smaller orbits.
Resumo:
The optical-absorption spectrum of a cationic Ag0 atom in a KCl crystal has been studied theoretically by means of a series of cluster models of increasing size. Excitation energies have been determined by means of a multiconfigurational self-consistent field procedure followed by a second-order perturbation correlation treatment. Moreover results obtained within the density-functional framework are also reported. The calculations confirm the assignment of bands I and IV to transitions of the Ag-5s electron into delocalized states with mainly K-4s,4p character. Bands II and III have been assigned to internal transitions on the Ag atom, which correspond to the atomic Ag-4d to Ag-5s transition. We also determine the lowest charge transfer (CT) excitation energy and confirm the assignment of band VI to such a transition. The study of the variation of the CT excitation energy with the Ag-Cl distance R gives additional support to a large displacement of the Cl ions due to the presence of the Ag0 impurity. Moreover, from the present results, it is predicted that on passing to NaCl:Ag0 the CT onset would be out of the optical range while the 5s-5p transition would undergo a redshift of 0.3 eV. These conclusions, which underline the different character of involved orbitals, are consistent with experimental findings. The existence of a CT transition in the optical range for an atom inside an ionic host is explained by a simple model, which also accounts for the differences with the more common 3d systems. The present study sheds also some light on the R dependence of the s2-sp transitions due to s2 ions like Tl+.