On the distinguishability of geometrically uniform quantum states

Abstract

A geometrically uniform (GU) ensemble is a uniformly weighted quantum state ensemble generated from a fixed state by a unitary representation of a finite group $G$. In this work we analyze the problem of discriminating GU ensembles from various angles. Assuming that the representation of $G$ is irreducible, we first show that a particular optimal measurement can be understood as the limit of weighted `pretty good measurements' (PGM). This naturally provides examples of state discrimination for which the unweighted PGM is provably sub-optimal. We extend this analysis to certain reducible representations, and use Schur-Weyl duality to discuss two particular examples of GU ensembles in terms of Werner-type and permutation-invariant generator states. For the case of pure-state GU ensembles we give a streamlined proof of optimality of the PGM first proved in [Eldar et al., 2004]. We use this result to give simplified proofs of the optimality of the PGM, along with expressions for the corresponding success probabilities, for two tasks: the hidden subgroup problem over semidirect product groups (first proved in [Bacon et al., 2005]), and port-based teleportation (first proved in [Mozrzymas et al., 2019] and [Leditzky, 2022]). Finally, we consider the $n$-copy setting and adapt a result of [Montanaro, 2007] to derive a compact and easily evaluated lower bound on the success probability of the PGM for this task. This result can be applied to the hidden subgroup problem to obtain a new proof for an upper bound on the sample complexity by [Hayashi et al., 2006].

24 pages, comments welcome! v2: added citation to previous result by Holevo (Ref. [38]), improved presentation, identical to published version

References in corpus (41)

• On the reality of the quantum state
• The operational meaning of min- and max-entropy
• Structure of states which satisfy strong subadditivity of quantum entropy with equality
• Programmable quantum gate arrays
• Evenly distributed unitaries: on the structure of unitary designs
• Quantum algorithms for algebraic problems
• Quantum state discrimination and its applications
• Strong Converse to the Quantum Channel Coding Theorem
• Asymptotic teleportation scheme as a universal programmable quantum processor
• From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
• Simplified instantaneous non-local quantum computation with applications to position-based cryptography
• Fundamental limits to quantum channel discrimination
• Accessible information and optimal strategies for real symmetrical quantum sources
• Quantum teleportation scheme by selecting one of multiple output ports
• Conclusive Exclusion of Quantum States
• On the Optimality of Square Root Measurements in Quantum State Discrimination
• Optimal probabilistic storage and retrieval of unitary channels
• Quantum communication complexity advantage implies violation of a Bell inequality
• Probabilistic exact universal quantum circuits for transforming unitary operations
• On the distinguishability of random quantum states
• Port-based teleportation in arbitrary dimension
• Capacities of Quantum Channels and How to Find Them
• Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on the maximum overlap problem using directional iterates
• Optimal Port-based Teleportation
• Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds
• Optimization and learning of quantum programs
• Convex optimization of programmable quantum computers
• Deterministic transformations between unitary operations: Exponential advantage with adaptive quantum circuits and the power of indefinite causality
• Asymptotic performance of port-based teleportation
• Optimal Measurements for Symmetric Quantum States with Applications to Optical Communication
• Complexity and entanglement in non-local computation and holography
• Optimal measurements for the dihedral hidden subgroup problem
• Error rates of Belavkin weighted quantum measurements and a converse to Holevo's asymptotic optimality theorem
• Characterising port-based teleportation as a universal simulator of qubit channels
• General Mixed State Quantum Data Compression with and without Entanglement Assistance
• Optimality of the pretty good measurement for port-based teleportation
• On the Duality of Teleportation and Dense Coding
• Quantum Coupon Collector
• Quantum State Merging for Arbitrarily Small-Dimensional Systems
• Optimal lower bounds for Quantum Learning via Information Theory
• The pretty bad measurement