相关论文: Approximate virtual quantum broadcasting
We propose a new protocol of implementing continuous-variable quantum state transfer using partially disembodied transport. This protocol may improve the fidelity at the expense of the introduction of a semi-quantum channel between the…
We investigate the optimal quantum state reconstruction from cloud to many spatially separated users by measure-broadcast-prepare scheme without the availability of quantum channel. The quantum state equally distributed from cloud to…
The paper deals with the distributed minimum sharing problem: a set of decision-makers compute the minimum of some local quantities of interest in a distributed and decentralized way by exchanging information through a communication…
We consider the problem of broadcasting arbitrary states of radiation modes from N to M>N copies by a map that preserves the average value of the field and optimally reduces the total noise in conjugate variables. For N>=2 the broadcasting…
Motivated by applications in wireless communications, this paper develops semidefinite programming (SDP) relaxation techniques for some mixed binary quadratically constrained quadratic programs (MBQCQP) and analyzes their approximation…
In Part I of this paper, we proposed and analyzed a novel algorithmic framework for the minimization of a nonconvex (smooth) objective function, subject to nonconvex constraints, based on inner convex approximations. This Part II is devoted…
In recent years Quantum Key Distribution (QKD) has emerged as the most paradigmatic example of Quantum technology allowing the realization of intrinsically secure communication links over hundreds of kilometers. Beyond its commercial…
To establish an entangled state of optimal fidelity between two distant observers when the available quantum channel is noisy, is a central problem in quantum information theory. We consider an instance of this problem for two-qubit systems…
We consider a standard distributed optimisation setting where $N$ machines, each holding a $d$-dimensional function $f_i$, aim to jointly minimise the sum of the functions $\sum_{i = 1}^N f_i (x)$. This problem arises naturally in…
Quantum key distribution (QKD) offers a secret way to share keys between legitimate users which is guaranteed by the law of quantum mechanics. Most recently, the limitation of transmission distance without quantum repeaters was broken…
The security of quantum cryptography is guaranteed by the no-cloning theorem, which implies that an eavesdropper copying transmitted qubits in unknown states causes their disturbance. Nevertheless, in real cryptographic systems some level…
In the task of discriminating between nonorthogonal quantum states from multiple copies, the key parameters are the error probability and the resources (number of copies) used. Previous studies have considered the task of minimizing the…
This paper studies pliable index coding, in which a sender broadcasts information to multiple receivers through a shared broadcast medium, and the receivers each have some message a priori and want any message they do not have. An approach,…
Pulse controlled non-adiabatic quantum state transmission (QST) was proposed many years ago. However, in practice environmental noise inevitably damages communication quality in the proposal. In this paper, we study the optimally controlled…
We develop a quantum teleportation protocol of an unknown optical single rail qubit using a hybrid quantum channel composed of continuous variable (CV) states of certain parity. The quantum channel is characterized by two parameters: a…
Employing the fundamental laws of quantum physics, Quantum Key Distribution (QKD) promises the unconditionally secure distribution of cryptographic keys. However, in practical realisations, a QKD protocol is only secure, when the quantum…
Shadow tomography for quantum states provides a sample efficient approach for predicting the properties of quantum systems when the properties are restricted to expectation values of $2$-outcome POVMs. However, these shadow tomography…
The most simplest form of quantum network is an one dimensional quantum network with a single player in each node. In remote entanglement distribution each of the players carry out measurement at the intermediate nodes to produce an…
We propose a quantum soft-covering problem for a given general quantum channel and one of its output states, which consists in finding the minimum rank of an input state needed to approximate the given channel output. We then prove a…
We study quantum soft covering and privacy amplification against quantum side information. The former task aims to approximate a quantum state by sampling from a prior distribution and querying a quantum channel. The latter task aims to…