paper-with-me

홈 › Papers

Exact Coset Sampling for Quantum Lattice Algorithms

2025-09-15 · Yifan Zhang arxiv

We revisit the post-processing phase of Chen's Karst-wave quantum lattice algorithm (Chen, 2024) in the Learning with Errors (LWE) parameter regime. Conditioned on a transcript $E$, the post-Step 7 coordinate state on $(\mathbb{Z}_M)^n$ is supported on an affine grid line $\{\, jΔ+ v^{\ast}(E) + M_2 k \bmod M : j \in \mathbb{Z},\ k \in \mathcal{K} \,\}$, with $Δ= 2D^2 b$, $M = 2M_2 = 2D^2 Q$, and $Q$ odd. The amplitudes include a quadratic Karst-wave chirp $\exp(-2πi j^2 / Q)$ and an unknown run-dependent offset $v^{\ast}(E)$. We show that Chen's Steps 8-9 can be replaced by a single exact post-processing routine: measure the deterministic residue $τ:= X_1 \bmod D^2$, obtain the run-local class $v_{1,Q} := v_1^{\ast}(E) \bmod Q$ as explicit side information in our access model, apply a $v_{1,Q}$-dependent diagonal quadratic phase on $X_1$ to cancel the chirp, and then apply $\mathrm{QFT}_{\mathbb{Z}_M}^{\otimes n}$ to the coordinate registers. The routine never needs the full offset $v^{\ast}(E)$. Under Additional Conditions AC1-AC5 on the front end, a measured Fourier outcome $u \in \mathbb{Z}_M^n$ satisfies the resonance $\langle b, u \rangle \equiv 0 \pmod Q$ with probability $1 - o(1)$. Moreover, conditioned on resonance, the reduced outcome $u \bmod Q$ is exactly uniform on the dual hyperplane $H = \{\, v \in \mathbb{Z}_Q^n : \langle b, v \rangle \equiv 0 \pmod Q \,\}$.

📄 PDF Abstract BibTeX arXiv:2509.12341

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Advances in machine-learning-based sampling motivated by lattice quantum chromodynamics

2023-09-03 · Kyle Cranmer, Gurtej Kanwar, Sébastien Racanière, Danilo J. Rezende 외

Sampling from known probability distributions is a ubiquitous task in computational science, underlying calculations in domains from linguistics to biology and physics. Generative machine-learning (ML) models have emerge…

Audio Generation

Prediction and compression of lattice QCD data using machine learning algorithms on quantum annealer

2021-12-03 · Boram Yoon, Chia Cheng Chang, Garrett T. Kenyon, Nga T. T. Nguyen 외

We present regression and compression algorithms for lattice QCD data utilizing the efficient binary optimization ability of quantum annealers. In the regression algorithm, we encode the correlation between the input and…

BIG-bench Machine Learningregression

Estimating truncation effects of quantum bosonic systems using sampling algorithms

2022-12-16 · Masanori Hanada, Junyu Liu, Enrico Rinaldi, Masaki Tezuka

To simulate bosons on a qubit- or qudit-based quantum computer, one has to regularize the theory by truncating infinite-dimensional local Hilbert spaces to finite dimensions. In the search for practical quantum applicati…

Gauge equivariant neural networks for quantum lattice gauge theories

2020-12-09 · Di Luo, Giuseppe Carleo, Bryan K. Clark, James Stokes

Gauge symmetries play a key role in physics appearing in areas such as quantum field theories of the fundamental particles and emergent degrees of freedom in quantum materials. Motivated by the desire to efficiently simu…

Aspects of scaling and scalability for flow-based sampling of lattice QCD

2022-11-14 · Ryan Abbott, Michael S. Albergo, Aleksandar Botev, Denis Boyda 외

Recent applications of machine-learned normalizing flows to sampling in lattice field theory suggest that such methods may be able to mitigate critical slowing down and topological freezing. However, these demonstrations…