The efficiency of quantum identity testing of multiple states
From MaRDI portal
Abstract: We examine two quantum operations, the Permutation Test and the Circle Test, which test the identity of n quantum states. These operations naturally extend the well-studied Swap Test on two quantum states. We first show the optimality of the Permutation Test for any input size n as well as the optimality of the Circle Test for three input states. In particular, when n=3, we present a semi-classical protocol, incorporated with the Swap Test, which approximates the Circle Test efficiently. Furthermore, we show that, with help of classical preprocessing, a single use of the Circle Test can approximate the Permutation Test efficiently for an arbitrary input size n.
Recommendations
Cited in
(8)- Sequential measurements, disturbance and property testing
- SWAP test for an arbitrary number of quantum states
- The SWITCH test for discriminating quantum evolutions
- Approximate orthogonality of permutation operators, with application to quantum information
- Pseudorandom isometries
- Dimension independent disentanglers from unentanglement and applications
- On the power of quantum distributed proofs
- Revocable encryption, programs, and more: the case of multi-copy security
This page was built for publication: The efficiency of quantum identity testing of multiple states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3531190)