We study the task of estimating a $d-$dimensional quantum state $\rho$ under the constraint that the measurement is $\alpha-$gentle. Such measurements $M$ do not collapse the state; they issue both a random variable $R^M = \omega$ containing statistical information and a post-measurement state $\rho_{M \to \omega}$ such that $\|\rho_{M\to \omega} - \rho\|_{Tr} \leq \alpha$. We describe gentle measurements and their connection to quantum differential privacy. Our results show that the optimal minimax estimation rate in Frobenius norm is of order $d^3/(n \alpha^2)$, instead of $d^2/n$ for general measurements. Moreover, for rank $r$ states with $r\leq d$ we prove that the optimal minimax rate is $rd^2/(n \alpha^2)$, instead of $rd/n$. Very surprisingly, the loss for gentleness $d/\alpha^2$ scales with the ambient dimension of the Hilbert space, rather than the number of parameters $rd$, typically seen in classical differential privacy. We propose optimal gentle measurements and indicate how they can be physically implemented using an ancillary state and a CNOT gate to entangle it with the initial state. We notice that the resulting random variable has a likelihood that satisfies local differential privacy. Lower bounds are proven through a new quantum information-theoretic inequality applied to well chosen families of states in the manifold of (small-rank) quantum states.
We consider a fundamental problem of \emph{mixedness testing}: Given $n$ copies of an $N$-qubit state $\rho$, determine whether $\rho = \mathbb{I}_d/d$ or $\|\rho-\mathbb{I}_d/d\|_1 \geq \varepsilon$ with high probability, where $d = 2^N$. In particular, we focus on performing this task in the practical setting of sing...
Jayadev Acharya, Abhilash Dharmavarapu, Yu-Han Liu et al.· 1 citation
We prove that, for an $n$-qubit system of dimension $d=2^n$, every state satisfying $\operatorname{Tr}(\rho^2)\le 1/(d-a_\ast)$, with $a_\ast=0.458327\cdots$, lies inside the stabilizer polytope and is therefore magic-free. Combining this result with general geometric properties of high-dimensional polytopes, we establ...
We determine the optimal sample complexity of low-rank quantum state tomography when each measurement may act jointly on at most $t$ samples. For sufficiently small $\varepsilon$, estimating an unknown state on $\mathbb{C}^d$ of rank at most $r$ to trace norm error $\varepsilon$ with constant success probability requir...
We give collective tomography protocols for quantum states and channels with known symmetries, using random purification and dilation to reduce learning to pure-state estimation. For states commuting with a compact-group representation with multiplicities $m_\lambda$, the optimal copy complexity is $\Theta((\sum_\lambd...
Satoshi Yoshida, K. Okigami, P. M. Posta et al.· 0 citations
We prove the first quantum-classical separation for a sampling problem over a continuous domain. For a class of Gibbs states $p\propto e^{-\beta E}$ on the torus $\mathbb{T}^d$ with smooth ($s$-Gevrey) potential and barrier amplitude $\alpha=e^{\beta\Delta}$, where $\Delta = \max E-\min E$, every classical algorithm qu...
Enrico Olivucci, Mariia Sobchuk, Sehmimul Hoque et al.· 1 citation
Estimating nonlinear properties of an unknown quantum state with restrictive experimental accessibility is a fundamental problem in quantum learning. We study the sample complexity of estimating the state moments $\operatorname{Tr}(\rho^t)$, allowing arbitrary adaptive single-copy measurements. While purity estimation...
Zhen-Huan Liu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.