Related papers: Sphere Valued Noise Stability and Quantum MAX-CUT …
Real quantum computers will be subject to complicated, qubit-dependent noise, instead of simple noise such as depolarizing noise with the same strength for all qubits. We can do quantum error correction more effectively if our decoding…
We summarise important recent advances in quantum metrology, in connection to experiments in cold gases, trapped cold atoms and photons. First we review simple metrological setups, such as quantum metrology with spin squeezed states, with…
We investigate the complexity of solving stable or perturbation-resilient instances of $k$-Means and $k$-Median clustering in fixed dimension Euclidean metrics (more generally doubling metrics). The notion of stable (perturbation resilient)…
Representing multi-mode squeezed light with a Gaussian random vector, our locally deterministic detection model challenges the CHSH game, achieving fidelities exceeding 96\%. Squeezing strength, detector threshold, and efficiency influence…
We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…
We address the characterization of classical fractional random noise via quantum probes. In particular, we focus on estimation and discrimination problems involving the fractal dimension of the trajectories of a system subject to fractional…
After the NP-hardness of computational problems such as 3SAT and MaxCut was established, a natural next step was to explore whether these problems remain hard to approximate. While the quantum extensions of some of these problems are known…
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We compare several different possible definitions. Our main…
Information-theoretic definitions for the noise associated with a quantum measurement and the corresponding disturbance to the state of the system have recently been introduced [F. Buscemi et al., Phys. Rev. Lett. 112, 050401 (2014)]. These…
The Max-Cut problem is a fundamental NP-hard problem, which is attracting attention in the field of quantum computation these days. Regarding the approximation algorithm of the Max-Cut problem, algorithms based on semidefinite programming…
We show a relation, based on parallel repetition of the Magic Square game, that can be solved, with probability exponentially close to $1$ (worst-case input), by $1D$ (uniform) depth $2$, geometrically-local, noisy (noise below a…
We witness experimentally the presence of macroscopic coherence in Gaussian quantum states using a recently proposed criterion (E.G. Cavalcanti and M. Reid, Phys. Rev. Lett. 97, 170405 (2006)). The macroscopic coherence stems from…
The ability of a quantum computer to reproduce or replicate the results of a quantum circuit is a key concern for verifying and validating applications of quantum computing. Statistical variations in circuit outcomes that arise from…
We propose a safe approximation to joint chance-constrained programming where the constraint functions are additively dependent on a normally-distributed random vector. The approximation is analytical, meaning that it requires neither…
The Born rule provides a probability vector (distribution) with a quantum state for a measurement setting. For two settings, we have a pair of vectors from the same quantum state. Each pair forms a combined-probability vector that obeys…
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an approximation factor better than 1/2. Moreover, for the k-player…
It is shown that $3$ disjoint sets with fixed Gaussian volumes that partition $\mathbb{R}^{n}$ with nearly minimum total Gaussian surface area must be close to adjacent $120$ degree sectors, when $n\geq2$. These same results hold for any…
The impact of measurement imperfections on quantum metrology protocols has not been approached in a systematic manner so far. In this work, we tackle this issue by generalising firstly the notion of quantum Fisher information to account for…
We prove limit equalities between the sharp constants in weighted Nikolskii-type inequalities for multivariate polynomials on an $m$-dimensional cube and ball and the corresponding constants for entire functions of exponential type.
A quantum computer -- i.e., a computer capable of manipulating data in quantum superposition -- would find applications including factoring, quantum simulation and tests of basic quantum theory. Since quantum superpositions are fragile, the…