Related papers: Symmetrizing Cost of Quantum States
Here we address a task denoted as deimaginarity, which is to transform a state into a real state with the aid of random covariant-free unitary operations. We consider the minimum cost of randomness required for deimaginarity in the scenario…
We introduce and analyze a task in which a tripartite quantum state is transformed to an approximately recoverable state by a randomizing operation on one of the three subsystems. We consider cases where the initial state is a tensor…
We introduce and analyze a task that we call Markovianization, in which a tripartite quantum state is transformed to a quantum Markov chain by a randomizing operation on one of the three subsystems. We consider cases where the initial state…
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…
We give a detailed proof of the conjecture that the asymptotic entanglement cost of preparing a bipartite state \rho is equal to the regularized entanglement of formation of \rho.
We investigate how to determine whether the states of a set of quantum systems are identical or not. This paper treats both error-free comparison, and comparison where errors in the result are allowed. Error-free comparison means that we…
Symmetry is fundamental in the description and simulation of quantum systems. Leveraging symmetries in classical simulations of many-body quantum systems can results in significant overhead due to the exponentially growing size of some…
Understanding the resource consumption in distributed scenarios is one of the main goals of quantum information theory. A prominent example for such a scenario is the task of quantum state merging where two parties aim to merge their parts…
This thesis aims to establish notions of symmetry for quantum states and channels as well as describe algorithms to test for these properties on quantum computers. Ideally, the work will serve as a self-contained overview of the subject. We…
Measurement in quantum simulations provides a means for extracting meaningful information from a complex quantum state, and for quantum computing reducing the complexity of measurement will be vital for near-term applications. For most…
We compute entanglement cost and distillable entanglement of states supported on symmetric subspace. Not only giving general formula, we apply them to the output states of optimal cloning machines. Surprisingly, under some settings, the…
The entanglement cost of arbitrary sequences of bipartite states is shown to be expressible as the minimization of a conditional spectral entropy rate over sequences of separable extensions of the states in the sequence. The expression is…
Symmetric quantum states are fascinating objects. They correspond to multipartite systems that remain invariant under particle permutations. This symmetry is reflected in their compact mathematical characterisation but also in their unique…
Symmetry is an important property of quantum mechanical systems which may dramatically influence their behavior in and out of equilibrium. In this paper, we study the effect of symmetry on tripartite entanglement properties of typical…
Quantum information theory is plagued by the problem of regularisations, which require the evaluation of formidable asymptotic quantities. This makes it computationally intractable to gain a precise quantitative understanding of the…
Symmetry is a unifying concept in physics. In quantum information and beyond, it is known that quantum states possessing symmetry are not useful for certain information-processing tasks. For example, states that commute with a Hamiltonian…
We determine the optimal entanglement rate of quantum state merging when assuming that the state is unknown except for its membership in a certain set of states. We find that merging is possible at the lowest rate allowed by the individual…
We develop an adaptive method for quantum state preparation that utilizes randomness as an essential component and that does not require classical optimization. Instead, a cost function is minimized to prepare a desired quantum state…
Consider a quantum system prepared in an input state. One wants to drive it into a target state. Assuming classical states and operations as free resources, I identify a geometric cost function which quantifies the difficulty of the…
We consider a quantum state shared between many distant locations, and define a quantum information processing primitive, state merging, that optimally merges the state into one location. As announced in [Horodecki, Oppenheim, Winter,…