Searcharxiv⌕ Search

arXiv subjects

Ryuji Takagi

Publications and source records attributed to Ryuji Takagi.

At least 37 records · Page 2Linked to original sources

Universal tradeoff relations between resource cost and irreversibility of channels: General-resource Wigner-Araki-Yanase theorems and beyond

Quantum technologies offer exceptional -- sometimes almost magical -- speed and performance, yet every quantum process costs physical resources. Designing next-generation quantum devices, therefore, depends on solving the following question: which resources, and in what amount, are required to implement a desired quantum process? Casting the problem in the language of quantum resource theories, we prove a universal cost-irreversibility tradeoff: the lower the irreversibility of a quantum process, the greater the required resource cost for its realization. The trade-off law holds for a broad range of resources -- energy, magic, asymmetry, coherence, athermality, and others -- yielding lower bounds on resource cost of any quantum channel. Its broad scope positions this result as a foundation for deriving the following key results: (1) we show a universal relation between the energetic cost and the irreversibility for arbitrary channels, encompassing the energy-error tradeoff for any measurement or unitary gate; (2) we extend the energy-error tradeoff to free energy and work costs; (3) we extend the Wigner-Araki-Yanase theorem, which is the universal limitation on measurements under conservation laws, to a wide class of resource theories: the probability of failure in distinguishing resourceful states via a measurement is inversely proportional to its resource cost; (4) we prove that infinitely many resource-non-increasing operations in fact require an infinite implementation cost. These findings reveal a universal relationship between quantumness and irreversibility, providing a first step toward a general theory that explains when -- and how -- quantumness can suppress irreversibility.

quant-ph↗

Gibbs-preserving operations requiring infinite amount of quantum coherence

Gibbs-preserving operations have been studied as one of the standard free processes in quantum thermodynamics. Although they admit a simple mathematical structure, their operational significance has been unclear due to the potential hidden cost to implement them using an operatioanlly motivated class of operations, such as thermal operations. Here, we show that this hidden cost can be infinite -- we present a family of Gibbs-preserving operations that cannot be implemented by thermal operations aided by any finite amount of quantum coherence. Our result implies that there are uncountably many Gibbs-preserving operations that require unbounded thermodynamic resources to implement, raising a question about employing Gibbs-preserving operations as available thermodynamics processes. This finding is a consequence of the general lower bounds we provide for the coherence cost of approximately implementing a certain class of Gibbs-preserving operations with a desired accuracy. We find that our lower bound is almost tight, identifying a quantity -- related to the energy change caused by the channel to implement -- as a fundamental quantifier characterizing the coherence cost for the approximate implementation of Gibbs-preserving operations.

quant-ph↗

Bridging magic and non-Gaussian resources via Gottesman-Kitaev-Preskill encoding

Although the similarity between non-stabilizer states -- also known as magic states -- in discrete-variable systems and non-Gaussian states in continuous-variable systems has widely been recognized, the precise connections between these two notions have still been unclear. We establish a fundamental link between these two quantum resources via the Gottesman-Kitaev-Preskill (GKP) encoding. We show that the negativity of the continuous-variable Wigner function for an encoded GKP state coincides with a magic measure we introduce, which matches the negativity of the discrete Wigner function for odd dimensions. We also provide a continuous-variable representation of the stabilizer Rényi entropy -- a recent proposal for a magic measure for multi-qubit states. With this in hand, we give a classical simulation algorithm with runtime scaling with the resource contents, quantified by our magic measures. We also employ our results to prove that implementing a multi-qubit logical non-Clifford operation in the GKP code subspace requires a non-Gaussian operation even at the limit of perfect encoding, despite the fact that the ideal GKP states already come with a large amount of non-Gaussianity.

quant-ph↗

Quantum Dynamic Programming

We introduce a quantum extension of dynamic programming, a fundamental computational method that efficiently solves recursive problems using memory. Our innovation lies in showing how to coherently generate recursion step unitaries by using memorized intermediate quantum states. Quantum dynamic programming achieves an exponential reduction in circuit depth for a broad class of fixed-point quantum recursions, though this comes at the cost of increased circuit width. Interestingly, the trade-off becomes more favourable when the initial state is pure. By hybridizing our approach with a conventional memoryless one, we can flexibly balance circuit depth and width to optimize performance on quantum devices with fixed hardware constraints. Finally, we showcase applications of quantum dynamic programming to several quantum recursions, including a variant of Grover's search, quantum imaginary-time evolution, and a new protocol for obliviously preparing a quantum state in its Schmidt basis.

quant-ph↗

Black Box Work Extraction and Composite Hypothesis Testing

Work extraction is one of the most central processes in quantum thermodynamics. However, the prior analysis of optimal extractable work has been restricted to a limited operational scenario where complete information about the initial state is given. Here, we introduce a general framework of black box work extraction, which addresses the inaccessibility of information on the initial state. We show that the optimal extractable work in the black box setting is completely characterized by the performance of a composite hypothesis testing task, a fundamental problem in information theory. We employ this general relation to reduce the asymptotic black box work extraction to the quantum Stein's lemma in composite hypothesis testing, allowing us to provide their exact characterization in terms of the Helmholtz free energy. We also show a new quantum Stein's lemma motivated in this physical setting, where a composite hypothesis contains a certain correlation. Our work exhibits the importance of information about the initial state and gives a new interpretation of the quantities in the composite quantum hypothesis testing, encouraging the interplay between the physical settings and the information theory.

quant-ph↗

Universal trade-off structure between symmetry, irreversibility, and quantum coherence in quantum processes

Symmetry, irreversibility, and quantum coherence are foundational concepts in physics. Here, we present a universal tradeoff relation between these three concepts. This particularly reveals that (1) under a global symmetry, any attempt to change the local conserved charge causes inevitable irreversibility, and (2) such irreversibility can be mitigated by quantum coherence. Our tradeoff relation follows solely from the unitarity and global symmetry of the total dynamics, allowing for general applicability. For non-equilibrium physics, it relates the coherence cost and the entropy production -- representing thermodynamic irreversibility -- in arbitrary quantum processes. It also provides fundamental limitations on the capability of a number of quantum information processing tasks -- such as gate and measurement implementation and error correction -- that involve symmetry restrictions. Furthermore, it predicts how many bits of classical information thrown into a black hole become unreadable under energy conservation. Our tradeoff relation is based on quantum uncertainty relation, showcasing intimate connections between fundamental physical principles and ultimate operational capability of quantum processes.

quant-ph↗

Mixed-state additivity properties of magic monotones based on quantum relative entropies for single-qubit states and beyond

We prove that the stabilizer fidelity is multiplicative for the tensor product of an arbitrary number of single-qubit states. We also show that the relative entropy of magic becomes additive if all the single-qubit states but one belong to a symmetry axis of the stabilizer octahedron. We extend the latter results to include all the $α$-$z$ Rényi relative entropy of magic. This allows us to identify a continuous set of magic monotones that are additive for single-qubit states. We also show that all the monotones mentioned above are additive for several standard two and three-qubit states subject to depolarizing noise. Finally, we obtain closed-form expressions for several states and tighter lower bounds for the overhead of probabilistic one-shot magic state distillation.

quant-ph↗

When quantum memory is useful for dense coding

We discuss dense coding with $n$ copies of a specific preshared state between the sender and the receiver when the encoding operation is limited to the application of group representation. Typically, to act on multiple local copies of these preshared states, the receiver needs quantum memory, because in general the multiple copies will be generated sequentially. Depending on available encoding unitary operations, we investigate what preshared state offers an advantage of using quantum memory on the receiver's side.

quant-ph↗

Arbitrary Amplification of Quantum Coherence in Asymptotic and Catalytic Transformation

Quantum coherence is one of the fundamental aspects distinguishing classical and quantum theories. Coherence between different energy eigenstates is particularly important, as it serves as a valuable resource under the law of energy conservation. A fundamental question in this setting is how well one can prepare good coherent states from low coherent states and whether a given coherent state is convertible to another one. Here, we show that any low coherent state is convertible to any high coherent state arbitrarily well in two operational settings: asymptotic and catalytic transformations. For a variant of asymptotic coherence manipulation where one aims to prepare desired states in local subsystems, the rate of transformation becomes unbounded regardless of how weak the initial coherence is. In a non-asymptotic transformation with a catalyst, a helper state that locally remains in the original form after the transformation, we show that an arbitrary state can be obtained from any low coherent state. Applying this to the standard asymptotic setting, we find that a catalyst can increase the coherence distillation rate significantly -- from zero to infinite rate. We also prove that such anomalous transformation requires small but non-zero coherence in relevant modes, establishing the condition under which a sharp transition of the operational capability occurs. Our results provide a general characterization of the coherence transformability in these operational settings and showcase their peculiar properties compared to other common resource theories such as entanglement and quantum thermodynamics.

quant-ph↗

Virtual quantum resource distillation

Distillation, or purification, is central to the practical use of quantum resources in noisy settings often encountered in quantum communication and computation. Conventionally, distillation requires using some restricted 'free' operations to convert a noisy state into one that approximates a desired pure state. Here, we propose to relax this setting by only requiring the approximation of the measurement statistics of a target pure state, which allows for additional classical postprocessing of the measurement outcomes. We show that this extended scenario, which we call virtual resource distillation, provides considerable advantages over standard notions of distillation, allowing for the purification of noisy states from which no resources can be distilled conventionally. We show that general states can be virtually distilled with a cost (measurement overhead) that is inversely proportional to the amount of existing resource, and we develop methods to efficiently estimate such cost via convex and semidefinite programming, giving several computable bounds. We consider applications to coherence, entanglement, and magic distillation, and an explicit example in quantum teleportation (distributed quantum computing). This work opens a new avenue for investigating generalized ways to manipulate quantum resources.

quant-ph↗

Robustness- and weight-based resource measures without convexity restriction: Multicopy witness and operational advantage in static and dynamical quantum resource theories

Quantum resource theories (QRTs) provide a unified framework to analyze quantum properties as resources for achieving advantages in quantum information processing. The generalized robustness and the weight of resource have been gaining increasing attention as useful resource quantifiers. However, the existing analyses of these measures were restricted to the cases where convexity of the set of free states is assumed, and physically motivated resources do not necessarily satisfy this restriction. In this paper, we give characterizations of robustness- and weight-based measures in general QRTs without convexity restriction through two different yet related approaches. On the one hand, we characterize the generalized robustness and the weight of resource by introducing a nonlinear witness. We show a general construction of new witness observables that detect the resourcefulness of a given state from multiple copies of the state and, using these witnesses, we provide operational interpretations of the above resource measures even without any convexity assumption. On the other hand, we find that the generalized robustness and the weight of resource can also be interpreted as the worst-case maximum advantage in variants of channel-discrimination and channel-exclusion tasks, respectively, where the set of free states consists of several convex subsets corresponding to multiple restrictions. We further extend these results to QRTs for quantum channels and quantum instruments. These characterizations show that every quantum resource exhibits an advantage for the corresponding tasks, even in general QRTs without convexity assumption. Thus, we establish the usefulness of robustness-based and weight-based techniques beyond the conventional scope of convex QRTs, leading to a better understanding of the general structure of QRTs.

quant-ph↗

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.

quant-ph↗

Virtual quantum resource distillation: General framework and applications

We develop the general framework of virtual resource distillation -- an alternative distillation strategy proposed in [Phys. Rev. Lett. 132, 050203 (2024)], which extends conventional quantum resource distillation by integrating the power of classical postprocessing. The framework presented here is applicable not only to quantum states, but also dynamical quantum objects such as quantum channels and higher-order processes. We provide a general characterization and benchmarks for the performance of virtual resource distillation in the form of computable semidefinite programs as well as several operationally motivated quantities. We apply our general framework to various concrete settings of interest, including standard resource theories such as entanglement, coherence, and magic, as well as settings involving dynamical resources such as quantum memory, quantum communication, and non-Markovian dynamics. The framework of probabilistic distillation is also discussed.

quant-ph↗

Universal Sampling Lower Bounds for Quantum Error Mitigation

Numerous quantum error-mitigation protocols have been proposed, motivated by the critical need to suppress noise effects on intermediate-scale quantum devices. Yet, their general potential and limitations remain elusive. In particular, to understand the ultimate feasibility of quantum error mitigation, it is crucial to characterize the fundamental sampling cost -- how many times an arbitrary mitigation protocol must run a noisy quantum device. Here, we establish universal lower bounds on the sampling cost for quantum error mitigation to achieve the desired accuracy with high probability. Our bounds apply to general mitigation protocols, including the ones involving nonlinear postprocessing and those yet-to-be-discovered. The results imply that the sampling cost required for a wide class of protocols to mitigate errors must grow exponentially with the circuit depth for various noise models, revealing the fundamental obstacles in the scalability of useful noisy near-term quantum devices.

quant-ph↗

One-Shot Yield-Cost Relations in General Quantum Resource Theories

Although it is well known that the amount of resources that can be asymptotically distilled from a quantum state or channel does not exceed the resource cost needed to produce it, the corresponding relation in the non-asymptotic regime hitherto has not been well understood. Here, we establish a quantitative relation between the one-shot distillable resource yield and dilution cost in terms of transformation errors involved in these processes. Notably, our bound is applicable to quantum state and channel manipulation with respect to any type of quantum resource and any class of free transformations thereof, encompassing broad types of settings, including entanglement, quantum thermodynamics, and quantum communication. We also show that our techniques provide strong converse bounds relating the distillable resource and resource dilution cost in the asymptotic regime. Moreover, we introduce a class of channels that generalize twirling maps encountered in many resource theories, and by directly connecting it with resource quantification, we compute analytically several smoothed resource measures and improve our one-shot yield--cost bound in relevant theories. We use these operational insights to exactly evaluate important measures for various resource states in the resource theory of magic states.

quant-ph↗

Fundamental limits of quantum error mitigation

The inevitable accumulation of errors in near-future quantum devices represents a key obstacle in delivering practical quantum advantages, motivating the development of various quantum error-mitigation methods. Here, we derive fundamental bounds concerning how error-mitigation algorithms can reduce the computation error as a function of their sampling overhead. Our bounds place universal performance limits on a general error-mitigation protocol class. We use them to show (1) that the sampling overhead that ensures a certain computational accuracy for mitigating local depolarizing noise in layered circuits scales exponentially with the circuit depth for general error-mitigation protocols and (2) the optimality of probabilistic error cancellation among a wide class of strategies in mitigating the local dephasing noise on an arbitrary number of qubits. Our results provide a means to identify when a given quantum error-mitigation strategy is optimal and when there is potential room for improvement.

quant-ph↗

Correlation in Catalysts Enables Arbitrary Manipulation of Quantum Coherence

Quantum resource manipulation may include an ancillary state called a catalyst, which aids the transformation while restoring its original form at the end, and characterizing the enhancement enabled by catalysts is essential to reveal the ultimate manipulability of the precious resource quantity of interest. Here, we show that allowing correlation among multiple catalysts can offer arbitrary power in the manipulation of quantum coherence. We prove that any state transformation can be accomplished with an arbitrarily small error by covariant operations with catalysts that may create a correlation within them while keeping their marginal states intact. This presents a new type of embezzlement-like phenomenon, in which the resource embezzlement is attributed to the correlation generated among multiple catalysts. We extend our analysis to general resource theories and provide conditions for feasible transformations assisted by catalysts that involve correlation, putting a severe restriction on other quantum resources for showing this anomalous enhancement, as well as characterizing achievable transformations in relation to their asymptotic state transformations. Our results provide not only a general overview of the power of correlation in catalysts but also a step toward the complete characterization of the resource transformability in quantum thermodynamics with correlated catalysts.

quant-ph↗

Enhancing quantum models of stochastic processes with error mitigation

Error mitigation has been one of the recently sought after methods to reduce the effects of noise when computation is performed on a noisy near-term quantum computer. Interest in simulating stochastic processes with quantum models gained popularity after being proven to require less memory than their classical counterparts. With previous work on quantum models focusing primarily on further compressing memory, this work branches out into the experimental scene; we aim to bridge the gap between theoretical quantum models and practical use with the inclusion of error mitigation methods. It is observed that error mitigation is successful in improving the resultant expectation values. While our results indicate that error mitigation work, we show that its methodology is ultimately constrained by hardware limitations in these quantum computers.

quant-ph↗