10 April 2019 in Physical Review Letters
One of the central problems in the study of quantum resource theories is to provide a given resource with an operational meaning, characterizing physical tasks in which the resource can give an explicit advantage over all resourceless states. We show that this can always be accomplished for all convex resource theories. We establish in particular that any resource state enables an advantage in a channel discrimination task, allowing for a strictly greater success probability than any state without the given resource. Furthermore, we find that the generalized robustness measure serves as an exact quantifier for the maximal advantage enabled by the given resource state in a class of subchannel discrimination problems, providing a universal operational interpretation to this fundamental resource quantifier. We also consider a wider range of subchannel discrimination tasks and show that the generalized robustness still serves as the operational advantage quantifier for several well-known theories such as entanglement, coherence, and magic.
9 July 2019 in Physical Review Letters
A fundamental approach for the characterization and quantification of all kinds of resources is to study the conversion between different resource objects under certain constraints. Here we analyze, from a resource-nonspecific standpoint, the optimal efficiency of resource formation and distillation tasks with only a single copy of the given quantum state, thereby establishing a unified framework of one-shot quantum resource manipulation. We find general bounds on the optimal rates characterized by resource measures based on the smooth max- or min-relative entropies and hypothesis testing relative entropy, as well as the free robustness measure, providing them with general operational meanings in terms of optimal state conversion. Our results encompass a wide class of resource theories via the theory-dependent coefficients we introduce, and the discussions are solidified by important examples, such as entanglement, coherence, superposition, magic states, asymmetry, and thermal nonequilibrium.
8 June 2020 in Physical Review A
We study the one-shot distillation of general quantum resources, providing a unified quantitative description of the maximal fidelity achievable in this task, and revealing similarities shared by broad classes of resources. We establish fundamental quantitative and qualitative limitations on resource distillation applicable to all convex resource theories. We show that every convex quantum resource theory admits a meaningful notion of a pure maximally resourceful state, which maximizes several monotones of operational relevance and finds use in distillation. We endow the generalized robustness measure with an operational meaning as an exact quantifier of performance in distilling such maximal states in many classes of resources, including bi- and multipartite entanglement, multilevel coherence, as well as the whole family of affine resource theories, which encompasses important examples such as asymmetry, coherence, and thermodynamics.
26 February 2020 in Physical Review A
We propose a general method to operationally quantify the “resourcefulness” of quantum channels via channel discrimination, an important information processing task. A main result is that the maximum success probability of distinguishing a given channel from the set of free channels by free probe states is exactly characterized by the resource generating power, i.e., the maximum amount of resource produced by the action of the channel, given by the trace distance to the set of free states. We apply this framework to the resource theory of quantum coherence, as an informative example. The general results can also be easily applied to other resource theories such as entanglement, magic states, and asymmetry.
8 January 2024 in npj Quantum Information
Classical shadows provide a noise-resilient and sample-efficient method for learning quantum system properties, relying on a user-specified unitary ensemble. What is the weakest assumption on this ensemble that can still yield meaningful results? To address this, we focus on Pauli-invariant unitary ensembles—those invariant under multiplication by Pauli operators. For these ensembles, we present explicit formulas for the reconstruction map and sample complexity bounds and extend our results to the case when noise impacts the protocol implementation. Two applications are explored: one for locally scrambled unitary ensembles, where we present formulas for the reconstruction map and sample complexity bounds that circumvent the need to solve an exponential-sized linear system, and another for the classical shadows of quantum channels. Our results establish a unified framework for classical shadows with Pauli-invariant unitary ensembles, applicable to both noisy and noiseless scenarios for states and channels and primed for implementation on near-term quantum devices.
17 June 2022 in Physical Review A
In theoretical machine learning, the statistical complexity is a notion that measures the richness of a hypothesis space. In this work, we apply a particular measure of statistical complexity, namely, the Rademacher complexity, to the quantum circuit model in quantum computation and study how the statistical complexity depends on various quantum circuit parameters. In particular, we investigate the dependence of the statistical complexity on the resources, depth, width, and the number of input and output registers of a quantum circuit. To study how the statistical complexity scales with resources in the circuit, we introduce a magic resource measure based on the group norm, which quantifies the amount of magic resource in the quantum channels associated with the circuit. These dependencies are investigated in the following two settings: (i) where the entire quantum circuit is treated as a single quantum channel, and (ii) where each layer of the quantum circuit is treated as a separate quantum channel. The bounds we obtain can be used to constrain the capacity of quantum neural networks in terms of their depths and widths as well as the resources in the network.