Sequential measurements, disturbance and property testing

We describe two procedures which, given access to one copy of a quantum state and a sequence of two-outcome measurements, can distinguish between the case that at least one of the measurements accepts the state with high probability, and the case that all of the measurements have low probability of acceptance. The measurements cannot simply be tried in sequence, because early measurements may disturb the state being tested. One procedure is based on a variant of Marriott-Watrous amplification. The other procedure is based on the use of a test for this disturbance, which is applied with low probability. We find a number of applications: • Quantum query complexity separations in the property testing model for testing isomorphism of functions under group actions. We give quantum algorithms for testing isomorphism, linear isomorphism and affine isomorphism of boolean functions which use exponentially fewer queries than is possible classically, and a quantum algorithm for testing graph isomorphism which uses polynomially fewer queries than the best algorithm known. • Testing properties of quantum states and operations. We show that any finite property of quantum states can be tested using a number of copies of the state which is logarithmic in the size of the property, and give a test for genuine multipartite entanglement of states of n qubits that uses O(n) copies of the state. We also show that equivalence of two unitary operations under conjugation by a unitary picked from a fixed set can be tested efficiently. This is a natural quantum generalisation of testing isomorphism of boolean functions. • Correcting an error in a result of Aaronson on de-Merlinizing quantum protocols. This result claimed that, in any one-way quantum communication protocol where two parties are assisted by an all-powerful but untrusted third party, the third party can be removed with only a modest increase in the communication cost. We give a corrected proof of a key technical lemma required for Aaronson's result.

[1]  Guoming Wang,et al.  Property testing of unitary operators , 2011, 1110.1133.

[2]  Non-Locality and Classical Communication of the Hidden Variable Theories , 2005, quant-ph/0511009.

[3]  Eldar Fischer,et al.  Testing graph isomorphism , 2006, SODA '06.

[4]  Frédéric Magniez,et al.  Quantum Testers for Hidden Group Properties , 2009, Fundam. Informaticae.

[5]  A. Harrow,et al.  Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization , 2010, JACM.

[6]  Chris Marriott,et al.  Quantum Arthur–Merlin games , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[7]  S. Aaronson.  QMA/qpoly ⊆ PSPACE/poly: De-Merlinizing Quantum Protocols , 2006 .

[8]  Mark M. Wilde,et al.  Quantum Information Theory , 2013 .

[9]  Ashley Montanaro,et al.  Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization , 2010, JACM.

[10]  Scott Aaronson,et al.  Limitations of quantum advice and one-way communication , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[11]  Mark M. Wilde,et al.  Sequential decoding of a general classical-quantum channel , 2013, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[12]  Andreas J. Winter,et al.  Coding theorem and strong converse for quantum channels , 1999, IEEE Trans. Inf. Theory.

[13]  L. Horwitz,et al.  Numerical study of zeno and anti-zeno effects in a local potential model , 1989 .

[14]  Vincent Nesme,et al.  Adversary Lower Bounds for Nonadaptive Quantum Algorithms , 2008 .

[15]  C. Lomont.  THE HIDDEN SUBGROUP PROBLEM - REVIEW AND OPEN PROBLEMS , 2004, quant-ph/0411037.

[16]  L. Fortnow,et al.  Quantum property testing , 2002, SODA '03.

[17]  Jingliang Gao.  Quantum union bounds for sequential projective measurements , 2014, 1410.5688.

[18]  Ronald de Wolf,et al.  A Survey of Quantum Property Testing , 2013, Theory Comput..

[19]  H. Nagaoka,et al.  A new proof of the channel coding theorem via hypothesis testing in quantum information theory , 2002, Proceedings IEEE International Symposium on Information Theory,.

[20]  Pranab Sen,et al.  Achieving the Han-Kobayashi inner bound for the quantum interference channel , 2011, 2012 IEEE International Symposium on Information Theory Proceedings.

[21]  Gilles Brassard,et al.  Quantum Cryptography, or Unforgeable Subway Tokens , 1982, CRYPTO.

[22]  Yakir Aharonov,et al.  Meaning of an individual "Feynman path" , 1980 .

[23]  V. Gontis,et al.  Quantum anti-Zeno effect , 1997 .

[24]  Noga Alon,et al.  Nearly tight bounds for testing function isomorphism , 2011, SODA '11.

[25]  Bill Fefferman,et al.  Space-Efficient Error Reduction for Unitary Quantum Computations , 2016, ICALP.

[26]  Elena Grigorescu,et al.  Tight Lower Bounds for Testing Linear Isomorphism , 2013, APPROX-RANDOM.

[27]  H. Bechmann-Pasquinucci,et al.  Quantum cryptography , 2001, quant-ph/0101098.

[28]  R. Cleve,et al.  Nonlocality and communication complexity , 2009, 0907.3584.

[29]  P. Goldbart,et al.  Geometric measure of entanglement and applications to bipartite and multipartite quantum states , 2003, quant-ph/0307219.

[30]  László Babai,et al.  Property Testing of Equivalence under a Permutation Group Action , 2008, Electron. Colloquium Comput. Complex..

[31]  Emanuel Knill,et al.  The quantum query complexity of the hidden subgroup problem is polynomial , 2004, Inf. Process. Lett..

[32]  Ashley Montanaro,et al.  An Efficient Test for Product States with Applications to Quantum Merlin-Arthur Games , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[33]  E. Sudarshan,et al.  Zeno's paradox in quantum theory , 1976 .

[34]  Ronald de Wolf,et al.  New Results on Quantum Property Testing , 2010, FSTTCS.

[35]  R. Cleve,et al.  Quantum fingerprinting. , 2001, Physical review letters.

[36]  Andreas J. Winter,et al.  How Many Copies are Needed for State Discrimination? , 2012, IEEE Transactions on Information Theory.