Quantum Hypothesis Testing with Group Structure

Abstract

The problem of discriminating between many quantum channels with certainty is analyzed under the assumption of prior knowledge of algebraic relations among possible channels. It is shown, by explicit construction of a novel family of quantum algorithms, that when the set of possible channels faithfully represents a finite subgroup of SU(2) (e.g., $C_n,D_{2n},A_4,S_4,A_5$) the recently-developed techniques of quantum signal processing can be modified to constitute subroutines for quantum hypothesis testing. These algorithms, for group quantum hypothesis testing (G-QHT), intuitively encode discrete properties of the channel set in SU(2) and improve query complexity at least quadratically in $n$, the size of the channel set and group, compared to naïve repetition of binary hypothesis testing. Intriguingly, performance is completely defined by explicit group homomorphisms; these in turn inform simple constraints on polynomials embedded in unitary matrices. These constructions demonstrate a flexible technique for mapping questions in quantum inference to the well-understood subfields of functional approximation and discrete algebra. Extensions to larger groups and noisy settings are discussed, as well as paths by which improved protocols for quantum hypothesis testing against structured channel sets have application in the transmission of reference frames, proofs of security in quantum cryptography, and algorithms for property testing.

arXiv comment22 pages + 9 figures + 3 tables

References in corpus (21)

• Quantum algorithm for solving linear systems of equations
• Hamiltonian Simulation by Qubitization
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Quantum algorithms for algebraic problems
• Statistical distinguishability between unitary operations
• General Resource Theories in Quantum Mechanics and Beyond: Operational Characterization via Discrimination Tasks
• Optimal discrimination of quantum operations
• Memory effects in quantum channel discrimination
• Efficient phase-factor evaluation in quantum signal processing
• The methodology of resonant equiangular composite quantum gates
• Operational Advantage of Quantum Resources in Subchannel Discrimination
• The Perfect Distinguishability of Quantum Operations
• Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations
• Fundamental limits to quantum channel discrimination
• Adaptive versus non-adaptive strategies for quantum channel discrimination
• Reexamination of Quantum Bit Commitment: the Possible and the Impossible
• Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
• Optimal estimation of group transformations using entanglement
• Product Decomposition of Periodic Functions in Quantum Signal Processing
• Ultimate limits for multiple quantum channel discrimination
• Unitary-process discrimination with error margin

Cited by in corpus (6)

• Multivariable quantum signal processing (M-QSP): prophecies of the two-headed oracle
• Experimental quantum channel discrimination using metastable states of a trapped ion
• Quantum advantage for noisy channel discrimination
• Single-shot Quantum Signal Processing Interferometry
• Reductive Quantum Phase Estimation
• Optimal Hamiltonian recognition of unknown quantum dynamics