相关论文: Quantum entanglement, indistinguishability, and th…
The creation of complex entangled states, resources that enable quantum computation, can be achieved via simple 'probabilistic' operations which are individually likely to fail. However, typical proposals exploiting this idea carry a severe…
We map the quantum entanglement problem onto the mathematically well-studied truncated moment problem. This yields a necessary and sufficient condition for separability that can be checked by a hierarchy of semi-definite programs. The…
A bipartite state which is secretly chosen from a finite set of known entangled pure states cannot be immediately useful in standard quantum information processing tasks. To effectively make use of the entanglement contained in this unknown…
Quantifying unknown quantum entanglement experimentally is a difficult task, but also becomes more and more necessary because of the fast development of quantum engineering. Machine learning provides practical solutions to this fundamental…
We present a quantization scheme for a three-player Prisoner's Dilemma game. It is shown that entanglement plays a dominant role in the three-player quantum game. Four different types of payoffs are identified on the basis of different…
Concept of entangled probability distribution of several random variables is introduced. These probability distributions describe multimode quantum states in probability representation of quantum mechanics. Example of entangled probability…
We establish a general implementation-independent approach to assess the potential advantage of using highly entangled quantum states between the initial and final states of the charging protocol to enhance the maximum charging power of…
Quantum discord has been utilised in order to find quantum advantage in an extension of the Clauser, Horne, Shimony, and Holt (CHSH) game. By writing the game explicitly as a Bayesian game, the resulting game is modified such the payoff's…
We consider a variation of the multi-party communication complexity scenario where the parties are supplied with an extra resource: particles in an entangled quantum state. We show that, although a prior quantum entanglement cannot be used…
In quantum teleportation, an unknown quantum state is transmitted from one party to another using only local operations and classical communication, at the cost of shared entanglement. Is it possible similarly, using an $N$ party entangled…
Advances in quantum algorithms suggest a tentative scaling advantage on certain combinatorial optimization problems. Recent work, however, has also reinforced the idea that barren plateaus render variational algorithms ineffective on large…
Coherent information quantifies the achievable rate of the reliable quantum information transmission through a communication channel. Use of the correlated quantum states instead of the factorized ones may result in an increase in the…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Quantum annealing is an innovative idea and method for avoiding the increase of the calculation cost of the combinatorial optimization problem. Since the combinatorial optimization problems are ubiquitous, quantum annealing machine with…
Entanglement is one of the pillars of quantum mechanics and quantum information processing, and as a result the quantumness of nonentangled states has typically been overlooked and unrecognized. We give a robust definition for the…
We establish an information gain-disturbance trade-off relation in local state discrimination. Our result demonstrates a fundamental limitation of local strategy to discriminate entangled quantum states without disturbance, which becomes…
The role of entanglement and quantum correlations in complex physical systems and quantum information processing devices has become a topic of intense study in the past two decades. In this work we present new tools for learning about…
We describe a quantum model of simple choice game (constructed upon entangled state of two qubits), which involves the fundamental problem of transitive - intransitive preferences. We compare attainability of optimal intransitive strategies…
Detecting entanglement in multipartite quantum states is an inherently probabilistic process, typically with a few measured samples. The level of confidence in entanglement detection quantifies the scheme's validity via the probability that…
We focus on determining the separability of an unknown bipartite quantum state $\rho$ by invoking a sufficiently large subset of all possible entanglement witnesses given the expected value of each element of a set of mutually orthogonal…