Searcharxiv⌕ Search

arXiv subjects

Roberto Ferrara

Publications and source records attributed to Roberto Ferrara.

23 records · Page 2Linked to original sources

The Computational and Latency Advantage of Quantum Communication Networks

This article summarises the current status of classical communication networks and identifies some critical open research challenges that can only be solved by leveraging quantum technologies. By now, the main goal of quantum communication networks has been security. However, quantum networks can do more than just exchange secure keys or serve the needs of quantum computers. In fact, the scientific community is still investigating on the possible use cases/benefits that quantum communication networks can bring. Thus, this article aims at pointing out and clearly describing how quantum communication networks can enhance in-network distributed computing and reduce the overall end-to-end latency, beyond the intrinsic limits of classical technologies. Furthermore, we also explain how entanglement can reduce the communication complexity (overhead) that future classical virtualised networks will experience.

cs.IT↗

Upper bounds on device-independent quantum key distribution

Quantum key distribution (QKD) is a method that distributes a secret key to a sender and a receiver by the transmission of quantum particles (e.g. photons). Device-independent quantum key distribution (DIQKD) is a version of QKD with a stronger notion of security, in that the sender and receiver base their protocol only on the statistics of input and outputs of their devices as inspired by Bell's theorem. We study the rate at which DIQKD can be carried out for a given bipartite quantum state distributed between the sender and receiver or a quantum channel connecting them. We provide upper bounds on the achievable rate going beyond upper bounds possible for QKD. In particular, we construct states and channels where the QKD rate is significant while the DIQKD rate is negligible. This gap is illustrated for a practical case arising when using standard post-processing techniques for entangled two-qubit states.

quant-ph↗

Performance Analysis of Identification Codes

In this paper we analyse the construction of identification codes. Identification codes are based on the question "Is the message I have just received the one I am interested in?", as opposed to Shannon's transmission, where the receiver is interested in not only one, but any message. The advantage of identification is that it allows rates growing double exponentially in the blocklength at the cost of not being able to decode every message, which might be beneficial in certain applications. We focus on a special identification code construction based on two concatenated Reed-Solomon codes and have a closer look at its implementation, analyzing the trade-offs of identification with respect to transmission and the trade-offs introduced by the computational cost of identification codes.

cs.IT↗

Random private quantum states

The study of properties of randomly chosen quantum states has in recent years led to many insights into quantum entanglement. In this work, we study private quantum states from this point of view. Private quantum states are bipartite quantum states characterised by the property that carrying out simple local measurements yields a secret bit. This feature is shared by the maximally entangled pair of quantum bits, yet private quantum states are more general and can in their most extreme form be almost bound entangled. In this work, we study the entanglement properties of random private quantum states and show that they are hardly distinguishable from separable states and thus have low repeatable key, despite containing one bit of key. The technical tools we develop are centred around the concept of locally restricted measurements and include a new operator ordering, bounds on norms under tensoring with entangled states and a continuity bound for a relative entropy measure.

quant-ph↗

Private states, quantum data hiding and the swapping of perfect secrecy

We derive a formal connection between quantum data hiding and quantum privacy, confirming the intuition behind the construction of bound entangled states from which secret bits can be extracted. We present three main results. First, we show how to simplify the class of private states and related states via reversible local operation and one-way communication. Second, we obtain a bound on the one-way distillable entanglement of private states in terms of restricted relative entropy measures, which is tight in many cases and shows that protocols for one-way distillation of key out of states with low distillable entanglement lead to the distillation of data hiding states. Third, we consider the problem of extending the distance of quantum key distribution with help of intermediate stations. In analogy to the quantum repeater, this paradigm has been called the quantum key repeater. We show that when extending private states with one-way communication, the resulting rate is bounded by the one-way distillable entanglement. In order to swap perfect secrecy it is thus essentially optimal to use entanglement swapping.

quant-ph↗