ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2605.31448v1· 20 results

quant-phcs.CRRecentMay 6, 2026

Fundamental Limitations of Post-Quantum Cryptographic Architectures

Jiho Jung, Donghwa Ji, Mingyu Lee, Kabgyun Jeong

The paper argues that current lattice-based post-quantum cryptography, which relies on injecting noise, is not unconditionally secure because advanced quantum error correction and learning techniques…

View →
quant-phcs.CRRecentMar 19, 2026

Post-Quantum Cryptography from Quantum Stabilizer Decoding

Jonathan Z. Lu, Alexander Poremba, Yihui Quek, Akshar Ramkumar

The paper proposes that decoding random quantum stabilizer codes is a robust, novel post-quantum cryptographic assumption, demonstrating that its average-case hardness implies core primitives like PKE…

View →
quant-phcs.AIRecentMay 31, 2026

Quantum Algorithm for Distributed Reduction of Entanglements (QADR): A Trainable and Simulation-Efficient QML Framework

Syed Farhan Ahmad, Gregory T. Byrd

The paper introduces QADR, a novel hybrid quantum-classical framework that efficiently trains variational quantum circuits by localizing entanglement reduction, thereby overcoming the exponential memo…

View →
quant-phcs.CRRecentApr 26, 2026

Efficient Quantum Fully Homomorphic Encryption

Fengxia Liu, Zixian Gong, Kun Tian, Yi Zhang +2 more

The paper introduces a unified framework for Quantum Fully Homomorphic Encryption (QFHE) that achieves exponential efficiency improvements by integrating a novel modular arithmetic program (MAP) tailo…

View →
quant-phcs.CRRecentMay 13, 2026

Backdoor Threats in Variational Quantum Circuits: Taxonomy, Attacks, and Defenses

Lei Jiang, Fan Chen

This paper surveys the security vulnerabilities of Variational Quantum Circuits (VQCs) to backdoor attacks, detailing various attack mechanisms and analyzing current detection and defense strategies.

View →
quant-phcs.CCcs.DSRecentMay 28, 2026

Elfs, transducers and quantum walks

Simon Apers, Jérémie Roland, Yuxin Zhang

This paper introduces Electric Flow Sampling (elfs) as a zero-error quantum walk primitive and uses it to derive improved quantum algorithms for various graph problems, including semi-supervised learn…

View →
quant-phcs.CRRecentMay 11, 2026

On Scalable Pseudorandom Unitaries and the Unitary Synthesis Problem

Zvika Brakerski, Henry Yuen

The paper establishes a strong connection between scalable pseudorandom unitaries (PRUs) and the unitary synthesis problem, proving that any such PRU construction must require a classical oracle of si…

View →
quant-phcs.CRmath.CORecentMay 17, 2026

Module Lattice Security (Part IV): Probabilistic Polynomial Quantum Attack on Module-LWE over 2-Power Cyclotomics

Ming-Xing Luo

This paper presents a quantum attack on Module-LWE based lattice schemes like ML-KEM, demonstrating a polynomial-time quantum algorithm with a high success probability.

View →
cs.CRmath.CORecentMay 21, 2026

Exact Hidden Paths in Noisy High Dimensional Path Spaces

Victor Duarte Melo

The paper introduces a mathematical and cryptographic framework for exactly recovering a single, noisy, high-dimensional discrete path from aggregated and incomplete observable data.

View →
quant-phcs.CRRecentJun 4, 2026

On the Cryptographic Structure Required for Verifying Qubits

James Bartusek, Itay Shalit

The paper constructs strong cryptographic primitives, including key agreement and oblivious transfer, directly from classical tests of anti-commutation (ToNC) on quantum devices, while also developing…

View →
cs.CRRecentApr 27, 2026

Machine-Checked Cardinality Bounds for Masked Barrett Reduction: A 1-Bit Side-Channel Leakage Barrier in Post-Quantum Cryptographic Hardware

Ray Iskander, Khaled Kirah

The paper establishes a universal, machine-checked 1-Bit Barrier for the internal wire map of masked Barrett reduction, providing a strong side-channel leakage bound for post-quantum cryptography.

View →
cs.ARRecentMay 31, 2026

Linear Complexity Fermionic Simulation on Quantum Devices with Hardware Connectivity Constraints

Xiangyu Gao, Winston Li, Jiakang Li, Zirui Li +3 more

The paper introduces Accordion, an end-to-end framework that significantly improves the efficiency of compiling fermionic Hamiltonians into quantum circuits for simulation on constrained quantum hardw…

View →
cs.CRRecentApr 20, 2026

From Finite Enumeration to Universal Proof: Ring-Theoretic Foundations for PQC Hardware Masking Verification

Ray Iskander, Khaled Kirah

The paper provides the first machine-checked universal proof, using ring theory, that value-independence implies identical marginal distributions for arithmetic masking, thereby extending the verifica…

View →
cs.CRRecentJun 4, 2026

Towards Worst-case Hardness for Low-Noise LPN

Divesh Aggarwal, Rishav Gupta, Hai Hoang Nguyen, Kel Zin Tan +1 more

The paper presents a new worst-case to average-case reduction for the Learning Parity with Noise (LPN) problem, achieving hardness for inverse-polynomial noise rates previously unattainable.

View →
cs.CRRecentApr 12, 2026

Public Key Encryption from High-Corruption Constraint Satisfaction Problems

Isaac M Hair, Amit Sahai

The paper introduces a novel public key encryption scheme with high security by leveraging the conjectured intractability of two types of highly corrupted constraint satisfaction problems (CSPs).

View →
quant-phcs.CRRecentApr 7, 2026

PQC-Enhanced QKD Networks: A Layered Approach

Paul Spooren, Andreas Neuhold, Sebastian Ramacher, Thomas Hühn

The paper proposes a layered, modular network architecture combining Quantum Key Distribution (QKD) and Post-Quantum Cryptography (PQC) to achieve scalable, end-to-end post-quantum security in multi-h…

View →
cs.CRRecentMay 4, 2026

The 1-Bit Barrier is Universal: k-Stage Pipeline Composition and Unified Leakage Bounds for Standard Modular Reductions in PQC Hardware

Ray Iskander, Khaled Kirah

This paper proves that the per-observation leakage bound for deep, multi-stage masked Number Theoretic Transform (NTT) pipelines remains constant and low ($2/q$), regardless of the pipeline's depth ($…

View →
quant-phcs.CGmath.ATRecentMay 27, 2026

Quantum encodings that preserve persistent homology

Arthur J. Parzygnat, Andrew Vlasic

The paper investigates which quantum encodings can be applied directly to classical data point clouds while preserving the topological invariants necessary for topological data analysis (TDA).

View →
cs.CRcs.LGRecentMay 13, 2026

Backdoor Channels Hidden in Latent Space: Cryptographic Undetectability in Modern Neural Networks

Marte Eggen, Eirik Reiestad, Kristian Gjøsteen, Inga Strümke

The paper demonstrates that cryptographically undetectable backdoors can be embedded into modern, state-of-the-art neural networks by exploiting inherent, latent geometric properties of the learned re…

View →
quant-phcs.CRRecentApr 11, 2026

Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning

Gabriele Gianini, Omar Hasan, Corrrado Mio, Stelvio Cimato +1 more

The paper classifies the subsets of an encrypted-clone storage register, demonstrating that intermediate non-authorized subsets can leak information about the original qubit state through a parity-dep…

View →