Quantifying extractable imaginarity with qubit triangles

Two qubit states with the same robustness of imaginarity can differ in the robustness attainable by real filtering on a successful outcome. We represent the input robustness $R$ and the largest conditional robustness $κ$ by the base of a right triangle and the slope of its hypotenuse, respectively. Twice the area, $R^2κ$, defines a faithful, convex measure that is monotone on average under real instruments. In arbitrary finite dimensions, maximizing the mean normalized area of the extracted qubits gives the pointwise smallest strongly monotone extension of the qubit measure. We derive computable bounds on this area by determining the maximum mean squared robustness of the output qubits. This maximum equals the Bures quantum $χ^2$ divergence between the input and its real part. A projection onto orthogonal real subspaces attains the maximum and, when its outcome is retained, preserves the quantum Fisher information at the midpoint of a mixture of the input and its complex conjugate. We obtain exact areas for states with commuting real and imaginary parts and for pure states mixed with white noise. Two eight-dimensional states have identical $R$, $κ$, and optimal mean squared robustness, yet their different areas rule out deterministic conversion by real operations in one direction.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24305
Primary Topic
Quantum Information and Cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Quantifying extractable imaginarity with qubit triangles

Shao‐Ming Fei, Meng‐Li Guo, Wen Xu, Chen-Xin Xu
arXiv (Cornell University)
Quantum Information and Cryptography
preprint

Quantifying extractable imaginarity with qubit triangles

Shao‐Ming Fei, Meng‐Li Guo, Wen Xu, Chen-Xin Xu
preprint en

Abstract

Two qubit states with the same robustness of imaginarity can differ in the robustness attainable by real filtering on a successful outcome. We represent the input robustness $R$ and the largest conditional robustness $κ$ by the base of a right triangle and the slope of its hypotenuse, respectively. Twice the area, $R^2κ$, defines a faithful, convex measure that is monotone on average under real instruments. In arbitrary finite dimensions, maximizing the mean normalized area of the extracted qubits gives the pointwise smallest strongly monotone extension of the qubit measure. We derive computable bounds on this area by determining the maximum mean squared robustness of the output qubits. This maximum equals the Bures quantum $χ^2$ divergence between the input and its real part. A projection onto orthogonal real subspaces attains the maximum and, when its outcome is retained, preserves the quantum Fisher information at the midpoint of a mixture of the input and its complex conjugate. We obtain exact areas for states with commuting real and imaginary parts and for pure states mixed with white noise. Two eight-dimensional states have identical $R$, $κ$, and optimal mean squared robustness, yet their different areas rule out deterministic conversion by real operations in one direction.

arXiv (Cornell University)
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon