Quantum Bounded Query Complexity

We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query complexity of decision problems. Under traditional complexity assumptions, we obtain an exponential speedup between the quantum and the classical query complexity of function classes. For decision problems and function classes we obtain the following results: o P_||^NP[2k] is included in EQP_||^NP[k] o P_||^NP[2^(k+1)-2] is included in EQP^NP[k] o FP_||^NP[2^(k+1)-2] is included in FEQP^NP[2k] o FP_||^NP is included in FEQP^NP[O(log n)] For sets A that are many-one complete for PSPACE or EXP we show that FP^A is included in FEQP^A[1]. Sets A that are many-one complete for PP have the property that FP_||^A is included in FEQP^A[1]. In general we prove that for any set A there is a set X such that FP^A is included in FEQP^X[1], establishing that no set is superterse in the quantum setting.Comment: 11 pages LaTeX2e, no figures, accepted for CoCo'9

New bounds for the max-kk-cut and chromatic number of a graph

We consider several semidefinite programming relaxations for the max-$k$-cut problem, with increasing complexity. The optimal solution of the weakest presented semidefinite programming relaxation has a closed form expression that includes the largest Laplacian eigenvalue of the graph under consideration. This is the first known eigenvalue bound for the max-$k$-cut when $k>2$ that is applicable to any graph. This bound is exploited to derive a new eigenvalue bound on the chromatic number of a graph. For regular graphs, the new bound on the chromatic number is the same as the well-known Hoffman bound; however, the two bounds are incomparable in general. We prove that the eigenvalue bound for the max-$k$-cut is tight for several classes of graphs. We investigate the presented bounds for specific classes of graphs, such as walk-regular graphs, strongly regular graphs, and graphs from the Hamming association scheme

Regular graphs with maximal energy per vertex

We study the energy per vertex in regular graphs. For every k, we give an upper bound for the energy per vertex of a k-regular graph, and show that a graph attains the upper bound if and only if it is the disjoint union of incidence graphs of projective planes of order k-1 or, in case k=2, the disjoint union of triangles and hexagons. For every k, we also construct k-regular subgraphs of incidence graphs of projective planes for which the energy per vertex is close to the upper bound. In this way, we show that this upper bound is asymptotically tight

Combinatorial Designs with Two Singular Values II. Partial Geometric Designs

In this and an earlier paper [17] we study combinatorial designs whose incidence matrix has two distinct singular values.These generalize (v, k, ë) designs, and include uniform multiplicative designs and partial geometric designs.Here we study the latter, which are precisely the designs with constant replication and block size.We collect most known results, give new characterization results, and we enumerate, partly by computer, all small ones.matrices;singularities;geometry;combinatorics

Combinatorial Designs with Two Singular Values I. Uniform Multiplicative Designs

In this and a sequel paper [10] we study combinatorial designs whose incidence matrix has two distinct singular values.These generalize 2-(v, k, É) designs, and include partial geometric designs and uniform multiplicative designs.Here we study the latter, which are precisely the nonsingular designs.We classify all such designs with smallest singular value at most, generalize the Bruck-Ryser-Chowla conditions, and enumerate, partly by computer, all uniform multiplicative designs on at most 30 points.combinatorics;matrices;singularities

Bimetric Theory of Fractional Quantum Hall States

We present a bimetric low-energy effective theory of fractional quantum Hall (FQH) states that describes the topological properties and a gapped collective excitation, known as Girvin-Macdonald-Platzman (GMP) mode. The theory consist of a topological Chern-Simons action, coupled to a symmetric rank two tensor, and an action \`a la bimetric gravity, describing the gapped dynamics of the spin-$2$ GMP mode. The theory is formulated in curved ambient space and is spatially covariant, which allows to restrict the form of the effective action and the values of phenomenological coefficients. Using the bimetric theory we calculate the projected static structure factor up to the $k^6$ order in the momentum expansion. To provide further support for the theory, we derive the long wave limit of the GMP algebra, the dispersion relation of the GMP mode, and the Hall viscosity of FQH states. We also comment on the possible applications to fractional Chern insulators, where closely related structures arise. Finally, it is shown that the familiar FQH observables acquire a curious geometric interpretation within the bimetric formalism.Comment: 14 pages, v2: Acknowledgments updated, v3: A few presentation improvements, Published versio