Related papers: Robust self-testing of many-qubit states
Among various multipartite entangled states, Dicke states stand out because their entanglement is maximally persistent and robust under particle losses. Although much attention has been attracted for their potential applications in quantum…
The rapid growth in size of quantum devices demands efficient ways to control them, which is challenging for systems with thousands of qubits or more. Here, we present a simple yet powerful solution: robust, site-dependent control of an…
We study the quantum moment problem: Given a conditional probability distribution together with some polynomial constraints, does there exist a quantum state rho and a collection of measurement operators such that (i) the probability of…
We show that any language in nondeterministic time $\exp(\exp(\cdots \exp(n)))$, where the number of iterated exponentials is an arbitrary function $R(n)$, can be decided by a multiprover interactive proof system with a classical…
We present a strong parallel repetition theorem for the entangled value of multi-player, one-round free games (games where the inputs come from a product distribution). Our result is the first parallel repetition theorem for entangled games…
We consider two-player stochastic games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously;…
We study linear quadratic dynamic games where players are uncertain about each other's control policies or goals and consequently seek to be strategically robust. Building on recent work on strategically robust and risk-averse game theory,…
Effective spin-spin interactions between N+1 qubits enable the determination of the eigenvalue of an arbitrary Pauli product of dimension N with a constant, small number of multi-qubit gates that is independent of N and encodes the…
In a recent paper [Quantum 5, 552 (2021)], the authors proposed a framework for robustly self-testing steerable quantum assemblages. In this work, we apply their method to the scenario of self-testing two-qubit entangled quantum states. The…
This paper introduces quantum multiparty protocols which allow the use of temporary assumptions. We prove that secure quantum multiparty computations are possible if and only if classical multi party computations work. But these strict…
We study strategic interaction in data-driven games where players face uncertainty about payoff distributions inferred from finite samples. To model calibrated attitudes toward such uncertainty, we formulate distributionally robust games…
Secure multi-party computing, also called "secure function evaluation", has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are…
Games involving quantum strategies often yield higher payoff. Here, we study a practical realization of the three-player dilemma game using the superconductivity-based quantum processors provided by IBM Q Experience. We analyze the…
Compiling Bell games under cryptographic assumptions replaces the need for physical separation, allowing nonlocality to be probed with a single untrusted device. While Kalai et al. (STOC'23) showed that this compilation preserves quantum…
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently propose a time delay and an action, and the action with the…
An approach towards quantum games is proposed that uses the unusual probabilities involved in EPR-type experiments directly in two-player games.
We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation. We achieve this by constructing a measurement protocol, which enables a classical verifier to use a quantum…
The recognition of entanglement states is a notoriously difficult problem when no prior information is available. Here, we propose an efficient quantum adversarial bipartite entanglement detection scheme to address this issue. Our proposal…
A protocol is proposed to generate singlet states of three logical qubits constructed by pairs of spins. Single and multiple operations of logical qubits are studied for the construction of an effective Hamiltonian, with which robust…
We prove that a sufficiently strong parallel repetition theorem for a special case of multiplayer (multiprover) games implies super-linear lower bounds for multi-tape Turing machines with advice. To the best of our knowledge, this is the…