Related papers: A universal set of qubit quantum channels
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 show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact…
We propose a categorical foundation for the connection between pure and mixed states in quantum information and quantum computation. The foundation is based on distributive monoidal categories. First, we prove that the category of all…
A characterization of qubit quantum channels is introduced. In analogy to what happens in the context of Bosonic channels we exploit the possibility of representing the states of the system in terms of characteristic function. The latter…
Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the…
We examine the possible states of subsystems of a system of bits or qubits. In the classical case (bits), this means the possible marginal distributions of a probability distribution on a finite number of binary variables; we give necessary…
We develop an approximation approach to infinite dimensional quantum channels based on detailed investigation of the continuity properties of entropic characteristics of quantum channels and operations (trace-nonincreasing completely…
We address the question of the existence of quantum channels that are divisible in two quantum channels but not in three or, more generally, channels divisible in $n$ but not in $n+1$ parts. We show that for the qubit those channels…
We introduce and study norms in the space of hermitian operators, obtained from base norms in positively generated subspaces. These norms are closely related to discrimination of so-called generalized quantum channels, including quantum…
We give a direct proof of the additivity of the minimum output entropy of a particular quantum channel which breaks the multiplicativity conjecture. This yields additivity of the classical capacity of this channel, a result obtained by a…
A quantum circuit is generalized to a nonunitary one whose constituents are nonunitary gates operated by quantum measurement. It is shown that a specific type of one-qubit nonunitary gates, the controlled-NOT gate, as well as all one-qubit…
A linear map $L$ from ${\mathbb C}^{n \times n}$ into ${\mathbb C}^{n \times n}$ is called a quantum channel if it is completely positive and trace preserving. The set ${\cal L}_n$ of all such quantum channels is known to be a compact…
We introduce and experimentally demonstrate a method for realising a quantum channel using the measurement-based model. Using a photonic setup and modifying the bases of single-qubit measurements on a four-qubit entangled cluster state,…
The N to M (M>N) universal quantum broadcasting of mixed states are proposed for qubits system. The broadcasting of mixed states is universal and optimal in the sense that the shrinking factor is independent of input state and achieves the…
We revisit the question of universality in quantum computing and propose a new paradigm. Instead of forcing a physical system to enact a predetermined set of universal gates (e.g., single-qubit operations and CNOT), we focus on the…
We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a…
Operating quantum sensors and quantum computers would make data in the form of quantum states available for purely quantum processing, opening new avenues for studying physical processes and certifying quantum technologies. In this…
We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as…
A measurement on a section K of the set of states of a finite dimensional C*-algebra is defined as an affine map from K to a probability simplex. Special cases of such sections are used in description of quantum networks, in particular…
In this work we examine quantum states which have non-negative amplitudes (in a fixed basis) and the channels which preserve them. These states include the ground states of stoquastic Hamiltonians and they are of interest since they avoid…