Related papers: Generating random quantum channels
Coherence is a basic notion for quantum states. Instead of quantum states, in this work, We establish a resource theory for quantifying the coherence of Gaussian channels. To do this, we propose the definitions of incoherent Gaussian…
We show that unbounded number of channel uses may be necessary for perfect transmission of quantum information. For any n we explicitly construct low-dimensional quantum channels ($d_A$=4, $d_E$=2 or 4) whose quantum zero-error capacity is…
The construction of a perfectly secure private quantum channel in dimension d is known to require 2 log d shared random key bits between the sender and receiver. We show that if only near-perfect security is required, the size of the key…
Measurement outcomes on quantum systems exhibit inherent randomness and are fundamentally nondeterministic. This has enabled quantum physics to set new standards for the generation of true randomness with significant applications in the…
Using the graphical calculus and integration techniques introduced by the authors, we study the statistical properties of outputs of products of random quantum channels for entangled inputs. In particular, we revisit and generalize models…
We investigate an original family of quantum distinguishability problems, where the goal is to perfectly distinguish between $M$ quantum states that become identical under a completely decohering map. Similarly, we study distinguishability…
In this letter, we prove that the classical capacity of quantum channel for $M$ symmetric states is achieved by an uniform distribution on a priori probabilities. We also investigate non-symmetric cases such as a ternary amplitude shift…
We demonstrate a quantum random number generator based on the random nature of the phase difference between two independent laser sources. The speed of random bit generation is determined by the photodetector bandwidth and the linewidth of…
We determine the capacity of compound classical-quantum channels. As a consequence we obtain the capacity formula for the averaged classical-quantum channels. The capacity result for compound channels demonstrates, as in the classical…
Measurements of quantum systems can be used to generate classical data that is truly unpredictable for every observer. However, this true randomness needs to be discriminated from randomness due to ignorance or lack of control of the…
One of the major achievements of the recently emerged quantum information theory is the introduction and thorough investigation of the notion of quantum channel which is a basic building block of any data-transmitting or data-processing…
The quantum channel decomposition techniques, which contain the so-called probabilistic error cancellation and gate/wire cutting, are powerful approach for simulating a hard-to-implement (or an ideal) unitary operation by concurrently…
Entanglement plays an important role in quantum communication, algorithms, and error correction. Schmidt coefficients are correlated to the eigenvalues of the reduced density matrix. These eigenvalues are used in Von Neumann entropy to…
No quantum circuit can turn a completely unknown unitary gate into its coherently controlled version. Yet, coherent control of unknown gates has been realised in experiments, making use of a different type of initial resources. Here, we…
Quantum physics can be exploited to generate true random numbers, which play important roles in many applications, especially in cryptography. Genuine randomness from the measurement of a quantum system reveals the inherent nature of…
We propose a quantum algorithm for sampling from a solution of stochastic differential equations (SDEs). Using differentiable quantum circuits (DQCs) with a feature map encoding of latent variables, we represent the quantile function for an…
Quantum protocols often require the generation of specific quantum states. We describe a quantum algorithm for generating any prescribed quantum state. For an important subclass of states, including pure symmetric states, this algorithm is…
We explore the conceptual usefulness of Riemannian geometric tools induced by the statistical concept of distinguishability in quantifying the effect of a depolarizing channel on quantum states. Specifically, we compare the geometries of…
In this work we provide an efficiency analysis of the problem of comparison of two randomly chosen quantum operations in the single-shot regime. We provide tight bounds for the success probability of such a protocol for arbitrary quantum…
We investigate the possibility of dividing quantum channels into concatenations of other channels, thereby studying the semigroup structure of the set of completely-positive trace-preserving maps. We show the existence of 'indivisible'…