Tight Bounds for Quantum State Certification with Incoherent Measurements

04/14/2022
by   Sitan Chen, et al.
0

We consider the problem of quantum state certification, where we are given the description of a mixed state σ∈ℂ^d × d, n copies of a mixed state ρ∈ℂ^d × d, and ε > 0, and we are asked to determine whether ρ = σ or whether ρ - σ_1 > ε. When σ is the maximally mixed state 1/d I_d, this is known as mixedness testing. We focus on algorithms which use incoherent measurements, i.e. which only measure one copy of ρ at a time. Unlike those that use entangled, multi-copy measurements, these can be implemented without persistent quantum memory and thus represent a large class of protocols that can be run on current or near-term devices. For mixedness testing, there is a folklore algorithm which uses incoherent measurements and only needs O(d^3/2 / ε^2) copies. The algorithm is non-adaptive, that is, its measurements are fixed ahead of time, and is known to be optimal for non-adaptive algorithms. However, when the algorithm can make arbitrary incoherent measurements, the best known lower bound is only Ω (d^4/3 / ε^2) [Bubeck-Chen-Li '20], and it has been an outstanding open problem to close this polynomial gap. In this work, 1) we settle the copy complexity of mixedness testing with incoherent measurements and show that Ω (d^3/2 / ε^2) copies are necessary, and 2) we show the instance-optimal bounds for state certification to general σ first derived by [Chen-Li-O'Donnell '21] for non-adaptive measurements also hold for arbitrary incoherent measurements. Qualitatively, our results say that adaptivity does not help at all for these problems. Our results are based on new techniques that allow us to reduce the problem to understanding certain matrix martingales, which we believe may be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/25/2021

Toward Instance-Optimal State Certification With Incoherent Measurements

We revisit the basic problem of quantum state certification: given copie...
research
04/16/2020

Entanglement is Necessary for Optimal Quantum Property Testing

There has been a surge of progress in recent years in developing algorit...
research
06/10/2022

Tight Bounds for State Tomography with Incoherent Measurements

We consider the classic question of state tomography: given copies of an...
research
11/02/2017

Measuring Quantum Entropy

The entropy of a quantum system is a measure of its randomness, and has ...
research
04/14/2018

Summoning, No-Signaling and Relativistic Bit Commitments

Summoning is a task between two parties, Alice and Bob, with distributed...
research
06/01/2020

More Practical and Adaptive Algorithms for Online Quantum State Learning

Online quantum state learning is a recently proposed problem by Aaronson...
research
11/10/2021

A Hierarchy for Replica Quantum Advantage

We prove that given the ability to make entangled measurements on at mos...

Please sign up or login with your details

Forgot password? Click here to reset