Related papers: The augmented message-matrix approach to determini…
The distributed subgradient method (DSG) is a widely discussed algorithm to cope with large-scale distributed optimization problems in the arising machine learning applications. Most exisiting works on DSG focus on ideal communication…
We derive a new upper bound on the reliability function for channel coding over discrete memoryless channels. Our bounding technique relies on two main elements: (i) adding an auxiliary genie-receiver that reveals to the original receiver a…
Deterministic port-based teleportation (dPBT) protocol is a scheme where a quantum state is guaranteed to be transferred to another system without unitary correction. We characterize the best achievable performance of the dPBT when both the…
We present a framework of a multimode dense coding network with multiple senders and a single receiver using continuous variable systems. The protocol is scalable to arbitrary numbers of modes with the encoding being displacements while the…
We develop a novel and powerful technique for communication lower bounds, the pattern matrix method. Specifically, fix an arbitrary function f:{0,1}^n->{0,1} and let A_f be the matrix whose columns are each an application of f to some…
By sending a classical two-level system, one can transfer information about only \emph{two} distinguishable outcomes. Here we show that in quantum mechanics, using both the spin and path degrees of freedom of a spin-1/2 particle, and a…
We explore the possibility of performing super dense coding with non-maximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to…
The optimal rate of reliable communication over a quantum channel can be enhanced by pre-shared entanglement. Whereas the enhancement may be unbounded in infinite-dimensional settings even when the input power is constrained, a…
New techniques based on weak measurements have recently been introduced to the field of quantum state reconstruction. Some of them allow the direct measurement of each matrix element of an unknown density operator and need only $O(d)$…
For a binary system specified by the density operators r0 and r1 and by the prior probabilities q0 and q1, Helstrom's theory permits the evaluation of the optimal measurement operators and of the corresponding maximum correct detection…
We present an iterative algorithm that finds the optimal measurement for extracting the accessible information in any quantum communication scenario. The maximization is achieved by a steepest-ascent approach toward the extremal point,…
We provide the first example of a communication model and a distributed task, for which there exists a realistic quantum protocol which is asymptotically more efficient than any classical protocol, both in the communication and the…
Distributed quantum metrology (DQM) enables the estimation of global functions of d distributed parameters beyond the capability of separable sensors. Continuous-variable DQM involves using a linear network with at least one nonclassical…
Determinant Quantum Monte Carlo (DQMC) provides numerically exact solutions for strongly correlated fermionic systems but faces significant computational challenges with increasing system size. While submatrix updates were originally…
We establish a one-to-one correspondence between (1) quantum teleportation schemes, (2) dense coding schemes, (3) orthonormal bases of maximally entangled vectors, (4) orthonormal bases of unitary operators with respect to the…
Using the tool of unitary transformations of the extended receiver we perform simple operations with the non-diagonal elements of the initial sender's density matrix after their transferring to the receiver. These operations are following:…
This article presents a differential detection scheme for the uplink of a massive MIMO system that employs one-bit quantizers on each receive antenna. We focus on the detection of differential amplitude and phase shift keying symbols and we…
The posterior matching scheme, for feedback encoding of a message point lying on the unit interval over memoryless channels, maximizes mutual information for an arbitrary number of channel uses. However, it in general does not always…
Repeating a gate sequence multiple times amplifies systematic errors coherently, making it a useful tool for characterizing quantum gates. However, the precision of such an approach is limited by low-frequency noises, while its efficiency…
This paper presents a perfectly secure matrix multiplication (PSMM) protocol for multiparty computation (MPC) of $\mathrm{A}^{\top}\mathrm{B}$ over finite fields. The proposed scheme guarantees correctness and information-theoretic privacy…