Related papers: Calculation of quantum discord and entanglement me…
We consider random bipartite quantum states obtained by tracing out one subsystem from a random, uniformly distributed, tripartite pure quantum state. We compute thresholds for the dimension of the system being traced out, so that the…
We study three methods of obtaining an approximation of unitary evolution of a quantum system under decoherence. We use three methods of optimizing the control pulses: genetic optimization, approximate evolution method and approximate…
A novel class of hybrid quantum-classical algorithms based on the variational approach have recently emerged from separate proposals addressing, for example, quantum chemistry and combinatorial problems. These algorithms provide an…
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…
Some quantum algorithms have "quantum speedups": improved time complexity as compared with the best-known classical algorithms for solving the same tasks. Can we understand what fuels these speedups from an entropic perspective? Information…
The concept of randomized measurements on individual particles has proven to be useful for analyzing quantum systems and is central for methods like shadow tomography of quantum states. We introduce $\textit{collective}$ randomized…
We propose a general framework for solving quantum state estimation problems using the minimum relative entropy criterion. A convex optimization approach allows us to decide the feasibility of the problem given the data and, whenever…
We introduce a purely geometric formulation for two different measures addressed to quantify the entanglement between different parts of a tripartite qubit system. Our approach considers the entanglement-polytope defined by the smallest…
We present an iterative method to solve the multipartite quantum state estimation problem. We demonstrate convergence for any informationally complete set of generalized quantum measurements in every finite dimension. Our method exhibits…
Quantum entanglement is usually revealed via a well aligned, carefully chosen set of measurements. Yet, under a number of experimental conditions, for example in communication within multiparty quantum networks, noise along the channels or…
We present a measure of quantum entanglement which is capable of quantifying the degree of entanglement of a multi-partite quantum system. This measure, which is based on a generalization of the Schmidt rank of a pure state, is defined on…
This work studies the variational quantum eigensolver algorithm, designed to determine the ground state of a quantum mechanical system by combining classical and quantum hardware. Methods of reducing the number of required qubit…
How can we quantify the entanglement in a quantum state, if only the expectation value of a single observable is given? This question is of great interest for the analysis of entanglement in experiments, since in many multiparticle…
We investigate optimal discrimination between two projective single-qubit measurements in a scenario where the measurement can be performed only once. We consider general setting involving a tunable fraction of inconclusive outcomes and we…
There has been a surge of progress in recent years in developing algorithms for testing and learning quantum states that achieve optimal copy complexity. Unfortunately, they require the use of entangled measurements across many copies of…
Quantum discord, a measure of genuinely quantum correlations, is generalized to continuous variable systems. For all two-mode Gaussian states, we calculate analytically the quantum discord and a related measure of classical correlations,…
We compute the multipartite entanglement measures such as the global entanglement of various one- and two-dimensional quantum systems to probe the quantum criticality based on the matrix and tensor product states (MPSs/TPSs). We use…
Quantum entanglement plays a key role in quantum computation and quantum information processing. It is of great significance to find efficient and experimentally friend separability criteria to detect entanglement. In this paper, we firstly…
This paper presents a new measure of entanglement which can be employed for multipartite entangled systems. The classification of multipartite entangled systems based on this measure is considered. Two approaches to applying this measure to…
Quantifying coherence and entanglement is extremely important in quantum information processing. Here, we present numerical and analytical results for the geometric measure of coherence, and also present numerical results for the geometric…