相关论文: Bounds on entanglement dimensions and quantum grap…

This work focuses on minimizing the eigenvalue of a noncommutative polynomial subject to a finite number of noncommutative polynomial inequality constraints. Based on the Helton-McCullough Positivstellensatz, the noncommutative analog of…

Sharing entanglement across quantum interconnects is fundamental for quantum information processing. We discuss a practical setting where this interconnect, modeled by a quantum channel, is used once with the aim of sharing high fidelity…

Many quantum information measures can be written as an optimization of the quantum relative entropy between sets of states. For example, the relative entropy of entanglement of a state is the minimum relative entropy to the set of separable…

We introduce semidefinite programming hierarchies for benchmarking relevant entanglement properties in the high-dimensional steering scenario. Firstly, we provide a general method for detecting the entanglement dimensionality through…

Maximal correlation is a measure of correlation for bipartite distributions. This measure has two intriguing features: (1) it is monotone under local stochastic maps; (2) it gives the same number when computed on i.i.d. copies of a pair of…

Kauffman and Lomonaco explored the idea of understanding quantum entanglement (the non-local correlation of certain properties of particles) topologically by viewing unitary entangling operators as braiding operators. In the work of G.…

When a quantum system is divided into two local subsystems, measurements on the two subsystems can exhibit correlations beyond those possible in a classical joint probability distribution; these are partially explained by entanglement, and…

Quantum algorithms have the ability to reduce runtime for executing tasks beyond the capabilities of classical algorithms. Therefore, identifying the resources responsible for quantum advantages is an interesting endeavour. We prove that…

We introduce two quantum algorithms for solving structured prediction problems. We first show that a stochastic gradient descent that uses the quantum minimum finding algorithm and takes its probabilistic failure into account solves the…

Coordination in distributed systems is often hampered by communication latency, which degrades performance. Quantum entanglement offers fundamentally stronger correlations than classically achievable without communication. Crucially, these…

Measurement incompatibility is a cornerstone of quantum mechanics. In the context of estimating multiple parameters of a quantum system, this manifests as a fundamental trade-off between the precisions with which different parameters can be…

In this work, we present a comprehensive exploration of the entanglement and graph connectivity properties of graph states. We quantify the entanglement in pseudo graph states using the entanglement distance, a recently introduced measure…

Organising the space of entanglement structures of a multipartite quantum system is a much more challenging task than its bipartite version: while the local unitary (LU) orbit of a bipartite pure state can be conveniently characterized by…

We give asymptotically converging semidefinite programming hierarchies of outer bounds on bilinear programs of the form $\mathrm{Tr}\big[M(X\otimes Y)\big]$, maximized with respect to semidefinite constraints on $X$ and $Y$. Applied to the…

We analyze few-body quantum states with particular correlation properties imposed by the requirement of maximal bipartite entanglement for selected partitions of the system into two complementary parts. A novel framework to treat this…

Entanglement detection is a fundamental task in quantum information science, serving as a cornerstone for quantum benchmarking and foundational studies. With an increasing qubit number that can be effectively controlled, there is a pressing…

A central challenge in quantum metrology is identifying optimal measurements that saturate the quantum Cramer-Rao bound under realistic constraints, e.g., local measurements. We show that symmetries of the probe state provide a general…

We propose a method for constructing multi-qubit entangled quantum states representing weighted tripartite graphs. An expression for the entanglement distance for multi-qubit states corresponding to arbitrary tripartite graph structures is…

We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem,…

While tensor networks have their traditional application in simulating quantum systems, in the recent decade they have gathered interest as machine learning models. We combine the experience from both fields and derive how quantum…