In previous papers we have considered mutual simulation of n-partite pair-interaction Hamiltonians. We have focussed on the running time overhead of general simulations, while considering the required number of time steps only for special cases (decoupling and time-reversal). These two complexity measures differ significantly. Here we derive lower bounds on the number of time steps for general ...

We describe four improvements to a prosody SVM system, including a new method based on textand part-of-speechconstrained prosodic features. The improved system shows remarkably good performance on NIST SRE06 data, reducing the error rate of an MLLR system by as much as 23% after combination. In addition, an N -best system analysis using eight systems reveals that the prosody SVM is the third an...

In previous papers we have considered mutual simulation of n-partite pair-interaction Hamiltonians. We have focussed on the running time overhead of general simulations, while considering the required number of time steps only for special cases (decoupling and time-reversal). These two complexity measures differ significantly. Here we derive lower bounds on the number of time steps for general ...

Compressed sensing is a new sampling technique which can exactly reconstruct sparse signal from a few measurements. In this article, we consider the blocksparse compressed sensing with special structure assumption about the signal. A novel non-convex model is proposed to reconstruct the block-sparse signals. In addition, the conditions of the proposed model for recovering the block-sparse noise...

We introduce a new approach for pricing energy derivatives known as tolling agreement contracts. The pricing problem is reduced to a linear program. We prove that the optimal operating strategy for a power plant can be expressed through optimal exercise boundaries (similar to the exercise boundaries for American options). We find the boundaries as a byproduct of the pricing algorithm. The sugge...

We show that a version of Martin-Löf type theory with extensional identity, a unit type N1,Σ,Π, and a base type is a free category with families (supporting these type formers) both in a 1and a 2-categorical sense. It follows that the underlying category of contexts is a free locally cartesian closed category in a 2-categorical sense because of a previously proved biequivalence. We then show th...

The continuous-time query model [3] can be thought of as a variant of the stardard query model, but where arbitrarily small λ-fractional queries to the data x1x2 . . . xN ∈ {0, 1} , of the form |j⟩ 7→ ej |j⟩, can be made at cost only λ. In the limit as λ → 0, such algorithms become continuous-time Hamiltonian evolution processes. We show that any continuous-time quantum query algorithm whose to...

Given a universal gate set on two qubits, it is well known that applying random gates from the set to random pairs of qubits will eventually yield an approximately Haar-distributed unitary. However, this requires exponential time. We show that random circuits of only polynomial length will approximate the first and second moments of the Haar distribution, thus forming approximate 1and 2-designs...

An analysis of symmetric function theory is given from the perspective of the underlying Hopf and bi-algebraic structures. These are presented explicitly in terms of standard symmetric function operations. Particular attention is focussed on Laplace pairing, Sweedler cohomology for 1and 2-cochains, and twisted products (Rota cliffordizations) induced by branching operators in the symmetric func...