Related papers: Quantum de Finetti Theorems under Local Measuremen…
We give an algorithm for solving unique games (UG) instances whenever low-degree sum-of-squares proofs certify good bounds on the small-set-expansion of the underlying constraint graph via a hypercontractive inequality. Our algorithm is in…
We report a cluster of results regarding the difficulty of finding approximate ground states to typical instances of the quantum satisfiability problem $k$-QSAT on large random graphs. As an approximation strategy, we optimize the solution…
In a model of fault-tolerant quantum computation with quick and noiseless polyloglog-time auxiliary classical computation, we construct a fault tolerance protocol with constant-space and $\widetilde{O}(\log N)$-time overhead, where…
A new finite form of de Finetti's representation theorem is established using elementary information-theoretic tools. The distribution of the first $k$ random variables in an exchangeable vector of $n\geq k$ random variables is close to a…
It is known that quantum correlations exhibited by a maximally entangled qubit pair can be simulated with the help of shared randomness, supplemented with additional resources, such as communication, post-selection or non-local boxes. For…
In recent years, the use of information principles to understand quantum correlations has been very successful. Unfortunately, all principles considered so far have a bipartite formulation, but intrinsically multipartite principles, yet to…
Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum computer (Quantum Mechanical Computers, Richard P. Feynman, Foundations of Physics, Vol. 16, No. 6, p597-531, 1986). Feynman's answer…
We propose a general method for studying properties of quantum channels acting on an n-partite system, whose action is invariant under permutations of the subsystems. Our main result is that, in order to prove that a certain property holds…
Random local measurements have recently been proposed to construct entanglement witnesses and thereby detect the presence of bipartite entanglement. We experimentally demonstrate the efficacy of one such scheme on a two-qubit NMR quantum…
Estimation of local quantum fields is a crucial aspect of quantum metrology applications, and often also forms the test-bed to analyze the utility of quantum resources, like entanglement. However, so far, this has been analyzed using the…
Quantum pseudotelepathy is a strong form of nonlocality. Different from the conventional non-local games where quantum strategies win statistically, e.g., the Clauser-Horne-Shimony-Holt game, quantum pseudotelepathy in principle allows…
Quantum metrology protocols are typically designed around the assumption that we have an abundance of measurement data, but recent practical applications are increasingly driving interest in cases with very limited data. In this regime the…
Uncertainty principle is an inherent nature of quantum system that undermines the precise measurement of incompatible observables and hence the applications of quantum theory. Entanglement, another unique feature of quantum physics, was…
Local search algorithms use the neighborhood relations among search states and often perform well for a variety of NP-hard combinatorial search problems. This paper shows how quantum computers can also use these neighborhood relations. An…
Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, often utilizing graph states, a specific class of multipartite…
This paper considers the decidability of fully quantum nonlocal games with noisy maximally entangled states. Fully quantum nonlocal games are a generalization of nonlocal games, where both questions and answers are quantum and the referee…
For two symmetric quantum states one may be interested in maximizing the overlap under local operations applied to one of them. The question arises whether the maximal overlap can be obtained by applying the same local operation to each…
We study the estimation of the overlap between two unknown pure quantum states of a finite dimensional system, given $M$ and $N$ copies of each type. This is a fundamental primitive in quantum information processing that is commonly…
Entanglement does not correspond to any observable and its evaluation always corresponds to an estimation procedure where the amount of entanglement is inferred from the measurements of one or more proper observables. Here we address…
Proving the unconditional security of a quantum key distribution (QKD) scheme is a highly challenging task as one needs to determine the most efficient attack compatible with experimental data. This task is even more demanding for…