02093nas a2200145 4500008004100000245008200041210006900123260001500192490000800207520163800215100002101853700002101874700001501895856003701910 2019 eng d00aLimitations of semidefinite programs for separable states and entangled games0 aLimitations of semidefinite programs for separable states and en c03/04/20190 v3663 a

Semidefinite programs (SDPs) are a framework for exact or approximate optimization that have widespread application in quantum information theory. We introduce a new method for using reductions to construct integrality gaps for SDPs. These are based on new limitations on the sum-of-squares (SoS) hierarchy in approximating two particularly important sets in quantum information theory, where previously no ω(1)-round integrality gaps were known: the set of separable (i.e. unentangled) states, or equivalently, the 2→4 norm of a matrix, and the set of quantum correlations; i.e. conditional probability distributions achievable with local measurements on a shared entangled state. In both cases no-go theorems were previously known based on computational assumptions such as the Exponential Time Hypothesis (ETH) which asserts that 3-SAT requires exponential time to solve. Our unconditional results achieve the same parameters as all of these previous results (for separable states) or as some of the previous results (for quantum correlations). In some cases we can make use of the framework of Lee-Raghavendra-Steurer (LRS) to establish integrality gaps for any SDP, not only the SoS hierarchy. Our hardness result on separable states also yields a dimension lower bound of approximate disentanglers, answering a question of Watrous and Aaronson et al. These results can be viewed as limitations on the monogamy principle, the PPT test, the ability of Tsirelson-type bounds to restrict quantum correlations, as well as the SDP hierarchies of Doherty-Parrilo-Spedalieri, Navascues-Pironio-Acin and Berta-Fawzi-Scholz.

1 aHarrow, Aram, W.1 aNatarajan, Anand1 aWu, Xiaodi uhttps://arxiv.org/abs/1612.0930602574nas a2200313 4500008004100000245006200041210006200103260001500165520165200180100002401832700002201856700002001878700002201898700002001920700002701940700002201967700002401989700001802013700002102031700002102052700001702073700003102090700001902121700002002140700001902160700002302179700002102202856003702223 2019 eng d00aQuantum Computing at the Frontiers of Biological Sciences0 aQuantum Computing at the Frontiers of Biological Sciences c2019/11/163 a

The search for meaningful structure in biological data has relied on cutting-edge advances in computational technology and data science methods. However, challenges arise as we push the limits of scale and complexity in biological problems. Innovation in massively parallel, classical computing hardware and algorithms continues to address many of these challenges, but there is a need to simultaneously consider new paradigms to circumvent current barriers to processing speed. Accordingly, we articulate a view towards quantum computation and quantum information science, where algorithms have demonstrated potential polynomial and exponential computational speedups in certain applications, such as machine learning. The maturation of the field of quantum computing, in hardware and algorithm development, also coincides with the growth of several collaborative efforts to address questions across length and time scales, and scientific disciplines. We use this coincidence to explore the potential for quantum computing to aid in one such endeavor: the merging of insights from genetics, genomics, neuroimaging and behavioral phenotyping. By examining joint opportunities for computational innovation across fields, we highlight the need for a common language between biological data analysis and quantum computing. Ultimately, we consider current and future prospects for the employment of quantum computing algorithms in the biological sciences. 

1 aEmani, Prashant, S.1 aWarrell, Jonathan1 aAnticevic, Alan1 aBekiranov, Stefan1 aGandal, Michael1 aMcConnell, Michael, J.1 aSapiro, Guillermo1 aAspuru-Guzik, Alán1 aBaker, Justin1 aBastiani, Matteo1 aMcClure, Patrick1 aMurray, John1 aSotiropoulos, Stamatios, N1 aTaylor, J., M.1 aSenthil, Geetha1 aLehner, Thomas1 aGerstein, Mark, B.1 aHarrow, Aram, W. uhttps://arxiv.org/abs/1911.0712702412nas a2200145 4500008004100000245006200041210006100103260001500164300001400179520194800193100002102141700002402162700002202186856005802208 2017 eng d00aSequential measurements, disturbance and property testing0 aSequential measurements disturbance and property testing c2017/01/01 a1598-16113 a

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. First, 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. Second, 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. Third, 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 aHarrow, Aram, W.1 aLin, Cedric, Yen-Yu1 aMontanaro, Ashley uhttp://epubs.siam.org/doi/10.1137/1.9781611974782.10501232nas a2200157 4500008004100000245005300041210005300094260001500147490000800162520078900170100001800959700002100977700002100998700001801019856003701037 2011 eng d00aEntanglement can completely defeat quantum noise0 aEntanglement can completely defeat quantum noise c2011/12/150 v1073 a We describe two quantum channels that individually cannot send any information, even classical, without some chance of decoding error. But together a single use of each channel can send quantum information perfectly reliably. This proves that the zero-error classical capacity exhibits superactivation, the extreme form of the superadditivity phenomenon in which entangled inputs allow communication over zero capacity channels. But our result is stronger still, as it even allows zero-error quantum communication when the two channels are combined. Thus our result shows a new remarkable way in which entanglement across two systems can be used to resist noise, in this case perfectly. We also show a new form of superactivation by entanglement shared between sender and receiver. 1 aChen, Jianxin1 aCubitt, Toby, S.1 aHarrow, Aram, W.1 aSmith, Graeme uhttp://arxiv.org/abs/1109.0540v101195nas a2200157 4500008004100000245009000041210006900131260001500200300001600215490000700231520070200238100002100940700001800961700002100979856003701000 2011 eng d00aSuperactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel0 aSuperactivation of the Asymptotic ZeroError Classical Capacity o c2011/12/01 a8114 - 81260 v573 a The zero-error classical capacity of a quantum channel is the asymptotic rate at which it can be used to send classical bits perfectly, so that they can be decoded with zero probability of error. We show that there exist pairs of quantum channels, neither of which individually have any zero-error capacity whatsoever (even if arbitrarily many uses of the channels are available), but such that access to even a single copy of both channels allows classical information to be sent perfectly reliably. In other words, we prove that the zero-error classical capacity can be superactivated. This result is the first example of superactivation of a classical capacity of a quantum channel. 1 aCubitt, Toby, S.1 aChen, Jianxin1 aHarrow, Aram, W. uhttp://arxiv.org/abs/0906.2547v301297nas a2200133 4500008004100000245009900041210006900140260001500209520083300224100002301057700002101080700001801101856004401119 2006 eng d00aWeak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem 0 aWeak FourierSchur sampling the hidden subgroup problem and the q c2006/09/143 a Schur duality decomposes many copies of a quantum state into subspaces labeled by partitions, a decomposition with applications throughout quantum information theory. Here we consider applying Schur duality to the problem of distinguishing coset states in the standard approach to the hidden subgroup problem. We observe that simply measuring the partition (a procedure we call weak Schur sampling) provides very little information about the hidden subgroup. Furthermore, we show that under quite general assumptions, even a combination of weak Fourier sampling and weak Schur sampling fails to identify the hidden subgroup. We also prove tight bounds on how many coset states are required to solve the hidden subgroup problem by weak Schur sampling, and we relate this question to a quantum version of the collision problem. 1 aChilds, Andrew, M.1 aHarrow, Aram, W.1 aWocjan, Pawel uhttp://arxiv.org/abs/quant-ph/0609110v1