Property Testing of Quantum Measurements
Guoming Wang

TL;DR
This paper introduces methods for efficiently testing properties of unknown quantum measurements, including stabilizer, k-local, and permutation-invariant measurements, with query complexity independent of system dimension.
Contribution
It develops a metric for quantum measurements and provides algorithms for property testing and measurement comparison with dimension-independent query complexity.
Findings
Efficient testing of stabilizer, k-local, and permutation-invariant measurements.
Query complexity is independent of the quantum system's dimension.
Algorithms for measuring the distance between two unknown quantum measurements.
Abstract
In this paper, we study the following question: given a black box performing some unknown quantum measurement on a multi-qudit system, how do we test whether this measurement has certain property or is far away from having this property. We call this task \textit{property testing} of quantum measurement. We first introduce a metric for quantum measurements, and show that it possesses many nice features. Then we show that, with respect to this metric, the following classes of measurements can be efficiently tested: 1. the stabilizer measurements, which play a crucial role for quantum error correction; 2. the -local measurements, i.e. measurements whose outcomes depend on a subsystem of at most qudits; 3. the permutation-invariant measurements, which include those measurements used in quantum data compression, state estimation and entanglement concentration. In fact, all of them…
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 Computing Algorithms and Architecture · Quantum Information and Cryptography · Complexity and Algorithms in Graphs
