We introduce a novel property of bipartite quantum states, which we call "faithfulness", and we say that a state is faithful when acting with a channel on one of the two quantum systems, the output state carries a complete information about the channel. The concept of faithfulness can also be extended to sets of states, when the output states patched together carry a complete imprinting of the channel.
The problem of estimating an unknown phase $ φ$ using two-level probes in the presence of unital phase-covariant noise and using finite resources is investigated. We introduce a simple model in which the phase-imprinting operation on the probes is realized by a unitary transformation with a randomly sampled generator. We determine the optimal phase sensitivity in a sequential estimation protocol, and derive a general (tight-fitting) lower bound. The sensitivity grows quadratically with the number of applications $ N $ of the phase-imprinting operation, then attains a maximum at some $ N_\text{…
We model the fundamental behavior of a two-branch quantum interference device. Quantum interference oscillations are visible in the output as the magnetic flux through the paths is varied. Multiple witness systems are field-coupled to each branch. Each witness state entangles with the device state, but for our {\em blind} witnesses which-path information is not transferred to the quantum state of witnesses--they cannot "see" or make a record of which path is traversed. Yet the presence of these minimal witnesses rapidly quenches quantum interference. Thus, it is not the imprinting of which-pat…
The notion of potential output purity of a completely positive map is introduced as a generalization of the regularized output purity. An upper bound is derived for this quantity, and for several classes of maps (including CQ, QC and Hadamard channels) it is shown that potential purity does not exceed the standard output purity. As an application the potential purity is used to bound the logarithmic Sobolev constant of a product of depolarizing channel semigroups.
The purpose of this paper is to investigate system identification for single-input-single-output general (active or passive) quantum linear systems. For a given input we address the following questions: (1) Which parameters can be identified by measuring the output? (2) How can we construct a system realization from sufficient input-output data? We show that for time-dependent inputs, the systems which cannot be distinguished are related by symplectic transformations acting on the space of system modes. This complements a previous result for passive linear systems. In the regime of stationary …
A problem in quantum information theory that has received considerable attention in recent years is the question of multiplicativity of the so-called maximal output purity (MOP) of a quantum channel. This quantity is defined as the maximum value of the purity one can get at the output of a channel by varying over all physical input states, when purity is measured by the Schatten $q$-norm, and is denoted by $ν_q$. The multiplicativity problem is the question whether two channels used in parallel have a combined $ν_q$ that is the product of the $ν_q$ of the two channels. A positive answer would …
Determining the worst-case uncertainty added by a quantum circuit is shown to be computationally intractable. This is the problem of detecting when a quantum channel implemented as a circuit is close to a linear isometry, and it is shown to be complete for the complexity class QMA of verifiable quantum computation. This is done by relating the problem of detecting when a channel is close to an isometry to the problem of determining how mixed the output of the channel can be when the input is a pure state. How mixed the output of the channel is can be detected by a protocol making use of the sw…
Data-driven inference was recently introduced as a protocol that, upon the input of a set of data, outputs a mathematical description for a physical device able to explain the data. The device so inferred is automatically self-consistent, that is, capable of generating all given data, and least committal, that is, consistent with a minimal superset of the given dataset. When applied to the inference of an unknown device, data-driven inference has been shown to output always the "true" device whenever the dataset has been produced by means of an observationally complete setup, which plays here …
Computation is currently seen as a forward propagator that evolves (retards) a completely defined initial vector into a corresponding final vector. Initial and final vectors map the (logical) input and output of a reversible Boolean network respectively, whereas forward propagation maps a one-way propagation of logical implication, from input to output. Conversely, hard NP-complete problems are characterized by a two-way propagation of logical implication from input to output and vice versa, given that both are partly defined from the beginning. Logical implication can be propagated forward an…
We study measurements on various subsystems of the output of a universal 1 to 2 cloning machine, and establish a correspondence between these measurements at the output and effective measurements on the original input. We show that one can implement sharp effective measurement elements by measuring only two out of the three output systems. Additionally, certain complete sets of sharp measurements on the input can be realised by measurements on the two clones. Furthermore, we introduce a scheme that allows to restore the original input in one of the output bits, by using measurements and classi…
We consider quantum-information division, which is characterized by a channel whose outputs have no correlation and are not completely randomized. We show that the quantum-information division is possible in a probabilistic manner by optimizing the average fidelity in the channel with $M$ outputs in both deterministic and probabilistic cases. Moreover, we show that the optimal fidelities drastically change depending on the condition imposed on the outputs (symmetric and asymmetric), which is quite in contrast to the case of imperfect cloning.
Given a quantum channel -- that is, a completely positive trace-preserving linear map -- as the only communication resource available between two parties, we consider the problem of characterizing the set of classical noisy channels that can be obtained from it by means of suitable classical-quantum encodings and quantum-classical decodings, respectively, on the sender's and the receiver's side. We consider various classes of linear witnesses and compute their optimum values in closed form for several classes of quantum channels. The witnesses that we consider here are formulated as communicat…
The calculating of the coherent information is a fundamental step in obtaining the quantum capacity of a quantum channel. We introduce orthogonal and complete code basis to evaluate the coherent information per channel use when the input is the maximal mixture of stabilizer codewords. In the code basis, the output density matrix is diagonal, the joint output of the system and the auxiliary is block diagonal. The coherent information is worked out by counting the weights of error operators.
A channel is degradable if there exists a second channel that maps the output state of the channel to the environment state. These channels satisfy the property that the output state contains more information about the input than the environment does. A complementary class of channels is the antidegradable channels, which admit channels that map the environment state to the output state of the channel. In this paper we show that the computational problem of distinguishing two channels remains PSPACE-complete when restricted to these classes of channels. This is shown using a construction of Cu…
We consider sequences of random quantum channels defined using the Stinespring formula with Haar-distributed random orthogonal matrices. For any fixed sequence of input states, we study the asymptotic eigenvalue distribution of the outputs through tensor powers of random channels. We show that the input states achieving minimum output entropy are tensor products of maximally entangled states (Bell states) when the tensor power is even. This phenomenon is completely different from the one for random quantum channels constructed from Haar-distributed random unitary matrices, which leads us to fo…
For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on quantum states are trace-preserving completely positive maps, but we also consider variants of these requirements. We generalize the definition of complete positivity to linear maps defined on arbitrary subspaces, then formulate this notion as a semidefinite program, and relate it by duality to approximative extensions of this map. This gives a characterization of…
The Glauber-Sudarshan diagonal `weight' function provides a natural divide between the quantum-optical notion of classical and nonclassical states of continuous variables systems. Based on this demarcation, a channel is said to be nonclassicality breaking if it outputs only classical states for any input state. We focus on multimode bosonic Gaussian channels and classify those that are nonclassicality breaking by introducing a criterion that needs to be satisfied by the matrices representing these channels. The criterion can be interpreted as a nonclassicality benchmark for these channels sinc…
Additivity violation of minimum output entropy, which shows non-classical properties in quantum communication, had been proved in most cases for random quantum channels defined by Haar-distributed unitary matrices. In this paper, we investigate random completely positive maps made of Gaussian Unitary Ensembles and Ginibre Ensembles regarding this matter. Using semi-circular systems and circular systems of free probability, we not only show the multiplicativity violation of maximum output norms in the asymptotic regimes but also prove the additivity violation via Haagerup inequality for a new c…
We prove the longstanding conjecture stating that Gaussian thermal input states minimize the output von Neumann entropy of one-mode phase-covariant quantum Gaussian channels among all the input states with a given entropy. Phase-covariant quantum Gaussian channels model the attenuation and the noise that affect any electromagnetic signal in the quantum regime. Our result is crucial to prove the converse theorems for both the triple trade-off region and the capacity region for broadcast communication of the Gaussian quantum-limited amplifier. Our result extends to the quantum regime the Entropy…
