Classical matching theory can be defined in terms of matrices with nonnegative entries. The notion of Positive operator, central in Quantum Theory, is a natural generalization of matrices with nonnegative entries. Based on this point of view, we introduce a definition of perfect Quantum (operator) matching . We show that the new notion inherits many "classical" properties, but not all of them . This new notion goes somewhere beyound matroids . For separable bipartite quantum states this new notion coinsides with the full rank property of the intersection of two corresponding geometric matroids . In the classical situation, permanents are naturally associated with perfects matchings. We introduce an analog of permanents for positive operators, called Quantum Permanent and show how this generalization of the permanent is related to the Quantum Entanglement. Besides many other things, Quantum Permanents provide new rational inequalities necessary for the separability of bipartite quantum states . Using Quantum Permanents, we give deterministic poly-time algorithm to solve Hidden Matroids Intersection Problem and indicate some "classical" complexity difficulties associated with the Quantum Entanglement. Finally, we prove that the weak membership problem for the convex set of separable bipartite density matrices is NP-HARD.
We introduce several classes of quantum combinatorial designs, namely quantum Latin squares, cubes, hypercubes and a notion of orthogonality between them. A further introduced notion, quantum orthogonal arrays, generalizes all previous classes of designs. We show that mutually orthogonal quantum Latin arrangements can be entangled in the same way than quantum states are entangled. Furthermore, we show that such designs naturally define a remarkable class of genuinely multipartite highly entangled states called $k$-uniform, i.e. multipartite pure states such that every reduction to $k$ parties …
With any state of a multipartite quantum system its separability polytope is associated. This is an algebro-topological object (non-trivial only for mixed states) which captures the localisation of entanglement of the state. Particular examples of separability polytopes for 3-partite systems are explicitly provided. It turns out that this characterisation of entanglement is associated with simulation of arbitrary unitary operations by 1- and 2-qubit gates. A topological description of how entanglement changes in course of such simulation is provided.
In this paper, we consider the problem of how to quantify entanglement for any multipartite quantum states. For bipartite pure states partial entropy is a good entanglement measure. By using partial entropy, we firstly introduce the Combinatorial Entropy of Fully entangled states (CEF) which can be used to quantify entanglement for any fully entangled pure states. In order to quantify entanglement for any multipartite states we also need another concept the Entanglement Combination (EC) which can be used to completely describe the entanglement between any parties of the given quantum states. C…
We present new combinatorial objects, which we call grid-labelled graphs, and show how these can be used to represent the quantum states arising in a scenario which we refer to as the faulty emitter scenario: we have a machine designed to emit a particular quantum state on demand, but which can make an error and emit a different one. The device is able to produce a list of candidate states which can be used as a kind of debugging information for testing entanglement. By reformulating the Peres-Horodecki and matrix realignment criteria we are able to capture some characteristic features of enta…
The spin network quantum simulator relies on the su(2) representation ring (or its q-deformed counterpart at q= root of unity) and its basic features naturally include (multipartite) entanglement and braiding. In particular, q-deformed spin network automata are able to perform efficiently approximate calculations of topological invarians of knots and 3-manifolds. The same algebraic background is shared by 2D lattice models supporting topological phases of matter that have recently gained much interest in condensed matter physics. These developments are motivated by the possibility to store qua…
We present a novel, universal description of quantum entanglement using group theory and generalized characteristic functions. It leads to new reformulations of the separability problem, and the positivity of partial transpose (PPT) criterion. The latter turns out to be intimately related to a certain reality condition for group representations. Within our formalism, we also show a connection between existence of entanglement and group non-commutativity.
We consider pure quantum states of N qubits and study the genuine N-qubit entanglement that is shared among all the N qubits. We introduce an information-theoretic measure of genuine N-qubit entanglement based on bipartite partitions. When N is an even number, this measure is presented in a simple formula, which depends only on the purities of the partially reduced density matrices. It can be easily computed theoretically and measured experimentally. When N is an odd number, the measure can also be obtained in principle.
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that the density matrix of a graph can be always written as a uniform mixture of pure density matrices of graphs. We consider the von Neumann entropy of these matrices and we characterize the graphs for which the minimum and maximum values are attained. We then discuss the problem of separability by pointing out that separability of density matrices of graphs doe…
Quantum secret sharing (QSS) schemes without entanglement have huge advantages in scalability and are easier to realize as they only require sequential communications of a single quantum system. However, these schemes often come with drawbacks such as exact ($n, n$) structure, security flaws and absences of effective cheating detections. To address these problems, we propose a verifiable framework by utilizing entanglement-free states to construct ($t, n$)-QSS schemes. Our work is the heuristic step towards information-theoretical security in entanglement-free QSS, and it sheds light on how to…
The discrete-time quantum walk is a quantum counterpart of the random walk. It is expected that the model plays important roles in the quantum field. In the quantum information theory, entanglement is a key resource. We use the von Neumann entropy to measure the entanglement between the coin and the particle's position of the quantum walks. Also we deal with the Shannon entropy which is an important quantity in the information theory. In this paper, we show limits of the von Neumann entropy and the Shannon entropy of the quantum walks on the one dimensional lattice starting from the origin def…
We address the following criterion for quantifying the quantum information resources: classically simulable {\it vs.} classically non-simulable information processing. This approach gives rise to existence of a deeper level of quantum information processing--which we refer to as "quantum communication channel". We particularly show, that following the recipes of the standard theory of entanglement measures does not necessarily give rise to un-locking the quantum communication channel, which is naturally quantified by Bell inequalities.
Why we do not see large macroscopic objects in entangled states? There are two ways to approach this question. The first is dynamic: the coupling of a large object to its environment cause any entanglement to decrease considerably. The second approach, which is discussed in this paper, puts the stress on the difficulty to observe a large scale entanglement. As the number of particles n grows we need an ever more precise knowledge of the state, and an ever more carefully designed experiment, in order to recognize entanglement. To develop this point we consider a family of observables, called wi…
We show that the two notions of entanglement: the maximum of the geometric measure of entanglement and the maximum of the nuclear norm is attained for the same states. We affirm the conjecture of Higuchi-Sudberry on the maximum entangled state of four qubits. We introduce the notion of d-density tensor for mixed d-partite states. We show that d-density tensor is separable if and only if its nuclear norm is $1$. We suggest an alternating method for computing the nuclear norm of tensors. We apply the above results to symmetric tensors. We give many numerical examples.
The hypergraph states are pure multipartite quantum states corresponding to a hypergraph. It is an equal superposition of the states belonging to the computational basis. Given any hypergraph, we can construct a hypergraph state determined by a Boolean function. In contrast, we can find a hypergraph, corresponding to a Boolean function. This investigation develops a number of combinatorial structures concerned with the hypergraph states. For instance, the elements of the computational basis generate a lattice. The chains and antichains in this lattice assist us to find the equation of the Bool…
An Operator-Theoretic Model of Entanglement Percolation in Series-Parallel Quantum Networks
College of Mathematics, Taiyuan University of Technology（太原理工大学数学学院）；School of Mathematics and Statistics, Shaanxi Normal University（陕西师范大学数学与统计学院）；School of Mathematics, Xi’an University of Technology（西安理工大学数学学院）
Hypergraph states are multiqubit states whose combinatorial description and entanglement properties generalize the well-studied class of graph states. Graph states are important in applications such as measurement-based quantum computation and quantum error correction. The study of hypergraph states, with their richer multipartite entanglement and other nonlocal properties, has a promising outlook for new insight into multipartite entanglement. We present results analyzing local unitary symmetries of hypergraph states, including both continuous and discrete families of symmetries. In particula…
A special feature of the ground state in a topologically ordered phase is the existence of large scale correlations depending only on the topology of the regions. These correlations can be detected by the topological entanglement entropy or by a measure called irreducible correlation. We show that these two measures coincide for states obeying an area law and having zero-correlation length. Moreover, we provide an operational meaning for these measures by proving its equivalence to the optimal rate of a particular class of secret sharing protocols. This establishes an information-theoretical a…
The concentration and distribution of quantum entanglement is an essential ingredient in emerging quantum information technologies. Much theoretical and experimental effort has been expended in understanding how to distribute entanglement in one-dimensional networks. However, as experimental techniques in quantum communication develop, protocols for multi-dimensional systems become essential. Here, we focus on recent theoretical developments in protocols for distributing entanglement in regular and complex networks, with particular attention to percolation theory and network-based error correc…
The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed density matrices from combinatorial laplacian matrices of graphs discussed in Braunstein {\it et al.} Annals of Combinatorics, {\bf 10}(2006)291 to tripartite states. Then we proved that the degree condition defined in Braunstein {\it et al.} Phys. Rev. A {\bf 73}, (2006)012320 is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph.
Absolutely Maximally Entangled (AME) states are those multipartite quantum states that carry absolute maximum entanglement in all possible partitions. AME states are known to play a relevant role in multipartite teleportation, in quantum secret sharing and they provide the basis novel tensor networks related to holography. We present alternative constructions of AME states and show their link with combinatorial designs. We also analyze a key property of AME, namely their relation to tensors that can be understood as unitary transformations in every of its bi-partitions. We call this property m…
Within the context of quantum teleportation, a proposed intuitive model to explain bipartite entanglement describes the scheme as being the same qubit of information evolving along and against the flow of time of an external observer. We investigate the physicality of such a model by applying the time-reversal of the Schrodinger equation in the teleportation context. To do so, we first lay down the theory of time-reversal applied to the circuit model and then show that the outcome of a teleportation-like circuit is consistent with the usual tensor product treatment, thus independent of the phy…
The performance of variational quantum algorithms relies on the success of using quantum and classical computing resources in tandem. Here, we study how these quantum and classical components interrelate. In particular, we focus on algorithms for solving the combinatorial optimization problem MaxCut, and study how the structure of the classical optimization landscape relates to the quantum circuit used to evaluate the MaxCut objective function. In order to analytically characterize the impact of quantum features on the critical points of the landscape, we consider a family of quantum circuit a…
We study topological properties of quasi-particle states in the non-Abelian quantum Hall states. We apply a skein-theoretic method to the Read--Rezayi state whose effective theory is the SU(2)_K Chern--Simons theory. As a generalization of the Pfaffian (K=2) and the Fibonacci (K=3) anyon states, we compute the braiding matrices of quasi-particle states with arbitrary spins. Furthermore we propose a method to compute the entanglement entropy skein-theoretically. We find that the entanglement entropy has a nontrivial contribution called the topological entanglement entropy which depends on the q…
The dynamics of entanglement between two photons with one of them passing through noisy quantum channels is characterized. It is described by a simple factorization law which was first theoretically proposed by Konrad {\it et al.} [Nature Phys., 4, 99 (2008)]. Quantum state tomography process is employed to reconstruct the reduced density matrixes of the final states and the corresponding concurrences are calculated. Good fittings between experimental results and theoretical predictions are found, which imply the validity of the general factorization law in the characterization of entanglement…
We study the operational regime of a noiseless linear amplifier based on quantum scissors that can nondeterministically amplify the one photon component of a quantum state with weak excitation. It has been shown that an arbitrarily large quantum state can be amplified by first splitting it into weak excitation states using a network of beamsplitters. The output states of the network can then be coherently recombined. In this paper, we analyse the performance of such a device for distilling entanglement after transmission through a lossy quantum channel, and look at two measures to determine th…
There are two important paradigms for defining quantum correlations in quantum information theory, viz. the information-theoretic and the entanglement-separability ones. We find an analytical relation between two measures of quantum correlations, one in each paradigm, and show that only a certain cone-like region on the two-dimensional space spanned by these measures is accessible to pure three-qubit states. The information-theoretic multiparty quantum correlation measure is related to the monogamy considerations of a bipartite information-theoretic quantum correlation measure, while the entan…
Particle identity and entanglement are two fundamental quantum properties that work as major resources for various quantum information tasks. However, it is still a challenging problem to understand the correlation of the two properties in the same system. While recent theoretical studies have shown that the spatial overlap between identical particles is necessary for nontrivial entanglement, the exact role of particle indistinguishability in the entanglement of identical particles has never been analyzed quantitatively before. Here, we theoretically and experimentally investigate the behavior…
Closed timelike curves are striking predictions of general relativity allowing for time-travel. They are afflicted by notorious causality issues (e.g. grandfather's paradox). Quantum models where a qubit travels back in time solve these problems, at the cost of violating quantum theory's linearity - leading e.g. to universal quantum cloning. Interestingly, linearity is violated even by open timelike curves (OTCs), where the qubit does not interact with its past copy, but is initially entangled with another qubit. Non-linear dynamics is needed to avoid violating entanglement monogamy. Here we p…
In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of pure and mixed states, Von-Neumann entropy, separability of multipartite quantum states and quantum operations in terms of the graphs associated with quantum states. In order to address the separability and entanglement questions using graphs, we introduce a modified tensor product of weighted graphs, and establish its algebraic properties. In particular, we s…
Double-slit experiment very well lends itself in describing the problem of measuring simultaneously incompatible properties. In such a context, we theoretically design an ideal experiment for spin-7/2 particles, able to produce the entanglement which makes possible the detection.
Quantum entanglement of identical particles is essential in quantum information theory. Yet, its correct determination remains an open issue hindering the general understanding and exploitation of many-particle systems. Operator-based methods have been developed that attempt to overcome the issue. We introduce a state-based method which, as second quantization, does not label identical particles and presents conceptual and technical advances compared to the previous ones. It establishes the quantitative role played by arbitrary wave function overlaps, local measurements and particle nature (bo…
Entanglement and mixedness of a bipartite mixed state resource are crucial for the success of quantum teleportation. Upper bounds on measures of mixedness, namely, von Neumann entropy and linear entropy beyond which the bipartite state ceases to be useful for quantum teleportation are known in the literature. In this work, we generalize these bounds and obtain rank dependent upper bounds on von Nuemann entropy and linear entropy for an arbitrary bipartite mixed state resource. We observe that the upper bounds on measures of mixedness increase with increase in the rank. For two qubit mixed stat…
Inspired by the recent developments in the research of atom-photon quantum interface and energy-time entanglement between single photon pulses, we propose to establish the concept of a special energy-time entanglement between a single photon pulse and internal states of a single atom, which is analogous to the frequency-bin entanglement between single photon pulses. We show that this type of entanglement arises naturally in the interaction between frequency-bin entangled single photon pulse pair and a single atom, via straightforward atom-photon phase gate operations. We also discuss the prope…
We report on the generation of time-bin entangled photon pairs from a semiconductor quantum dot via pulsed resonant biexciton generation. Based on theoretical modeling we optimized the duration of the excitation pulse to minimize the laser-induced dephasing and increase the biexciton-to-background single exciton occupation probability. This results in a high degree of entanglement with a concurrence of up to 0.78(6) and a 0.88(3) overlap with a maximally entangled state. Theoretical simulations also indicate a power dependent nature of the dephasing during the laser excitation that limits the …
Quantum correlations are investigated theoretically in a two-spin system with the dipole-dipole interactions in the NMR multiple-pulse spin-locking experiments. We consider two schemes of the multiple-pulse spin-locking. The first scheme consists of $π/2$-pulses only and the delays between the pulses can differ. The second scheme contains $φ$-pulses ($0<φ<π$) and has equal delays between them. We calculate entanglement for both schemes for an initial separable state. We show that entanglement is absent for the first scheme at equal delays between $π/2$-pulses at arbitraty temperatures. Entangl…
How best one can recycle a given quantum resource, mitigating the various difficulties involved in its preparation and preservation, is of considerable importance for ensuring efficient applications in quantum technology. Here we demonstrate quantitatively the resource theoretic advantage of reusing a single copy of a two-qubit entangled state towards information processing. To this end, we consider a scenario of sequential entanglement detection of a given two-qubit state by multiple independent observers on each of the two spatially separated wings. In particular, we consider equal numbers o…
We develop graph theoretic methods for analysing maximally entangled pure states distributed between a number of different parties. We introduce a technique called {\it bicolored merging}, based on the monotonicity feature of entanglement measures, for determining combinatorial conditions that must be satisfied for any two distinct multiparticle states to be comparable under local operations and classical communication (LOCC). We present several results based on the possibility or impossibility of comparability of pure multipartite states. We show that there are exponentially many such entangl…
Nonlocality and quantum entanglement constitute two special features of quantum systems of paramount importance in quantum information theory (QIT). Essentially regarded as identical or equivalent for many years, they constitute different concepts. Describing nonlocality by means of the maximal violation of two Bell inequalities, we study both entanglement and nonlocality for two and three spins in the XY model. Our results shed a new light into the description of nonlocality and the possible information-theoretic task limitations of entanglement in an infinite quantum system.
We investigate multipartite entanglement in relation to the theoretical process of quantum state exchange. In particular, we consider such entanglement for a certain pure state involving two groups of N trapped atoms. The state, which can be produced via quantum state exchange, is analogous to the steady-state intracavity state of the subthreshold optical nondegenerate parametric amplifier. We show that, first, it possesses some 2N-way entanglement. Second, we place a lower bound on the amount of such entanglement in the state using a novel measure called the entanglement of minimum bipartite …
The recent literature on near-term applications for quantum computers contains several examples of the applications of hybrid quantum/classical variational approaches. This methodology can be applied to a variety of optimization problems, but its practical performance is not well studied yet. This paper moves some steps in the direction of characterizing the practical performance of the methodology, in the context of finding solutions to classical combinatorial optimization problems. Our study is based on numerical results obtained applying several classical nonlinear optimization algorithms t…
This paper develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum error-correcting codes (EAQECCs) with many desirable properties. These properties include the requirement of only one initial entanglement bit, high error correction performance, high rates, and low decoding complexity. The proposed method produces infinitely many new codes with a wide variety of parameters and entanglement requirements. Our framework encompass…
