all InfoSec news
Simple constructions of linear-depth t-designs and pseudorandom unitaries
April 22, 2024, 4:11 a.m. | Tony Metger, Alexander Poremba, Makrand Sinha, Henry Yuen
cs.CR updates on arXiv.org arxiv.org
Abstract: Uniformly random unitaries, i.e. unitaries drawn from the Haar measure, have many useful properties, but cannot be implemented efficiently. This has motivated a long line of research into random unitaries that "look" sufficiently Haar random while also being efficient to implement. Two different notions of derandomisation have emerged: $t$-designs are random unitaries that information-theoretically reproduce the first $t$ moments of the Haar measure, and pseudorandom unitaries (PRUs) are random unitaries that are computationally indistinguishable from …
arxiv cs.cr depth line linear measure quant-ph random research simple
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
Lead Security Specialist
@ Fujifilm | Holly Springs, NC, United States
Security Operations Centre Analyst
@ Deliveroo | Hyderabad, India (Main Office)
CISOC Analyst
@ KCB Group | Kenya
Lead Security Engineer – Red Team/Offensive Security
@ FICO | Work from Home, United States
Cloud Security SME
@ Maveris | Washington, District of Columbia, United States - Remote
SOC Analyst (m/w/d)
@ Bausparkasse Schwäbisch Hall | Schwäbisch Hall, DE