Beyond future applications, quantum networks open interesting fundamental perspectives, notably novel forms of quantum correlations. In this work we discuss quantum correlations in networks from the perspective of the underlying quantum states and their entanglement. We address the questions of which states can be prepared in the so-called triangle network, consisting of three nodes connected pairwise by three sources. We derive necessary criteria for a state to be preparable in such a network, considering both the cases where the sources are statistically independent and classically correlated. This shows that the network structure imposes strong and non-trivial constraints on the set of preparable states, fundamentally different from the standard characterization of multipartite quantum entanglement.
We derive a simple lower bound on the geometric measure of entanglement for mixed quantum states in the case of a general multipartite system. The main ingredient of the presented derivation is the triangle inequality applied to the root infidelity distance in the space of density matrices. The obtained bound leads to entanglement criteria with a straightforward interpretation. Proposed criteria provide an experimentally accessible, powerful entanglement test.
A previously overlooked constraint for the distribution of entanglement in three-qubit systems is exploited for the first time and used to reveal a new genuine tripartite entanglement measure. It is interpreted as the area of a so-called concurrence triangle and is compared with other existing measures. The new measure is found superior to previous attempts for different reasons. A specific example is illustrated to show that two tripartite entanglement measures can be inequivalent due to the high dimensionality of the Hilbert space.
Quantum coherence and entanglement are two key features in quantum mechanics and play important roles in quantum information processing and quantum computation. We provide a general triangle-like inequality satisfied by the $l_1$-norm measure of coherence for convex combination of arbitrary $n$ pure states of a quantum state $ρ$. Furthermore, we present triangle-like inequality for the convex-roof extended negativity for any states of rank 2, which gives a positive answer to a conjecture raised in [Phys. Rev. A 96, 062308 (2017)]. Detailed examples are given to illustrate the relations charact…
We study the quantification of genuine multipartite entanglement (GME) for general multipartite states. A set of inequalities satisfied by the entanglement of $N$-partite pure states is derived by exploiting the restrictions on entanglement distributions, showing that the bipartite entanglement between each part and its remaining ones cannot exceed the sum of the other partners with their remaining ones. Then a series of triangles, named concurrence triangles, are established corresponding to these inequalities. Proper genuine multipartite entanglement measures are thus constructed by using th…
We provide detailed proofs of triangle inequalities in coherence measures and entanglement concurrence. If a rank-$2$ state $\varrho$ can be expressed as a convex combination of two pure states, i.e., $\varrho=p_{1}|ψ_{1}\rangle\langleψ_{1}|+p_{2}|ψ_{2}\rangle\langleψ_{2}|$, a triangle inequality can be established as $\big{|}E(|Ψ_{1}\rangle)-E(|Ψ_{2}\rangle)\big{|}\leq E(\varrho)\leq E(|Ψ_{1}\rangle)+E(|Ψ_{2}\rangle)$, where $|Ψ_{1}\rangle=\sqrt{p_{1}}|ψ_{1}\rangle$ and $|Ψ_{2}\rangle=\sqrt{p_{2}}|ψ_{2}\rangle$, $E$ can be considered either coherence measures or entanglement concurrence. This…
Quantifying genuine entanglement is a crucial task in quantum information theory.In this work, we give an approach of constituting genuine $m$-partite entanglement measures from any bipartite entanglement and any $k$-partite entanglement measure, $3\leq k<m$. In addition, as a complement to the three-qubit concurrence triangle proposed in [Phys. Rev. Lett., 127, 040403], we show that the triangle relation is also valid for any continuous entanglement measure and system with any dimension. We also discuss the tetrahedron structure for the four-partite system via the triangle relation associated…
We present an alternative approach to unveil a different kind of entanglement in bipartite quantum states whose diagonal zero patterns in suitable matrix representations admit a nice description in terms of triangle-free graphs. Upon application of a local averaging operation, the separability of such states transforms into a simple matrix positivity condition, the violation of which implies the presence of entanglement. We completely characterize the class of triangle-free graphs which allows for nontrivial entanglement detection using the above test. Moreover, we develop a recipe to construc…
In proposals for quantum computers using arrays of trapped ultracold polar molecules as qubits, a strong external field with appreciable gradient is imposed in order to prevent quenching of the dipole moments by rotation and to distinguish among the qubit sites. That field induces the molecular dipoles to undergo pendular oscillations, which markedly affect the qubit states and the dipole-dipole interaction. We evaluate entanglement of the pendular qubit states for two linear dipoles, characterized by pairwise concurrence, as a function of the molecular dipole moment and rotational constant, s…
Generalized quantum discord $(D_q)$, Einstein-Podolsky-Rosen steering $(S)$, entanglement $(E)$, and Bell nonlocality ($N$), are logically distinct quantifiers of quantum correlations. All these measures capture nonclassical aspects of quantum states and play some role as resources in quantum information processing. In this work, we look for the hierarchy satisfied by these quantum correlation witnesses for a class of two-qubit states. We show that $N \triangleright S\triangleright E\triangleright D_q$, meaning that nonlocality implies steering, which in turn implies entanglement, which then i…
Two quantum information processing protocols are said to be dual under resource reversal if the resources consumed (generated) in one protocol are generated (consumed) in the other. Previously known examples include the duality between entanglement concentration and dilution, and the duality between coherent versions of teleportation and super-dense coding. A quantum feedback channel is an isometry from a system belonging to Alice to a system shared between Alice and Bob. We show that such a resource may be reversibly decomposed into a perfect quantum channel and pure entanglement, generalizin…
We show that in the quantum query model the complexity of detecting a triangle in an undirected graph on $n$ nodes can be done using $O(n^{1+{3\over 7}}\log^{2}n)$ quantum queries. The same complexity bound applies for outputting the triangle if there is any. This improves upon the earlier bound of $O(n^{1+{1\over 2}})$.
In this paper we consider a quantum version of Pascal's triangle. Pascal's triangle is a well-known triangular array of numbers and when these numbers are plotted modulo 2, a fractal known as the Sierpinski triangle appears. We first prove the appearance of more general fractals when Pascal's triangle is considered modulo prime powers. The numbers in Pascal's triangle can be obtained by scaling the probabilities of the simple symmetric random walk on the line. In this paper we consider a quantum version of Pascal's triangle by replacing the random walk by the quantum walk known as the Hadamard…
We show that the Csiszar-Korner sufficient condition for secure cryptographic key generation with the help of quantum theory can be easily derived using the triangle inequality for an information-theoretic distance.
We present two new quantum algorithms that either find a triangle (a copy of $K_{3}$) in an undirected graph $G$ on $n$ nodes, or reject if $G$ is triangle free. The first algorithm uses combinatorial ideas with Grover Search and makes $\tilde{O}(n^{10/7})$ queries. The second algorithm uses $\tilde{O}(n^{13/10})$ queries, and it is based on a design concept of Ambainis~\cite{amb04} that incorporates the benefits of quantum walks into Grover search~\cite{gro96}. The first algorithm uses only $O(\log n)$ qubits in its quantum subroutines, whereas the second one uses O(n) qubits. The Triangle Pr…
In order to study N-locality without inputs in long lines and in configurations with loops, e.g. the triangle, we introduce a natural joint measurement on two qubits different from the usual Bell state measurement. The resulting quantum probability $p(a_1,a_2,...,a_N)$ has interesting features. In particular the probability that all results are equal is that large, while respecting full symmetry, that it seems highly implausible that one could reproduce it with any N-local model, though - unfortunately - I have not been unable to prove it.
Quantum networks allow in principle for completely novel forms of quantum correlations. In particular, quantum nonlocality can be demonstrated here without the need of having various input settings, but only by considering the joint statistics of fixed local measurement outputs. However, previous examples of this intriguing phenomenon all appear to stem directly from the usual form of quantum nonlocality, namely via the violation of a standard Bell inequality. Here we present novel examples of 'quantum nonlocality without inputs', which we believe represent a new form of quantum nonlocality, g…
It has long been recognized that certain quantum correlations are incompatible with particular assumption about classical causal structure. Given a causal structure of unknown classicality, the presence of such correlations certifies the nonclassical nature of the causal structure in a device-independent fashion. In structures where all parties share a common resource, these nonclassical correlations are also known as nonlocal correlations. Any constraint satisfied by all correlations which are classically compatible with a given causal structure defines a causal compatibility criterion. Such …
The interplay of interactions, symmetries and gauge fields usually leads to intriguing quantum many-body phases. To explore the nature of emerging phases, we study a quantum Rabi triangle system as an elementary building block for synthesizing an artificial magnetic field. We develop an analytical approach to study the rich phase diagram and the associated quantum criticality. Of particular interest is the emergence of a chiral-coherent phase, which breaks both the $\mathbb{Z}_2$ and the chiral symmetry. In this chiral phase, photons flow unidirectionally and the chirality can be tuned by the …
Quantum networks are the center of many of the recent advances in quantum science, not only leading to the discovery of new properties in the foundations of quantum theory but also allowing for novel communication and cryptography protocols. It is known that networks beyond that in the paradigmatic Bell's theorem imply new and sometimes stronger forms of nonclassicality. Due to a number of practical difficulties, however, the experimental implementation of such networks remains far less explored. Going beyond what has been previously tested, here we verify the nonlocality of an experimental tr…
Using the fact that the energy eigenstates of the equilateral triangle infinite well (or billiard) are available in closed form, we examine the connections between the energy eigenvalue spectrum and the classical closed paths in this geometry, using both periodic orbit theory and the short-term semi-classical behavior of wave packets. We also discuss wave packet revivals and show that there are exact revivals, for all wave packets, at times given by $T_{rev} = 9 μa^2/4\hbar π$ where $a$ and $μ$ are the length of one side and the mass of the point particle respectively. We find additional cases…
We introduce a novel geometric approach to characterize entanglement relations in large quantum systems. Our approach is inspired by Schumacher's singlet state triangle inequality, which used an entropic-based distance to capture the strange properties of entanglement using geometric-based inequalities. Schumacher uses classical entropy and can only describe the geometry of bipartite states. We extend his approach by using von Neumann entropy to create an entanglement monotone that can be generalized for higher dimensional systems. We achieve this by utilizing recent definitions for entropic a…
We present quasi-analytical and numerical calculations of Gaussian wave packet solutions of the Schrödinger equation for two-dimensional infinite well and quantum billiard problems with equilateral triangle, square, and circular footprints. These cases correspond to N=3, N=4, and $N \to \infty$ regular polygonal billiards and infinite wells, respectively. In each case the energy eigenvalues and wavefunctions are given in terms of familiar special functions. For the first two systems, we obtain closed form expressions for the expansion coefficients for localized Gaussian wavepackets in terms of…
Classically, for many computational problems one can conclude time lower bounds conditioned on the hardness of one or more of key problems: k-SAT, 3SUM and APSP. More recently, similar results have been derived in the quantum setting conditioned on the hardness of k-SAT and 3SUM. This is done using fine-grained reductions, where the approach is to (1) select a key problem $X$ that, for some function $T$, is conjectured to not be solvable by any $O(T(n)^{1-ε})$ time algorithm for any constant $ε> 0$ (in a fixed model of computation), and (2) reduce $X$ in a fine-grained way to these computation…
Correlations in quantum networks with independent sources exhibit a completely novel form of nonclassicality in the sense that the nonlocality of such correlations can be demonstrated in fixed local input scenarios. Before the pioneering work by M.O.Renou, et al., in [1], the nonlocal feature of such network correlations was directly attributable to standard Bell nonlocality. In [1], the authors provided some of the first examples of triangle network correlations, whose nonlocality cannot be deduced from Bell-CHSH nonlocality. To date, a complete characterization of such scenarios is yet to be…
We express the matrix elements of the density matrix of the qutrit state in terms of probabilities associated with artificial qubit states. We show that the quantum statistics of qubit states and observables is formally equivalent to the statistics of classical systems with three random vector variables and three classical probability distributions obeying special constrains found in this study. The Bloch spheres geometry of qubit states is mapped onto triangle geometry of qubits. We investigate the triada of Malevich's squares describing the qubit states in quantum suprematism picture and the…
The existence of quantum tricriticality and exotic phases are found in a Dicke triangle (TDT) where three cavities, each one containing an ensemble of three-level atoms, are connected to each other through the action of an artificial magnetic field. The conventional superradiant phase (SR) is connected to the normal phase through first- and second-order boundaries, with tricritical points located at the intersection of such boundaries. Apart from the SR phase, a chiral superradiant (CSR) phase is found by tuning the artificial magnetic field. This phase is characterized by a nonzero photon cur…
It is an established fact that entanglement is a resource. Sharing an entangled state leads to non-local correlations and to violations of Bell inequalities. Such non-local correlations illustrate the advantage of quantum resources over classical resources. Here, we study quantitatively Bell inequalities with $2\times n$ inputs. As found in [N. Gisin et al., Int. J. Q. Inf. 5, 525 (2007)] quantum mechanical correlations cannot reach the algebraic bound for such inequalities. In this paper, we uncover the heart of this effect which we call the {\it fraction of determinism}. We show that any qua…
The violation of Leggett-Garg inequalities tested the quantumness of neutrino oscillations (NOs) across macroscopic distances. The quantumness can be quantified by using the tools of the quantum resource theories. Recently, a new genuine tripartite entanglement measure [S. B. Xie et al., Phys. Rev. Lett. 127, 040403 (2021)], concurrence fill, is defined as the square root of the area of the concurrence triangle satisfying all genuine multipartite entanglement conditions. It has several advantages compared to other existing tripartite measures. Here, we focus on using concurrence fill to quanti…
This paper discusses relationships between topological entanglement and quantum entanglement. Specifically, we propose that for this comparison it is fundamental to view topological entanglements such as braids as "entanglement operators" and to associate to them unitary operators that are capable of creating quantum entanglement.
This paper considers the triangle finding problem in the CONGEST model of distributed computing. Recent works by Izumi and Le Gall (PODC'17), Chang, Pettie and Zhang (SODA'19) and Chang and Saranurak (PODC'19) have successively reduced the classical round complexity of triangle finding (as well as triangle listing) from the trivial upper bound $O(n)$ to $\tilde O(n^{1/3})$, where~$n$ denotes the number of vertices in the graph. In this paper we present a quantum distributed algorithm that solves the triangle finding problem in $\tilde O(n^{1/4})$ rounds in the CONGEST model. This gives another…
It is shown that Smolin four-qubit bound entangled states [Phys. Rev. A, 63 032306 (2001)] can maximally violate two-setting Bell inequality similar to standard CHSH inequality. Surprisingly this entanglement does not allow for secure key distillation, so neither entanglement nor violation of Bell inequalities implies quantum security. It is also pointed out how that kind of bound entanglement can be useful in reducing communication complexity.
Using entanglement of assistance, we establish a general polygamy inequality of multi-party entanglement in arbitrary dimensional quantum systems. For multi-party closed quantum systems, we relate our result with the monogamy of entanglement to show that the entropy of entanglement is an universal entanglement measure that bounds both monogamy and polygamy of multi-party quantum entanglement.
PhD thesis dealing with various aspects of multipartite entanglement, such as entanglement measures, absolutely maximally entangled states, bell inequalities, entanglement spectrum and quantum frustration. Also some quantum algorithms run with the IBM quantum computer are covered, together with others applied to adiabatic quantum computation and quantum thermodynamics.
We show that an improvement to the best known quantum lower bound for GRAPH-COLLISION problem implies an improvement to the best known lower bound for TRIANGLE problem in the quantum query complexity model. In GRAPH-COLLISION we are given free access to a graph $(V,E)$ and access to a function $f:V\rightarrow \{0,1\}$ as a black box. We are asked to determine if there exist $(u,v) \in E$, such that $f(u)=f(v)=1$. In TRIANGLE we have a black box access to an adjacency matrix of a graph and we have to determine if the graph contains a triangle. For both of these problems the known lower bounds a…
We show that the quantum query complexity of detecting if an $n$-vertex graph contains a triangle is $O(n^{9/7})$. This improves the previous best algorithm of Belovs making $O(n^{35/27})$ queries. For the problem of determining if an operation $\circ : S \times S \rightarrow S$ is associative, we give an algorithm making $O(|S|^{10/7})$ queries, the first improvement to the trivial $O(|S|^{3/2})$ application of Grover search. Our algorithms are designed using the learning graph framework of Belovs. We give a family of algorithms for detecting constant-sized subgraphs, which can possibly be di…
The degree of entanglement in an open quantum system varies according to how information in the environment is read. A measure of this contextual entanglement is introduced based on quantum trajectory unravelings of the open system dynamics. It is used to characterize the entanglement in a driven quantum system of dimension $2\times\infty$ where the entanglement is induced by the environmental interaction. A detailed mechanism for the environment-induced entanglement is given.
It is known that if the quantum gates in a proposed quantum computer are so noisy that they are incapable of generating entanglement, then the device can be efficiently simulated classically. If the measurements and single particle operations are restricted, then the same statement can be true for generalised non-quantum notions of entanglement. Here we show that this can improve the applicability of limited-entanglement simulation algorithms. In particular, we show that by using a non-quantum notion of separability a classical simulation algorithm of Harrow & Nielsen can efficiently simulate …
Entanglement is a key issue in the quantum physics which gives rise to resources for achieving tasks that are not possible within the realm of classical physics. Quantum entanglement varies with the evolution of the quantum systems. It is of significance to investigate the entanglement dynamics in terms of quantum channels. We study the entanglement-breaking channels and present the necessary and sufficient conditions for a quantum channel to an entanglement-breaking one for qubit systems. Furthermore, a concept of strong entanglement-breaking channel is introduced. The amendment of entangleme…
We relate the problem of irreversibility of entanglement with the recently defined measures of quantum correlation - quantum discord and one-way quantum deficit. We show that the entanglement of formation is always strictly larger than the coherent information and the entanglement cost is also larger in most cases. We prove irreversibility of entanglement under LOCC for a family of entangled states. This family is a generalization of the maximally correlated states for which we also give an analytic expression for the distillable entanglement, the relative entropy of entanglement, the distilla…
We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.
This paper gives a criterion for detecting the entanglement of a quantum state, and uses it to study the relationship between topological and quantum entanglement. It is fundamental to view topological entanglements such as braids as entanglement operators and to associate to them unitary operators that are capable of creating quantum entanglement. The entanglement criterion is used to explore this connection. The paper discusses non-locality in the light of this criterion.
