SearcharxivSearch

arXiv subjects

Pei-Ying Chen

Publications and source records attributed to Pei-Ying Chen.

3 recordsLinked to original sources

Geometry of Kirkwood-Dirac classical states: A case study based on discrete Fourier transform

The characterization of Kirkwood-Dirac (KD) classicality or non-classicality is very important in quantum information processing. In general, the set of KD classical states with respect to two bases is not a convex polytope[J. Math. Phys. \textbf{65} 072201 (2024)], which makes us interested in finding out in which circumnstances they do form a polytope. In this paper, we focus on the characterization of KD classicality of mixed states for the case where the transition matrix between two bases is a discrete Fourier transform (DFT) matrix in Hilbert space with dimensions $p^2$ and $pq$, respectively, where $p, q$ are prime. For the two particular cases we investigate, the sets of extremal points are finite, implying that the set of KD classical states we characterize forms a convex polytope. We show that for $p^2$ dimensional system, the set $\rm{KD}_{\mathcal{A},\mathcal{B}}^+$ is a convex hull of the set $\rm {pure}({\rm {KD}_{\mathcal{A},\mathcal{B}}^+})$ based on DFT, where $\rm{KD}_{\mathcal{A},\mathcal{B}}^+$ is the set of KD classical states with respect to two bases and $\rm {pure}({\rm {KD}_{\mathcal{A},\mathcal{B}}^+})$ is the set of all the rank-one projectors of KD classical pure states with respect to two bases. In $pq$ dimensional system, we believe that this result also holds. Unfortunately, we do not completely prove it, but some meaningful conclusions are obtained about the characterization of KD classicality.

quant-ph

Characterizing Kirkwood-Dirac nonclassicality and uncertainty diagram based on discrete Fourier transform

In this paper, we investigate the Kirkwood-Dirac nonclassicality and uncertainty diagram based on discrete Fourier transform (DFT) in a $d$ dimensional system. The uncertainty diagram of complete incompatibility bases $\mathcal {A},\mathcal {B}$ are characterized by De Bièvre [arXiv: 2207.07451]. We show that for the uncertainty diagram of the DFT matrix which is a transition matrix from basis $\mathcal {A}$ to basis $\mathcal {B}$, there is no ``hole" in the region of the $(n_{\mathcal {A}}, n_{\mathcal {B}})$-plane above and on the line $n_{\mathcal {A}}+n_{\mathcal {B}}\geq d+1$, whether the bases $\mathcal {A},\mathcal {B}$ are not complete incompatible bases or not. Then we present that the KD nonclassicality of a state based on the DFT matrix can be completely characterized by using the support uncertainty relation $n_{\mathcal {A}}(ψ)n_{\mathcal {B}}(ψ)\geq d$, where $n_{\mathcal {A}}(ψ)$ and $n_{\mathcal {B}}(ψ)$ count the number of nonvanishing coefficients in the basis $\mathcal {A}$ and $\mathcal {B}$ representations, respectively. That is, a state $|ψ\rangle$ is KD nonclassical if and only if $n_{\mathcal {A}}(ψ)n_{\mathcal {B}}(ψ)> d$, whenever $d$ is prime or not. That gives a positive answer to the conjecture in [Phys. Rev. Lett. \textbf{127}, 190404 (2021)].

quant-ph

Challenges of measuring the impact of software: an examination of the lme4 R package

The rise of software as a research object is mirrored in the increasing interests towards quantitative studies of scientific software. However, due to the inconsistent practice of citing software, most of the existing studies analyzing the impact of scientific software are based on identification of software name mentions in full-text publications. Despite its limitations, citation data have a much larger quantity and broader coverage of scientific fields than full-text data and thus could support findings in much larger scopes. This paper presents an analysis aiming to evaluate the extent to which citations data can be used to reconstruct the impact of software. Specifically, we identified the variety of citable objects related to the lme4 R package and examined how the package's impact is scattered across these objects. Our results reveal a little-discussed challenge of using citation data to measure the impact of software, that even within the category of formal citation, there might be different forms in which the same software object is cited. This challenge can be mitigated by more carefully selecting objects as the proxy of software. However, it cannot be fully solved until we have one-software-one-proxy policy for software citation.

cs.DL