Related papers: Lattice: A Post-Quantum Settlement Layer

The quantum matter synthesizer (QMS) is a new quantum simulation platform in which individual particles in a lattice can be resolved and re-arranged into arbitrary patterns. The ability to spatially manipulate ultracold atoms and control…

Post-quantum cryptography (PQC) is moving from evaluation to deployment as NIST finalizes standards for ML-KEM, ML-DSA, and SLH-DSA. This survey maps the space from foundations to practice. We first develop a taxonomy across lattice-,…

Lattices with minimal normalized second moments are designed using a new numerical optimization algorithm. Starting from a random lower-triangular generator matrix and applying stochastic gradient descent, all elements are updated towards…

A half-duplex wireless network with 6 lateral nodes, 3 transmitters and 3 receivers, and a central relay is considered. The transmitters wish to send information to their corresponding receivers via a two phase communication protocol. The…

Transformer encoders contextualize token representations by attending to all other tokens at each layer, leading to quadratic increase in compute effort with the input length. In practice, however, the input text of many NLP tasks can be…

Lattice-linear systems allow nodes to execute asynchronously. We introduce eventually lattice-linear algorithms, where lattices are induced only among the states in a subset of the state space. The algorithm guarantees that the system…

Currently deployed public-key cryptosystems will be vulnerable to attacks by full-scale quantum computers. Consequently, "quantum resistant" cryptosystems are in high demand, and lattice-based cryptosystems, based on a hard problem known as…

We introduce the Byte Latent Transformer (BLT), a new byte-level LLM architecture that, for the first time, matches tokenization-based LLM performance at scale with significant improvements in inference efficiency and robustness. BLT…

In this paper, we present a laboratory study focused on the impact of post-quantum cryptography (PQC) algorithms on multiple layers of stateful HTTP over TLS transactions: the TCP handshake, the intermediate TCP-TLS layer, the TLS…

In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…

Incorporating lattices into character-level Chinese named entity recognition is an effective method to exploit explicit word information. Recent works extend recurrent and convolutional neural networks to model lattice inputs. However, due…

A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of…

For planar architectures surface code-based quantum error correction is one of the most promising approaches to fault-tolerant quantum computation. This is partially due to the variety of fault-tolerant logical protocols that can be…

The emergence of quantum computing presents profound challenges to existing cryptographic infrastructures, whilst the development of central bank digital currencies (CBDCs) has raised concerns regarding privacy preservation and excessive…

We present an economical dynamical control scheme to perform quantum computation on a one dimensional optical lattice, where each atom encodes one qubit. The model is based on atom tunneling transitions between neighboring sites of the…

We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D-lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer…

Scalar quantization of large language models (LLMs) is fundamentally limited by information-theoretic bounds. While vector quantization (VQ) overcomes these limits by encoding blocks of parameters jointly, practical implementations must…

We study the feasibility of a PC-based parallel computer for medium to large scale lattice QCD simulations. The E\"otv\"os Univ., Inst. Theor. Phys. cluster consists of 137 Intel P4-1.7GHz nodes with 512 MB RDRAM. The 32-bit, single…

We propose a fault tolerant loading scheme to produce an array of fermions in an optical lattice of the high fidelity required for applications in quantum information processing and the modelling of strongly correlated systems. A cold…

We demonstrate arbitrary coherent addressing of individual neutral atoms in a $5\times 5\times 5$ array formed by an optical lattice. Addressing is accomplished using rapidly reconfigurable crossed laser beams to selectively ac Stark shift…