Related papers: Parametrization of Quantum States and Channels
In the current noisy intermediate-scale quantum (NISQ) era, quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers. In quantum machine learning, the gates of a quantum circuit are parametrized,…
For many-particle systems, quantum information in base n can be defined by partitioning the set of states according to the outcomes of n-ary (joint) observables. Thereby, k particles can carry k nits. With regards to the randomness of…
Non-unitary protocols are already at the base of many hybrid quantum computing applications, especially in the noisy intermediate-scale quantum (NISQ) era where quantum errors typically affect the unitary evolution. However, while the…
We introduce a new "positive formalism" for encoding quantum theories in the general boundary formulation, somewhat analogous to the mixed state formalism of the standard formulation. This makes the probability interpretation more natural…
In this thesis I present a short review of ideas in quantum information theory. The first chapter contains introductory material, sketching the central ideas of probability and information theory. Quantum mechanics is presented at the level…
This work shows an approach to reduce the dimensionality of matrix representations of quantum channels. It is achieved by finding a base of the cone of positive semidefinite matrices which represent quantum channels. Next, this is…
Quantum applications transmit and receive data through quantum and classical communication channels. Channel capacity, the distance and the photon path between transmitting and receiving parties and the speed of the computation links play…
Particle statistics is a fundamental part of quantum physics, and yet its role and use in the context of quantum information have been poorly explored so far. After briefly introducing particle statistics and the Symmetrization Postulate, I…
Concomitant with the rapid development of quantum technologies, challenging demands arise concerning the certification and characterization of devices. The promises of the field can only be achieved if stringent levels of precision of…
Using Grothendieck approach to the tensor product of locally convex spaces we review a characterization of positive maps as well as Belavkin-Ohya characterization of PPT states. Moreover, within this scheme, \textit{ a generalization of the…
I discuss the role that relativistic considerations play in quantum information processing. First I describe how the causality requirements limit possible multi-partite measurements. Then the Lorentz transformations of quantum states are…
Tomograms introduced for the description of quantum states in terms of probability distributions are shown to be related to a standard star-product quantization with appropriate kernels. Examples of symplectic tomograms and spin tomograms…
The present Thesis covers the subject of the characterization of entangled states by recourse to entropic measures, as well as the description of entanglement related to several issues in quantum mechanics, such as the speed of a quantum…
The multi-access channels in quantum information theory are considered. Classical messages from independent sources, which are represented as some quantum states, are transported by a channel to one address. The messages can interact with…
This article reviews the extraordinary features of quantum information predicted by the quantum formalism, which, combined with the development of modern quantum technologies, have opened new horizons in quantum physics that can potentially…
One of the most challenging open problems in quantum information theory is to clarify and quantify how entanglement behaves when part of an entangled state is sent through a quantum channel. Of central importance in the description of a…
A method is given by which the descriptive content of quantum state information can be encoded into subparticle coordinates. This method is consistent with the MA-model solution to the general grand unification problem. Subparticle…
State preparation is a necessary component of many quantum algorithms. In this work, we combine a method for efficiently representing smooth differentiable probability distributions using matrix product states with recently discovered…
A parametrization of density operators for bipartite quantum systems is proposed. It is based on the particular parametrization of the unitary group found recently by Jarlskog. It is expected that this parametrization will find interesting…
In this paper we propose a general method to quantify how "quantum" a set of quantum states is. The idea is to gauge the quantumness of the set by the worst-case difficulty of transmitting the states through a purely classical communication…