Searcharxiv⌕ Search

arXiv subjects

Evgeny Shchukin

Publications and source records attributed to Evgeny Shchukin.

4 recordsLinked to original sources

Separability rigidity of Gaussian states under positive domination

We prove a separability rigidity theorem for finite-mode Gaussian states. Let $ρ_G$ be Gaussian and let $\mathcal I$ be a fixed partition of the modes. If $ρ_G$ dominates a nonzero positive operator $T$ that is separable across $\mathcal I$, $0\neq T\preccurlyeq ρ_G$, then $ρ_G$ itself is separable across $\mathcal I$. The dominated operator is arbitrary and need not be Gaussian. The theorem has three applications. First, any Gaussian channel admitting a nonzero entanglement-breaking completely positive subchannel is itself entanglement breaking, even when that subchannel is non-Gaussian. Second, if a resource state dominates a positive multiple of a faithful separable state, no finite-copy, postselected separability-preserving protocol can prepare an entangled Gaussian state exactly with nonzero success probability. Third, a connected graph of entangled Gaussian two-mode marginals certifies genuine multipartite entanglement of every compatible global state, even if the global state is non-Gaussian; the certification is robust to sufficiently small trace-norm errors in the marginals. As a structural corollary, mixing states separable across different partitions cannot produce new Gaussian states, so full inseparability and genuine multipartite entanglement coincide for finite-mode Gaussian states and identical copies of a biseparable Gaussian state cannot activate genuine multipartite entanglement.

quant-ph↗

A counterexample to the Harper-norm silver-mean conjecture

The silver-mean conjecture formulated in Gerhold and Shalit 2022 states that the norm $E(α)$ of the Harper operator attains its minimum at the silver mean $α= \sqrt{2}-1$. We show that this conjecture is wrong by constructing an explicit rational point with a smaller Harper-norm value: $E(181/437)<2.591046794<E(\sqrt2-1)$. The separating decimal is an exact rational number. All acceptance checks use exact integer arithmetic with rigorously proved coefficient enclosures. No floating-point eigenvalue estimates or external witness data enter the certificate.

math.SP↗

Exact rate analysis for quantum repeaters with imperfect memories and entanglement swapping as soon as possible

We present an exact rate analysis for a secret key that can be shared among two parties employing a linear quantum repeater chain. One of our main motivations is to address the question whether simply placing quantum memories along a quantum communication channel can be beneficial in a realistic setting. The underlying model assumes deterministic entanglement swapping of single-spin quantum memories and it excludes probabilistic entanglement distillation, and thus two-way classical communication, on higher nesting levels. Within this framework, we identify the essential properties of any optimal repeater scheme: entanglement distribution in parallel, entanglement swapping as soon and parallel quantum storage as little as possible. While these features are obvious or trivial for the simplest repeater with one middle station, for more stations they cannot always be combined. We propose an optimal scheme including channel loss and memory dephasing, proving its optimality for the case of two stations and conjecturing it for the general case. In an even more realistic setting, we consider additional tools and parameters such as memory cut-offs, multiplexing, initial state and swapping gate fidelities, and finite link coupling efficiencies in order to identify potential regimes in memory-assisted quantum key distribution beyond one middle station that exceed the rates of the smallest quantum repeaters as well as those obtainable in all-optical schemes unassisted by stationary memory qubits and two-way classical communication.

quant-ph↗

Optimal entanglement swapping in quantum repeaters

We formulate the problem of finding the optimal entanglement swapping scheme in a quantum repeater chain as a Markov decision process and present its solution for different repeater's sizes. Based on this, we are able to demonstrate that the commonly used "doubling" scheme for performing probabilistic entanglement swapping of probabilistically distributed entangled qubit pairs in quantum repeaters does not always produce the best possible raw rate. Focussing on this figure of merit, without considering additional probabilistic elements for error suppression such as entanglement distillation on higher "nesting levels", our approach reveals that a power-of-two number of segments has no privileged position in quantum repeater theory; the best scheme can be constructed for any number of segments. Moreover, classical communication can be included into our scheme, and we show how this influences the raw waiting time for different number of segments, confirming again the optimality of "non-doubling" in some relevant parameter regimes. Thus, our approach provides the minimal possible waiting time of quantum repeaters in a fairly general physical setting.

quant-ph↗