Operational Interpretation of Weight-Based Resource Quantifiers in Convex Quantum Resource Theories

Limitations of Classically Simulable Measurements for Quantum State Discrimination

In the realm of fault-tolerant quantum computing, stabilizer operations play a pivotal role, characterized by their remarkable efficiency in classical simulation. This efficiency sets them apart from nonstabilizer operations within the quantum computational theory. In this Letter, we investigate the limitations of classically simulable measurements in distinguishing quantum states. We demonstrate that any pure magic state and its orthogonal complement of odd prime dimensions cannot be unambiguously distinguished by stabilizer operations, regardless of how many copies of the states are supplied. We also reveal intrinsic similarities and distinctions between the quantum resource theories of magic states and entanglement in quantum state discrimination. The results emphasize the inherent limitations of classically simulable measurements and contribute to a deeper understanding of the quantum-classical boundary.

Every Quantum Helps: Operational Advantage of Quantum Resources beyond Convexity

Identifying what quantum-mechanical properties are useful to untap a superior performance in quantum technologies is a pivotal question. Quantum resource theories provide a unified framework to analyze and understand such properties, as successfully demonstrated for entanglement and coherence. While these are examples of convex resources, for which quantum advantages can always be identified, many physical resources are described by a nonconvex set of free states and their interpretation has so far remained elusive. Here we address the fundamental question of the usefulness of quantum resources without convexity assumption, by providing two operational interpretations of the generalized robustness measure in general resource theories. First, we characterize the generalized robustness in terms of a nonlinear resource witness and reveal that any state is more advantageous than a free one in some multicopy channel discrimination task. Next, we consider a scenario where a theory is characterized by multiple constraints and show that the generalized robustness coincides with the worst-case advantage in a single-copy channel discrimination setting. Based on these characterizations, we conclude that every quantum resource state shows a qualitative and quantitative advantage in discrimination problems in a general resource theory even without any specification on the structure of the free states.

Distributed Quantum Incompatibility

Incompatible, i.e., nonjointly measurable quantum measurements are a necessary resource for many information processing tasks. It is known that increasing the number of distinct measurements usually enhances the incompatibility of a measurement scheme. However, it is generally unclear how large this enhancement is and on what it depends. Here, we show that the incompatibility which is gained via additional measurements is upper and lower bounded by certain functions of the incompatibility of subsets of the available measurements. We prove the tightness of some of our bounds by providing explicit examples based on mutually unbiased bases. Finally, we discuss the consequences of our results for the nonlocality that can be gained by enlarging the number of measurements in a Bell experiment.

Simulability of High-Dimensional Quantum Measurements

We investigate the compression of quantum information with respect to a given set M of high-dimensional measurements. This leads to a notion of simulability, where we demand that the statistics obtained from M and an arbitrary quantum state ρ are recovered exactly by first compressing ρ into a lower-dimensional space, followed by some quantum measurements. A full quantum compression is possible, i.e., leaving only classical information, if and only if the set M is jointly measurable. Our notion of simulability can thus be seen as a quantification of measurement incompatibility in terms of dimension. After defining these concepts, we provide an illustrative example involving mutually unbiased bases, and develop a method based on semidefinite programming for constructing simulation models. In turn we analytically construct optimal simulation models for all projective measurements subjected to white noise or losses. Finally, we discuss how our approach connects with other concepts introduced in the context of quantum channels and quantum correlations.

Coherence as a Resource for Shor's Algorithm

Shor's factoring algorithm provides a superpolynomial speedup over all known classical factoring algorithms. Here, we address the question of which quantum properties fuel this advantage. We investigate a sequential variant of Shor's algorithm with a fixed overall structure and identify the role of coherence for this algorithm quantitatively. We analyze this protocol in the framework of dynamical resource theories, which capture the resource character of operations that can create and detect coherence. This allows us to derive a lower and an upper bound on the success probability of the protocol, which depend on rigorously defined measures of coherence as a dynamical resource. We compare these bounds with the classical limit of the protocol and conclude that within the fixed structure that we consider, coherence is the quantum resource that determines its performance by bounding the success probability from below and above. Therefore, we shine new light on the fundamental role of coherence in quantum computation.

Probabilistic Transformations of Quantum Resources

The difficulty in manipulating quantum resources deterministically often necessitates the use of probabilistic protocols, but the characterization of their capabilities and limitations has been lacking. We develop a general approach to this problem by introducing a new resource monotone that obeys a very strong type of monotonicity: it can rule out all transformations, probabilistic or deterministic, between states in any quantum resource theory. This allows us to place fundamental limitations on state transformations and restrict the advantages that probabilistic protocols can provide over deterministic ones, significantly strengthening previous findings and extending recent no-go theorems. We apply our results to obtain a substantial improvement in bounds for the errors and overheads of probabilistic distillation protocols, directly applicable to tasks such as entanglement or magic state distillation, and computable through convex optimization. In broad classes of resources, we strengthen our results to show that the monotone completely governs probabilistic transformations-it serves as a necessary and sufficient condition for state convertibility. This endows the monotone with a direct operational interpretation, as it can exactly quantify the highest fidelity achievable in resource distillation tasks by means of any probabilistic manipulation protocol.

Operational Characterization of Infinite-Dimensional Quantum Resources

Recently, various nonclassical properties of quantum states and channels have been characterized through an advantage they provide in quantum information tasks over their classical counterparts. Such advantage can be typically proven to be quantitative, in that larger amounts of quantum resources lead to better performance in the corresponding tasks. So far, these characterizations have been established only in the finite-dimensional setting, hence, leaving out central resources in continuous variable systems such as entanglement and nonclassicality of states as well as entanglement breaking and broadcasting channels. In this Letter, we present a fully general framework for resource quantification in infinite-dimensional systems. The framework is applicable to a wide range of resources with the only premises being that classical randomness cannot create a resource and that the resourceless objects form a closed set in an appropriate sense. As the latter may be hard to establish for the abstract topologies of continuous variable systems, we provide a relaxation of the condition with no reference to topology. This envelopes the aforementioned resources and various others, hence, giving them an interpretation as performance enhancement in so-called input-output games.

Fisher Information Universally Identifies Quantum Resources

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 without 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.

Catalytic Quantum Teleportation

In this work, we address fundamental limitations of quantum teleportation-the process of transferring quantum information using classical communication and preshared entanglement. We develop a new teleportation protocol based upon the idea of using ancillary entanglement catalytically, i.e., without depleting it. This protocol is then used to show that catalytic entanglement allows for a noiseless quantum channel to be simulated with a quality that could never be achieved using only entanglement from the shared state, even for catalysts with a small dimension. On the one hand, this allows for a more faithful transmission of quantum information using generic states and fixed amount of consumed entanglement. On the other hand, this shows, for the first time, that entanglement catalysis provides a genuine advantage in a generic quantum-information processing task. Finally, we show that similar ideas can be directly applied to study quantum catalysis for more general problems in quantum mechanics. As an application, we show that catalysts can activate so-called passive states, a concept that finds widespread application, e.g., in quantum thermodynamics.

Operational Quantification of Continuous-Variable Quantum Resources

The diverse range of resources which underlie the utility of quantum states in practical tasks motivates the development of universally applicable methods to measure and compare resources of different types. However, many of such approaches were hitherto limited to the finite-dimensional setting or were not connected with operational tasks. We overcome this by introducing a general method of quantifying resources for continuous-variable quantum systems based on the robustness measure, applicable to a plethora of physically relevant resources such as optical nonclassicality, entanglement, genuine non-Gaussianity, and coherence. We demonstrate in particular that the measure has a direct operational interpretation as the advantage enabled by a given state in a class of channel discrimination tasks. We show that the robustness constitutes a well-behaved, bona fide resource quantifier in any convex resource theory, contrary to a related negativity-based measure known as the standard robustness. Furthermore, we show the robustness to be directly observable-it can be computed as the expectation value of a single witness operator-and establish general methods for evaluating the measure. Explicitly applying our results to the relevant resources, we demonstrate the exact computability of the robustness for several classes of states.

All Quantum Resources Provide an Advantage in Exclusion Tasks

A key ingredient in quantum resource theories is a notion of measure. Such as a measure should have a number of fundamental properties, and desirably also a clear operational meaning. Here we show that a natural measure known as the convex weight, which quantifies the resource cost of a quantum device, has all the desired properties. In particular, the convex weight of any quantum resource corresponds exactly to the relative advantage it offers in an exclusion (or antidistinguishability) task. After presenting the general result, we show how the construction works for state assemblages, sets of measurements, and sets of transformations. Moreover, in order to bound the convex weight analytically, we give a complete characterization of the convex components and corresponding weights of such devices.