SearcharxivSearch

arXiv subjects

Ruoting Dou

Publications and source records attributed to Ruoting Dou.

2 recordsLinked to original sources

The Inverse Eigenvalue Problem for Partial Transposes of Two-Qubit States

For a bipartite state $\rho$, information about the spectrum of its partial transpose $\rho^{\Gamma_B}$ can be inferred from measurements on multiple copies of $\rho$, without full state tomography. This raises a natural question: which eigenvalue lists can arise as $\operatorname{spec}(\rho^{\Gamma_B})$ for a density operator $\rho$? We completely solve this inverse eigenvalue problem for two qubits. Every nonnegative trace-one spectrum is realized as $\operatorname{spec}(\rho^{\Gamma_B})$ by some PPT state $\rho$, whereas an ordered candidate eigenvalue list $(x,y,z,-q)$, with $x\ge y\ge z\ge0$, $q>0$, and $x+y+z-q=1$, is realized by an NPT state iff $q\le y$ and $qy\le xz$. Sufficiency in the latter case is established by an explicit $X$ state whose quantum steering ellipsoid has center $c=(y-q)/(1-z)$ and normalized volume $V/V_{\max}(c)=qy/(xz)$, providing a geometric interpretation of the inequalities $q\le y$ and $qy\le xz$ as the allowed ellipsoid-center region and the fixed-center volume bound. Beyond this geometric picture, the two-qubit inverse theorem also yields exact negativity bounds from the two lowest nontrivial PT moments. Given fixed values of $p_2=Tr[(\rho^{\Gamma_B})^2]$ and $p_3=Tr[(\rho^{\Gamma_B})^3]$, we determine the exact minimum and maximum negativity over all two-qubit states subject to these moment constraints. When no PPT state is consistent with the pair $(p_2,p_3)$, the minimum is attained either at $x=y$ or $qy=xz$, while the maximum is attained either at $y=z$ or $q=y$. Finally, we show how the two-qubit inequalities persist as necessary constraints for the inverse eigenvalue problem in qubit--qudit systems.

quant-ph

Local Universality and Structural Certificates for Minimal Fixed-Depth Two-Qutrit Gate Decomposition

We study a dimension-saturating fixed-core ansatz in which four copies of a fixed, non-tunable two-qutrit core $K\in SU(9)$ are interleaved with five adjustable local layers from $L=SU(3)\otimes SU(3)$. Since $\dim SU(9)=80$ and $5\dim L=80$, this is the shortest fixed-core architecture not excluded by parameter counting. We formulate the smooth map $\Phi_K:L^5\to SU(9)$ and use its right-trivialized differential to give verifiable certificates for local universality. We construct an explicit Clifford-word core whose Pauli-label splitting makes the identity-point differential an exact isometry, and we classify all 2304 symplectic actions satisfying the same splitting criterion. We also prove a structural obstruction for an important symmetry class: every complex-symmetric core $K=K^{T}$, including every core generated by a time-independent real-symmetric Hamiltonian in the chosen computational basis, has identity-point differential rank at most 78; hence any full-rank certificate for such a core must occur away from that point. We then assess a hardware-motivated superconducting core generated by a noncommuting, temporally asymmetric drive. Direct calculation verifies $K_{\rm sc}\neq K_{\rm sc}^{\mathsf T}$, and the core achieves $F_{\rm avg}\ge 0.999$ for all 1000 Haar-random targets tested under the stated restart protocol. We also report favorable sampled Jacobian-rank, structured-target, and robustness diagnostics. These results establish local universality at the parameter-counting-minimal, dimension-saturating depth, with an exact Clifford certificate complemented by a hardware-motivated numerical case study. Throughout, we separate exact local certificates from numerical evidence for broader synthesis performance.

quant-ph