Quantum measurements for hidden subgroup problems with optimal sample complexity
From MaRDI portal
Recommendations
- Optimal measurements for the dihedral hidden subgroup problem
- For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets
- On the complexity of the hidden subgroup problem
- On the Complexity of the Hidden Subgroup Problem
- The quantum query complexity of the hidden subgroup problem is polynomial
Cited in
(18)- An upper bound on the success probability of minimum-error discrimination
- On the quantum complexity of the continuous hidden subgroup problem
- Bit-oriented quantum public key probabilistic encryption schemes
- Sample complexity of hidden subgroup problem
- Quantum public-key encryption schemes based on conjugate coding
- Entropic lower bound for distinguishability of quantum states
- For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets
- On the Power of Quantum Encryption Keys
- Optimal measurements for the dihedral hidden subgroup problem
- Quantum Testers for Hidden Group Properties
- scientific article; zbMATH DE number 1293522 (Why is no real title available?)
- Computational indistinguishability between quantum states and its cryptographic application
- The independence of reduced subgroup-state
- Public-key cryptography based on bounded quantum reference frames
- Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on maximum overlap using directional iterates
- How hard is deciding trivial versus nontrivial in the dihedral coset problem?
- Complexity bounds on some fundamental computational problems for quantum branching programs.
- On the distinguishability of geometrically uniform quantum states
This page was built for publication: Quantum measurements for hidden subgroup problems with optimal sample complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3534623)
