Related papers: Generating random quantum channels
Quantum circuits that generate coherent superpositions of stochastic processes are key to many downstream quantum-accelerated tasks, such as risk analysis, importance sampling, and DNA sequencing. However, traditional methods for designing…
Random numbers are important in many activities, including communication, encryption, science, gambling, finance, and decision-making. There is a strong demand for a hardware random number generator that could support cryptographic…
In this paper, we consider the convex set of $d$ dimensional unital quantum channels. In particular, we parametrise a family of maps and through this parametrisation we provide a partial characterisation of the set of unital quantum maps…
Let G be a finite subgroup of unitary matrices acting on the space of $N$-qubits. We associate with G a uniform quantum channel QU from the space on $N$-qubits to itself. We give a quantum algorithm to approximate this channel by…
Let $K$ be a convex subset of the state space of a finite dimensional $C^*$-algebra. We study the properties of channels on $K$, which are defined as affine maps from $K$ into the state space of another algebra, extending to completely…
We determine the optimal rates of universal quantum codes for entanglement transmission and generation under channel uncertainty. In the simplest scenario the sender and receiver are provided merely with the information that the channel…
We consider the problem of universal decoding for arbitrary unknown channels in the random coding regime. For a given random coding distribution and a given class of metric decoders, we propose a generic universal decoder whose average…
A controlled quantum dense coding scheme is investigated with a four-particle non-maximal quantum channel. The amount of classical information is shown to be capable of being controlled by the controllers through adjustments of the local…
We show that quantum-to-classical channels, i.e., quantum measurements, can be asymptotically simulated by an amount of classical communication equal to the quantum mutual information of the measurement, if sufficient shared randomness is…
In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is,…
In this paper, we introduce the framework for quantifying the imaginarity of quantum channels. Besides, an alternative framework is given together to simplify the process of verifying the condition. We present three imaginarity measures of…
We derive, for a bistochastic strictly contractive quantum channel on a matrix algebra, a relation between the contraction rate and the rate of entropy production. We also sketch some applications of our result to the statistical physics of…
We study the problem of approximating a quantum channel by one with as few Kraus operators as possible (in the sense that, for any input state, the output states of the two channels should be close to one another). Our main result is that…
Complex numbers play an indispensable role in quantum mechanics and quantum information, as validated by both theoretical analysis and experimental verification. Since quantum information processing inherently relies on quantum channels,…
Random numbers are widely used for information security, cryptography, stochastic modeling, and quantum simulations. Key technical challenges for physical random number generation are speed and scalability. We demonstrate a method for…
Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any…
We consider the problem of correcting the errors incurred from sending classical or quantum information through a noisy quantum environment by schemes using classical information obtained from a measurement on the environment. We give a…
We present a new method for quantum process tomography. The method enables us to efficiently estimate, with fixed precision, any of the parameters characterizing a quantum channel. It is selective since one can choose to estimate the value…
A parametrized family of normal states on a von Neumann algebra is called a statistical experiment, which generalizes the corresponding concepts in classical statistics and finite-dimensional quantum systems. We introduce randomization…
We investigate the approximate quantum state sharing protocol based on random unitary channels, which is secure against any exterior or interior attackers in principle. Although the protocol leaks small information for a security parameter…