Related papers: Perfect quantum strategies with small input cardin…
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…
In the flavour of categorical quantum mechanics, we extend nonlocal games to allow quantum questions and answers, using quantum sets (special symmetric dagger Frobenius algebras) and the quantum functions of Musto, Reutter, and Verdon…
A quantum algorithm is exact if it always produces the correct answer, on any input. Coming up with exact quantum algorithms that substantially outperform the best classical algorithm has been a quite challenging task. In this paper, we…
Following the prescription of Ref. \cite{PST} in which perfect state transference (PST) of a qubit over distance regular spin networks was discussed, in this paper PST of an arbitrary $d$-level quantum state (qudit) over antipodes of more…
Effective communication is an important skill for enabling information exchange in multi-agent settings and emergent communication is now a vibrant field of research, with common settings involving discrete cheap-talk channels. Since, by…
A new solution concept for two-player zero-sum matrix games with multi-dimensional payoff is introduced. It is based on extensions of vector orders in K-dimensional spaces to order relations in their power sets, so-called set relations, and…
We develop a semidefinite programming method for the optimization of quantum networks, including both causal networks and networks with indefinite causal structure. Our method applies to a broad class of performance measures, defined…
Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player-two…
We consider the problem of determining the mixed quantum state of a large but finite number of identically prepared quantum systems from data obtained in a sequence of ideal (von Neumann) measurements, each performed on an individual copy…
We introduce novel upper bounds on the Hilbert space dimensions required to realize quantum correlations in Bell scenarios. We start by considering bipartite cases wherein one of the two parties has two settings and two outcomes. Regardless…
We consider a combinatorial question about searching for an unknown ideal $\mu$ within a known poset $\lambda$. Elements of $\lambda$ may be queried for membership in $\mu$, but at most $k$ positive query results are permitted. The goal is…
We define memory-efficient certificates for $\mu$-calculus model checking problems based on the well-known correspondence of the $\mu$-calculus model checking with winning certain parity games. Winning strategies can independently checked,…
One of the fundamental results in quantum foundations is the Kochen-Specker (KS) theorem, which states that any theory whose predictions agree with quantum mechanics must be contextual, i.e., a quantum observation cannot be understood as…
We present in this paper that the CHSH game admits one and only one optimal state and so remove all ambiguity of representations. More precisely, we use the well-known universal description of quantum commuting correlations as state space…
We study the computational complexity of computing or approximating a quasi-proper equilibrium for a given finite extensive form game of perfect recall. We show that the task of computing a symbolic quasi-proper equilibrium is…
We study the discrimination of multipartite quantum states by local operations and classical communication. We derive that any optimal discrimination of quantum states spanning a two-dimensional Hilbert space in which each party's space is…
We consider a scenario where we wish to bring a closed system of known Hilbert space dimension $d_S$ (the target), subject to an unknown Hamiltonian evolution, back to its quantum state at a past time $t_0$. The target is out of our…
Stackelberg equilibrium is a solution concept that describes optimal strategies to commit: Player 1 (the leader) first commits to a strategy that is publicly announced, then Player 2 (the follower) plays a best response to the leader's…
A correlated equilibrium is a fundamental solution concept in game theory that enjoys many desirable properties. However, it requires a trusted mediator, which is a major drawback in many practical applications. A computational solution to…
Most quantum processors requires pulse sequences for controlling quantum states. Here, we present an alternative algorithm for computing an optimal pulse sequence in order to perform a specific task, being an implementation of a quantum…