Related papers: Experimental Virtual Quantum Broadcasting
Pauli channels are fundamental in the context of quantum computing as they model the simplest kind of noise in quantum devices. We propose a quantum algorithm for simulating Pauli channels and extend it to encompass Pauli dynamical maps…
We propose entangled (M+1)-mode quantum states as a multiuser quantum channel for continuous-variable communication. Arbitrary quantum states can be sent via this channel simultaneously to M remote and separated locations with equal minimum…
This paper describes a novel approach to emulate a universal quantum computer with a wholly classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any…
After proving a general no-cloning theorem for black boxes, we derive the optimal universal cloning of unitary transformations, from one to two copies. The optimal cloner is realized by quantum channels with memory, and greately outperforms…
Communication over a quantum broadcast channel with cooperation between the receivers is considered. The first form of cooperation addressed is classical conferencing, where Receiver 1 can send classical messages to Receiver 2. Another…
We develop a device-independent framework for testing quantum channels. That is, we falsify a hypothesis about a quantum channel based only on an observed set of input-output correlations. Formally, the problem consists of characterizing…
We introduce the study of quantum protocols that probabilistically simulate quantum channels from a sender in the future to a receiver in the past. The maximum probability of simulation is determined by causality and depends on the amount…
Optimal quantum machines can be implemented by linear projective operations. In the present work a general qubit symmetrization theory is presented by investigating the close links to the qubit purification process and to the programmable…
We derive a tight upper bound for the fidelity of a universal N to M qubit cloner, valid for any M \geq N, where the output of the cloner is required to be supported on the symmetric subspace. Our proof is based on the concatenation of two…
Distributed quantum computing (DQC) provides a way to scale quantum computers using multiple quantum processing units (QPU) connected through quantum communication links. In this paper, we have built a distributed quantum computing…
Distributed quantum computation is a practical method for large-scale quantum computation on quantum processors with limited size. It can be realized by direct quantum channels in flying qubits. Moreover, the pre-established quantum…
Encoding schemes and error-correcting codes are widely used in information technology to improve the reliability of data transmission over real-world communication channels. Quantum information protocols can further enhance the performance…
Quantum simulations consist in the intentional reproduction of physical or unphysical models into another more controllable quantum system. Beyond establishing communication vessels between unconnected fields, they promise to solve complex…
We present an explicit construction of a relativistic quantum computing architecture using a variational quantum circuit approach that is shown to allow for universal quantum computing. The variational quantum circuit consists of tunable…
We study generating joint measurements by operating on the input quantum state with a broadcasting channel followed by local measurements on the two outputs of the broadcasting channel. Although, due to perfect broadcasting or cloning being…
Quantum computers promise to revolutionise electronic simulations by overcoming the exponential scaling of many-electron problems. While electronic wave functions can be represented using a product of fermionic unitary operators, shallow…
We investigate the transmission of both classical and quantum information between two arbitrary observers in globally hyperbolic spacetimes using a quantum field as a communication channel. The field is supposed to be in some arbitrary…
Quantum simulation algorithms often require numerous ancilla qubits and deep circuits, prohibitive for near-term hardware. We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit…
A collection of quantum channels is called incompatible if they cannot be obtained as marginals from a single channel. No-cloning theorem is the most prominent instance of incompatibility of quantum channels. We show that every collection…
Operational contextuality forms a rapidly developing subfield of quantum information theory. However, the characterization of the quantum mechanical entities that fuel the phenomenon has remained unknown with many partial results existing.…