Related papers: Quantum Merlin-Arthur with an internally separable…
We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game. Our main result is the first nontrivial lower bound on the class MIP* of languages having multi-prover interactive proofs with entangled…
It is very crucial to know that whether the quantum state generated in the experiment is entangled or not. In the literature, this topic was studied extensively and researchers proposed different approaches for the detection of mixed…
We present a quantum circuit that implements a non-demolition measurement of complementary single- and bi-partite properties of a two-qubit system: entanglement and single-partite visibility and predictability. The system must be in a pure…
We show that the bipartite separability of a pure qubit state hinges critically on the combinatorial structure of its computational-basis support. Using Boolean cube geometry, we introduce a taxonomy that distinguishes support-guaranteed…
The entropic uncertainty relation with quantum side information (EUR-QSI) from [Berta et al., Nat. Phys. 6, 659 (2010)] is a unifying principle relating two distinctive features of quantum mechanics: quantum uncertainty due to measurement…
The quantum uncertainty principle stands as a cornerstone and a distinctive feature of quantum mechanics, setting it apart from classical mechanics. We introduce a tripartite quantum-memory-assisted entropic uncertainty relation, and extend…
Quantum annealing (QA) is one of the efficient methods to calculate the ground-state energy of a problem Hamiltonian. In the absence of noise, QA can accurately estimate the ground-state energy if the adiabatic condition is satisfied.…
The state of a quantum system, consisting of two distinct subsystems, is called separable if it can be prepared by two distant experimenters who receive instructions from a common source, via classical communication channels. A necessary…
Nuclear Magnetic Resonance (NMR) was successfully employed to test several protocols and ideas in Quantum Information Science. In most of these implementations the existence of entanglement was ruled out. This fact introduced concerns and…
We demonstrate that for every two-qubit state there is a X-counterpart, i.e., a corresponding two-qubit X-state of same spectrum and entanglement, as measured by concurrence, negativity or relative entropy of entanglement. By parametrizing…
An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is…
Violation of Mermin inequalities is tested on the 5-qubit IBM quantum computer. For 3, 4 and 5 parties, quantum states that violate the corresponding Mermin inequalities are constructed using quantum circuits on superconducting qubits.…
The quantum state discrimination problem is to distinguish between non-orthogonal quantum states. This problem has many applications in quantum information theory, quantum communication and quantum cryptography. In this paper a quantum…
We introduce the challenges of multi-party quantum entanglement and explain a recent success in learning to take its measure. Given the widely accepted reputation of entanglement as a counter-intuitive feature of quantum theory, we first…
Quantum steering inequalities allow to demonstrate the presence of entanglement between two parties when one of the two measurement device is not trusted. In this paper we show that quantum steering can be demonstrated for arbitrary low…
The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build…
Quantum states are the key mathematical objects in quantum mechanics, and entanglement lies at the heart of the nascent fields of quantum information processing and computation. However, there has not been a general, necessary and…
To detect frauds from some internal participants or external attackers, some verifiable threshold quantum secret sharing schemes have been proposed. In this paper, we present a new verifiable threshold structure based on a single qubit…
We consider whether quantum coherence in the form of mutual entanglement between a pair of qubits is susceptible to decay that may be more rapid than the decay of the coherence of either qubit individually. An instance of potential…
We prove that given the ability to make entangled measurements on at most $k$ replicas of an $n$-qubit state $\rho$ simultaneously, there is a property of $\rho$ which requires at least order $2^n$ measurements to learn. However, the same…