相关论文: Multipartite purification protocols: upper and opt…
The accuracy of any physical scheme used to estimate the parameter describing the strength of a single qubit Pauli channel can be quantified using standard techniques from quantum estimation theory. It is known that the optimal estimation…
The efficient and reliable verification of quantum states plays a crucial role in various quantum information processing tasks. We consider the task of verifying entangled states using one-way and two-way classical communication and…
Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…
Hyperentanglement is a promising resource in quantum information processing, especially for increasing the channel capacity of long-distance quantum communication. Hyperentanglement purification is an important method to obtain…
Based on the realignment moments of density matrix, we study parameterized entanglement criteria for bipartite and multipartite states. By adjusting the different parameter values, our criterion can detect not only bound entangled states,…
We ask whether the optimal probe is entangled, and if so, what is its character and amount, for estimating the noise parameter of a large class of local quantum encoding processes that we refer to as vector encoding, examples of which…
In quantum networks multipath entanglement purification (MEP) between a pair of source-destination nodes can substantially strengthen their entanglement connection. An efficient MEP strategy can therefore increase the size of the network…
The optimum interval method for finding an upper limit of a one-dimensionally distributed signal in the presence of an unknown background is extended to the case of high statistics. There is also some discussion of how the method can be…
Entanglement purification protocols, designed to improve the fidelity of Bell states over quantum networks for inter-node communications, have attracted significant attention over the last few decades. These protocols have great potential…
Generalizing the bit thread formalism, we use convex duality to derive dual flow programs to the bipartite and multipartite holographic entanglement of purification proposals and then prove several inequalities using these constructions. In…
We study the problem of optimizing nonlinear objective functions over bipartite matchings. While the problem is generally intractable, we provide several efficient algorithms for it, including a deterministic algorithm for maximizing convex…
The inevitable accumulation of errors in near-future quantum devices represents a key obstacle in delivering practical quantum advantages, motivating the development of various quantum error-mitigation methods. Here, we derive fundamental…
Recently emerged as a disruptive networking paradigm, quantum networks rely on the mysterious quantum entanglement to teleport qubits without physically transferring quantum particles. However, the state of quantum systems is extremely…
Starting from the entanglement wedge of a multipartite mixed state we describe a purification procedure which involves the gluing of several copies. The resulting geometry has non-trivial topology and a single oriented boundary for each…
We propose upper and lower bounds on the maximum success probability for discriminating given quantum states. The proposed upper bound is obtained from a suboptimal solution to the dual problem of the corresponding optimal state…
An entanglement bound based on local measurements is introduced for multipartite pure states. It is the upper bound of the geometric measure and the relative entropy of entanglement. It is the lower bound of minimal measurement entropy. For…
We study the concurrence of arbitrary dimensional multipartite quantum systems. An explicit analytical lower bound of concurrence for four-partite mixed states is obtained in terms of the concurrences of tripartite mixed states. Detailed…
A maximum priority matching is a matching in an undirected graph that maximizes a priority score defined with respect to given vertex priorities. An earlier paper showed how to find maximum priority matchings in unweighted graphs. This…
With the rise of smartphones and the internet-of-things, data is increasingly getting generated at the edge on local, personal devices. For privacy, latency and energy saving reasons, this shift is causing machine learning algorithms to…
We introduce a `concrete complexity' model for studying algorithms for matching in bipartite graphs. The model is based on the "demand query" model used for combinatorial auctions. Most (but not all) known algorithms for bipartite matching…