[Submitted on 29 Jun 2026 (v1), last revised 30 Sep 2026 (this version, v2)] View PDF HTML (experimental) Comments: Subjects: Quantum Physics (quant-ph); Computational Complexity (cs.CC); Cryptography and Security (cs.CR) Cite as: arXiv:2606.30281 [quant-ph] (or arXiv:2606.30281v2 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2606.30281
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Articles by Fermi Ma
A one-query lower bound for unitary synthesis and breaking quantum cryptography
Paper 2023/1602 , Princeton University , Simons Institute, University of California, Berkeley , University of California, Berkeley The Unitary Synthesis Problem (Aaronson-Kuperberg 2007) asks whether any $n$-qubit unitary $U$ can be implemented by an efficient quantum algorithm $A$ augmented with an oracle that computes an arbitrary Boolean function $f$. In other words, can the task of implementing any unitary be efficiently reduced to the task of implementing any Boolean function?
Commitments to Quantum States
Paper 2022/1358 Commitments to Quantum States , UC Berkeley , UC Berkeley , Simons Institute and UC Berkeley , NTT Research and Princeton Abstract What does it mean to commit to a quantum state? In this work, we propose a simple answer: a commitment to quantum messages is binding if, after the commit phase, the committed state is hidden from the sender's view. We accompany this new definition with several instantiations.
Post-Quantum Zero Knowledge, Revisited (or: How to do Quantum Rewinding Undetectably)
Paper 2021/1543 Post-Quantum Zero Knowledge, Revisited (or: How to do Quantum Rewinding Undetectably) , Massachusetts Institute of Technology , Simons Institute, University of California, Berkeley , University of Warwick Abstract When do classical zero-knowledge protocols remain secure against quantum attacks?
Succinct Classical Verification of Quantum Computation
Paper 2022/857 Succinct Classical Verification of Quantum Computation , University of California, Berkeley , Microsoft Research, Massachusetts Institute of Technology , Massachusetts Institute of Technology , University of California, Berkeley, Simons Institute , Max Planck Institute for Security and Privacy , Massachusetts Institute of Technology , California Institute of Technology , Massachusetts Institute of Technology Abstract We construct a classically verifiable succinct interactive...
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Fermi
Contact Fermi, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack