DeepAI AI Chat
Log In Sign Up

A Hierarchy for Replica Quantum Advantage

11/10/2021
by   Sitan Chen, et al.
Microsoft
Harvard University
berkeley college
California Institute of Technology
0

We prove that given the ability to make entangled measurements on at most k replicas of an n-qubit state ρ simultaneously, there is a property of ρ which requires at least order 2^n measurements to learn. However, the same property only requires one measurement to learn if we can make an entangled measurement over a number of replicas polynomial in k, n. Because the above holds for each positive integer k, we obtain a hierarchy of tasks necessitating progressively more replicas to be performed efficiently. We introduce a powerful proof technique to establish our results, and also use this to provide new bounds for testing the mixedness of a quantum state.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/26/2021

Optimal Simulation of Quantum Measurements via the Likelihood POVMs

We provide a new and simplified proof of Winter's measurement compressio...
10/17/2022

Quantum Event Learning and Gentle Random Measurements

We prove the expected disturbance caused to a quantum system by a sequen...
05/01/2019

Dense Quantum Measurement Theory

Quantum measurement is a fundamental cornerstone of experimental quantum...
05/28/2018

Quantum generalizations of the polynomial hierarchy with applications to QMA(2)

The polynomial-time hierarchy (PH) has proven to be a powerful tool for ...
04/14/2022

Tight Bounds for Quantum State Certification with Incoherent Measurements

We consider the problem of quantum state certification, where we are giv...
11/16/2021

The Lovász Local Lemma is Not About Probability

Given a collection of independent events each of which has strictly posi...
10/13/2021

The Complexity of Bipartite Gaussian Boson Sampling

Gaussian boson sampling is a model of photonic quantum computing that ha...