Related papers: Quantifying the resource of sharing a reference fr…

We discuss the concept of transformations among reference frames (classical or quantum). Usually transformations among classical reference frames have sharply defined parameters; geometrically they can be considered as {pure states in the…

A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g.…

Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components, as well as communications between these components. Moreover, to model concurrent and…

The absence of a common framework for benchmarking quantum networks is an obstacle to comparing the capabilities of different quantum networks. We propose a general framework for quantifying the performance of a quantum network, which is…

Fidelity is a figure of merit widely employed in quantum technology in order to quantify similarity between quantum states and, in turn, to assess quantum resources or reconstruction techniques. Fidelities higher than, say, 0.9 or 0.99, are…

We consider the problem of quantum communication mediated by an optical refocusing system, which is schematized as a thin lens with a finite pupil. This model captures the basic features of all those situations in which a signal is either…

Composite quantum systems can be decomposed into subsystems in many different inequivalent ways. We call a particular decomposition a meronomic reference frame for the system. We apply the ideas of quantum reference frames to characterize…

We introduce and analyse the problem of encoding classical information into different resources of a quantum state. More precisely, we consider a general class of communication scenarios characterised by encoding operations that commute…

Restrictions on quantum operations give rise to resource theories. Total lack of a shared reference frame for transformations associated with a group G between two parties is equivalent to having, in effect, an invariant channel between the…

Useful relations describing arbitrary parameters of given quantum systems can be derived from simple physical constraints imposed on the vectors in the corresponding Hilbert space. This is well known and it usually proceeds by partitioning…

Existing approaches to quantum reservoir computing can be broadly categorized into restart-based and continuous protocols. Restart-based methods require reinitializing the quantum circuit for each time step, while continuous protocols use…

Resource theories play an important role in quantum information theory, as they identify resourceful states and channels that are potentially useful for the accomplishment of tasks that would be otherwise unreachable. The elementary…

Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or…

A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be…

A promising platform for semi-device-independent quantum information is prepare-and-measure experiments restricted only by a bound on the energy of the communication. Here, we investigate the role of shared entanglement in such scenarios.…

We investigate how quantum coherence scales and is redistributed in quantum communication protocols, using superdense coding and quantum teleportation as paradigmatic case studies. Employing the relative entropy of coherence as a…

A series of recent works has shown that placing communication channels in a coherent superposition of alternative configurations can boost their ability to transmit information. Instances of this phenomenon are the advantages arising from…

In classical information theory, channel capacity quantifies the maximum number of messages that can be reliably transmitted using shared information. An equivalent concept, termed uncommon information, represents the number of messages…

Many algorithms are specified with respect to a fixed but unspecified parameter. Examples of this are especially common in cryptography, where protocols often feature a security parameter such as the bit length of a secret key. Our aim is…

The coherent bit (cobit) channel is a resource intermediate between classical and quantum communication. It produces coherent versions of teleportation and superdense coding. We extend the cobit channel to continuous variables by providing…