Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Topics in applied physics

Quantum lattice problems

Hans A. De Raedt, Wolfgang von der Linden

Published Jan 1, 1992• 2 citations
Publisher
DOI
10.1007/3-540-60174-0_8

Related papers

Quantum Lattice Problems

Hans A. De Raedt, Wolfgang von der Linden

Topics in applied physics•Jan 1, 1992•5 citations

On Advances of Lattice-Based Cryptographic Schemes and Their Implementations

Harshana Bandara, Yasitha Herath, Thushara Weerasundara +1 more

Lattice-based cryptography is centered around the hardness of problems on lattices. A lattice is a grid of points that stretches to infinity. With the development of quantum computers, existing cryptographic schemes are at risk because the underlying mathematical problems can, in theory, be easily solved by quantum computers. Since lattice-based mathematical problems are hard to be solved even by quantum computers, lattice-based cryptography is a promising foundation for future cryptographic schemes. In this paper, we focus on lattice-based public-key encryption schemes. This survey presents the current status of the lattice-based public-key encryption schemes and discusses the existing implementations. Our main focus is the learning with errors problem (LWE problem) and its implementations. In this paper, the plain lattice implementations and variants with special algebraic structures such as ring-based variants are discussed. Additionally, we describe a class of lattice-based functions called lattice trapdoors and their applications.

Cryptography•Nov 9, 2022•40 citations

Quantum-Inspired Lattice Optimization (QILO)

Jincheng Zhang

Quantum-Inspired Lattice Optimization (QILO) is a novel optimization algorithm designed to address complex geometries in problems by leveraging the principles of quantum lattices. This paper introduces a new framework centered around the concept of mapping a problem to a discrete lattice structure, employing quantum-inspired techniques to guide the search for optimal solutions. The core mechanism of QILO involves translating a problem into a lattice representation, utilizing quantum-inspired methods to facilitate efficient exploration and potentially uncover solutions more effectively than traditional methods. This work offers a promising new direction in optimization, particularly for problems with intricate geometric constraints.

•Sep 6, 2026•0 citations

Quantum Mechanics and Lattices

WORLD SCIENTIFIC eBooks•May 1, 2000•0 citations

The application of lattice calculation on quantum physics

蔡启铭, Chi‐Ming Tsai

•Jan 1, 1997•0 citations

Post-Quantum Cryptosystems: Open Problems and Solutions. Lattice-Based Cryptosystems

Ekaterina Sergeevna Malygina, A. V. Kutsenko, S. A. Novoselov +5 more

Abstract The paper provides an overview of the main approaches to the construction of post-quantum cryptographic systems that are currently used. The area of lattice-based cryptography is analyzed in detail. We give the description and characterization of some known lattice-based cryptosystems whose resilience is based on the complexity of the shortest vector problem, learning with errors problem, and their variations. The main approaches to solving the problems from lattice theory, on which attacks on the corresponding cryptosystems are based, are analyzed. In particular, some known theoretical estimates of time and memory complexity of lattice basis reduction and lattice sieving algorithms are presented.

Journal of Applied and Industrial Mathematics•Sep 1, 2023•13 citations
Lattice-based cryptography is centered around the hardness of problems on lattices. A lattice is a grid of points that stretches to infinity. With the development of quantum computers, existing cryptographic schemes are at risk because the underlying mathematical problems can, in theory, be easily solved by quantum computers. Since lattice-based mathematical problems are hard to be solved even by quantum computers, lattice-based cryptography is a promising foundation for future cryptographic schemes. In this paper, we focus on lattice-based public-key encryption schemes. This survey presents the current status of the lattice-based public-key encryption schemes and discusses the existing implementations. Our main focus is the learning with errors problem (LWE problem) and its implementations. In this paper, the plain lattice implementations and variants with special algebraic structures such as ring-based variants are discussed. Additionally, we describe a class of lattice-based functions called lattice trapdoors and their applications.
Quantum-Inspired Lattice Optimization (QILO) is a novel optimization algorithm designed to address complex geometries in problems by leveraging the principles of quantum lattices. This paper introduces a new framework centered around the concept of mapping a problem to a discrete lattice structure, employing quantum-inspired techniques to guide the search for optimal solutions. The core mechanism of QILO involves translating a problem into a lattice representation, utilizing quantum-inspired methods to facilitate efficient exploration and potentially uncover solutions more effectively than traditional methods. This work offers a promising new direction in optimization, particularly for problems with intricate geometric constraints.
Abstract The paper provides an overview of the main approaches to the construction of post-quantum cryptographic systems that are currently used. The area of lattice-based cryptography is analyzed in detail. We give the description and characterization of some known lattice-based cryptosystems whose resilience is based on the complexity of the shortest vector problem, learning with errors problem, and their variations. The main approaches to solving the problems from lattice theory, on which attacks on the corresponding cryptosystems are based, are analyzed. In particular, some known theoretical estimates of time and memory complexity of lattice basis reduction and lattice sieving algorithms are presented.