Computational Complexity of Unitary and State Design Properties

We investigate unitary and state t -designs from a computational complexity perspective. First, we address the problems of computing frame potentials that characterize (approximate) t -designs. We present a quantum algorithm for computing frame potentials and establish the following: (1) exact compu...

Full description

Bibliographic Details

Published in:	PRX quantum Vol. 6; no. 3; p. 030345
Main Authors:	Nakata, Yoshifumi, Takeuchi, Yuki, Kliesch, Martin, Darmawan, Andrew
Format:	Journal Article
Language:	English
Published:	American Physical Society 09.09.2025
ISSN:	2691-3399, 2691-3399
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!