ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Spin alignment conjecture. We now provide a short description of a conjecture about the entropy of spins. Subject to this conjecture, Q(1) (Ns ) = Q(Ns ). First, consider a single spin-1/2 particle whose density operator ρ is a convex combina- tion of a given mixed state Q and some variable state \omega. The minimum entropy of ρ can be shown to occur at \omega = |\phiih\phi|, where |\phii is an eigenvector of Q corre- sponding to the largest eigenvalue. The spin-alignment conjecture generalizes the aforementioned setup: ρ is now allowed to be an n-spin density operator that is formed by a convex combination of several distinct states. In each distinct n-spin state, a subset of the spins are fixed to be products of the mixed state Q, and the rest of the spins are in some variable joint state. The spin-alignment conjecture posits that ρ has minimum entropy when spins in all these variable states align with each other making each variable state a product over the same spin state |\phii. We prove this conjecture in certain special cases with n = 2 and 3. For modest values of n we find numerical evidence supporting this conjecture. • Subject to the spin-alignment conjecture, the strict super-additivity of Q(1) (Ns ⊗M) for M = Ap , E\lambda is lifted to the quantum capacities, and here, both constituent channels have large, positive quantum capacities. The super-additivity of coherent information for all three assisting channels (and superadditivity of quantum capacity for M = Ap , E\lambda ) is achieved on a joint input state having the same form. Thus, in all three cases the same mechanism lies at the heart of the observed super-additivity effects. • This “mechanism” of super-additivity is distinct from those in prior (super-) activation of quantum capacities. Smith and Yard [2] showed that a 50% erasure channel can transform private capacity into quantum capacity at the cost of a factor of 1/2, via an attempted conversion of a p-bit (state with secret key) into entanglement, which succeeds with probability 1/2. This superactivates the quantum capacity of any channel with no quantum capacity but positive private capacity. But for the channel Ns , even though the private capacity is much bigger than the quantum capacity, we have Q(Ns ) > 21 P(Ns ). Therefore, the Smith-Yard protocol cannot increase the capacity. We may e

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.