اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEncoding classical information into quantum resources
99
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce and analyse the problem of encoding classical information into different resources of a quantum state. More precisely, we consider a general class of communication scenarios characterised by encoding operations that commute with a unique resource destroying map and leave free states invariant. Our motivating example is given by encoding information into coherences of a quantum system with respect to a fixed basis (with unitaries diagonal in that basis as encodings and the decoherence channel as a resource destroying map), but the generality of the framework allows us to explore applications ranging from super-dense coding to thermodynamics. For any state, we find that the number of messages that can be encoded into it using such operations in a one-shot scenario is upper-bounded in terms of the information spectrum relative entropy between the given state and its version with erased resources. Furthermore, if the resource destroying map is a twirling channel over some unitary group, we find matching one-shot lower-bounds as well. In the asymptotic setting where we encode into many copies of the resource state, our bounds yield an operational interpretation of resource monotones such as the relative entropy of coherence and its corresponding relative entropy variance.
قيم البحث
اقرأ أيضاً
We propose examples of a hybrid quantum-classical simulation where a classical computer assisted by a small quantum processor can efficiently simulate a larger quantum system. First we consider sparse quantum circuits such that each qubit participate
s in O(1) two-qubit gates. It is shown that any sparse circuit on n+k qubits can be simulated by sparse circuits on n qubits and a classical processing that takes time $2^{O(k)} poly(n)$. Secondly, we study Pauli-based computation (PBC) where allowed operations are non-destructive eigenvalue measurements of n-qubit Pauli operators. The computation begins by initializing each qubit in the so-called magic state. This model is known to be equivalent to the universal quantum computer. We show that any PBC on n+k qubits can be simulated by PBCs on n qubits and a classical processing that takes time $2^{O(k)} poly(n)$. Finally, we propose a purely classical algorithm that can simulate a PBC on n qubits in a time $2^{c n} poly(n)$ where $capprox 0.94$. This improves upon the brute-force simulation method which takes time $2^n poly(n)$. Our algorithm exploits the fact that n-fold tensor products of magic states admit a low-rank decomposition into n-qubit stabilizer states.
We show that both the classical as well as the quantum definitions of the Fisher information faithfully identify resourceful quantum states in general quantum resource theories, in the sense that they can always distinguish between states with and wi
thout a given resource. This shows that all quantum resources confer an advantage in metrology, and establishes the Fisher information as a universal tool to probe the resourcefulness of quantum states. We provide bounds on the extent of this advantage, as well as a simple criterion to test whether different resources are useful for the estimation of unitarily encoded parameters. Finally, we extend the results to show that the Fisher information is also able to identify the dynamical resourcefulness of quantum operations.
Reference frames are of special importance in physics. They are usually considered to be idealized entities. However, in most situations, e.g. in laboratories, physical processes are described within reference frames constituted by physical systems.
As new technological developments make it possible to demonstrate quantum properties of complex objects an interesting conceptual problem arises: Could one use states of quantum systems to define reference frames? Recently such a framework has been introduced in [F. Giacomini, E. Castro-Ruiz, and v{C}. Brukner, Nat Commun 10, 494 (2019)]. One of its consequences is the fact that quantum correlations depend on a physical state of an observers reference frame. The aim of this work is to examine the dynamical aspect of this phenomena and show that the same is true for correlations established during an evolution of a composite systems. Therefore, decoherence process is also relative: For some observers the reduced evolution of subsystems is unitary, whereas for others not. I also discuss implications of this results for modern developments of decoherence theory: Quantum Darwinism and Spectrum Broadcast Structures.
We introduce a scheme to perform quantum-information processing that is based on a hybrid spin-photon qubit encoding. The proposed qubits consist of spin-ensembles coherently coupled to microwave photons in coplanar waveguide resonators. The quantum
gates are performed solely by shifting the resonance frequencies of the resonators on a ns timescale. An additional cavity containing a Cooper-pair box is exploited as an auxiliary degree of freedom to implement two-qubit gates. The generality of the scheme allows its potential implementation with a wide class of spin systems.
Learning a hidden parity function from noisy data, known as learning parity with noise (LPN), is an example of intelligent behavior that aims to generalize a concept based on noisy examples. The solution to LPN immediately leads to decoding a random
binary linear code in the presence of classification noise. This problem is thought to be intractable classically, but can be solved efficiently if a quantum oracle can be queried. However, in practice, a learner is more likely to receive data from classical oracles. In this work, we show that a naive application of the quantum LPN algorithm to classical data encoded in an equal superposition state requires an exponential sample complexity. We then propose a quantum-classical reinforcement learning algorithm to solve the LPN problem for data generated by a classical oracle and demonstrate a significant reduction in the sample complexity. Simulations with a hidden bit string of length up to 12 show that the quantum-classical reinforcement learning performs better than known classical algorithms when the sample complexity, run time, and robustness to classical noise are collectively considered. Our algorithm is robust to any noise in the quantum circuit that effectively appears as Pauli errors on the final state.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
