Back to News
quantum-computing

Quantum Reservoir Autoencoder for Blind Decryption: Two-Phase Protocol and Noise Resilience

arXiv Quantum Physics
Loading...
4 min read
0 likes
⚡ Quantum Brief
Researchers Wakaura and Tanimae introduced a quantum reservoir autoencoder (QRA) that achieves noise-resilient blind decryption, suppressing shot-noise sensitivity by ten orders of magnitude compared to noiseless systems. The two-phase protocol trains decoding weights using shared plaintexts, decrypting unseen messages with near-perfect accuracy (MSE ~10⁻⁴) across ideal, shot-noise, and combined noise conditions, proving robustness against real-world quantum noise. Experiments revealed a sharp phase transition for qubit requirements, establishing a design rule: plaintext length must not exceed Nq(Nq+1)/2 + 8 for reliable decryption, where Nq is the qubit count. Blind decryption variants lacking training data failed (MSE ~0.3–0.53), confirming shared plaintexts are essential for viable decryption, even with advanced quantum architectures. The QRA outperformed variational quantum circuits under depolarizing noise, maintaining performance while baseline quantum recurrent neural networks collapsed entirely, highlighting its superior noise resilience.
Quantum Reservoir Autoencoder for Blind Decryption: Two-Phase Protocol and Noise Resilience

Summarize this article with:

Quantum Physics arXiv:2603.12303 (quant-ph) [Submitted on 12 Mar 2026] Title:Quantum Reservoir Autoencoder for Blind Decryption: Two-Phase Protocol and Noise Resilience Authors:Hikaru Wakaura, Taiki Tanimae View a PDF of the paper titled Quantum Reservoir Autoencoder for Blind Decryption: Two-Phase Protocol and Noise Resilience, by Hikaru Wakaura and Taiki Tanimae View PDF HTML (experimental) Abstract:We instantiate the quantum reservoir autoencoder (QRA) with a noise-induced reservoir employing reset noise channels and address two open problems: noise-resilient reversibility and blind decryption. For a single-ciphertext protocol with 10 data qubits and random (non-optimized) reset probabilities, the open-system reservoir suppresses shot-noise sensitivity by ten orders of magnitude, yielding mean-squared error (MSE) $\sim 10^{-14}$ compared with $\sim 10^{-3}$ without reset channels ($N_{\mathrm{shots}} = 1000$). A two-phase protocol trains per-position decoding weights from $M$ shared training plaintexts and decrypts previously unseen messages at MSE $\sim 10^{-4}$, with no statistically significant performance difference among ideal, shot-noise, and reset-plus-shot-noise conditions ($p > 0.05$, 16 seeds). Experiments at $N_q = 5$, 7, and 10 reveal a sharp phase transition at plaintext length $N_c \approx N_q(N_q{+}1)/2 + 8$, providing a design rule for the minimum qubit count. Two blind decoder variants that lack ground-truth targets -- a single-ciphertext cross-path iteration (MSE $\approx 0.3$) and a multi-sample regression variant (MSE $\approx 0.53$, worse than random) -- establish that shared training data is the irreducible requirement for blind decryption. A comparison with variational quantum circuit baselines shows that the fixed-reservoir analytic-readout architecture is dramatically more noise-robust: a quantum recurrent neural network protocol is completely destroyed under depolarizing noise, whereas the QRA remains invariant. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2603.12303 [quant-ph] (or arXiv:2603.12303v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2603.12303 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Hikaru Wakaura [view email] [v1] Thu, 12 Mar 2026 07:05:46 UTC (316 KB) Full-text links: Access Paper: View a PDF of the paper titled Quantum Reservoir Autoencoder for Blind Decryption: Two-Phase Protocol and Noise Resilience, by Hikaru Wakaura and Taiki TanimaeView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-03 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-machine-learning
quantum-hardware

Source Information

Source: arXiv Quantum Physics