QIP = PSPACE

We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a parallelized form of the matrix multiplicative weights update method to a class of semidefinite programs that captures the computational power of quantum interactive proofs. As the containment of PSPACE in QIP follows immediately from the well-known equality IP = PSPACE, the equality QIP = PSPACE follows.Comment: 21 pages; v2 includes corrections and minor revision

Root finding with threshold circuits

We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials---given by a list of coefficients in binary---can be computed to a given accuracy by a uniform TC^0 algorithm (a uniform family of constant-depth polynomial-size threshold circuits). The basic idea is to compute the inverse function of the polynomial by a power series. We also discuss an application to the theory VTC^0 of bounded arithmetic.Comment: 19 pages, 1 figur

Type-Based Detection of XML Query-Update Independence

This paper presents a novel static analysis technique to detect XML query-update independence, in the presence of a schema. Rather than types, our system infers chains of types. Each chain represents a path that can be traversed on a valid document during query/update evaluation. The resulting independence analysis is precise, although it raises a challenging issue: recursive schemas may lead to infer infinitely many chains. A sound and complete approximation technique ensuring a finite analysis in any case is presented, together with an efficient implementation performing the chain-based analysis in polynomial space and time.Comment: VLDB201

Quantum Proofs

Quantum information and computation provide a fascinating twist on the notion of proofs in computational complexity theory. For instance, one may consider a quantum computational analogue of the complexity class \class{NP}, known as QMA, in which a quantum state plays the role of a proof (also called a certificate or witness), and is checked by a polynomial-time quantum computation. For some problems, the fact that a quantum proof state could be a superposition over exponentially many classical states appears to offer computational advantages over classical proof strings. In the interactive proof system setting, one may consider a verifier and one or more provers that exchange and process quantum information rather than classical information during an interaction for a given input string, giving rise to quantum complexity classes such as QIP, QSZK, and QMIP* that represent natural quantum analogues of IP, SZK, and MIP. While quantum interactive proof systems inherit some properties from their classical counterparts, they also possess distinct and uniquely quantum features that lead to an interesting landscape of complexity classes based on variants of this model. In this survey we provide an overview of many of the known results concerning quantum proofs, computational models based on this concept, and properties of the complexity classes they define. In particular, we discuss non-interactive proofs and the complexity class QMA, single-prover quantum interactive proof systems and the complexity class QIP, statistical zero-knowledge quantum interactive proof systems and the complexity class \class{QSZK}, and multiprover interactive proof systems and the complexity classes QMIP, QMIP*, and MIP*.Comment: Survey published by NOW publisher

Accurate Mass Determinations in Decay Chains with Missing Energy: II

We discuss kinematic methods for determining the masses of the particles in events at a hadron collider in which a pair of identical particles is produced with each decaying via a series of on-shell intermediate beyond-the-SM (BSM) particles to visible SM particles and an invisible particle (schematically, pp -> ZZ + jets with Z -> Aa -> Bba -> Ccba -> ... -> cba... + N where a,b,c,... are visible SM particles or groups of SM particles, A,B,C,... are on-shell BSM particles and N is invisible). This topology arises in many models including SUSY processes such as squark and gluino pair production and decay. We present the detailed procedure for the case of Z -> 3 visible particles + N and demonstrate that the masses obtained from the kinematic procedure are independent of the model by comparing SUSY to UED.Comment: v2, published version in PR

A study of redundancy management strategy for tetrad strap-down inertial systems

Algorithms were developed that attempt to identify which sensor in a tetrad configuration has experienced a step failure. An algorithm is also described that provides a measure of the confidence with which the correct identification was made. Experimental results are presented from real-time tests conducted on a three-axis motion facility utilizing an ortho-skew tetrad strapdown inertial sensor package. The effects of prediction errors and of quantization on correct failure identification are discussed as well as an algorithm for detecting second failures through prediction

Les Houches 2013: Physics at TeV Colliders: Standard Model Working Group Report

This Report summarizes the proceedings of the 2013 Les Houches workshop on Physics at TeV Colliders. Session 1 dealt primarily with (1) the techniques for calculating standard model multi-leg NLO and NNLO QCD and NLO EW cross sections and (2) the comparison of those cross sections with LHC data from Run 1, and projections for future measurements in Run 2.Comment: Proceedings of the Standard Model Working Group of the 2013 Les Houches Workshop, Physics at TeV Colliders, Les houches 3-21 June 2013. 200 page