Add to ORKGA language L has a property tester if there exists a probabilistic algorithm that given an input x only asks a small number of bits of x and distinguishes the cases as to whether x is in L and x has large Hamming distance from all y in L. We define a similar notion of quantum property testing and show that there exist languages with quantum property testers but no good classical testers. We also show there exist languages which require a large number of queries even for quantumly testing
We describe two procedures which, given access to one copy of a quantum state and a sequence of two-...
Recently Brakerski, Christiano, Mahadev, Vazirani and Vidick (FOCS 2018) have shown how to construct...
In this paper, we present a few simple constructions of quantum locally testable codes that achieve ...
A language $L$ has a property tester if there exists a probabilistic algorithm that given an input $...
The area of property testing tries to design algorithms that can efficiently handle very large amou...
The area of property testing tries to design algorithms that can efficiently handle very large amoun...
The area of property testing tries to design algorithms that can efficiently handle very large amoun...
We present several new examples of speed-ups obtainable by quantum algorithms in the context of prop...
We initiate the systematic study of QMA algorithms in the setting of property testing, to which we r...
We study unitary property testing, where a quantum algorithm is given query access to a black-box un...
We study how the choices made when designing an oracle affect the complexity of quantum property tes...
Suppose one has access to oracles generating samples from two unknown probability distributions $p$ ...
A fundamental problem in statistics and learning theory is to test properties of distributions. We s...
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover...
A fundamental problem in statistics and learning theory is to test properties of distributions. We s...
We describe two procedures which, given access to one copy of a quantum state and a sequence of two-...
Recently Brakerski, Christiano, Mahadev, Vazirani and Vidick (FOCS 2018) have shown how to construct...
In this paper, we present a few simple constructions of quantum locally testable codes that achieve ...
A language $L$ has a property tester if there exists a probabilistic algorithm that given an input $...
The area of property testing tries to design algorithms that can efficiently handle very large amou...
The area of property testing tries to design algorithms that can efficiently handle very large amoun...
The area of property testing tries to design algorithms that can efficiently handle very large amoun...
We present several new examples of speed-ups obtainable by quantum algorithms in the context of prop...
We initiate the systematic study of QMA algorithms in the setting of property testing, to which we r...
We study unitary property testing, where a quantum algorithm is given query access to a black-box un...
We study how the choices made when designing an oracle affect the complexity of quantum property tes...
Suppose one has access to oracles generating samples from two unknown probability distributions $p$ ...
A fundamental problem in statistics and learning theory is to test properties of distributions. We s...
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover...
A fundamental problem in statistics and learning theory is to test properties of distributions. We s...
We describe two procedures which, given access to one copy of a quantum state and a sequence of two-...
Recently Brakerski, Christiano, Mahadev, Vazirani and Vidick (FOCS 2018) have shown how to construct...
In this paper, we present a few simple constructions of quantum locally testable codes that achieve ...