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

~ similar to 2607.15617· 20 results

quant-phcs.CRRecentApr 17, 2026

Quantum-Resistant Quantum Teleportation

Xin Jin, Nitish Kumar Chandra, Mohadeseh Azari, Jinglei Cheng +3 more

The paper proposes a quantum-resistant quantum teleportation (QRQT) framework using post-quantum cryptography to secure the classical channel, establishing maximum secure communication distances and a…

View →
quant-phcond-mat.dis-nncs.CCTheoreticalRecentJul 15, 2026

Circuit complexity lower bounds for quantum spin glasses

Omar Al-Ghattas, David Gamarnik

This paper shows that shallow circuits cannot prepare near-optimal states for random quantum $p$-spin glasses, and proves depth lower bounds for such preparations.

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.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 27, 2026

Information-Theoretic Solutions for Seedless QRNG Bootstrapping and Hybrid PQC-QKD Key Combination

Juan Antonio Vieira Giestinhas, Timothy Spiller

The paper proposes a unified, information-theoretic framework using universal hash functions to solve the bootstrapping of seedless QRNGs and to securely combine PQC and QKD keys against quantum adver…

View →
quant-phcs.CRRecentMar 28, 2026

Quantum Bit Error Rate Analysis in BB84 Quantum Key Distribution: Measurement, Statistical Estimation, and Eavesdropping Detection

Jaydeep Rath, Prajwal Panth, P. S. N. Bhaskar

This paper systematically analyzes the Quantum Bit Error Rate (QBER) in the BB84 Quantum Key Distribution protocol, demonstrating its use for quantifying channel noise and detecting eavesdropping, par…

View →
quant-phcs.CRRecentApr 13, 2026

Answering Counting Queries with Differential Privacy on a Quantum Computer

Arghya Mukherjee, Hassan Jameel Asghar, Gavin K. Brennen

This paper develops and analyzes two differentially private methods for answering counting queries on quantum-encoded datasets, demonstrating improved privacy guarantees and a quantum-safe approach fo…

View →
cs.CRRecentMay 5, 2026

Quantum-Resistant Networks: A Review of Primitives, Protocols and Best Practices

Elisa Bertino, Ramana Kompella, Ashish Kundu, Cristina Nita-Rotaru +2 more

This paper provides a comprehensive, system-level taxonomy for designing quantum-resistant network architectures, moving beyond simple protocol substitutions to address key distribution and management…

View →
quant-phcs.CRRecentMar 18, 2026

One Key Good, L Keys Better: List Decoding Meets Quantum Privacy Amplification

Prateek P. Kulkarni

The paper introduces List Privacy Amplification (LPA) and proves the Quantum List Leftover Hash Lemma (QLLHL), demonstrating that it can significantly increase the achievable key length in Quantum Key…

View →
cs.CCTheoreticalRecentJul 9, 2026

QMA Lower Bounds for Batch Verification via Approximate Degree

Mark Bun, Mandar Juvekar, Samuel King

The paper studies the resources required to batch verify Boolean functions and provides lower bounds on the witness-query tradeoff based on approximate degree.

View →
cs.ITcs.NIquant-phTheoreticalRecentJul 26, 2026

Lossless Address Coding for Quantum Networks

Dick Maryopi

This paper proposes a lossless source coding scheme for quantum network addressing, enabling compact, hierarchical, and coherently processable quantum address states.

View →
quant-phcs.CRRecentMay 29, 2026

Pseudoentanglement in constant depth: How trivial states can have non-trivial entanglement structure

Alexandru Gheorghiu

The paper constructs a family of simple quantum states (pseudoentangled states) generated by constant-depth circuits that exhibit non-trivial entanglement structure, demonstrating that entanglement st…

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 →
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.CRcs.SEquant-phRecentApr 8, 2026

Broken Quantum: A Systematic Formal Verification Study of Security Vulnerabilities Across the Open-Source Quantum Computing Simulator Ecosystem

Dominik Blain

The paper presents Broken Quantum, a comprehensive formal security audit that identifies 547 security vulnerabilities across 45 open-source quantum computing simulators, revealing critical flaws in me…

View →