Hierarchically discriminating Haar-randomness in quantum states from a black-box device
Xavier Bonet-Monroig, Hao Wang, Adri\'an P\'erez-Salinas

TL;DR
This paper introduces a hierarchical algorithm to efficiently determine if quantum states from a black-box device are Haar-random, using statistical moments and observable spectrum analysis, aiding quantum device benchmarking.
Contribution
The work presents a novel hierarchical discrimination algorithm that reduces complexity in testing Haar-randomness of quantum states from black-box devices, including analytical Haar moments and extensions for improved accuracy.
Findings
The discriminator can identify non-Haar-random states effectively.
Analytical Haar moments are computed using a new connection with the Dirichlet distribution.
Extensions improve the discrimination accuracy with increased computational resources.
Abstract
The concept of randomness in quantum computing has been central to construct benchmarking tools, cryptographic protocols, as well as a proof of beyond classical computation. Discerning whether quantum states (or unitaries) are randomly distributed is a computational task that requires an enormous amount of quantum computational resources. This work addresses such a challenge, a hierarchical discrimination algorithm to efficiently test the if a set of states generated from a black-box quantum device with an unknown distribution is (in)compatible with a random distribution. To this end, we reduce the complexity of the problem by selecting an observable with known spectrum to study the statistical properties of its expectation values with respect to the quantum states from an unknown (black-box) quantum device. Concurrently, we use our first technical result, a connection between…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Computability, Logic, AI Algorithms
