arXiv subjects

Ludovico Lami

Publications and source records attributed to Ludovico Lami.

108 records · Page 6Linked to original sources

arXiv2018

All phase-space linear bosonic channels are approximately Gaussian dilatable

We compare two sets of multimode quantum channels acting on a finite collection of harmonic oscillators: (a) the set of linear bosonic channels, whose action is described as a linear transformation at the phase space level; and (b) Gaussian dilatable channels, that admit a Stinespring dilation involving a Gaussian unitary. Our main result is that the set (a) coincides with the closure of (b) with respect to the strong operator topology. We also present an example of a channel in (a) which is not in (b), implying that taking the closure is in general necessary. This provides a complete resolution to the conjecture posed in Ref. [K.K. Sabapathy and A. Winter, Phys. Rev. A 95:062309, 2017]. Our proof technique is constructive, and yields an explicit procedure to approximate a given linear bosonic channel by means of Gaussian dilations. It turns out that all linear bosonic channels can be approximated by a Gaussian dilation using an ancilla with the same number of modes as the system. We also provide an alternative dilation where the unitary is fixed in the approximating procedure. Our results apply to a wide range of physically relevant channels, including all Gaussian channels such as amplifiers, attenuators, phase conjugators, and also non-Gaussian channels such as additive noise channels and photon-added Gaussian channels. The method also provides a clear demarcation of the role of Gaussian and non-Gaussian resources in the context of linear bosonic channels. Finally, we also obtain independent proofs of classical results such as the quantum Bochner theorem, and develop some tools to deal with convergence of sequences of quantum channels on continuous variable systems that may be of independent interest.

quant-ph↗

arXiv2018

Non-asymptotic assisted distillation of quantum coherence

We characterize the operational task of environment-assisted distillation of quantum coherence under different sets of free operations when only a finite supply of copies of a given state is available. We first evaluate the one-shot assisted distillable coherence exactly, and introduce a semidefinite programming bound on it in terms of a smooth entropic quantity. We prove the bound to be tight for all systems in dimensions 2 and 3, which allows us to obtain computable expressions for the one-shot rate of distillation, establish an analytical expression for the best achievable fidelity of assisted distillation for any finite number of copies, and fully solve the problem of asymptotic zero-error assisted distillation for qubit and qutrit systems. Our characterization shows that all relevant sets of free operations in the resource theory of coherence have exactly the same power in the task of one-shot assisted coherence distillation, and furthermore resolves a conjecture regarding the additivity of coherence of assistance in dimension 3.

quant-ph↗

arXiv2018

Gaussian quantum resource theories

We develop a general framework to assess capabilities and limitations of the Gaussian toolbox in continuous variable quantum information theory. Our framework allows us to characterize the structure and properties of quantum resource theories specialized to Gaussian states and Gaussian operations, establishing rigorous methods for their description and yielding a unified approach to their quantification. We show in particular that, under a few intuitive and physically motivated assumptions on the set of free states, no Gaussian quantum resource can be distilled with free Gaussian operations, even when an unlimited supply of the resource state is available. This places fundamental constraints on state manipulations in all such Gaussian resource theories. We discuss in particular the applications to quantum entanglement, where we extend previously known results by showing that Gaussian entanglement cannot be distilled even with Gaussian operations preserving the positivity of the partial transpose, as well as to other Gaussian resources such as steering and optical nonclassicality. A comprehensive semidefinite programming representation of all these resources is explicitly provided.

quant-ph↗

arXiv2018

Certification and Quantification of Multilevel Quantum Coherence

Quantum coherence, present whenever a quantum system exists in a superposition of multiple classically distinct states, marks one of the fundamental departures from classical physics. Quantum coherence has recently been investigated rigorously within a resource-theoretic formalism. However, the finer-grained notion of multilevel coherence, which explicitly takes into account the number of superposed classical states, has remained relatively unexplored. A comprehensive analysis of multi-level coherence, which acts as the single-party analogue to multi-partite entanglement, is essential for understanding natural quantum processes as well as for gauging the performance of quantum technologies. Here we develop the theoretical and experimental groundwork for characterizing and quantifying multilevel coherence. We prove that non-trivial levels of purity are required for multilevel coherence, as there is a ball of states around the maximally mixed state that do not exhibit multilevel coherence in any basis. We provide a simple necessary and sufficient analytical criterion to verify multilevel coherence, which leads to a complete classification for three-level systems. We present the robustness of multilevel coherence, a bona fide quantifier which we show to be numerically computable via semidefinite programming and experimentally accessible via multilevel coherence witnesses. We further verify and lower-bound the robustness of multilevel coherence by performing a semi-device-independent phase discrimination task, implemented experimentally with four-level probes in a photonic setup. Our results contribute to understanding the operational relevance of genuine multilevel coherence, also by demonstrating the key role it plays in enhanced phase discrimination---a primitive for quantum communication and metrology---and suggest new ways to reliably test the quantum behaviour of physical systems.

quant-ph↗

arXiv2018

Probabilistic distillation of quantum coherence

The ability to distill quantum coherence is pivotal for optimizing the performance of quantum technologies; however, such a task cannot always be accomplished with certainty. Here we develop a general framework of probabilistic distillation of quantum coherence in a one-shot setting, establishing fundamental limitations for different classes of free operations. We first provide a geometric interpretation for the maximal success probability, showing that under maximally incoherent operations (MIO) and dephasing-covariant incoherent operations (DIO) the problem can be simplified into efficiently computable semidefinite programs. Exploiting these results, we find that DIO and its subset of strictly incoherent operations (SIO) have equal power in probabilistic distillation of coherence from pure input states, while MIO are strictly stronger. We then prove a fundamental no-go result: distilling coherence from any full-rank state is impossible even probabilistically. We further find that in some conditions the maximal success probability can vanish suddenly beyond a certain threshold in the distillation fidelity. Finally, we consider probabilistic coherence distillation assisted by a catalyst and demonstrate, with specific examples, its superiority to the unassisted and deterministic cases.

quant-ph↗

arXiv2018

Renyi relative entropies of quantum Gaussian states

The quantum Renyi relative entropies play a prominent role in quantum information theory, finding applications in characterizing error exponents and strong converse exponents for quantum hypothesis testing and quantum communication theory. On a different thread, quantum Gaussian states have been intensely investigated theoretically, motivated by the fact that they are more readily accessible in the laboratory than are other, more exotic quantum states. In this paper, we derive formulas for the quantum Renyi relative entropies of quantum Gaussian states. We consider both the traditional (Petz) Renyi relative entropy as well as the more recent sandwiched Renyi relative entropy, finding formulas that are expressed solely in terms of the mean vectors and covariance matrices of the underlying quantum Gaussian states. Our development handles the hitherto elusive case for the Petz--Renyi relative entropy when the Renyi parameter is larger than one. Finally, we also derive a formula for the max-relative entropy of two quantum Gaussian states, and we discuss some applications of the formulas derived here.

quant-ph↗

arXiv2018

Ultimate data hiding in quantum mechanics and beyond

The phenomenon of data hiding, i.e. the existence of pairs of states of a bipartite system that are perfectly distinguishable via general entangled measurements yet almost indistinguishable under LOCC, is a distinctive signature of nonclassicality. The relevant figure of merit is the maximal ratio (called data hiding ratio) between the distinguishability norms associated with the two sets of measurements we are comparing, typically all measurements vs LOCC protocols. For a bipartite $n\times n$ quantum system, it is known that the data hiding ratio scales as $n$, i.e. the square root of the real dimension of the local state space of density matrices. We show that for bipartite $n_A\times n_B$ systems the maximum data hiding ratio against LOCC protocols is $Θ\left(\min\{n_A,n_B\}\right)$. This scaling is better than the previously obtained upper bounds $O\left(\sqrt{n_A n_B}\right)$ and $\min\{n_A^2, n_B^2\}$, and moreover our intuitive argument yields constants close to optimal. In this paper, we investigate data hiding in the more general context of general probabilistic theories (GPTs), an axiomatic framework for physical theories encompassing only the most basic requirements about the predictive power of the theory. The main result of the paper is the determination of the maximal data hiding ratio obtainable in an arbitrary GPT, which is shown to scale linearly in the minimum of the local dimensions. We exhibit an explicit model achieving this bound up to additive constants, finding that the quantum mechanical data hiding ratio is only of the order of the square root of the maximal one. Our proof rests crucially on an unexpected link between data hiding and the theory of projective and injective tensor products of Banach spaces. Finally, we develop a body of techniques to compute data hiding ratios for a variety of restricted classes of GPTs that support further symmetries.

quant-ph↗

arXiv2018

Non-classical correlations in quantum mechanics and beyond

Is entanglement an exclusive feature of quantum systems, or is it common to all non-classical theories? And if this is the case, how strong is quantum mechanical entanglement as compared to that exhibited by other theories? The first part of this thesis deals with these questions by considering quantum theory as part of a wider landscape of physical theories, collectively called general probabilistic theories (GPTs). Among the other things, this manuscript contains a detailed introduction to the abstract state space formalism for GPTs. We start with a comprehensive review of the proof of a famous theorem by Ludwig that constitutes one of its cornerstones (Ch. 1). After explaining the basic rules of the game, we translate our questions into precise conjectures and present our progress toward a full solution (Ch. 2). In Ch. 3 we consider entanglement at the level of measurements instead of states, focusing on one of its main implications, i.e. data hiding. We determine the maximal data hiding strength that a quantum mechanical system can exhibit, and also the maximum value among all GPTs, finding that the former scales as the square root of the latter. In the second part of this manuscript we look into quantum entanglement. In Ch. 4 we discuss the entanglement transformation properties of a class of maps that model white noise acting either locally or globally on a bipartite system. In Ch. 5 we employ matrix analysis tools to develop a unified approach to Gaussian entanglement. The third part of this thesis concerns more general forms of non-classical correlations in bipartite continuous variable systems. In Ch. 6 we devise a general scheme that allows to consistently classify correlations of bipartite Gaussian states into classical and quantum ones. Finally, Ch. 7 explores some problems connected with a certain strong subadditivity matrix inequality.

quant-ph↗

arXiv2018

Gaussian entanglement revisited

We present a novel approach to the separability problem for Gaussian quantum states of bosonic continuous variable systems. We derive a simplified necessary and sufficient separability criterion for arbitrary Gaussian states of $m$ vs $n$ modes, which relies on convex optimisation over marginal covariance matrices on one subsystem only. We further revisit the currently known results stating the equivalence between separability and positive partial transposition (PPT) for specific classes of Gaussian states. Using matrix analysis techniques such as Schur complements and matrix means, we provide a unified treatment and compact proofs of all these results. In particular, we recover the PPT-separability equivalence for: (i) Gaussian states of $1$ vs $n$ modes; and (ii) isotropic Gaussian states. In passing, we also retrieve (iii) the recently established equivalence between separability of a Gaussian state and and its complete Gaussian extendability. Our techniques are then applied to progress beyond the state of the art. We show that: (iv) Gaussian states that are invariant under partial transposition are necessarily separable; (v) the PPT criterion is necessary and sufficient for separability for Gaussian states of $m$ vs $n$ modes that are symmetric under the exchange of any two modes belonging to one of the parties; and (vi) Gaussian states which remain PPT under passive optical operations can not be entangled by them either. This is not a foregone conclusion per se (since Gaussian bound entangled states do exist) and settles a question that had been left unanswered in the existing literature on the subject. This paper, enjoyable by both the quantum optics and the matrix analysis communities, overall delivers technical and conceptual advances which are likely to be useful for further applications in continuous variable quantum information theory, beyond the separability problem.

quant-ph↗

arXiv2018

High-Dimensional Entanglement in States with Positive Partial Transposition

Genuine high-dimensional entanglement, i.e. the property of having a high Schmidt number, constitutes a resource in quantum communication, overcoming limitations of low-dimensional systems. States with a positive partial transpose (PPT), on the other hand, are generally considered weakly entangled, as they can never be distilled into pure entangled states. This naturally raises the question, whether high Schmidt numbers are possible for PPT states. Volume estimates suggest that optimal, i.e. linear, scaling in local dimension should be possible, albeit without providing an insight into the possible slope. We provide the first explicit construction of a family of PPT states that achieves linear scaling in local dimension and we prove that random PPT states typically share this feature. Our construction also allows us to answer a recent question by Chen et al. on the existence of PPT states whose Schmidt number increases by an arbitrarily large amount upon partial transposition. Finally, we link the Schmidt number to entangled sub-block matrices of a quantum state. We use this connection to prove that quantum states invariant under partial transposition on the smaller of their two subsystems cannot have maximal Schmidt number. This generalizes a well-known result by Kraus et al. We also show that the Schmidt number of absolutely PPT states cannot be maximal, contributing to an open problem in entanglement theory.

quant-ph↗

arXiv2018

Approximate reversal of quantum Gaussian dynamics

Recently, there has been focus on determining the conditions under which the data processing inequality for quantum relative entropy is satisfied with approximate equality. The solution of the exact equality case is due to Petz, who showed that the quantum relative entropy between two quantum states stays the same after the action of a quantum channel if and only if there is a \textit{reversal channel} that recovers the original states after the channel acts. Furthermore, this reversal channel can be constructed explicitly and is now called the \textit{Petz recovery map}. Recent developments have shown that a variation of the Petz recovery map works well for recovery in the case of approximate equality of the data processing inequality. Our main contribution here is a proof that bosonic Gaussian states and channels possess a particular closure property, namely, that the Petz recovery map associated to a bosonic Gaussian state $σ$ and a bosonic Gaussian channel $\mathcal{N}$ is itself a bosonic Gaussian channel. We furthermore give an explicit construction of the Petz recovery map in this case, in terms of the mean vector and covariance matrix of the state $σ$ and the Gaussian specification of the channel $\mathcal{N}$.

quant-ph↗

arXiv2017

From log-determinant inequalities to Gaussian entanglement via recoverability theory

Many determinantal inequalities for positive definite block matrices are consequences of general entropy inequalities, specialised to Gaussian distributed vectors with prescribed covariances. In particular, strong subadditivity (SSA) yields \begin{equation*} \ln\det V_{AC} + \ln\det V_{BC} - \ln\det V_{ABC} - \ln\det V_C \geq 0 \end{equation*} for all $3\times 3$-block matrices $V_{ABC}$, where subscripts identify principal submatrices. We shall refer to the above inequality as SSA of log-det entropy. In this paper we develop further insights on the properties of the above inequality and its applications to classical and quantum information theory. In the first part of the paper, we show how to find known and new necessary and sufficient conditions under which saturation with equality occurs. Subsequently, we discuss the role of the classical transpose channel (also known as Petz recovery map) in this problem and find its action explicitly. We then prove some extensions of the saturation theorem, by finding faithful lower bounds on a log-det conditional mutual information. In the second part, we focus on quantum Gaussian states, whose covariance matrices are not only positive but obey additional constraints due to the uncertainty relation. For Gaussian states, the log-det entropy is equivalent to the Rényi entropy of order $2$. We provide a strengthening of log-det SSA for quantum covariance matrices that involves the so-called Gaussian Rényi-$2$ entanglement of formation, a well-behaved entanglement measure defined via a Gaussian convex roof construction. We then employ this result to define a log-det entropy equivalent of the squashed entanglement, which is remarkably shown to coincide with the Gaussian Rényi-$2$ entanglement of formation. This allows us to establish useful properties of such measure(s), like monogamy, faithfulness, and additivity on Gaussian states.

quant-ph↗

arXiv2017

Genuine-multipartite entanglement criteria based on positive maps

Positive maps applied to a subsystem of a bipartite quantum state constitute a central tool in characterising entanglement. In the multipartite case, however, the direct application of a positive but not completely positive map cannot distinguish if a state is genuinely multipartite entangled or just entangled across some bipartition. We thus generalise this bipartite concept to the multipartite setting by introducing non-positive maps that are positive on the subset of bi-separable states, but can map to a non-positive element if applied to a genuine multipartite entangled state. We explicitly construct examples of multipartite non-positive maps, obtained from positive maps via a lifting procedure, that in this fashion can reveal genuine multipartite entanglement in a robust way.

quant-ph↗

arXiv2016

Schur complement inequalities for covariance matrices and monogamy of quantum correlations

We derive fundamental constraints for the Schur complement of positive matrices, which provide an operator strengthening to recently established information inequalities for quantum covariance matrices, including strong subadditivity. This allows us to prove general results on the monogamy of entanglement and steering quantifiers in continuous variable systems with an arbitrary number of modes per party. A powerful hierarchical relation for correlation measures based on the log-determinant of covariance matrices is further established for all Gaussian states, which has no counterpart among quantities based on the conventional von Neumann entropy.

quant-ph↗

arXiv2016

Conditional and unconditional Gaussian quantum dynamics

This article focuses on the general theory of open quantum systems in the Gaussian regime and explores a number of diverse ramifications and consequences of the theory. We shall first introduce the Gaussian framework in its full generality, including a classification of Gaussian (also known as "general-dyne") quantum measurements. In doing so, we will give a compact proof for the parametrisation of the most general Gaussian completely positive map, which we believe to be missing in the existing literature. We will then move on to consider the linear coupling with a white noise bath, and derive the diffusion equations that describe the evolution of Gaussian states under such circumstances. Starting from these equations, we outline a constructive method to derive general master equations that apply outside the Gaussian regime. Next, we include the general-dyne monitoring of the environmental degrees of freedom and recover the Riccati equation for the conditional evolution of Gaussian states. Our derivation relies exclusively on the standard quantum mechanical update of the system state, through the evaluation of Gaussian overlaps. The parametrisation of the conditional dynamics we obtain is novel and, at variance with existing alternatives, directly ties in to physical detection schemes. We conclude our study with two examples of conditional dynamics that can be dealt with conveniently through our formalism, demonstrating how monitoring can suppress the noise in optical parametric processes as well as stabilise systems subject to diffusive scattering.

quant-ph↗

arXiv2016

Bipartite depolarizing channels

We introduce a 3-parameter class of maps acting on a bipartite system that are a natural generalisation of the depolarizing channel (and include it as a special case). Then, we find the exact regions of the parameter space that alternatively determine a positive, completely positive, entanglement-breaking or entanglement-annihilating map. This model displays a much richer behaviour than the one shown by a simple depolarizing channel, yet it stays exactly solvable. As an example of this richness, PPT but not entanglement-breaking maps are found. A simple example of a positive yet indecomposable map is provided. Then, the study of the entanglement-annihilating property is fully addressed. Finally, we apply our results to solve the problem of the entanglement annihilation caused in a bipartite system by a tensor product of local depolarizing channels. In this context, a conjecture recently posed in the literature is proven, and many related open questions are answered. To arrive at this result we furthermore show how the Hadamard product between quantum states can be implemented via local operations.

quant-ph↗

arXiv2015

Entanglement-Breaking Indices

We study a set of new functionals (called entanglement--breaking indices) which characterize how many local iterations of a given (local) quantum channel are needed in order to completely destroy the entanglement between the system of interest over which the transformation is defined and an external ancilla. The possibility of contrasting the noisy effects introduced by the channel iterations via the action of intermediate ({\it filtering}) transformations is analyzed. We provide some examples in which our functionals can be exactly calculated. The differences between unitary and non-unitary filtering operations are analyzed showing that, at least for systems of dimension $d$ larger than or equal to 3, the non-unitary choice is preferable (the gap between the performances of the two cases being divergent in some cases). For $d=2$ (qubit case) on the contrary no evidences of the presence of such gap is revealed: we conjecture that for this special case unitary filtering transformations are optimal. The scenario in which more general filtering protocols are allowed is also discussed in some detail. The case of a depolarizing noise acting on a two--qubit system is exactly solved in a general case.

quant-ph↗

arXiv2015

Entanglement-Saving Channels

The set of Entanglement Saving (ES) quantum channels is introduced and characterized. These are completely positive, trace preserving transformations which when acting locally on a bipartite quantum system initially prepared into a maximally entangled configuration, preserve its entanglement even when applied an arbitrary number of times. In other words, a quantum channel $ψ$ is said to be ES if its powers $ψ^n$ are not entanglement-breaking for all integers $n$. We also characterize the properties of the Asymptotic Entanglement Saving (AES) maps. These form a proper subset of the ES channels that is constituted by those maps which, not only preserve entanglement for all finite $n$, but which also sustain an explicitly not null level of entanglement in the asymptotic limit~$n\rightarrow \infty$. Structure theorems are provided for ES and for AES maps which yield an almost complete characterization of the former and a full characterization of the latter.

quant-ph↗