We may soon see agencies offering public access to quantum communication networks. In such networks it may be a feature that certain resources are available only to priority users or at a higher user fee, as governed by a protective agency overseeing the communication in the network. If the agency wants to restrict the general users to communicate by transmitting states that we categorize as free states of a quantum resource theory (QRT), it may employ resource-destroying channels that do not affect the free states. Such channels, however, only exist for the simplest of QRTs, putting fundamental limitations on how quantum resources can be regulated. In this work, we go beyond the present limitation by devising a nonlinear censorship protocol which makes use of classical information about the transmitted state. We study the requirement disabling malicious users from breaking the censorship. The protocol can establish an unbreakable censorship of imaginarity and entanglement, while no such censorship can be made for quantum discord and Bell nonlocality.
We may soon see agencies offering public access to quantum communication networks. In such networks it may be a feature that certain resources are available only to priority users or at a higher user fee, as governed by a protective agency overseeing the communication in the network. If the agency wants to restrict the general users to communicate by transmitting states that we categorize as free states of a quantum resource theory (QRT), it may employ resource-destroying channels that do not affect the free states. Such channels, however, only exist for the simplest of QRTs, putting fundamental limitations on how quantum resources can be regulated. In this work, we go beyond the present limitation by devising a nonlinear censorship protocol which makes use of classical information about the transmitted state. We study the requirement disabling malicious users from breaking the censorship. The protocol can establish an unbreakable censorship of imaginarity and entanglement, while no such censorship can be made for quantum discord and Bell nonlocality.
In quantum censorship, an agency oversees quantum communication in a public-domain network. The agency restricts the users communication to the free states of a quantum resource theory (QRT). Despite quantum correlations being fragile, any realistic censorship leaves behind some quantumness, raising concerns that censorship may be overcome through revival or distillation of quantum resources. Here, we introduce censorship protocols that do not require a perfect erasure of a quantum resource, but rather deem censorship successful if users are unable to restore the original quantum state using free operations. We investigate under which conditions censorship is secure, and when it might fail. Moreover, we address the issue of account sharing in quantum networks, wherein independent parties assist in transmitting quantum resources to censored users. This connects resource censorship to timely topics such as quantum catalysis and resource-assisted communication. Censorship protocols offer a novel perspective on quantum network security, that differs fundamentally from existing approaches such as quantum and post-quantum cryptography.
A protocol for regulating the distribution of quantum information between multiple parties is put forward. To prohibit the unrestricted distribution of quantum-resource states in a public quantum network, agents can apply a resource-destroying map to each sender's channel. Since resource-destroying maps only exist for affine quantum resource theories, censorship of a nonaffine resource theory is established on an operationally motivated subspace of free states. This is achieved by using what we name a resource-censoring map. The protocol is applied to censoring coherence, reference frames, and entanglement. Because of the local nature of the censorship protocol, it is, in principle, possible for collaborating parties to bypass censorship. Thus, we additionally derive necessary and sufficient conditions under which the censorship protocol is unbreakable.
In this work (multipartite) entanglement, discord, and coherence are unified as different aspects of a single underlying resource theory defined through simple and operationally meaningful elemental operations. This is achieved by revisiting the resource theory defining entanglement, local operations, and classical communication (LOCC), placing the focus on the underlying quantum nature of the communication channels. Taking the natural elemental operations in the resulting generalization of LOCC yields a resource theory that singles out coherence in the wire connecting the spatially separated systems as an operationally useful resource. The approach naturally allows us to consider a reduced setting as well, namely, the one with only the wire connected to a single quantum system, which leads to discordlike resources. The general form of free operations in this latter setting is derived and presented as a closed form. We discuss in what sense the present approach defines a resource theory of quantum discord and in which situations such an interpretation is sound—and why in general discord is not a resource. This unified and operationally meaningful approach makes transparent many features of entanglement that in LOCC might seem surprising, such as the possibility to use a particle to entangle two parties, without it ever being entangled with either of them, or that there exist different forms of multipartite entanglement.
It was recently realized that many quantum phenomena, such as entanglement or non-locality, can be expressed in the framework of quantum resource theories (QRTs) as resources that can be expended to perform tasks. This approach has revolutionized our understanding of these phenomena and has provided a framework to rigorously characterize them, quantify them, and study the question of convertibility of resources within them. Moreover, this framework has enabled the discovery of similar structures common to many QRTs, and thus offered a better and deeper understanding of the phenomena they describe. Most of the research that has been done so far in the area of QRTs has been concerned with resource theories of states, that is, where the objects in the QRT are static resources that are divided among free and resource states. Free operations, defined as quantum channels that do not generate resources, are used to transform these states. However, this concept can be generalized to include dynamical resources, or non-free operations. We call the resource theories that arise from this, QRTs of quantum processes. This thesis introduces different QRTs of quantum processes that we call QRTs of non-projectiveness. More precisely, these are QRTs where projective measurements are considered free. There are different resource theories that arise based on exactly which additional operations are allowed and whether quantum measurements are described with a classical output, a quantum output, or both. This research looks into four such QRTs of non-projectiveness.
Bell's theorem shows that entangled quantum particles can exhibit correlations that classical particles cannot reproduce without an additional nonlocal resource, such as communication. In this sense, quantum particles are fundamentally more nonlocal than classical ones, and entanglement becomes unavoidable in physics. Here we prove the analogous result within quantum theory itself: indistinguishable fermions transmitted through a quantum network can generate correlations that distinguishable particles or indistinguishable bosons cannot reproduce without additional communication. In the same sense, fermions are fundamentally more nonlocal than bosons or distinguishable particles, motivating fermionic anticommutation and indistinguishability as unavoidable operational resources. Our result further implies that fermions can strictly surpass all qubit-based protocols for certain distributed computing tasks, demonstrating that a complete understanding of information processing requires going beyond qubits to fermionic information carriers - febits.
Due to its complexity, resource allocation in complex communication networks has been always designed with great deal of approximations and restrictions. With the availability of quantum computing, quantum optimization and quantum search algorithms, we are able to overcome these limitations significantly and come up with more precise and efficient “quantum era” algorithms. The main objective of this paper is to provide the future network designers with a new optimization framework for resource (capacity and secrete key rate) allocation in quantum networks. The analysis is general to include: the classical capacityC, for transmitting classical information; the quantum capacityQ, for reliably transmitting intact quantum states; the two-way classical-assisted quantum capacityQ2, for transmitting quantum states with the help of a two-way classical side channel; and the entanglement-assisted classical capacityCE, which we define as the classical capacity of a quantum channel enabled by prior shared entanglement between two nodes. Once the optimization framework is introduced the rest of the paper discusses the optimization constraints, by surveying some examples of the relevant work on achievable network resources (capacity and secrete key rate) and relaxation of the optimization constraints by increasing these parameters using the quantum coding schemes. These constraints are an integral part of the optimization algorithms and full understanding of their nature and limits is essential for system optimization. The achievable secret key rates/capacity of quantum channels are limited, so our optimization framework for resource allocation enables maximization of the overall resources allocated to all users, or maximization of the number of users accessing the network, or minimization of the number of hopes on the routes or maximization of remaining resources in the most critical node in the network. The optimization problems have combinatorial form, and the most efficient execution of these algorithms can be achieved by using quantum search algorithms like Grover’s algorithm or quantum approximative optimization algorithms (QAOA) which are extensively discussed in the paper.Regarding the scope of the technology survey in Section VIII we summarize the coverage of our targeted survey and the coverage of other relevant works.