arXiv subjects

Maciej Demianowicz

Publications and source records attributed to Maciej Demianowicz.

18 recordsLinked to original sources

arXiv2026

Progress in the study of the (non)existence of genuinely unextendible product bases

We investigate the open problem of the existence of genuinely unextendible product bases (GUPBs), that is, multipartite unextendible product bases (UPBs) which remain unextendible even with respect to biproduct vectors across all bipartitions of the parties. To this end, we exploit the well-known connection between UPBs and graph theory through orthogonality graphs and orthogonal representations, together with recent progress in this framework, and employ forbidden induced subgraph characterizations to single out the admissible local orthogonality graphs for GUPBs. Using this approach, we establish that GUPBs of size thirteen in three-qutrit systems-the smallest candidate GUPBs-do not exist. We further provide a partial characterization of graphs relevant to larger bases and systems with ququart subsystems.

quant-ph↗

arXiv2024

Completely entangled subspaces of entanglement depth $k$

We introduce a class of entangled subspaces: completely entangled subspaces of entanglement depth $k$ ($k$-CESs). These are subspaces of multipartite Hilbert spaces containing only pure states with an entanglement depth of at least $k$. We present an efficient construction of $k$-CESs of any achievable dimensionality in any multipartite scenario. Further, we discuss the relation between these subspaces and unextendible product bases (UPBs). In particular, we establish that there is a non-trivial bound on the cardinality of a UPB whose orthocomplement is a $k$-CES. Further, we discuss the existence of such UPBs for qubit systems.

quant-ph↗

arXiv2022

Universal construction of genuinely entangled subspaces of any size

We put forward a simple construction of genuinely entangled subspaces -- subspaces supporting only genuinely multipartite entangled states -- of any permissible dimensionality for any number of parties and local dimensions. The method uses nonorthogonal product bases, which are built from totally nonsingular matrices with a certain structure. We give an explicit basis for the constructed subspaces. An immediate consequence of our result is the possibility of constructing in the general multiparty scenario genuinely multiparty entangled mixed states with ranks up to the maximal dimension of a genuinely entangled subspace.

quant-ph↗

arXiv2022

Negative result about the construction of genuinely entangled subspaces from unextendible product bases

Unextendible product bases (UPBs) provide a versatile tool with various applications across different areas of quantum information theory. Their comprehensive characterization is thus of great importance and has been a subject of vital interest for over two decades now. An open question asks about the existence of UPBs, which are genuinely unextendible, i.e., they are not extendible even with biproduct vectors. In other words, the problem is to verify whether there exist genuinely entangled subspaces (GESs), subspaces composed solely of genuinely multiparty entangled states, complementary to UPBs. We solve this problem in the negative for many sizes of UPBs in different multipartite scenarios. In particular, in the all-important case of equal local dimensions, we show that there are always forbidden cardinalities for such UPBs, including the minimal ones corresponding to GESs of the maximal dimensions.

quant-ph↗

arXiv2021

Decoherence-Free Communication over Multiaccess Quantum Channels

In this paper we consider decoherence-free communication over multiple access and $k$-user quantum channels. First, we concentrate on a hermitian unitary noise model $U$ for a two-access bi-unitary channel and show that in this case a decoherence-free code exists if the space of Schmidt matrices of an eigensubspace of $U$ exhibits certain properties of decomposability. Then, we show that our technique is also applicable for generic random unitary two-access channels. Finally, we consider the applicability of the result to the case of a larger number of senders and general Kraus operators.

quant-ph↗

arXiv2021

Simple sufficient condition for subspace to be completely or genuinely entangled

We introduce a simple sufficient criterion, which allows one to tell whether a subspace of a bipartite or multipartite Hilbert space is entangled. The main ingredient of our criterion is a bound on the minimal entanglement of a subspace in terms of entanglement of vectors spanning that subspace expressed for geometrical measures of entanglement. The criterion is applicable to both completely and genuinely entangled subspaces. We explore its usefulness in several important scenarios. Further, an entanglement criterion for mixed states following directly from the condition is stated. As an auxiliary result we provide a formula for the generalized geometric measure of entanglement of the $d$--level Dicke states.

quant-ph↗

arXiv2020

An approach to constructing genuinely entangled subspaces of maximal dimension

Genuinely entangled subspaces (GESs) are the class of completely entangled subspaces that contain only genuinely multiparty entangled states. They constitute a particularly useful notion in the theory of entanglement but also have found an application, for instance, in quantum error correction and cryptography. In a recent study (Demianowicz and Augusiak in Phys Rev A 98:012313, 2018), we have shown how GESs can be efficiently constructed in any multiparty scenario from the so-called unextendible product bases. The provided subspaces, however, are not of maximal allowable dimensions, and our aim here is to put forward an approach to building such. The method is illustrated with few examples in small systems. Connections with other mathematical problems, such as spaces of matrices of equal rank and the numerical range, are discussed.

quant-ph↗

arXiv2019

Entanglement of genuinely entangled subspaces and states: exact, approximate, and numerical results

Genuinely entangled subspaces (GESs) are those subspaces of multipartite Hilbert spaces that consist only of genuinely multiparty entangled pure states. They are natural generalizations of the well-known notion of completely entangled subspaces , which by definition are void of fully product vectors. Entangled subspaces are an important tool of quantum information theory as they directly lead to constructions of entangled states, since any state supported on such a subspace is automatically entangled. Moreover, they have also proven useful in the area of quantum error correction. In our recent contribution [M. Demianowicz and R. Augusiak, Phys. Rev. A \textbf{98}, 012313 (2018)], we have studied the notion of a GES qualitatively in relation to so--called nonorthogonal unextendible product bases and provided a few constructions of such subspaces. The main aim of the present work is to perform a quantitative study of the entanglement properties of GESs. First, we show how one can attempt to compute analytically the subspace entanglement, defined as the entanglement of the least entangled vector from the subspace, of a GES and illustrate our method by applying it to a new class of GESs. Second, we show that certain semidefinite programming relaxations can be exploited to estimate the entanglement of a GES and apply this observation to a few classes of GESs revealing that in many cases the method provides the exact results. Finally, we study the entanglement of certain states supported on GESs, which is compared to the obtained values of the entanglement of the corresponding subspaces, and find the white--noise robustness of several GESs. In our study we use the (generalized) geometric measure as the quantifier of entanglement.

quant-ph↗

arXiv2018

From unextendible product bases to genuinely entangled subspaces

Unextendible product bases (UPBs) are interesting mathematical objects arising in composite Hilbert spaces that have found various applications in quantum information theory, for instance in a construction of bound entangled states or Bell inequalities without quantum violation. They are closely related to another important notion, completely entangled subspaces (CESs), which are those that do not contain any fully separable pure state. Among CESs one finds a class of subspaces in which all vectors are not only entangled, but are genuinely entangled. Here we explore the connection between UPBs and such genuinely entangled subspaces (GESs) and provide classes of nonorthogonal UPBs that lead to GESs for any number of parties and local dimensions. We then show how these subspaces can be immediately utilized for a simple general construction of genuinely entangled states in any such multipartite scenario.

quant-ph↗

arXiv2016

Inequivalence of entanglement, steering, and Bell nonlocality for general measurements

Einstein-Podolsky-Rosen steering is a form of inseparability in quantum theory commonly acknowledged to be intermediate between entanglement and Bell nonlocality. However, this statement has so far only been proven for a restricted class of measurements, namely projective measurements. Here we prove that entanglement, one-way steering, two-way steering and nonlocality are genuinely different considering general measurements, i.e. single round positive-operator-valued-measures. Finally, we show that the use of sequences of measurements is relevant for steering tests, as they can be used to reveal "hidden steering".

quant-ph↗

arXiv2015

Progress towards a unified approach to entanglement distribution

Entanglement distribution is key to the success of secure communication schemes based on quantum mechanics, and there is a strong need for an ultimate architecture able to overcome the limitations of recent proposals such as those based on entanglement percolation or quantum repeaters. In this work we provide broad theoretical background for the development of such technologies. In particular, we investigate the question of whether entanglement distribution is more efficient if some amount of entanglement -- or some amount of correlations in general -- is available prior to the transmission stage of the protocol. We show that in the presence of noise the answer to this question strongly depends on the type of noise and on the way how entanglement is quantified. On the one hand, subadditive entanglement measures do not show advantage of preshared correlations if entanglement is established via combinations of single-qubit Pauli channels. On the other hand, based on the superadditivity conjecture of distillable entanglement, we provide evidence that this phenomenon occurs for this measure. These results strongly suggest that sending one half of some pure entangled state down a noisy channel is the best strategy for any subadditive entanglement quantifier, thus paving the way to a unified approach for entanglement distribution which does not depend on the nature of noise. We also provide general bounds for entanglement distribution involving quantum discord, and present a counter-intuitive phenomenon of the advantage of arbitrarily little entangled states over maximally entangled ones, which may also occur for quantum channels relevant in experiments.

quant-ph↗

arXiv2014

Local hidden--variable models for entangled quantum states

While entanglement and violation of Bell inequalities were initially thought to be equivalent quantum phenomena, we now have different examples of entangled states whose correlations can be described by local hidden--variable models and, therefore, do not violate any Bell inequality. We provide an up to date overview of the existing local hidden--variable models for entangled quantum states, both in the bipartite and multipartite case, and discuss some of the most relevant open questions in this context. Our review covers twenty five years of this line of research since the seminal work by Werner [R. F. Werner, Phys. Rev. A 40, 8 (1989)] providing the first example of an entangled state with a local model, which in turn appeared twenty five years after the seminal work by Bell [J. S. Bell, Physics 1, 195 (1964)], about the impossibility of recovering the predictions of quantum mechanics using a local hidden--variables theory.

quant-ph↗

arXiv2014

Multiaccess quantum communication and product higher rank numerical range

In the present paper we initiate the study of the product higher rank numerical range. The latter, being a variant of the higher rank numerical range [M.--D. Choi {\it et al.}, Rep. Math. Phys. {\bf 58}, 77 (2006); Lin. Alg. Appl. {\bf 418}, 828 (2006)], is a natural tool for studying construction of quantum error correction codes for multiple access channels. We review properties of this set and relate it to other numerical ranges, which were recently introduced in the literature. Further, the concept is applied to the construction of codes for bi--unitary two--access channels with a hermitian noise model. Analytical techniques for both outerbounding the product higher rank numerical range and determining its exact shape are developed for this case. Finally, the reverse problem of constructing a noise model for a given product range is considered.

quant-ph↗

arXiv2011

Reexamination of determinant-based separability test for two qubits

It was shown in [Augusiak et al.,\;Phys. Rev. A \textbf{77}, 030301(R) (2008)] that discrimination between entanglement and separability in a two qubit state can be achieved by a measurement of a single observable on four copies of it. Moreover, a pseudo entanglement monotone $π$ was proposed to quantify entanglement in such states. The main goal of the present paper is to show that close relationship between $π$ and concurrence reported there is a result of sharing the same underlying construction of a spin flipped matrix. We also show that monogamy of entanglement can be rephrased in terms of $π$ and prove the factorization law for $π$.

quant-ph↗

arXiv2010

Aspects of multistation quantum information broadcasting

We study quantum information transmission over multiparty quantum channel. In particular, we show an equivalence of different capacity notions and provide a multiletter characterization of a capacity region for a general quantum channel with $k$ senders and $m$ receivers. We point out natural generalizations to the case of two-way classical communication capacity.

quant-ph↗

arXiv2007

Universal observable detecting all two-qubit entanglement and determinant based separability tests

We construct a single observable measurement of which mean value on four copies of an {\it unknown} two-qubit state is sufficient for unambiguous decision whether the state is separable or entangled. In other words, there exists a universal collective entanglement witness detecting all two-qubit entanglement. The test is directly linked to a function which characterizes to some extent the entanglement quantitatively. This function is an entanglement monotone under so--called local pure operations and classical communication (pLOCC) which preserve local dimensions. Moreover it provides tight upper and lower bounds for negativity and concurrence. Elementary quantum computing device estimating unknown two-qubit entanglement is designed.

quant-ph↗

arXiv2006

Quantum channel capacities - multiparty communication

We analyze different aspects of multiparty communication over quantum memoryless channels and generalize some of key results known from bipartite channels to that of multiparty scenario. In particular, we introduce multiparty versions of minimal subspace transmission fidelity and entanglement transmission fidelity. We also provide alternative, local, versions of fidelities and show their equivalence to the global ones in context of capacity regions defined. The equivalence of two different capacity notions with respect to two types of the fidelities is proven. In analogy to bipartite case it is shown, via sufficiency of isometric encoding theorem, that additional classical forward side channel does not increase capacity region of any quantum channel with $k$ senders and $m$ receivers which represents a compact unit of general quantum networks theory. The result proves that recently provided capacity region of multiple access channel ([M. Horodecki et al, Nature {\bf 436} 673 (2005)], [J.Yard et al, quant-ph/0501045]) is optimal also in the scenario of additional support of forward classical communication.

quant-ph↗

arXiv2005

Unconditional fidelity thresholds in single copy distillation and some aspects of quantum error correction

Various aspects of distillation of noisy entanglement and some associated effects in quantum error correction are considered. In particular we prove that if only one--way classical communication (from Alice to Bob) is allowed and the shared $d \otimes d$ state is not pure then there is a threshold for optimal entanglement fraction $F$ of the state (being an overlap between the shared state and symmetric maximally entangled state) which can be obtained in single copy distillation process. This implies that to get (probabilistically) arbitrary good conclusive teleportation via mixed state at least one classical bit of backward communication (for Bob to Alice) has to be sent. We provide several other threshold properties in this context including in particular the existence of ultimate threshold of optimal $F$ for states of full rank. Finally the threshold results are linked to those of error correction. Namely it is pointed out that in quantum computer working on fixed number of quantum bits almost any kind of noise can be (probabilistically) corrected only to some threshold error bar though there are some (rare) exceptions.

quant-ph↗