The quantum simulation of quantum chemistry is a promising application of quantum computers. However, for
We study twoqubit circuits over the Clifford+CS gate set, which consists of the Clifford gates together with the controlledphase gate CS = diag(1, 1, 1,
 Publication Date:
 NSFPAR ID:
 10251644
 Journal Name:
 npj Quantum Information
 Volume:
 7
 Issue:
 1
 ISSN:
 20566387
 Publisher:
 Nature Publishing Group
 Sponsoring Org:
 National Science Foundation
More Like this

Abstract N molecular orbitals, the gate complexity of performing Hamiltonian and unitary Coupled Cluster Trotter steps makes simulation based on such primitives challenging. We substantially reduce the gate complexity of such primitives through a twostep lowrank factorization of the Hamiltonian and cluster operator, accompanied by truncation of small terms. Using truncations that incur errors below chemical accuracy allow one to perform Trotter steps of the arbitrary basis electronic structure Hamiltonian with$${\mathcal{O}}({N}^{4})$$ $O\left({N}^{4}\right)$ gate complexity in small simulations, which reduces to$${\mathcal{O}}({N}^{3})$$ $O\left({N}^{3}\right)$ gate complexity in the asymptotic regime; and unitary Coupled Cluster Trotter steps with$${\mathcal{O}}({N}^{2})$$ $O\left({N}^{2}\right)$ gate complexity as a function of increasing basis size for a given molecule. In the case of the Hamiltonian Trotter step, these circuits have$${\mathcal{O}}({N}^{3})$$ $O\left({N}^{3}\right)$ depth on a linearly connected array, an improvement over the$${\mathcal{O}}({N}^{2})$$ $O\left({N}^{2}\right)$ scaling assuming no truncation. As a practical example, we show that a chemically accurate Hamiltonian Trotter step for a 50 qubit molecular simulation can be carried out in the molecular orbital basis with as few as 4000 layers of parallel nearestneighbor twoqubit gates, consisting of fewer than 10^{5}nonClifford rotations. We also apply our algorithm to iron–sulfur clusters relevant for elucidating the mode of action of metalloenzymes.$${\mathcal{O}}({N}^{3})$$ $O\left({N}^{3}\right)$ 
Abstract We continue the program of proving circuit lower bounds via circuit satisfiability algorithms. So far, this program has yielded several concrete results, proving that functions in
and other complexity classes do not have small circuits (in the worst case and/or on average) from various circuit classes$\mathsf {Quasi}\text {}\mathsf {NP} = \mathsf {NTIME}[n^{(\log n)^{O(1)}}]$ $\mathrm{Quasi}\mathrm{NP}=\mathrm{NTIME}\left[{n}^{{\left(\mathrm{log}n\right)}^{O\left(1\right)}}\right]$ , by showing that$\mathcal { C}$ $C$ admits nontrivial satisfiability and/or$\mathcal { C}$ $C$# SAT algorithms which beat exhaustive search by a minor amount. In this paper, we present a new strong lower bound consequence of having a nontrivial# SAT algorithm for a circuit class . Say that a symmetric Boolean function${\mathcal C}$ $C$f (x _{1},…,x _{n}) issparse if it outputs 1 onO (1) values of . We show that for every sparse${\sum }_{i} x_{i}$ ${\sum}_{i}{x}_{i}$f , and for all “typical” , faster$\mathcal { C}$ $C$# SAT algorithms for circuits imply lower bounds against the circuit class$\mathcal { C}$ $C$ , which may be$f \circ \mathcal { C}$ $f\circ C$stronger than itself. In particular:$\mathcal { C}$ $C$# SAT algorithms forn ^{k}size circuits running in 2^{n}/$\mathcal { C}$ $C$n ^{k}time (for allk ) implyN E X P does not have circuits of polynomial size.$(f \circ \mathcal { C})$ $(f\circ C)$# SAT algorithms for size$2^{n^{{\varepsilon }}}$ ${2}^{{n}^{\epsilon}}$ circuits running in$\mathcal { C}$ $C$ time (for some$2^{nn^{{\varepsilon }}}$ ${2}^{n{n}^{\epsilon}}$ε > 0) implyQ u a s i N P does not have circuits of polynomial size.$(f \circ \mathcal { C})$ $(f\circ C)$Applying
# SAT algorithms from the literature, one immediate corollary of our results is thatQ u a s i N P does not haveE M A J ∘A C C ^{0}∘T H R circuits of polynomialmore » 
Abstract We consider the problem of covering multiple submodular constraints. Given a finite ground set
N , a weight function ,$$w: N \rightarrow \mathbb {R}_+$$ $w:N\to {R}_{+}$r monotone submodular functions over$$f_1,f_2,\ldots ,f_r$$ ${f}_{1},{f}_{2},\dots ,{f}_{r}$N and requirements the goal is to find a minimum weight subset$$k_1,k_2,\ldots ,k_r$$ ${k}_{1},{k}_{2},\dots ,{k}_{r}$ such that$$S \subseteq N$$ $S\subseteq N$ for$$f_i(S) \ge k_i$$ ${f}_{i}\left(S\right)\ge {k}_{i}$ . We refer to this problem as$$1 \le i \le r$$ $1\le i\le r$MultiSubmodCover and it was recently considered by HarPeled and Jones (Few cuts meet many point sets. CoRR.arxiv:abs1808.03260 HarPeled and Jones 2018) who were motivated by an application in geometry. Even with$$r=1$$ $r=1$MultiSubmodCover generalizes the wellknown Submodular Set Cover problem (SubmodSC ), and it can also be easily reduced toSubmodSC . A simple greedy algorithm gives an approximation where$$O(\log (kr))$$ $O(log(kr\left)\right)$ and this ratio cannot be improved in the general case. In this paper, motivated by several concrete applications, we consider two ways to improve upon the approximation given by the greedy algorithm. First, we give a bicriteria approximation algorithm for$$k = \sum _i k_i$$ $k={\sum}_{i}{k}_{i}$MultiSubmodCover that covers each constraint to within a factor of while incurring an approximation of$$(11/e\varepsilon )$$ $(11/e\epsilon )$ in the cost. Second, we consider the special case when each$$O(\frac{1}{\epsilon }\log r)$$ $O(\frac{1}{\u03f5}logr)$ is a obtained from a truncated coverage function and obtain an algorithm that generalizes previous work on partial set cover ($$f_i$$ ${f}_{i}$PartialSC ), covering integer programs (CIPs ) and multiple vertex cover constraintsmore » 
Abstract Finite volume, weighted essentially nonoscillatory (WENO) schemes require the computation of a smoothness indicator. This can be expensive, especially in multiple space dimensions. We consider the use of the simple smoothness indicator
, where$$\sigma ^{\textrm{S}}= \frac{1}{N_{\textrm{S}}1}\sum _{j} ({\bar{u}}_{j}  {\bar{u}}_{m})^2$$ ${\sigma}^{\text{S}}=\frac{1}{{N}_{\text{S}}1}{\sum}_{j}{({\overline{u}}_{j}{\overline{u}}_{m})}^{2}$ is the number of mesh elements in the stencil,$$N_{\textrm{S}}$$ ${N}_{\text{S}}$ is the local function average over mesh element$${\bar{u}}_j$$ ${\overline{u}}_{j}$j , and indexm gives the target element. Reconstructions utilizing standard WENO weighting fail with this smoothness indicator. We develop a modification of WENOZ weighting that gives a reliable and accurate reconstruction of adaptive order, which we denote as SWENOZAO. We prove that it attains the order of accuracy of the large stencil polynomial approximation when the solution is smooth, and drops to the order of the small stencil polynomial approximations when there is a jump discontinuity in the solution. Numerical examples in one and two space dimensions on general meshes verify the approximation properties of the reconstruction. They also show it to be about 10 times faster in two space dimensions than reconstructions using the classic smoothness indicator. The new reconstruction is applied to define finite volume schemes to approximate the solution of hyperbolic conservation laws. Numerical tests show results of the same quality as standard WENOmore » 
Abstract The free multiplicative Brownian motion
is the large$$b_{t}$$ ${b}_{t}$N limit of the Brownian motion on in the sense of$$\mathsf {GL}(N;\mathbb {C}),$$ $\mathrm{GL}(N\u037eC),$ distributions. The natural candidate for the large$$*$$ $\ast $N limit of the empirical distribution of eigenvalues is thus the Brown measure of . In previous work, the second and third authors showed that this Brown measure is supported in the closure of a region$$b_{t}$$ ${b}_{t}$ that appeared in the work of Biane. In the present paper, we compute the Brown measure completely. It has a continuous density$$\Sigma _{t}$$ ${\Sigma}_{t}$ on$$W_{t}$$ ${W}_{t}$ which is strictly positive and real analytic on$$\overline{\Sigma }_{t},$$ ${\overline{\Sigma}}_{t},$ . This density has a simple form in polar coordinates:$$\Sigma _{t}$$ ${\Sigma}_{t}$ where$$\begin{aligned} W_{t}(r,\theta )=\frac{1}{r^{2}}w_{t}(\theta ), \end{aligned}$$ $\begin{array}{c}{W}_{t}(r,\theta )=\frac{1}{{r}^{2}}{w}_{t}\left(\theta \right),\end{array}$ is an analytic function determined by the geometry of the region$$w_{t}$$ ${w}_{t}$ . We show also that the spectral measure of free unitary Brownian motion$$\Sigma _{t}$$ ${\Sigma}_{t}$ is a “shadow” of the Brown measure of$$u_{t}$$ ${u}_{t}$ , precisely mirroring the relationship between the circular and semicircular laws. We develop several new methods, based on stochastic differential equations and PDE, to prove these results.$$b_{t}$$ ${b}_{t}$