aiqbench analysis
This research establishes that sequential repetitions of the parallel Kac's Walk constitute an adaptive-secure pseudorandom unitary family, offering a novel construction in quantum cryptography. By confirming a prior conjecture and demonstrating strong security against inverse queries, the study further validates the efficacy of path recording techniques for generating secure quantum protocols. The work advances theoretical foundations in quantum complexity and cryptographic security without relying on external classical assumptions.
Parallel Kac's Walk Generates PRU
arXiv:2504.14957v3 Announce Type: replace Abstract: Ma and Huang recently proved that the PFC construction, introduced by Metger, Poremba, Sinha and Yuen [MPSY24], gives an adaptive-secure pseudorandom unitary family PRU. Their proof developed a new path recording technique [MH25]. In this work, we show that a linear number of sequential repetitions of the parallel Kac's Walk, introduced by Lu, Qin, Song, Yao and Zhao [LQS+26], also forms an adaptive-secure PRU, confirming a conjecture therein. Moreover, it additionally satisfies strong security against adversaries making inverse queries. This gives an alternative PRU construction, and provides another instance demonstrating the power of the path recording technique. We also discuss some further simplifications and implications.
Abstract:Ma and Huang recently proved that the PFC construction, introduced by Metger, Poremba, Sinha and Yuen [MPSY24], gives an adaptive-secure pseudorandom unitary family PRU. Their proof developed a new path recording technique [MH25]. In this work, we show that a linear number of sequential repetitions of the parallel Kac's Walk, introduced by Lu, Qin, Song, Yao and Zhao [LQS+26], also forms an adaptive-secure PRU, confirming a conjecture therein. Moreover, it additionally satisfies strong security against adversaries making inverse queries. This gives an alternative PRU construction, and provides another instance demonstrating the power of the path recording technique. We also discuss some further simplifications and implications.
Quantum Physics (quant-ph); Computational Complexity (cs.CC); Cryptography and Security (cs.CR)
arXiv:2504.14957 [quant-ph]
(or arXiv:2504.14957v3 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2504.14957 Focus to learn more arXiv-issued DOI via DataCite
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.
Full text under the publisher's open licence · 204 words
Related coverage
Walk fast but be careful: Understanding Parallel Sampling in Masked Diffusion
arXiv · Oct 8, 2026
From Vector Search to Agentic RAG: Building an Enterprise Research Analyst with hipVS
AMD · Jul 15, 2026
Runway’s WorldPrompt and the Engineering of Real-Time Worlds
Latent Space · Sep 25, 2026
Attention Decode on AMD MI450 GPUs: A Gluon Kernel Optimization Guide
AMD · Jul 27, 2026