Signatures of non-classicality in mixed-state quantum computation

We investigate signatures of non-classicality in quantum states, in particular, those involved in the DQC1 model of mixed-state quantum computation [Phys. Rev. Lett. 81, 5672 (1998)]. To do so, we consider two known non-classicality criteria. The first quantifies disturbance of a quantum state under locally noneffective unitary operations (LNU), which are local unitaries acting invariantly on a subsystem. The second quantifies measurement induced disturbance (MID) in the eigenbasis of the reduced density matrices. We study the role of both figures of non-classicality in the exponential speedup of the DQC1 model and compare them vis-a-vis the interpretation provided in terms of quantum discord. In particular, we prove that a non-zero quantum discord implies a non-zero shift under LNUs. We also use the MID measure to study the locking of classical correlations [Phys. Rev. Lett. 92, 067902 (2004)] using two mutually unbiased bases (MUB). We find the MID measure to exactly correspond to the number of locked bits of correlation. For three or more MUBs, it predicts the possibility of superior locking effects.Comment: Published version, containing additional discussion on the role of non-classicality in the locking of classical correlation

Quantifying nonclassicality: global impact of local unitary evolutions

We show that only those composite quantum systems possessing nonvanishing quantum correlations have the property that any nontrivial local unitary evolution changes their global state. We derive the exact relation between the global state change induced by local unitary evolutions and the amount of quantum correlations. We prove that the minimal change coincides with the geometric measure of discord (defined via the Hilbert- Schmidt norm), thus providing the latter with an operational interpretation in terms of the capability of a local unitary dynamics to modify a global state. We establish that two-qubit Werner states are maximally quantum correlated, and are thus the ones that maximize this type of global quantum effect. Finally, we show that similar results hold when replacing the Hilbert-Schmidt norm with the trace norm.Comment: 5 pages, 1 figure. To appear in Physical Review

On quantum mean-field models and their quantum annealing

This paper deals with fully-connected mean-field models of quantum spins with p-body ferromagnetic interactions and a transverse field. For p=2 this corresponds to the quantum Curie-Weiss model (a special case of the Lipkin-Meshkov-Glick model) which exhibits a second-order phase transition, while for p>2 the transition is first order. We provide a refined analytical description both of the static and of the dynamic properties of these models. In particular we obtain analytically the exponential rate of decay of the gap at the first-order transition. We also study the slow annealing from the pure transverse field to the pure ferromagnet (and vice versa) and discuss the effect of the first-order transition and of the spinodal limit of metastability on the residual excitation energy, both for finite and exponentially divergent annealing times. In the quantum computation perspective this quantity would assess the efficiency of the quantum adiabatic procedure as an approximation algorithm.Comment: 44 pages, 23 figure

The Complexity of Translationally Invariant Problems beyond Ground State Energies

It is known that three fundamental questions regarding local Hamiltonians -- approximating the ground state energy (the Local Hamiltonian problem), simulating local measurements on the ground space (APX-SIM), and deciding if the low energy space has an energy barrier (GSCON) -- are $\mathsf{QMA}$-hard, $\mathsf{P}^{\mathsf{QMA}[log]}$-hard and $\mathsf{QCMA}$-hard, respectively, meaning they are likely intractable even on a quantum computer. Yet while hardness for the Local Hamiltonian problem is known to hold even for translationally-invariant systems, it is not yet known whether APX-SIM and GSCON remain hard in such "simple" systems. In this work, we show that the translationally invariant versions of both APX-SIM and GSCON remain intractable, namely are $\mathsf{P}^{\mathsf{QMA}_{\mathsf{EXP}}}$- and $\mathsf{QCMA}_{\mathsf{EXP}}$-complete, respectively. Each of these results is attained by giving a respective generic "lifting theorem" for producing hardness results. For APX-SIM, for example, we give a framework for "lifting" any abstract local circuit-to-Hamiltonian mapping $H$ (satisfying mild assumptions) to hardness of APX-SIM on the family of Hamiltonians produced by $H$, while preserving the structural and geometric properties of $H$ (e.g. translation invariance, geometry, locality, etc). Each result also leverages counterintuitive properties of our constructions: for APX-SIM, we "compress" the answers to polynomially many parallel queries to a QMA oracle into a single qubit. For GSCON, we give a hardness construction robust against highly non-local unitaries, i.e. even if the adversary acts on all but one qudit in the system in each step.Comment: 58 pages, 4 figure

The Complexity of Translationally Invariant Problems Beyond Ground State Energies

The physically motivated quantum generalisation of k-SAT, the k-Local Hamiltonian (k-LH) problem, is well-known to be QMA-complete ("quantum NP"-complete). What is surprising, however, is that while the former is easy on 1D Boolean formulae, the latter remains hard on 1D local Hamiltonians, even if all constraints are identical [Gottesman, Irani, FOCS 2009]. Such "translation-invariant" systems are much closer in structure to what one might see in Nature. Moving beyond k-LH, what is often more physically interesting is the computation of properties of the ground space (i.e. "solution space") itself. In this work, we focus on two such recent problems: Simulating local measurements on the ground space (APX-SIM, analogous to computing properties of optimal solutions to MAX-SAT formulae) [Ambainis, CCC 2014], and deciding if the low energy space has an energy barrier (GSCON, analogous to classical reconfiguration problems) [Gharibian, Sikora, ICALP 2015]. These problems are known to be P^{QMA[log]}- and QCMA-complete, respectively, in the general case. Yet, to date, it is not known whether they remain hard in such simple 1D translationally invariant systems. In this work, we show that the 1D translationally invariant versions of both APX-SIM and GSCON are intractable, namely are P^{QMA_{EXP}}- and QCMA^{EXP}-complete ("quantum P^{NEXP}" and "quantum NEXP"), respectively. Each of these results is attained by giving a respective generic "lifting theorem". For APX-SIM we give a framework for lifting any abstract local circuit-to-Hamiltonian mapping H satisfying mild assumptions to hardness of APX-SIM on the family of Hamiltonians produced by H, while preserving the structural properties of H (e.g. translation invariance, geometry, locality, etc). Each result also leverages counterintuitive properties of our constructions: for APX-SIM, we compress the answers to polynomially many parallel queries to a QMA oracle into a single qubit. For GSCON, we show strong robustness, i.e. soundness even against adversaries acting on all but a single qudit in the system

Faithful Squashed Entanglement

Squashed entanglement is a measure for the entanglement of bipartite quantum states. In this paper we present a lower bound for squashed entanglement in terms of a distance to the set of separable states. This implies that squashed entanglement is faithful, that is, strictly positive if and only if the state is entangled. We derive the bound on squashed entanglement from a bound on quantum conditional mutual information, which is used to define squashed entanglement and corresponds to the amount by which strong subadditivity of von Neumann entropy fails to be saturated. Our result therefore sheds light on the structure of states that almost satisfy strong subadditivity with equality. The proof is based on two recent results from quantum information theory: the operational interpretation of the quantum mutual information as the optimal rate for state redistribution and the interpretation of the regularised relative entropy of entanglement as an error exponent in hypothesis testing. The distance to the set of separable states is measured by the one-way LOCC norm, an operationally-motivated norm giving the optimal probability of distinguishing two bipartite quantum states, each shared by two parties, using any protocol formed by local quantum operations and one-directional classical communication between the parties. A similar result for the Frobenius or Euclidean norm follows immediately. The result has two applications in complexity theory. The first is a quasipolynomial-time algorithm solving the weak membership problem for the set of separable states in one-way LOCC or Euclidean norm. The second concerns quantum Merlin-Arthur games. Here we show that multiple provers are not more powerful than a single prover when the verifier is restricted to one-way LOCC operations thereby providing a new characterisation of the complexity class QMA.Comment: 24 pages, 1 figure, 1 table. Due to an error in the published version, claims have been weakened from the LOCC norm to the one-way LOCC nor

Measurement of Angular Distributions and R= sigma_L/sigma_T in Diffractive Electroproduction of rho^0 Mesons

Production and decay angular distributions were extracted from measurements of exclusive electroproduction of the rho^0(770) meson over a range in the virtual photon negative four-momentum squared 0.5< Q^2 <4 GeV^2 and the photon-nucleon invariant mass range 3.8< W <6.5 GeV. The experiment was performed with the HERMES spectrometer, using a longitudinally polarized positron beam and a ^3He gas target internal to the HERA e^{+-} storage ring. The event sample combines rho^0 mesons produced incoherently off individual nucleons and coherently off the nucleus as a whole. The distributions in one production angle and two angles describing the rho^0 -> pi+ pi- decay yielded measurements of eight elements of the spin-density matrix, including one that had not been measured before. The results are consistent with the dominance of helicity-conserving amplitudes and natural parity exchange. The improved precision achieved at 47 GeV, reveals evidence for an energy dependence in the ratio R of the longitudinal to transverse cross sections at constant Q^2.Comment: 15 pages, 15 embedded figures, LaTeX for SVJour(epj) document class Revision: Fig. 15 corrected, recent data added to Figs. 10,12,14,15; minor changes to tex

Moment-Based Evidence for Simple Rational-Valued Hilbert-Schmidt Generic 2 x 2 Separability Probabilities

Employing Hilbert-Schmidt measure, we explicitly compute and analyze a number of determinantal product (bivariate) moments |rho|^k |rho^{PT}|^n, k,n=0,1,2,3,..., PT denoting partial transpose, for both generic (9-dimensional) two-rebit (alpha = 1/2) and generic (15-dimensional) two-qubit (alpha=1) density matrices rho. The results are, then, incorporated by Dunkl into a general formula (Appendix D6), parameterized by k, n and alpha, with the case alpha=2, presumptively corresponding to generic (27-dimensional) quaternionic systems. Holding the Dyson-index-like parameter alpha fixed, the induced univariate moments (|rho| |rho^{PT}|)^n and |rho^{PT}|^n are inputted into a Legendre-polynomial-based (least-squares) probability-distribution reconstruction algorithm of Provost (Mathematica J., 9, 727 (2005)), yielding alpha-specific separability probability estimates. Since, as the number of inputted moments grows, estimates based on |rho| |rho^{PT}| strongly decrease, while ones employing |rho^{PT}| strongly increase (and converge faster), the gaps between upper and lower estimates diminish, yielding sharper and sharper bounds. Remarkably, for alpha = 2, with the use of 2,325 moments, a separability-probability lower-bound 0.999999987 as large as 26/323 = 0.0804954 is found. For alpha=1, based on 2,415 moments, a lower bound results that is 0.999997066 times as large as 8/33 = 0.242424, a (simpler still) fractional value that had previously been conjectured (J. Phys. A, 40, 14279 (2007)). Furthermore, for alpha = 1/2, employing 3,310 moments, the lower bound is 0.999955 times as large as 29/64 = 0.453125, a rational value previously considered (J. Phys. A, 43, 195302 (2010)).Comment: 47 pages, 12 figures; slightly expanded and modified for journal publication; this paper incorporates and greatly extends arXiv:1104.021

Neuropathic pain in a rehabilitation setting after spinal cord injury: an interpretative phenomenological analysis of inpatients’ experiences

Study design Qualitative, semi-structured interviews. Objectives Neuropathic pain (NP) can be psychologically and physically debilitating, and is present in approximately half of the spinal cord injured (SCI) population. However, under half of those with NP are adherent to pain medication. Understanding the impact of NP during rehabilitation is required to reduce long-term impact and to promote adherence to medication and psychoeducation recommendations. Setting United Kingdom. Methods Five males and three females with SCI and chronic NP, resident in rehabilitation wards at a specialist SCI center in the United Kingdom, took part. Semi-structured interviews were conducted with participants less than 15 months post-SCI (mean = 8.4 months). Verbatim transcripts were subject to interpretative phenomenological analysis (IPA). Results Three super-ordinate themes were identified, mediating pain and adherence: (1) the dichotomy of safety perceptions; (2) adherence despite adversity; and (3) fighting the future. Analyses suggest that experience of the rehabilitation setting and responsiveness of care shapes early distress. Attitudes to medication and psychosocial adjustment are relevant to developing expectations about pain management. Conclusions Enhancing self-efficacy, feelings of safety in hospital, and encouraging the adoption of adaptive coping strategies may enhance psychosocial and pain-related outcomes, and improve adherence to medication. Encouraging adaptive responses to, and interpretation of, pain, through the use of interventions such as coping effectiveness training, targeted cognitive behavioral pain management, and acceptance-based interventions such as mindfulness, is recommended in order to reduce long-term reliance on medication