REVIEW
General construction of noiseless networks detecting entanglement with help of linear maps
Quantum Physics · Submitted 2 Mar 2006 · 31 references
Pith's verdict: The positive-map construction is new and correct, but the advertised linear-contraction generalization rests on a false trace identity.
T0 · AI review
Why Pith says this
Highlight any text to comment on it.
Referee report
The paper
The paper claims
The paper proves that every positive-but-not-completely-positive map can be realized as a noiseless network detecting entanglement of an unknown bipartite state, using only $m$ measured moments instead of full tomography.
The reading
What carries the argument
The load-bearing object is the set of spectrum moments $\alpha_k=\operatorname{Tr}[\Theta(\rho)]^k$, which determine the spectrum of the Hermitian matrix $\Theta(\rho)$ from $m$ numbers. The proof mechanism moves $\Theta$ off the state: using the dual map $\Theta^\dagger$, each moment is shown to equal the expectation of a collective observable $O^{(k)}_\Theta$ on $\rho^{\otimes k}$ built from the cyclic permutation $V^{(k)}$ and its adjoint. A second ingredient is the single-qubit generalized measurement: because $O^{(k)}_\Theta$ has bounded spectrum, its mean is encoded in the up/down probabilities of one control qubit after a suitable unitary, so the whole network is noiseless in the sense that only the unknown copies $\rho^{\otimes k}$ and the control qubit enter.
Extended reading notes
Core claim
The central claim is that the spectrum of $\Theta(\rho)$ can be measured without ever implementing the unphysical map $\Theta$. The $k$-th moment $\alpha_k=\operatorname{Tr}[\Theta(\rho)]^k$ is rewritten as $\operatorname{Tr}\left[O^{(k)}_\Theta\,\rho^{\otimes k}\right]$ with $O^{(k)}_\Theta=\frac12\operatorname{Tr}_{\mathrm{aux}}\left[(\Theta^\dagger)^{\otimes k}(V^{(k)}+V^{(k)\dagger})\right]$, where $V^{(k)}$ is the cyclic permutation on $k$ copies. Since this observable is Hermitian and bounded, its mean in the state $\rho^{\otimes k}$ can be estimated by a generalized measurement on a single ancilla qubit, following the visibility formula. The values $k=1,\dots,m$ then reconstruct the eigenvalues of $\Theta(\rho)$. Taking $\Theta=I\otimes\Lambda$ with $\Lambda$ positive but not completely positive, the positivity condition $I\otimes\Lambda(\rho)\ge 0$ becomes a finite set of such visibility measurements, so a noiseless network exists for every positive-map entanglement criterion. The paper further claims that the same network idea applies to linear contractions $R$ on product states, using the doubled map $R\otimes R'$ to recover $\|R(\rho)\|_{\mathrm{Tr}}$ from moments of $R(\rho)R(\rho)^\dagger$.
Load-bearing premise
For the linear-contraction half of the paper, the load-bearing premise is that the measured moments of $R(\rho)\otimes R(\rho)^\dagger$ equal the moments of $R(\rho)R(\rho)^\dagger$; for a generic map $R$ this equality is false, so the claimed generalization stands only for a restricted class of contractions.
Editorial extensions
If this is right
- Every positive-but-not-completely-positive map can be converted into a concrete noiseless network, so the known transposition network becomes one instance of a general construction.
- Unknown bipartite states can be tested for entanglement with $d^2$ measured parameters instead of $d^4-1$, eliminating the need for prior state reconstruction.
- Existing spectrum-estimator schemes based on structural physical approximations become noiseless, removing the extra noise those approximations injected.
- Any polynomial in the matrix elements of $\Theta(\rho)$ of degree at most $k$ is measurable through the same collective-observable route.
- Realignment and permutation criteria would also admit noiseless networks rather than noisy ones, if the linear-contraction step is valid.
Reading between the lines
- Editorial: The positive-map core of the paper does not need the extra moment identity; the linear-contraction extension would go through if the network could measure $\operatorname{Tr}[(R(\rho)R(\rho)^\dagger)^k]$ directly instead of $\operatorname{Tr}[(R(\rho)\otimes R(\rho)^\dagger)^k]$, and it is open whether a noiseless circuit can do that for the full contraction class.
- Editorial: The positive-map result implies that entanglement witnesses derived from positive maps could be turned into direct circuits whose required precision is set by visibility rather than by SPA noise.
- Editorial: A testable next step is to benchmark the $m$-moment single-qubit protocol against full tomography for small $m$, since circuit depth of $O^{(k)}_\Theta$ may grow steeply with $k$ even though the parameter count does not.
Original abstract
We present the general scheme for construction of noiseless networks detecting entanglement with the help of linear, hermiticity-preserving maps. We show how to apply the method to detect entanglement of unknown state without its prior reconstruction. In particular, we prove there always exists noiseless network detecting entanglement with the help of positive, but not completely positive maps. Then the generalization of the method to the case of entanglement detection with arbitrary, not necessarily hermiticity-preserving, linear contractions on product states is presented.
The compiled record
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
The abstract, sentence by sentence
We present the general scheme for construction of noiseless networks detecting entanglement with the help of linear, hermiticity-preserving maps. We show how to apply the method to detect entanglement of unknown state without its prior reconstruction. In particular, we prove there always exists noiseless network detecting entanglement with the help of positive, but not completely positive maps. Then the generalization of the method to the case of entanglement detection with arbitrary, not necessarily hermiticity-preserving, linear contractions on product states is presented.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We present the general scheme for construction of noiseless networks detecting entanglement with the help of linear, hermiticity-preserving maps. | contribution 0.98 | 0.92 | 0.45 | asserted 1.00 |
| s1 | We show how to apply the method to detect entanglement of unknown state without its prior reconstruction. | contribution 0.75 | 0.91 | 0.15 | asserted 1.00 |
| s2 | In particular, we prove there always exists noiseless network detecting entanglement with the help of positive, but not completely positive maps. | result 0.98 | 0.92 | 0.46 | asserted 1.00 |
| s3 | Then the generalization of the method to the case of entanglement detection with arbitrary, not necessarily hermiticity-preserving, linear contractions on product states is presented. | contribution 0.96 | 0.89 | 0.10 | asserted 0.99 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
Figures
Figures reproduced from arXiv:quant-ph/0603015 by the authors.
References
Discussion
Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.