Related papers: Computation of entanglement for quantum states by …
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Considering pure quantum states, entanglement concentration is the procedure where from $N$ copies of a partially entangled state, a single state with higher entanglement can be obtained. Getting a maximally entangled state is possible for…
In this work we are interested in the construction of numerical methods for high dimensional constrained nonlinear optimization problems by particle-based gradient-free techniques. A consensus-based optimization (CBO) approach combined with…
Consensus-based optimization (CBO) is a versatile multi-particle metaheuristic optimization method suitable for performing nonconvex and nonsmooth global optimizations in high dimensions. It has proven effective in various applications…
We introduce the concept of embedding quantum simulators, a paradigm allowing the efficient quantum computation of a class of bipartite and multipartite entanglement monotones. It consists in the suitable encoding of a simulated quantum…
Quantifying entanglement in quantum systems is an important yet challenging task due to its NP-hard nature. In this work, we propose an efficient algorithm for evaluating distance-based entanglement measures. Our approach builds on…
Quantifying quantum entanglement is a pivotal challenge in quantum information science, particularly for high-dimensional systems, due to its computational complexity. This thesis extends the geometric measure of entanglement (GME) to…
We propose a variant of consensus-based optimization (CBO) algorithms, controlled-CBO, which introduces a feedback control term to improve convergence towards global minimizers of non-convex functions in multiple dimensions. The feedback…
A quantum state's entanglement across a bipartite cut can be quantified with entanglement entropy or, more generally, Schmidt norms. Using only Schmidt decompositions, we present a simple iterative algorithm to maximize Schmidt norms.…
We discuss an interferometric approach to the estimation of quantum mechanical damping. We study specific classes of entangled and separable probe states consisting of superpositions of coherent states. Based on the assumption of limited…
A convergent iterative procedure is proposed for the calculation of the relative entropy of entanglement of a given bipartite quantum state. When this state turns out to be non-separable the algorithm provides the corresponding optimal…
Consensus-based optimization (CBO) is a versatile multi-particle optimization method for performing nonconvex and nonsmooth global optimizations in high dimensions. Proofs of global convergence in probability have been achieved for a broad…
Entanglement is the key resource for quantum technologies and is at the root of exciting many-body phenomena. However, quantifying the entanglement between two parts of a real-world quantum system is challenging when it interacts with its…
In a previous paper, we showed how entanglement of formation can be defined as a minimum of the quantum conditional mutual information (a.k.a. quantum conditional information transmission). In classical information theory, the…
Measurement of entanglement remains an important problem for quantum information. We present the design and simulation of an experimental method for entanglement estimation for a general multiqubit state. The system can be in a pure or a…
Quantifying entanglement is a work in progress which is important for the active field of quantum information and computation. A measure of bipartite pure state entanglement is proposed here, named entanglement coherence, which is…
Shared entanglement can significantly amplify classical correlations between systems interacting over a limited quantum channel. A natural avenue is to use entanglement of the same dimension as the channel because this allows for unitary…
Entanglement is one of the fundamental properties of a quantum state and is a crucial differentiator between classical and quantum computation. There are many ways to define entanglement and its measure, depending on the problem or…
Variational quantum algorithms constitute one of the most widespread methods for using current noisy quantum computers. However, it is unknown if these heuristic algorithms provide any quantum-computational speedup, although we cannot…
We study compression strategies for multipartite entanglement distribution under uncertainty in the partitioning of the quantum state. When the partition is not known at the time of state preparation, we show that a joint design of the…