اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA no-go result on the purification of quantum states
134
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The information encoded in a quantum system is generally spoiled by the influences of its environment, leading to a transition from pure to mixed states. Reducing the mixedness of a state is a fundamental step in the quest for a feasible implementation of quantum technologies. Here we show that it is impossible to transfer part of such mixedness to a trash system without losing some of the initial information. Such loss is lower-bounded by a value determined by the properties of the initial state to purify. We discuss this interesting phenomenon and its consequences for general quantum information theory, linking it to the information theoretical primitive embodied by the quantum state-merging protocol and to the behaviour of general quantum correlations.
قيم البحث
اقرأ أيضاً
The linear superposition principle in quantum mechanics is essential for several no-go theorems such as the no-cloning theorem, the no-deleting theorem and the no-superposing theorem. It remains an open problem of finding general forbidden principles
to unify these results. In this paper, we investigate general quantum transformations forbidden or permitted by the superposition principle for various goals. First, we prove a no-encoding theorem that forbids linearly superposing of an unknown pure state and a fixed state in Hilbert space of finite dimension. Two general forms include the no-cloning theorem, the no-deleting theorem, and the no-superposing theorem as special cases. Second, we provide a unified scheme for presenting perfect and imperfect quantum tasks (cloning and deleting) in a one-shot manner. This scheme may yield to fruitful results that are completely characterized with the linear independence of the input pure states. The generalized upper bounds for the success probability will be proved. Third, we generalize a recent superposing of unknown states with fixed overlaps when multiple copies of the input states are available.
We derive the invariant measure on the manifold of multimode quantum Gaussian states, induced by the Haar measure on the group of Gaussian unitary transformations. To this end, by introducing a bipartition of the system in two disjoint subsystems, we
use a parameterization highlighting the role of nonlocal degrees of freedom -- the symplectic eigenvalues -- which characterize quantum entanglement across the given bipartition. A finite measure is then obtained by imposing a physically motivated energy constraint. By averaging over the local degrees of freedom we finally derive the invariant distribution of the symplectic eigenvalues in some cases of particular interest for applications in quantum optics and quantum information.
Signal analysis is built upon various resolutions of the identity in signal vector spaces, e.g. Fourier, Gabor, wavelets, etc. Similar resolutions are used as quantizers of functions or distributions, paving the way to a time-frequency or time-scale
quantum formalism and revealing interesting or unexpected features. Extensions to classical electromagnetism viewed as a quantum theory for waves and not for photons are mentioned.
We investigate the encoding of higher-dimensional logic into quantum states. To that end we introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions and investigate their structure as an algebra over the ring
of integers modulo $d$. We point out that the polynomiality of the function is the deciding property for associating hypergraphs to states. Given a polynomial, we map it to a tensor-edge hypergraph, where each edge of the hypergraph is associated with a tensor. We observe how these states generalize the previously defined qudit hypergraph states, especially through the study of a group of finite-function-encoding Pauli stabilizers. Finally, we investigate the structure of FFE states under local unitary operations, with a focus on the bipartite scenario and its connections to the theory of complex Hadamard matrices.
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are significant
because they are the first to have time-complexities that are comparable to the best known methods for simulating time-independent Hamiltonian evolution, given appropriate smoothness criteria on the Hamiltonian are satisfied. We provide a thorough cost analysis of these algorithms that considers discretizion errors in both the time and the representation of the Hamiltonian. In addition, we provide the first upper bounds for the error in Lie-Trotter-Suzuki approximations to unitary evolution operators, that use adaptively chosen time steps.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
