How do retail prices react to minimum wage increases?

Wages ; Prices

Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy

We consider quantum computations comprising only commuting gates, known as IQP computations, and provide compelling evidence that the task of sampling their output probability distributions is unlikely to be achievable by any efficient classical means. More specifically we introduce the class post-IQP of languages decided with bounded error by uniform families of IQP circuits with post-selection, and prove first that post-IQP equals the classical class PP. Using this result we show that if the output distributions of uniform IQP circuit families could be classically efficiently sampled, even up to 41% multiplicative error in the probabilities, then the infinite tower of classical complexity classes known as the polynomial hierarchy, would collapse to its third level. We mention some further results on the classical simulation properties of IQP circuit families, in particular showing that if the output distribution results from measurements on only O(log n) lines then it may in fact be classically efficiently sampled.Comment: 13 page

A Full Characterization of Quantum Advice

We prove the following surprising result: given any quantum state rho on n qubits, there exists a local Hamiltonian H on poly(n) qubits (e.g., a sum of two-qubit interactions), such that any ground state of H can be used to simulate rho on all quantum circuits of fixed polynomial size. In terms of complexity classes, this implies that BQP/qpoly is contained in QMA/poly, which supersedes the previous result of Aaronson that BQP/qpoly is contained in PP/poly. Indeed, we can exactly characterize quantum advice, as equivalent in power to untrusted quantum advice combined with trusted classical advice. Proving our main result requires combining a large number of previous tools -- including a result of Alon et al. on learning of real-valued concept classes, a result of Aaronson on the learnability of quantum states, and a result of Aharonov and Regev on "QMA+ super-verifiers" -- and also creating some new ones. The main new tool is a so-called majority-certificates lemma, which is closely related to boosting in machine learning, and which seems likely to find independent applications. In its simplest version, this lemma says the following. Given any set S of Boolean functions on n variables, any function f in S can be expressed as the pointwise majority of m=O(n) functions f1,...,fm in S, such that each fi is the unique function in S compatible with O(log|S|) input/output constraints.Comment: We fixed two significant issues: 1. The definition of YQP machines needed to be changed to preserve our results. The revised definition is more natural and has the same intuitive interpretation. 2. We needed properties of Local Hamiltonian reductions going beyond those proved in previous works (whose results we'd misstated). We now prove the needed properties. See p. 6 for more on both point

Operator renewal theory and mixing rates for dynamical systems with infinite measure

We develop a theory of operator renewal sequences in the context of infinite ergodic theory. For large classes of dynamical systems preserving an infinite measure, we determine the asymptotic behaviour of iterates $L^n$ of the transfer operator. This was previously an intractable problem. Examples of systems covered by our results include (i) parabolic rational maps of the complex plane and (ii) (not necessarily Markovian) nonuniformly expanding interval maps with indifferent fixed points. In addition, we give a particularly simple proof of pointwise dual ergodicity (asymptotic behaviour of $\sum_{j=1}^nL^j$) for the class of systems under consideration. In certain situations, including Pomeau-Manneville intermittency maps, we obtain higher order expansions for $L^n$ and rates of mixing. Also, we obtain error estimates in the associated Dynkin-Lamperti arcsine laws.Comment: Preprint, August 2010. Revised August 2011. After publication, a minor error was pointed out by Kautzsch et al, arXiv:1404.5857. The updated version includes minor corrections in Sections 10 and 11, and corresponding modifications of certain statements in Section 1. All main results are unaffected. In particular, Sections 2-9 are unchanged from the published versio

Geometries for universal quantum computation with matchgates

Matchgates are a group of two-qubit gates associated with free fermions. They are classically simulatable if restricted to act between nearest neighbors on a one-dimensional chain, but become universal for quantum computation with longer-range interactions. We describe various alternative geometries with nearest-neighbor interactions that result in universal quantum computation with matchgates only, including subtle departures from the chain. Our results pave the way for new quantum computer architectures that rely solely on the simple interactions associated with matchgates.Comment: 6 pages, 4 figures. Updated version includes an appendix extending one of the result

Unbounded-error One-way Classical and Quantum Communication Complexity

This paper studies the gap between quantum one-way communication complexity $Q(f)$ and its classical counterpart $C(f)$, under the {\em unbounded-error} setting, i.e., it is enough that the success probability is strictly greater than 1/2. It is proved that for {\em any} (total or partial) Boolean function $f$, $Q(f)=\lceil C(f)/2 \rceil$, i.e., the former is always exactly one half as large as the latter. The result has an application to obtaining (again an exact) bound for the existence of $(m,n,p)$-QRAC which is the $n$-qubit random access coding that can recover any one of $m$ original bits with success probability $\geq p$. We can prove that $(m,n,>1/2)$-QRAC exists if and only if $m\leq 2^{2n}-1$. Previously, only the construction of QRAC using one qubit, the existence of $(O(n),n,>1/2)$-RAC, and the non-existence of $(2^{2n},n,>1/2)$-QRAC were known.Comment: 9 pages. To appear in Proc. ICALP 200

On interpolations from SUSY to non-SUSY strings and their properties

The interpolation from supersymmetric to non-supersymmetric heterotic theories is studied, via the Scherk-Schwarz compactification of supersymmetric $6D$ theories to $4D$. A general modular-invariant Scherk-Schwarz deformation is deduced from the properties of the $6D$ theories at the endpoints, which significantly extends previously known examples. This wider class of non-supersymmetric $4D$ theories opens up new possibilities for model building. The full one-loop cosmological constant of such theories is studied as a function of compactification radius for a number of cases, and the following interpolating configurations are found: two supersymmetric $6D$ theories related by a $T$-duality transformation, with intermediate $4D$ maximum or minimum at the string scale; a non-supersymmetric $6D$ theory interpolating to a supersymmetric $6D$ theory, with the $4D$ theory possibly having an AdS minimum; a ``metastable'' non-supersymmetric $6D$ theory interpolating via a $4D$ theory to a supersymmetric $6D$ theory

Spatial search and the Dirac equation

We consider the problem of searching a d-dimensional lattice of N sites for a single marked location. We present a Hamiltonian that solves this problem in time of order sqrt(N) for d>2 and of order sqrt(N) log(N) in the critical dimension d=2. This improves upon the performance of our previous quantum walk search algorithm (which has a critical dimension of d=4), and matches the performance of a corresponding discrete-time quantum walk algorithm. The improvement uses a lattice version of the Dirac Hamiltonian, and thus requires the introduction of spin (or coin) degrees of freedom.Comment: 5 pages, 1 figur