Consider unitary operators Û1 and Û2 represented by matrices U 1 and U 2 of size N. We shall call operators Û1 and Û2 relatively random. if (1) % MathType!MTEF!2!1!+- % feaagCart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9 % vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x % fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeqiVd0Maey % ypa0ZaaSaaaeaaciGGsbGaaiyzamaadmaabaGaamivaiaadkhacaGG % OaGaamyvamaaDaaaleaacaaIXaaabaGaaiiiGaaakiaadwfadaqhaa % WcbaGaaGOmaaqaaiaaccciaaGccaWGvbWaaSbaaSqaaiaaigdaaeqa % aOGaamyvamaaBaaaleaacaaIYaaabeaakiaacMcaaiaawUfacaGLDb % aaaeaacaWGobaaaiablQMi9iaaigdacaGGUaaaaa!4BEE! μ=NRe[Tr(U1†U2†U1U2)]≪1.
Unitary operator discrimination is a fundamental problem in quantum information theory. The basic version of this problem can be described as follows: Given a black box implementing a unitary operator U∈S:={U1, U2} under some probability distribution over S, the goal is to decide whether U=U1 or U=U2. In this paper, we consider the query complexity of this problem. We show that there exists a quantum algorithm that solves this problem with bounded error probability using ⌈6θcover−1⌉ queries to the black box in the worst case, i.e., under any probability distribution over S, where the parameter θcover, which is determined by the eigenvalues of U1†U2, represents the “closeness” between U1 and U2. We also show that this upper bound is essentially tight: we prove that for every θcover > 0 there exist operators U1 and U2 such that any quantum algorithm solving this problem with bounded error probability requires at least ⌈3θcover2⌉ queries under uniform distribution over S.
This letter considers covert communication in downlink NOMA systems, where a public action (communication from Alice to the NOMA-weak user U1) is used to provide a cover for a secret action (communication from Alice to the NOMA-strong user U2). To aid system design, we first derive the detection error probability (DEP) at Willie and the connect outage probabilities (COPs) at U1 and U2. Then, considering the covertness and outage constraints, the optimization of power allocation factor ratio between U1 and U2 is tackled in order to maximize the effective covert rate. The results demonstrate that the minimum DEP is the power allocation factor for U1. In addition, for a given covert constraint, relaxing the outage constraint will effectively increase the maximum effective covert rate within a certain range of the maximum transmit power of U1.