Related papers: The quantum moment problem and bounds on entangled…
In this work we construct tests that allow a classical user to certify high dimensional entanglement in uncharacterized and possibly noisy quantum devices. We present a family of non-local games $\{G_n\}$ that for all $n$ certify states…
We consider statistical methods based on finite samples of locally randomized measurements in order to certify different degrees of multiparticle entanglement in intermediate-scale quantum systems. We first introduce hierarchies of…
Go has long been considered as a testbed for artificial intelligence. By introducing certain quantum features, such as superposition and collapse of wavefunction, we experimentally demonstrate a quantum version of Go by using correlated…
This article uses data from two experimental studies of two-person Prisoner's Dilemma games [1, 2] and compares the data with the theoretic predictions calculated with the use of a quantum game theoretical method. The experimental findings…
For decades it is known that Quantum Computers might serve as a tool to solve a very specific kind of problems that have long thought to be incalculable. Some of those problems are of a combinatorial nature, with the quantum advantage…
Detection of entanglement in quantum networks consisting of many parties is one of the important steps towards building quantum communication and computation networks. We consider a scenario where the measurement devices used for this…
Quantum nonlocality is tested for an entangled coherent state, interacting with a dissipative environment. A pure entangled coherent state violates Bell's inequality regardless of its coherent amplitude. The higher the initial nonlocality,…
We consider entanglement detection for quantum key distribution systems that use two signal states and continuous variable measurements. This problem can be formulated as a separability problem in a qubit-mode system. To verify…
Similar formalisms have been independently developed in psychology, to deal with the issue of selective influences (deciding which of several experimental manipulations selectively influences each of several, generally non-independent,…
We analyze quantum two prover one round interactive proof systems, in which noninteracting provers can share unlimited entanglement. The maximum acceptance probability is characterized as a superoperator norm. We get some partial results…
We study the distinguishability of bipartite quantum states by Positive Operator-Valued Measures with positive partial transpose (PPT POVMs). The contributions of this paper include: (1). We give a negative answer to an open problem of [M.…
Self-testing refers to a method with which a classical user can certify the state and measurements of quantum systems in a device-independent way. Especially, the self-testing of entangled states is of great importance in quantum…
We develop an extension of a recently introduced subspace coset state monogamy-of-entanglement game [Coladangelo, Liu, Liu, and Zhandry; Crypto'21] to general group coset states, which are uniform superpositions over elements of a subgroup…
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…
Soon after the dawn of quantum error correction, DiVincenzo and Peres observed that stabilizer codewords could give rise to simple proofs of quantumness via contextuality. This discovery can be recast in the language of nonlocal games:…
We devised a protocol that allows two parties, who may malfunction or intentionally convey incorrect information in communication through a quantum channel, to verify each other's measurements and agree on each other's results. This has…
Iterated bipartite quantum games are implemented in terms of the discrete-time quantum walk on the line. Our proposal allows for conditional strategies, as two rational agents make a choice from a restricted set of two-qubit unitary…
In this paper we study the reduction criterion for detecting entanglement of large dimensional bipartite quantum systems. We first obtain an explicit formula for the moments of a random quantum state to which the reduction criterion has…
This paper describes an algorithmic system called SQT for the computer simulation of a wide class of quantum experiments on entangled particles. SQT maintains a hidden internal state for each particle and it provides an initialization…
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier's verdict is a function of the XOR of the two bits received. We show that, when the provers are allowed to…