Related papers: Perfect quantum strategies with small input cardin…
We present a systematic, constructive analysis of Kochen-Specker contextuality, emphasizing the foundational importance of complete orthogonal bases (contexts). First, in three dimensions, we generate a complete inventory of 165 rays and…
We suggest a protocol for perfect quantum communication through spin chain channels. By combining a dual-rail encoding with measurements only at the receiving end, we can get conclusively perfect state transfer, whose probability of success…
A pure quantum state of N subsystems with d levels each is called k-multipartite maximally entangled state, written k-uniform, if all its reductions to k qudits are maximally mixed. These states form a natural generalization of N-qudits GHZ…
Projection games constitute an important class of nonlocal games where, for any answer from the first player, there is a unique correct answer for the second player. This class of games captures nonlocal games arising from constraint…
The security of a passive plug-and-play QKD arrangement in the case of finite (resources) key lengths is analysed. It is assumed that the eavesdropper has full access to the channel so an unknown and untrusted source is assumed. To take…
In this paper, we address the problem of designing a quantum encoder that maximizes the minimum output purity of a given decohering channel, where the minimum is taken over all possible pure inputs. This problem is cast as a max-min…
A class of optimal quantum repeaters for qubits is suggested. The schemes are minimal, i.e. involve a single additional probe qubit, and optimal, i.e. provide the maximum information adding the minimum amount of noise. Information gain and…
Perfect tensors are the tensors corresponding to the absolutely maximally entangled states, a special type of quantum states of interest in quantum information theory. We establish a method to compute parameterized families of perfect…
We analyse two party non-local games whose predicate requires Alice and Bob to generate matching bits, and their three party extensions where a third player receives all inputs and is required to output a bit that matches that of the…
A Bayesian player acting in an infinite multi-player game learns to predict the other players' strategies if his prior assigns positive probability to their play (or contains a grain of truth). Kalai and Lehrer's classic grain of truth…
This work considers a generalization of Grover's search problem, viz., to find any one element in a set of acceptable choices which constitute a fraction f of the total number of choices in an unsorted data base. An infinite family of…
A fundamental question asks how uniformly finite sets of pure quantum states can be distributed in a Hilbert space. The Welch bounds address this question, and are saturated by $k$-designs, i.e. sets of states reproducing the $k$-th Haar…
We consider the problem of optimally identifying the state of a probe qudit, prepared with given prior probability in a pure state belonging to a finite set of possible states which together span a D-dimensional subspace of the…
We characterize optimality of Quantum strategies for the Odd-Cycle game. Separate from other game-theoretic settings, parallel repetition for the Odd-Cycle game is related to the foam problem, which can be formulated through a minimization…
The complexity of computing equilibrium refinements has been at the forefront of algorithmic game theory research, but it has remained open in the seminal class of potential games; we close this fundamental gap in this paper. We first show…
The perfect quantum strategies of a linear system game correspond to certain representations of its solution group. We study the solution groups of graph incidence games, which are linear system games in which the underlying linear system…
A transformation method is applied to the second order ordinary differential equation satisfied by orthogonal polynomials to construct a family of exactly solvable quantum systems in any arbitrary dimensional space. Using the properties of…
We present a classical algorithm that, for any $D$-dimensional geometrically-local, quantum circuit $C$ of polylogarithmic-depth, and any bit string $x \in {0,1}^n$, can compute the quantity $|<x|C|0^{\otimes n}>|^2$ to within any…
This paper introduces two information-theoretically secure protocols that achieve quantum secure direct communication between Alice and Bob in the first case, and among Alice, Bod and Charlie in the second case. Both protocols use the same…
Here we consider perfect entanglers from another perspective. It is shown that there are some {\em special} perfect entanglers which can maximally entangle a {\em full} product basis. We have explicitly constructed a one-parameter family of…