Epsilon-Nets, Unitary Designs, and Random Quantum Circuits

DOI10.1109/TIT.2021.3128110zbMath1489.81011arXiv2007.10885OpenAlexW3213277701MaRDI QIDQ5030341

Adam Sawicki, Michał Oszmaniec, Michał Horodecki

Publication date: 17 February 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.10885

zbMATH Keywords

approximate t-designscompilation of quantum gatesconstruction of efficient polynomial approximations to Dirac deltanon-constructive Solovay-Kitaev theoremshallow random circuitsspace of quantum channelsuniversal two-qudit gate

Mathematics Subject Classification ID

Quantum computation (81P68) Channel models (including quantum) in information and communication theory (94A40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (2)

Calculable lower bounds on the efficiency of universal sets of quantum gates ⋮ Hay from the haystack: explicit examples of exponential quantum circuit complexity

This page was built for publication: Epsilon-Nets, Unitary Designs, and Random Quantum Circuits