Optimal control of atom transport for quantum gates in optical lattices

By means of optimal control techniques we model and optimize the manipulation of the external quantum state (center-of-mass motion) of atoms trapped in adjustable optical potentials. We consider in detail the cases of both noninteracting and interacting atoms moving between neighboring sites in a lattice of a double-well optical potentials. Such a lattice can perform interaction-mediated entanglement of atom pairs and can realize two-qubit quantum gates. The optimized control sequences for the optical potential allow transport faster and with significantly larger fidelity than is possible with processes based on adiabatic transport.

Phase diagram of spin-1 bosons on one-dimensional lattices

Spinor Bose condensates loaded in optical lattices have a rich phase diagram characterized by different magnetic order. Here we apply the density matrix renormalization group to accurately determine the phase diagram for spin-1 bosons loaded on a one-dimensional lattice. The Mott lobes present an even or odd asymmetry associated to the boson filling. We show that for odd fillings the insulating phase is always in a dimerized state. The results obtained in this work are also relevant for the determination of the ground state phase diagram of the S=1 Heisenberg model with biquadratic interaction.

Free and projective Banach lattices

We define and prove the existence of free Banach lattices in the category of Banach lattices and contractive lattice homomorphisms, and establish some of their fundamental properties. We give much more detailed results about their structure in the case when there are only a finite number of generators, and give several Banach lattice characterizations of the number of generators being, respectively, one, finite or countable. We define a Banach lattice P to be projective if, whenever X is a Banach lattice, J is a closed ideal in X, Q : X → X/J is the quotient map, T: P → X/J is a linear lattice homomorphism and ε > 0, there exists a linear lattice homomorphism : P → X such thatT = Q º and ∥∥ ≤ (1 + ε)∥T∥. We establish the connection between projective Banach lattices and free Banach lattices, describe several families of Banach lattices that are projective and prove that some are not.

Tensor products of subspace lattices and rank one density

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.

Entanglement properties of spin models in triangular lattices

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.

Lattice-based Encryption Over Standard Lattices in Hardware

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.

On lattices from combinatorial game theory modularity and a representation theorem: Finite case

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.

On lattices from combinatorial game theory modularity and a representation theorem: finite case

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.

Monte Carlo study of the XY-model on quasi-periodic lattices

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.