Low-energy behavior of strongly interacting bosons on a flat-band lattice above the critical filling factor

Bosons interacting repulsively on a lattice with a flat lowest band energy dispersion may, at sufficiently small filling factors, enter into a Wigner-crystal-like phase. This phase is a consequence of the dispersionless nature of the system, which in turn implies the occurrence of single-particle localized eigenstates. We investigate one of these systems-the sawtooth lattice-filled with strongly repulsive bosons at filling factors infinitesimally above the critical point where the crystal phase is no longer the ground state. We find, in the hard-core limit, that the crystal retains its structure in all but one of its cells, where it is broken. The broken cell corresponds to an exotic kind of repulsively bound state, which becomes delocalized. We investigate the excitation spectrum of the system analytically and find that the bound state behaves as a single particle hopping on an effective lattice with reduced periodicity, and is therefore gapless. Thus, the addition of a single particle to a flat-band system at critical filling is found to be enough to make kinetic behavior manifest.

Thermometry precision in strongly correlated ultracold lattice gases

The precise knowledge of the temperature of an ultracold lattice gas simulating a strongly correlated
system is a question of both fundamental and technological importance. Here, we address such
question by combining tools from quantum metrology together with the study of the quantum
correlations embedded in the system at finite temperatures. Within this frame we examine the spin-
1 2 XY chain, first estimating, by means of the quantum Fisher information, the lowest attainable
bound on the temperature precision. We then address the estimation of the temperature of the sample
from the analysis of correlations using a quantum non demolishing Faraday spectroscopy method.
Remarkably, our results show that the collective quantum correlations can become optimal
observables to accurately estimate the temperature of our model in a given range of temperatures.

Practical Lattice-Based Digital Signature Schemes

Digital signatures are an important primitive for building secure systems and are used in most real-world security protocols. However, almost all popular signature schemes are either based on the factoring assumption (RSA) or the hardness of the discrete logarithm problem (DSA/ECDSA). In the case of classical cryptanalytic advances or progress on the development of quantum computers, the hardness of these closely related problems might be seriously weakened. A potential alternative approach is the construction of signature schemes based on the hardness of certain lattice problems that are assumed to be intractable by quantum computers. Due to significant research advancements in recent years, lattice-based schemes have now become practical and appear to be a very viable alternative to number-theoretic cryptography. In this article, we focus on recent developments and the current state of the art in lattice-based digital signatures and provide a comprehensive survey discussing signature schemes with respect to practicality. Additionally, we discuss future research areas that are essential for the continued development of lattice-based cryptography.

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.

Spectral isometries into commutative Banach algebras

We determine the structure of spectral isometries between unital Banach algebras under the hypothesis that the codomain is commutative.