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

Deterministic lattice code development at UNIST

Chidong Kong, Sooyoung Choi, Deokjung Lee

Published Jan 1, 2015• 0 citations
OpenAlex

Related papers

Lectures on Quantum Mechanics (Kibog Park's Spring 2011 Lectures)

Miftachul Hadi

This is my very rough typing of Professor Kibog Park’s lectures which was conducted on Spring 2011 at UNIST Campus (Ulsan, South Korea). Reader should be careful with my mistyping and misunderstanding of concepts. Problems and solutions (my effort to solve the problems) are added. Reader should check it carefully. This material is still being developed.

•Oct 25, 2020•0 citations

Deterministic Computation Towards Indeterminism

А. В. Богданов, Ashot S. Gevorkyan, Elena N. Stankova +1 more

Lecture notes in computer science•Jan 1, 2002•3 citations

Lattice-Based Cryptosystems: A Design Perspective

Jiang Zhang, Zhenfeng Zhang

Springer eBooks•Jan 1, 2020•17 citations

Lattice Based Cryptography for Beginners.

Dong Pyo, Jeong Woon Choi, Jeong San Kim +1 more

The purpose of this lecture note is to introduce lattice based cryptography, which is thought to be a cryptosystem of post-quantum age. We have tried to give as many details possible specially for novice on the subject. Something may be trivial to an expert but not to a novice. Many fundamental problems about lattice are thought to be hard even against quantum computer, compared to factorization problem which can be solved easily with quantum computer, via the celebrated Shor factorization quantum algorithm. The first part of our presentation is based on slides of Christ Peikert 2013 Bonn lecture (crypt@b-it2013). We, more or less, give somewhat detailed explanation of Professor Peikert’s lecture slides. We unfortunately could not attend his Bonn class. We are afraid that there are many mistakes in this note; if any, they are due to our misunderstanding of the material. Part II of our lecture note is on ring LWE, based on the paper “A tool-kit for Ring-LWE Cryptography” by Lyubashevsky, Peikert and Regev. Part III is about multilinear maps together with cryptanalysis of GGH map due to Hu and Jia. Our presentation follows professor Steinfeld’s lecture slides on GGHLite, and the paper by Yupu Hu and Huiwen Jia. When you read this lecture note, the corresponding original paper should be accompanied. We thank professor Jung Hee Cheon for introducing the subject and asking Dong Pyo Chi to give a lecture on the subject at the department of mathematics in Seoul National University. We also thank Hyeongkwan Kim for many helps, especially many corrections and improvements of the manuscript during the 2015 Summer session at UNIST. We also thank the students who took the classes at SNU and UNIST. The lecture was given by a novice for novice, so many mistakes are unavoidable. If the reader lets us know any errors, we will very much appreciate it.

•Jan 1, 2015•13 citations

Symplectic Barnes-Wall GKP Codes: Deterministic $O(N \log^2 N)$ Decoding and Logarithmic Rate Scaling

Shanxiang Lyu

We construct an explicit symplectic realization of the Barnes-Wall lattice that yields a family of multimode Gottesman-Kitaev-Preskill (GKP) codes with encoding rate $R = \frac{1}{2}\log_2 N$ and a deterministic $O(N\log^2 N)$ bounded-distance decoder. The recursive generator $G_{m+1} = \bigl(\begin{smallmatrix} G_m & 0 \\ G_m & R_m G_m \end{smallmatrix}\bigr)$ with $R_m = I + Ω$ simultaneously guarantees symplectic integrality for valid quantum stabilizers and preserves the exact Barnes-Wall decoding structure through a chain of isometric isomorphisms. The code distance is constant at $Δ^2 = 1$ (in units of $2π$), representing an explicit distance--rate tradeoff in which logarithmic encoding efficiency is achieved at the cost of non-scaling protection. This construction provides a deterministic, space-efficient paradigm for GKP error correction in platforms supporting non-local modular connectivity.

cs.ITCross-listedarXiv:2608.00601•Aug 4, 2026•0 citations

Irregular low-density parity-check code design based on integer lattices

Wataru Matsumoto, Hirotaka Imai

We propose an irregular low-density parity-check (LDPC) code design scheme by extension of a regular LDPC code using Latin square matrices of random sequence. Our scheme is a deterministic method that enables to easily design good irregular LDPC code for any code rate and degree distributions. We optimize LDPC codes by Gaussian approximation (GA) Chung, S-Y et al., (2001) method and construct irregular LDPC codes based on integer lattices Vasic, B et al., (2002).

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2003•1 citation
The purpose of this lecture note is to introduce lattice based cryptography, which is thought to be a cryptosystem of post-quantum age. We have tried to give as many details possible specially for novice on the subject. Something may be trivial to an expert but not to a novice. Many fundamental problems about lattice are thought to be hard even against quantum computer, compared to factorization problem which can be solved easily with quantum computer, via the celebrated Shor factorization quantum algorithm. The first part of our presentation is based on slides of Christ Peikert 2013 Bonn lecture (crypt@b-it2013). We, more or less, give somewhat detailed explanation of Professor Peikert’s lecture slides. We unfortunately could not attend his Bonn class. We are afraid that there are many mistakes in this note; if any, they are due to our misunderstanding of the material. Part II of our lecture note is on ring LWE, based on the paper “A tool-kit for Ring-LWE Cryptography” by Lyubashevsky, Peikert and Regev. Part III is about multilinear maps together with cryptanalysis of GGH map due to Hu and Jia. Our presentation follows professor Steinfeld’s lecture slides on GGHLite, and the paper by Yupu Hu and Huiwen Jia. When you read this lecture note, the corresponding original paper should be accompanied. We thank professor Jung Hee Cheon for introducing the subject and asking Dong Pyo Chi to give a lecture on the subject at the department of mathematics in Seoul National University. We also thank Hyeongkwan Kim for many helps, especially many corrections and improvements of the manuscript during the 2015 Summer session at UNIST. We also thank the students who took the classes at SNU and UNIST. The lecture was given by a novice for novice, so many mistakes are unavoidable. If the reader lets us know any errors, we will very much appreciate it.
Symplectic Barnes-Wall GKP Codes: Deterministic O(Nlog⁡2N)O(N \log^2 N)O(Nlog2N) Decoding and Logarithmic Rate Scaling
We construct an explicit symplectic realization of the Barnes-Wall lattice that yields a family of multimode Gottesman-Kitaev-Preskill (GKP) codes with encoding rate R=12log⁡2NR = \frac{1}{2}\log_2 NR=21​log2​N and a deterministic O(Nlog⁡2N)O(N\log^2 N)O(Nlog2N) bounded-distance decoder. The recursive generator Gm+1=(Gm0GmRmGm)G_{m+1} = \bigl(\begin{smallmatrix} G_m & 0 \\ G_m & R_m G_m \end{smallmatrix}\bigr)Gm+1​=(Gm​Gm​​0Rm​Gm​​) with Rm=I+ΩR_m = I + ΩRm​=I+Ω simultaneously guarantees symplectic integrality for valid quantum stabilizers and preserves the exact Barnes-Wall decoding structure through a chain of isometric isomorphisms. The code distance is constant at Δ2=1Δ^2 = 1Δ2=1 (in units of 2π2π2π), representing an explicit distance--rate tradeoff in which logarithmic encoding efficiency is achieved at the cost of non-scaling protection. This construction provides a deterministic, space-efficient paradigm for GKP error correction in platforms supporting non-local modular connectivity.