相关论文: Sequential scheme for locally discriminating bipar…

Distributed optimization algorithms have been studied extensively in the literature; however, underlying most algorithms is a linear consensus scheme, i.e. averaging variables from neighbors via doubly stochastic matrices. We consider…

The study of stronger-than-quantum effects is a fruitful line of research that provides valuable insight into quantum theory. Unfortunately, traditional bipartite steering scenarios can always be explained by quantum theory. Here we show…

We theoretically investigate schemes to discriminate between two nonorthogonal quantum states given multiple copies. We consider a number of state discrimination schemes as applied to nonorthogonal, mixed states of a qubit. In particular,…

Local unitary equivalence is an important ingredient for quantifying and classifying entanglement. Verifying whether or not two quantum states are local unitary equivalent is a crucial problem, where only the case of multipartite pure…

We give a rigorous formulation of the intuitive idea that a differentiable map should be thesame thing as a locally, or infinitesimally, linear map: just as a linear map respects the operations of addition and multiplication by scalars ina…

Small numbers of qubits are one of the primary constraints on the near-term deployment of advantageous quantum computing. To mitigate this constraint, techniques have been developed to break up a large quantum computation into smaller…

We exhibit assertion-preserving (reachability preserving) transformations from parameterized concurrent shared-memory programs, under a k-round scheduling of processes, to sequential programs. The salient feature of the sequential program…

We consider the question of perfect local distinguishability of mutually orthogonal bipartite quantum states, with the property that every state can be specified by a unitary operator acting on the local Hilbert space of Bob. We show that…

The recognition of entanglement states is a notoriously difficult problem when no prior information is available. Here, we propose an efficient quantum adversarial bipartite entanglement detection scheme to address this issue. Our proposal…

We show that every correctable subsystem for an arbitrary noise operation can be recovered by a unitary operation, where the notion of recovery is more relaxed than the notion of correction insofar as it does not protect the subsystem from…

We devise and experimentally realize a procedure capable of detecting and distinguishing quantum discord and classical correlations as well the presence of factorized states in a joint system-environment setting. Our scheme builds on recent…

In this paper we analyze the (im)possibility of the exact distinguishability of orthogonal multipartite entangled states under {\em restricted local operation and classical communication}. Based on this local distinguishability analysis we…

Discrimination of unitary operations is fundamental in quantum computation and information. A lot of quantum algorithms including the well-known Deutsch-Jozsa algorithm, Simon's algorithm, and Grover's algorithm can essentially be regarded…

In this paper the problem of scheduling of jobs on parallel machines under incompatibility relation is considered. In this model a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same…

A bipartite quantum channel represents the interaction between systems, generally allowing for exchange of information. A special class of bipartite channels are the no-signaling ones, which do not allow communication. In Ref. [1] it has…

Quantum steering describes the ability of one observer to nonlocally affect the other observer's state through local measurements, which represents a new form of quantum nonlocal correlation and has potential applications in quantum…

Non-invertible symmetries of quantum field theories and many-body systems generalize the concept of symmetries by allowing non-invertible operations in addition to more ordinary invertible ones described by groups. The aim of this paper is…

We investigate the conditions under which a set $\SC$ of pure bipartite quantum states on a $D\times D$ system can be locally cloned deterministically by separable operations, when at least one of the states is full Schmidt rank. We allow…

A sequential quadratic programming (SQP) algorithm is designed for nonsmooth optimization problems with upper-C^2 objective functions. Upper-C^2 functions are locally equivalent to difference-of-convex (DC) functions with smooth convex…

It is revealed that ensembles consisting of multipartite quantum states can exhibit different kinds of nonlocalities. An operational measure is introduced to quantify nonlocalities in ensembles consisting of bipartite quantum states.…