Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

四川师范大学学报:自然科学版

双原子分子光谱的量子代数Uqp(u1,1)模型

Huan-Qiang Zhou, 张新明

Published Jan 1, 1995• 0 citations
OpenAlex

Related papers

多光束共振光压作用下钠原子束的偏转

志尧 周, 育竹 王, 汝枋 周 +5 more

Science in China Series A-Mathematics Physics Astronomy & Technological Science (in Chinese)•May 1, 1984•0 citations

Relatively Random Unitary Operators

Karol Życzkowski

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! $$ \mu = \frac{{\operatorname{Re} \left[ {Tr(U_1^\dag U_2^\dag {U_1}{U_2})} \right]}}{N} \ll 1. $$

Operator theory•Jan 1, 1994•2 citations

Quantum Query Complexity of Unitary Operator Discrimination

Akinori Kawachi, Kenichi Kawano, François Le Gall +1 more

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 $\lceil{\sqrt{6}\theta_{\rm cover}^{-1}}\rceil$ 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 $U_1^\dagger {U_2}$, 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 $\lceil{\frac{2}{3 \theta_{\rm cover}}}\rceil$ queries under uniform distribution over S.

IEICE Transactions on Information and Systems•Feb 28, 2019•4 citations

高强度多光子激光的非平衡统计

守礼 彭

Chinese Science Bulletin (Chinese Version)•Sep 1, 1983•0 citations

Covert Communication in Downlink NOMA Systems With Random Transmit Power

Liwei Tao, Weiwei Yang, Shihao Yan +3 more

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.

IEEE Wireless Communications Letters•Jul 22, 2020•140 citations

循环四能级原子介质中的增益相位光栅

杨丽 Li YANG, 董雅宾 Ya-bin DONG, 任磊 Lei REN +1 more

Acta Sinica Quantum Optica•Jan 1, 2022•0 citations
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! μ=Re⁡[Tr(U1†U2†U1U2)]N≪1. \mu = \frac{{\operatorname{Re} \left[ {Tr(U_1^\dag U_2^\dag {U_1}{U_2})} \right]}}{N} \ll 1. μ=NRe[Tr(U1†​U2†​U1​U2​)]​≪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⌉\lceil{\sqrt{6}\theta_{\rm cover}^{-1}}\rceil⌈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†U2U_1^\dagger {U_2}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 ⌈23θcover⌉\lceil{\frac{2}{3 \theta_{\rm cover}}}\rceil⌈3θcover​2​⌉ 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.