Related papers: Computable entanglement cost under positive partia…
Many problems in quantum information theory can be formulated as optimizations over the sequential outcomes of dynamical systems subject to unpredictable external influences. Such problems include many-body entanglement detection through…
In this thesis there are two topics: On the entangling capacity, in terms of negativity, of quantum operations, and on the supremum of negativity for symmetric Gaussian states. Positive partial transposition (PPT) states are an important…
The computation of quantum entanglement can be formulated as a high-dimensional nonconvex optimization problem with orthogonality constraints. In this work, we propose structure-preserving consensus-based optimization (CBO) methods for…
An outstanding problem in quantum computing is the calculation of entanglement, for which no closed-form algorithm exists. Here we solve that problem, and demonstrate the utility of a quantum neural computer, by showing, in simulation, that…
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…
Computing the exact rate at which entanglement can be distilled from noisy quantum states is one of the longest-standing questions in quantum information. We give an exact solution for entanglement distillation under the set of dually…
Inspired by environmental sciences, we develop a framework to quantify the energy needed to generate quantum entanglement via noisy quantum channels, focusing on the hardware-independent, i.e. fundamental cost. Within this framework, we…
Quantum computing promises to provide exponential speed-ups to certain classes of problems. In many such algorithms, a classical vector $\mathbf{b}$ is encoded in the amplitudes of a quantum state $\left |b \right >$. However, efficiently…
The entanglement cost of a quantum channel is the minimal rate at which entanglement (between sender and receiver) is needed in order to simulate many copies of a quantum channel in the presence of free classical communication. In this…
Unlike the entanglement of quantum states, very little is known about the entanglement of bipartite channels, called dynamical entanglement. Here we work with the partial transpose of a superchannel, and use it to define computable measures…
Recent advances in quantum technology facilitate the realization of information processing using quantum computers at least on the small and intermediate scales of up to several dozens of qubits. We investigate entanglement cost required…
The trade-off relation between the rate and the strong converse exponent for probabilistic asymptotic entanglement transformations between pure multipartite states can in principle be characterised in terms of a class of entanglement…
In recent years it was recognized that properties of physical systems such as entanglement, athermality, and asymmetry, can be viewed as resources for important tasks in quantum information, thermodynamics, and other areas of physics. This…
The problem of optimally estimating an unknown unitary quantum operation with the aid of entanglement is addressed. The idea is to prepare an entangled pair, apply the unknown unitary to one of the two parts and then measure the joint…
Multipartite entanglement is an essential resource for quantum communication, quantum computing, quantum sensing, and quantum networks. The utility of a quantum state, $|\psi\rangle$, for these applications is often directly related to the…
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…
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…
Entanglement is the powerful and enigmatic resource central to quantum information processing, which promises capabilities in computing, simulation, secure communication, and metrology beyond what is possible for classical devices. Exactly…
Convex optimization problems arise naturally in quantum information theory, often in terms of minimizing a convex function over a convex subset of the space of hermitian matrices. In most cases, finding exact solutions to these problems is…
Notions of circuit complexity and cost play a key role in quantum computing and simulation where they capture the (weighted) minimal number of gates that is required to implement a unitary. Similar notions also become increasingly prominent…