Adaptively Secure Unitary Designs with Constant Non-Clifford Cost
Physical Review Letters · 28.05.2026 · 136 (21)
DOI: 10.1103/9hcw-7fl6 ↗Kurz gefasst
Fachartikel in der Zeitschrift Physical Review Letters, online erschienen am 28.05.2026. Verfasst von Lennart Bittel und 1 weiteren Autor:innen. Beteiligte Einrichtung: Freie Universität Berlin, Dahlem Center for Complex Quantum Systems, 14195 Berlin, Germany. Die Arbeit nennt 46 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Deutsche Forschungsgemeinschaft, Bundesministerium für Forschung, Technologie und Raumfahrt, QuantERA.
Abstract (Originalsprache)
Randomness is a fundamental resource in quantum information, with crucial applications in cryptography, algorithms, and error correction. A central challenge is to construct unitary k designs that closely approximate Haar-random unitaries while minimizing the costly use of non-Clifford operations. In this Letter, we present a protocol able to generate unitary k designs on n qubits, secure against any adversarial quantum measurement, with a system-size-independent number of non-Clifford gates. Our construction applies a k design only to a subsystem of size Θ ( k ) , independent of n . This “seed” design is then “diluted” across the entire n -qubit system by sandwiching it between two random Clifford operators. The resulting ensemble forms an ϵ -approximate unitary k design on n qubits. We prove that this construction achieves full quantum security against adaptive adversaries using only O ˜ ( k 2 log ϵ − 1 ) non-Clifford gates. If one requires security only against polynomial-time adaptive adversaries, the non-Clifford cost decreases to O ˜ ( k + log 1 + c ϵ − 1 ) . This is optimal, since we show that at least Ω ( k ) non-Clifford gates are required in this setting. Compared to existing approaches, our method significantly reduces non-Clifford overhead while strengthening security guarantees to adaptive security as well as removing artificial assumptions between n and k . These results make high-order unitary designs practically attainable in near-term fault-tolerant quantum architectures.
Autor:innen und Institutionen
- Freie Universität Berlin, Dahlem Center for Complex Quantum Systems, 14195 Berlin, Germany.
- Università degli Studi di Salerno, Dipartimento di Ingegneria Industriale, Via Giovanni Paolo II, 132, 84084 Fisciano (SA), Italy.
Förderung
- Deutsche Forschungsgemeinschaft
- Bundesministerium für Forschung, Technologie und Raumfahrt
- QuantERA
- Alexander von Humboldt-Stiftung
- European Research Council
- Berlin Mathematics Research Center MATH+
- Ministero dell’Università e della Ricerca
- Munich Quantum Valley
Zitieren
APA
Bittel, L., & Leone, L. (2026). Adaptively Secure Unitary Designs with Constant Non-Clifford Cost. Physical Review Letters, 136(21). https://doi.org/10.1103/9hcw-7fl6
Vancouver
Bittel L, Leone L. Adaptively Secure Unitary Designs with Constant Non-Clifford Cost. Physical Review Letters. 2026;136(21). doi:10.1103/9hcw-7fl6
BibTeX
@article{Bittel2026,
author = {Bittel, Lennart and Leone, Lorenzo},
title = {Adaptively Secure Unitary Designs with Constant Non-Clifford Cost},
journal = {Physical Review Letters},
year = {2026},
volume = {136},
number = {21},
doi = {10.1103/9hcw-7fl6}
}
EUVIMED