Cover Image

The Quantum Decoding Problem : Tight Achievability Bounds and Application to Regev's Reduction

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Blanvillain, Agathe, Chailloux, André, Tillich, Jean-Pierre
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Quantum advantage from soft decoders
by: Chailloux, André, et al.
Published: (2024)

Regev's reduction as a candidate quantum algorithm for the discrete logarithm problem in finite abelian groups
by: Garrido, M. Isabel Franco, et al.
Published: (2026)

OPI x Soft Decoders
by: Chailloux, André
Published: (2025)

On the Quantum Equivalence between $S|LWE\rangle$ and $ISIS$
by: Chailloux, André, et al.
Published: (2025)

Fine-Grained Unambiguous Measurements
by: Buzet, Quentin, et al.
Published: (2025)

Implementation and Analysis of Regev's Quantum Factorization Algorithm
by: Pawlitko, Przemysław, et al.
Published: (2025)

Space-Optimized and Experimental Implementations of Regev's Quantum Factoring Algorithm
by: Yang, Wentao, et al.
Published: (2025)

IQP circuits for 2-Forrelation
by: Buzet, Quentin, et al.
Published: (2026)

Tight Bounds for Quantum Phase Estimation and Related Problems
by: Mande, Nikhil S., et al.
Published: (2023)

Optimization Using Locally-Quantum Decoders
by: Shutty, Noah, et al.
Published: (2026)

Achievability of Covert Quantum Communication
by: Anderson, Evan J. D., et al.
Published: (2025)

Tight Quantum Lower Bound for k-Distinctness
by: Belovs, Aleksandrs
Published: (2026)

Extending Regev's factoring algorithm to compute discrete logarithms
by: Ekerå, Martin, et al.
Published: (2023)

Tight Quantum Lower Bound for Approximate Counting with Quantum States
by: Belovs, Aleksandrs, et al.
Published: (2020)

Tight Generalization Bound for Supervised Quantum Machine Learning
by: Wang, Xin, et al.
Published: (2025)

Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits
by: Letcher, Alistair, et al.
Published: (2023)

Parallel Spooky Pebbling Makes Regev Factoring More Practical
by: Kahanamoku-Meyer, Gregory D., et al.
Published: (2025)

Study on Frustrated Quantum Phase Transition Achievable by Quantum Computing
by: Chen, Zili
Published: (2024)

Quantum Lovász Local Lemma: Shearer's Bound is Tight
by: He, Kun, et al.
Published: (2018)

Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing
by: Braida, Arthur, et al.
Published: (2023)

Tight Quantum Depth Lower Bound for Solving Systems of Linear Equations
by: Wang, Qisheng, et al.
Published: (2024)

Simplified Quantum Weight Reduction with Optimal Bounds
by: Hsieh, Min-Hsiu, et al.
Published: (2025)

Tight Communication Bounds for Distributed Algorithms in the Quantum Routing Model
by: Dufoulon, Fabien, et al.
Published: (2026)

A Tight Quantum Algorithm for Multiple Collision Search
by: Bonnetain, Xavier, et al.
Published: (2025)

An Achievable Rate Region for $3-$User Classical-Quantum Broadcast Channels
by: Gouiaa, Fatma, et al.
Published: (2022)

Continuous-Variable Quantum Key Distribution with Composable Security and Tight Error Correction Bound for Constrained Devices
by: Papanastasiou, Panagiotis, et al.
Published: (2025)

Constrained Quantum Optimization at Utility Scale: Application to the Knapsack Problem
by: Mohseni, Naeimeh, et al.
Published: (2026)

Achievable Trade-Off in Network Nonlocality Sharing
by: Li, Ming-Xiao, et al.
Published: (2025)

Lower Bounds on Error Exponents via a New Quantum Decoder
by: Beigi, Salman, et al.
Published: (2023)

Achievable Rate Regions for Multi-terminal Quantum Channels via Coset Codes
by: Gouiaa, Fatma, et al.
Published: (2025)

Achievable rates in non-asymptotic bosonic quantum communication
by: Mele, Francesco Anna, et al.
Published: (2025)

Achievable Identification Rates in Noisy Bosonic Broadcast Channels
by: Amiri, Zuhra, et al.
Published: (2025)

Lower Bounds for Quantum Secure Function Evaluation Reductions
by: Hänggi, Esther, et al.
Published: (2024)

Achievable rates for concatenated square Gottesman-Kitaev-Preskill codes
by: Subramanian, Mahadevan, et al.
Published: (2025)

Quantum Resonant Dimensionality Reduction and Its Application in Quantum Machine Learning
by: Yang, Fan, et al.
Published: (2024)

Solving Sharp Bounded-error Quantum Polynomial Time Problem by Evolution methods
by: Guo, Zhen, et al.
Published: (2024)

Quantum Speed Limits Based on Schatten Norms: Universality and Tightness
by: Rosal, Alberto J. B., et al.
Published: (2023)

Truncated-Binary Encoding: Spectral Degree Reduction of Combinatorial Optimization Problems for Quantum Hardware
by: Zaborniak, Tristan
Published: (2026)

Entanglement Management in Space-Based Quantum Information Networks
by: Paccard, Luca, et al.
Published: (2025)

Entanglement-Assisted Bosonic MAC: Achievable Rates and Covert Communication
by: Shen, Yu-Chen, et al.
Published: (2026)