If the transmissivity of an optical fibre falls below a critical value, its use as a reliable quantum channel is known to be drastically compromised. However, if the memoryless assumption does not hold — e.g. when input signals are separated by a sufficiently short time interval — the validity of this limitation is put into question. In this work we introduce a model of optical fibre that can describe memory effects for long transmission lines. We then solve its quantum capacity, two-way quantum capacity, and secret-key capacity exactly. By doing so, we show that — due to the memory cross-talk between the transmitted signals — reliable quantum communication is attainable even for highly noisy regimes where it was previously considered impossible.

We study the problem of transmitting classical information on a quantum channel in the absence of a shared phase reference. This problem is relevant for long-distance communications in free space and optical fiber, where phase noise is typically considered as a limiting factor. Previous analyses considered phase noise that acts independently on each communication mode, thus completely decohering successive signals and making it impossible to establish a phase reference. In the present work we analyze instead the realistic case in which the phase reference is lost only after m uses of the transmission line, due to a finite decoherence time. In this setting, focusing on the simplest case m = 2, we analyze two communication strategies using coherent states of the electromagnetic field and show that it is not beneficial to employ the total energy to establish a reference frame but rather to spread out the energy on all the modes and directly transmit information using their relative degrees of freedom.

We consider the problem of correctly classifying a given quantum two-level system (qubit) which is known to be in one of two equally probable quantum states. We assume that this task should be performed by a quantum machine which does not have at its disposal a complete classical description of the two template states, but can only have partial prior information about their level of purity and mutual overlap. Moreover, similarly to the classical supervised learning paradigm, we assume that the machine can be trained by n qubits prepared in the first template state and by n more qubits prepared in the second template state. In this situation, we are interested in the optimal process which correctly classifies the input qubit with the largest probability allowed by quantum mechanics. The problem is studied in its full generality for a number of different prior information scenarios and for an arbitrary size n of the training data. Finite size corrections around the asymptotic limit n → ∞ are derived. When the states are assumed to be pure, with known overlap, the problem is also solved in the case of d-level systems.

We prove that Gaussian thermal input states minimize the output von Neumann entropy of the one-mode Gaussian quantum-limited attenuator for fixed input entropy. The Gaussian quantum-limited attenuator models the attenuation of an electromagnetic signal in the quantum regime. The Shannon entropy of an attenuated real-valued classical signal is a simple function of the entropy of the original signal. A striking consequence of energy quantization is that the output von Neumann entropy of the quantum-limited attenuator is no more a function of the input entropy alone. The proof starts from the majorization result of De Palma et al., IEEE Trans. Inf. Theory 62, 2895 (2016), and is based on a new isoperimetric inequality. Our result implies that geometric input probability distributions minimize the output Shannon entropy of the thinning for fixed input entropy. Moreover, our result opens the way to the multimode generalization that permits to determine both the triple tradeoff region of the Gaussian quantum-limited attenuator and the classical capacity region of the Gaussian degraded quantum broadcast channel.

An ordering between the quantum states emerging from a single-mode gauge-covariant bosonic Gaussian channel is proved. Specifically, we show that within the set of input density matrices with the same given spectrum, the element passive with respect to the Fock basis (i.e., diagonal with decreasing eigenvalues) produces an output, which majorizes all the other outputs emerging from the same set. When applied to pure input states, our finding includes as a special case the result of Mari et al., Nat. Comm. 5, 3826 (2014) which implies that the output associated to the vacuum majorizes the others.

We design logic circuits based on the notion of zero forcing on graphs; each gate of the circuits is a gadget in which zero forcing is performed. We show that such circuits can evaluate every monotone Boolean function. By using two vertices to encode each logical bit, we obtain universal computation. We also highlight a phenomenon of "back forcing" as a property of each function. Such a phenomenon occurs in a circuit when the input of gates which have been already used at a given time step is further modified by a computation actually performed at a later stage. Finally, we show that zero forcing can be also used to implement reversible computation. The model introduced here provides a potentially new tool in the analysis of Boolean functions, with particular attention to monotonicity. Moreover, in the light of applications of zero forcing in quantum mechanics, the link with Boolean functions may suggest a new directions in quantum control theory and in the study of engineered quantum spin systems. It is an open technical problem to verify whether there is a link between zero forcing and computation with contact circuits.

A security analysis of the recently introduced Quantum Private Query (QPQ) protocol is presented. The latter is a cheat sensitive quantum protocol to perform a private search on a classical database. It allows a user to retrieve an item from the database without revealing which item was retrieved, and at the same time it ensures data privacy of the database (the information that the user retrieves in a query is bounded). The security analysis is based on information-disturbance tradeoffs which show that whenever the provider tries to obtain information on the query, the query (encoded into a quantum system) is disturbed so that the person querying the database can detect the privacy violation. The security bounds are derived under the assumption that a unique answer corresponds to each query. To remove this assumption, some simple variants of the protocol are illustrated, and it is conjectured that analogous security bounds apply to them.

The capacity C for transmitting classical information is investigated for noisy bosonic channel models. An exact result is obtained for the pure-loss case. Upper and lower bounds are established for channels with active noise sources