Related papers: Self-testing high dimensional states using the gen…
We investigate complex self-testing, a generalization of standard self-testing that accounts for quantum strategies whose statistics is indistinguishable from their complex conjugate's. We show that many structural results from standard…
We introduce a simple two-player test which certifies that the players apply tensor products of Pauli $\sigma_X$ and $\sigma_Z$ observables on the tensor product of $n$ EPR pairs. The test has constant robustness: any strategy achieving…
We study the quantum separability problem by using general symmetric informationally complete measurements and present separability criteria for both $d$-dimensional bipartite and multipartite systems. The criterion for bipartite quantum…
Certifying that quantum devices behave as intended is crucial for quantum information science. Here, methods are developed for certification of both state preparation devices and measurement devices based on prepare-and-measure experiments…
When increasing the dimensionality of quantum systems, high-dimensional quantum state certification becomes important in quantum information science and technology. However, how to certify ensembles of high-dimensional quantum states in a…
We introduce a technique for applying quantum expanders in a distributed fashion, and use it to solve two basic questions: testing whether a bipartite quantum state shared by two parties is the maximally entangled state and disproving a…
Self-testing is a method to certify devices from the result of a Bell test. Although examples of noise tolerant self-testing are known, it is not clear how to deal efficiently with a finite number of experimental trials to certify the…
We consider the problem of $1$-sided device-independent self-testing of any pure entangled two-qubit state based on steering inequalities which certify the presence of quantum steering. In particular, we note that in the $2-2-2$ steering…
This paper investigates the role of interaction and coins in public-coin quantum interactive proof systems (also called quantum Arthur-Merlin games). While prior works focused on classical public coins even in the quantum setting, the…
We show that every quantum computation can be described by Bayesian update of a probability distribution on a finite state space. When applied to the model of quantum computation with magic states, the size of this state space only depends…
We consider the separability of various joint states of D-dimensional quantum systems, which we call "qudits." We derive two main results: (i) the separability condition for a two-qudit state that is a mixture of the maximally mixed state…
Self-testing is a device-independent method that usually amounts to show that the maximal quantum violation of a Bell's inequality certifies a unique quantum state, up to some symmetries inherent to the device-independent framework. In this…
Here we study multiplayer linear games, a natural generalization of XOR games to multiple outcomes. We generalize a recently proposed efficiently computable bound, in terms of the norm of a game matrix, on the quantum value of 2-player…
We propose families of protocols for magic state distillation -- important components of fault tolerance schemes --- for systems of odd prime dimension. Our protocols utilize quantum Reed-Muller codes with transversal non-Clifford gates. We…
Magic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states and plays a fundamental role from quantum state complexity to universal fault-tolerant quantum computing. However, analytical or…
We consider the problem of a state determination for a two-level quantum system which can be in one of two nonorthogonal mixed states. It is proved that for the two independent identical systems the optimal combined measurement (which…
We define generalized quantum games by introducing the coherent payoff operators and propose a simple scheme to illustrate it. The scheme is implemented with a single spin qubit system and two entangled qubit system. The Nash Equilibrium…
The certification of entanglement in multipartite scenarios is crucial for the advancement of quantum technologies, particularly for the realization of large-scale quantum networks. Here, we introduce a method to certify the structure of…
We show that thresholds for fault-tolerant quantum computation are solely determined by the quality of single-system operations if one allows for d-dimensional systems with $8 \leq d \leq 32$. Each system serves to store one logical qubit…
The onset of the era of fully-programmable error-corrected quantum computers will be marked by major breakthroughs in all areas of science and engineering. These devices promise to have significant technological and societal impact, notable…