Erasing, Converting, and Communicating: The Power of Resource-Nongenerating Operations

• URL: http://arxiv.org/abs/2509.12604v1
• Date: Tue, 16 Sep 2025 03:00:33 GMT
• Title: Erasing, Converting, and Communicating: The Power of Resource-Nongenerating Operations
• Authors: Xian Shi,
• Abstract summary: We investigate resource nongenerating operations (RNOs) in both static and dynamical quantum resource theories.<n>Our results clarify the key roles of RNOs in quantum information processing tasks.
• Score: 4.704514200771222
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: We investigate resource nongenerating operations (RNOs) in both static and dynamical quantum resource theories. For the static scenarios, we derive a sufficient condition for state transformations under RNOs. Then we construct a dynamical resource theory where RNOs constitute the set of free operations, and we propose an axiomatic approach to quantify quantum channels. We further analyze the erasure of the dynamical resources. As applications, we establish bounds on the asymptotic cost of states under RNOs in a generic convex resource theory and obtain capacity bounds for communication tasks assisted by dynamical coherence. Our results clarify the key roles of RNOs in quantum information processing tasks.

Related papers

• Quantum Resource Management in the NISQ Era: Implications and Perspectives from Software Engineering [44.99833362998488]
  We analyze the role of resources in current uses of NISQ devices, identifying their relevance and implications for quantum software engineering.<n>We aim to strengthen the field of Quantum Resource Estimation (QRE) and move toward scalable and reliable quantum software development.
  arXiv  Detail & Related papers  (2025-08-06T19:15:57Z)
• Joint Admission Control and Resource Allocation of Virtual Network Embedding via Hierarchical Deep Reinforcement Learning [69.00997996453842]
  We propose a deep Reinforcement Learning approach to learn a joint Admission Control and Resource Allocation policy for virtual network embedding. We show that HRL-ACRA outperforms state-of-the-art baselines in terms of both the acceptance ratio and long-term average revenue.
  arXiv  Detail & Related papers  (2024-06-25T07:42:30Z)
• Generative AI-enabled Quantum Computing Networks and Intelligent Resource Allocation [80.78352800340032]
  Quantum computing networks execute large-scale generative AI computation tasks and advanced quantum algorithms. efficient resource allocation in quantum computing networks is a critical challenge due to qubit variability and network complexity. We introduce state-of-the-art reinforcement learning (RL) algorithms, from generative learning to quantum machine learning for optimal quantum resource allocation.
  arXiv  Detail & Related papers  (2024-01-13T17:16:38Z)
• Quantum Dynamical Resource Theory under Resource Non-increasing Framework [0.0]
  We show that maximally incoherent operations (MIO) and incoherent operations (IO) in the static coherence resource theory are free in the sense of dynamical coherence. We also present convenient measures and give the analytic calculation for the amplitude damping channel.
  arXiv  Detail & Related papers  (2022-03-13T04:19:01Z)
• Entropic and operational characterizations of dynamic quantum resources [3.2074558838636262]
  We provide new methods for characterizing general closed and convex quantum resource theories. We propose a resource-theoretic generalization of the quantum conditional min-entropy. We show that every well-defined robustness-based measure of a channel can be interpreted as an operational advantage of the channel over free channels in a communication task.
  arXiv  Detail & Related papers  (2021-12-13T18:58:36Z)
• Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding [58.720142291102135]
  We define a resource measure for magic, the sought-after property in most fault-tolerant quantum computers. Our formulation is based on bosonic codes, well-studied tools in continuous-variable quantum computation.
  arXiv  Detail & Related papers  (2021-09-27T12:56:01Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Dynamical Resources [7.734726150561088]
  Quantum channels play a key role in the manipulation of quantum resources. We show how to manipulate dynamical resources with free superchannels. These results serve as the framework for the study of concrete examples of theories of dynamical resources.
  arXiv  Detail & Related papers  (2020-12-31T19:08:09Z)
• One-shot dynamical resource theory [16.046979670252814]
  We consider tasks of one-shot resource distillation and dilution with a single copy of the resource. For any target of unitary channel or pure state preparation channel, we establish a universal strategy to determine upper and lower bounds on rates that convert between any given resource and the target. Our results are applicable to general dynamical resource theories with potential applications in quantum communication, fault-tolerant quantum computing, and quantum thermodynamics.
  arXiv  Detail & Related papers  (2020-12-04T18:57:42Z)
• One-Shot Manipulation of Dynamical Quantum Resources [0.0]
  We develop a unified framework to characterize one-shot transformations of dynamical quantum resources in terms of resource quantifiers. Our framework encompasses all dynamical resources represented as quantum channels. We show that our conditions become necessary and sufficient for broad classes of important theories.
  arXiv  Detail & Related papers  (2020-12-03T19:09:14Z)
• Coordinated Online Learning for Multi-Agent Systems with Coupled Constraints and Perturbed Utility Observations [91.02019381927236]
  We introduce a novel method to steer the agents toward a stable population state, fulfilling the given resource constraints. The proposed method is a decentralized resource pricing method based on the resource loads resulting from the augmentation of the game's Lagrangian.
  arXiv  Detail & Related papers  (2020-10-21T10:11:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.