The aim of this thesis is to advance the theory behind quantum information processing tasks, by deriving fundamental limits on bipartite quantum interactions and dynamics. A bipartite quantum interaction corresponds to an underlying Hamiltonian that governs the physical transformation of a two-body open quantum system. Under such an interaction, the physical transformation of a bipartite quantum system is considered in the presence of a bath, which may be inaccessible to an observer. The goal is to determine entangling abilities of such arbitrary bipartite quantum interactions. Doing so provides fundamental limitations on information processing tasks, including entanglement distillation and secret key generation, over a repeaterless bipartite quantum network. We also discuss limitations on the entropy change and its rate for dynamics of an open quantum system weakly interacting with the bath. We introduce a measure of non-unitarity to characterize the deviation of a doubly stochastic quantum process from a noiseless evolution. Next, we introduce information processing tasks for secure read-out of digital information encoded in read-only memory devices against adversaries of varying capabilities. The task of reading a memory device involves the identification of an interaction process between probe system, which is in known state, and the memory device. Essentially, the information is stored in the choice of channels, which are noisy quantum processes in general and are chosen from a publicly known set. Hence, it becomes pertinent to securely read memory devices against scrutiny of an adversary. In particular, for a secure read-out task called private reading when a reader is under surveillance of a passive eavesdropper, we have determined upper bounds on its performance. We do so by leveraging the fact that private reading of digital information stored in a memory device can be understood as secret key agreement via a specific kind of bipartite quantum interaction.
The aim of this thesis is to advance the theory behind quantum information processing tasks, by deriving fundamental limits on bipartite quantum interactions and dynamics. A bipartite quantum interaction corresponds to an underlying Hamiltonian that governs the physical transformation of a two-body open quantum system. Under such an interaction, the physical transformation of a bipartite quantum system is considered in the presence of a bath, which may be inaccessible to an observer. The goal is to determine entangling abilities of such arbitrary bipartite quantum interactions. Doing so provides fundamental limitations on information processing tasks, including entanglement distillation and secret key generation, over a repeaterless bipartite quantum network. We also discuss limitations on the entropy change and its rate for dynamics of an open quantum system weakly interacting with the bath. We introduce a measure of non-unitarity to characterize the deviation of a doubly stochastic quantum process from a noiseless evolution. Next, we introduce information processing tasks for secure read-out of digital information encoded in read-only memory devices against adversaries of varying capabilities. The task of reading a memory device involves the identification of an interaction process between probe system, which is in known state, and the memory device. Essentially, the information is stored in the choice of channels, which are noisy quantum processes in general and are chosen from a publicly known set. Hence, it becomes pertinent to securely read memory devices against scrutiny of an adversary. In particular, for a secure read-out task called private reading when a reader is under surveillance of a passive eavesdropper, we have determined upper bounds on its performance. We do so by leveraging the fact that private reading of digital information stored in a memory device can be understood as secret key agreement via a specific kind of bipartite quantum interaction.
The aim of this thesis is to advance the theory behind quantum information processing tasks, by deriving fundamental limits on bipartite quantum interactions and dynamics, which corresponds to an underlying Hamiltonian that governs the physical transformation of a two-body open quantum system. The goal is to determine entangling abilities of such arbitrary bipartite quantum interactions. Doing so provides fundamental limitations on information processing tasks, including entanglement distillation and secret key generation, over a bipartite quantum network. We also discuss limitations on the entropy change and its rate for dynamics of an open quantum system weakly interacting with the bath. We introduce a measure of non-unitarity to characterize the deviation of a doubly stochastic quantum process from a noiseless evolution. Next, we introduce information processing tasks for secure read-out of digital information encoded in read-only memory devices against adversaries of varying capabilities. The task of reading a memory device involves the identification of an interaction process between probe system, which is in known state, and the memory device. Essentially, the information is stored in the choice of channels, which are noisy quantum processes in general and are chosen from a publicly known set. Hence, it becomes pertinent to securely read memory devices against scrutiny of an adversary. In particular, for a secure read-out task called private reading when a reader is under surveillance of a passive eavesdropper, we have determined upper bounds on its performance. We do so by leveraging the fact that private reading of digital information stored in a memory device can be understood as secret key agreement via a specific kind of bipartite quantum interaction.
A bipartite quantum interaction corresponds to the most general quantum interaction that can occur between two quantum systems in the presence of a bath. In this work, we determine bounds on the capacities of bipartite interactions for entanglement generation and secret-key agreement between two quantum systems. Our upper bound on the entanglement generation capacity of a bipartite quantum interaction is given by a quantity called the bidirectional max-Rains information. Our upper bound on the secret-key-agreement capacity of a bipartite quantum interaction is given by a related quantity called the bidirectional max-relative entropy of entanglement. We also derive tighter upper bounds on the capacities of bipartite interactions obeying certain symmetries. Observing that reading of a memory device is a particular kind of bipartite quantum interaction, we leverage our bounds from the bidirectional setting to deliver bounds on the capacity of a task that we introduce, called private reading of a wiretap memory cell. Given a set of point-to-point quantum wiretap channels, the goal of private reading is for an encoder to form codewords from these channels, in order to establish a secret key with a party who controls one input and one output of the channels, while a passive eavesdropper has access to one output of the channels. We derive both lower and upper bounds on the private reading capacities of a wiretap memory cell. We then extend these results to determine achievable rates for the generation of entanglement between two distant parties who have coherent access to a controlled point-to-point channel, which is a particular kind of bipartite interaction.
Bipartite quantum interactions have applications in a number of different areas of quantum physics, reaching from fundamental areas such as quantum thermodynamics and the theory of quantum measurements to other applications such as quantum computers, quantum key distribution, and other information processing protocols. A particular aspect of the study of bipartite interactions is concerned with the entanglement that can be created from such interactions. In this Letter, we present our work on two basic building blocks of bipartite quantum protocols, namely, the generation of maximally entangled states and secret key via bipartite quantum interactions. In particular, we provide a nontrivial, efficiently computable upper bound on the positive-partial-transpose-assisted quantum capacity of a bipartite quantum interaction. In addition, we provide an upper bound on the secret-key-agreement capacity of a bipartite quantum interaction assisted by local operations and classical communication. As an application, we introduce a cryptographic protocol for the readout of a digital memory device that is secure against a passive eavesdropper.
The traditional perspective in quantum resource theories concerns how to use free operations to convert one resourceful quantum state to another one. For example, a fundamental and well known question in entanglement theory is to determine the distillable entanglement of a bipartite state, which is equal to the maximum rate at which fresh Bell states can be distilled from many copies of a given bipartite state by employing local operations and classical communication for free. It is the aim of this paper to take this kind of question to the next level, with the main question being: What is the best way of using free channels to convert one resourceful quantum channel to another? Here we focus on the the resource theory of entanglement for bipartite channels and establish several fundamental tasks and results regarding it. In particular, we establish bounds on several pertinent information processing tasks in channel entanglement theory, and we define several entanglement measures for bipartite channels, including the logarithmic negativity and the κ-entanglement. We also show that the max-Rains information of [Bäuml et al., Physical Review Letters, 121, 250504 (2018)] has a divergence interpretation, which is helpful for simplifying the results of this earlier work.
The intersection of quantum information processing and machine learning has recently at-tracted considerable interest within the physics and artificial intelligence communities. From a physical perspective, quantum computing offers fundamentally new modes of information processing, enabled by superposition, interference, and entanglement, which can lead to ad-vantages in computational speed and resource efficiency over classical approaches. These developments have motivated the exploration of machine learning paradigms that lever-age quantum dynamics as a computational resource. In parallel, reservoir computing—a non–von Neumann and neuromorphic computing framework—has gained attention due to its reliance on high-dimensional dynamical systems, in-memory computation, and low en-ergy consumption. Quantum reservoir computing extends this paradigm by exploiting the intrinsic dynamics of quantum many-body systems, such as spin networks, to process tem-poral information. Despite growing interest in quantum reservoir architectures, the role of genuinely quantum resources, in particular entanglement, in determining their information-processing capabilities remains incompletely understood. In this thesis, we study a distributed spin-network reservoir in which two independent time series are injected into separate qubits. Using short-term memory capacity as an opera-tional measure, we analyze how information introduced at distinct sites propagates through the network and how different entanglement structures contribute to storing and combining past inputs. Focusing on bilinear memory tasks, which require reconstructing the product of the two inputs at various delays, we probe temporal memory. Due to the computational cost associated with simulating open quantum many-body dynamics, the present study focuses on a minimal spin-network architecture consisting of four qubits, with two qubits serving as input nodes that receive independent time series. Even for such moderate system sizes, the numerical integration of the open-system dynamics are computationally demanding. Nevertheless, this minimal setting already captures the essential mechanisms of distributed information processing in quantum reservoirs. By computing the logarithmic negativity across different bipartitions of the reservoir, we investigate how memory performance relates to the underlying entanglement structure. We find that the short-term memory capacity is maximized at relatively weak coupling strengths, where entanglement is present but remains moderate. Among the various bipar-titions, the entanglement between the two input qubits consistently plays the most promi-nent role in learning performance. In this optimal regime, the reservoir exhibits long-lived memory, while a characteristic reduction in performance at zero delay, observed across all frequencies, reflects the finite time required for information to propagate through the sys-tem. Taken together, these results indicate that effective learning in distributed quantum reservoir computing is enabled by moderate, well-structured entanglement, rather than by maximal correlations.
This thesis is devoted to the study of coherent storage of quantum information as well as its potential applications.Quantum memories are crucial to harnessing the potential of quantum physics for information processing tasks.They are required for almost all quantum computation proposals.However, despite the large arsenal of theoretical techniques and proposals dedicated to their implementation, the realization of long-lived quantum memories remains an elusive task.Encoding information in quantum states associated to many-body topological phases of matter and protecting them by means of a static Hamiltonian is one of the leading proposals to achieve quantum memories.While many genuine and well publicized virtues have been demonstrated for this approach, equally real limitations were widely disregarded.In the first two projects of this thesis, we study limitations of passive Hamiltonian protection of quantum information under two different noise models.Chapter 2 deals with arbitrary passive Hamiltonian protection for a many body system under the effect of local depolarizing noise.It is shown that for both constant and time dependent Hamiltonians, the optimal enhancement over the natural single-particle memory time is logarithmic in the number of particles composing the system.The main argument involves a monotonic increase of entropy against which a Hamiltonian can provide little protection.Chapter 3 considers the recoverability of quantum information when it is encoded in a many-body state and evolved under a Hamiltonian composed of known geometrically local interactions and a weak yet unknown Hamiltonian perturbation.We obtain some generic criteria which must be fulfilled by the encoding of information.For specific proposals of protecting Hamiltonian and encodings such as Kitaev's toric code and a subsystem code proposed by Bacon, we additionally provide example perturbations capable of destroying the memory which imply upper bounds for the provable memory times.vi