The quantum simulation of quantum chemistry is a promising application of quantum computers. However, for
The road to computing on quantum devices has been accelerated by the promises that come from using Shor’s algorithm to reduce the complexity of prime factorization. However, this promise hast not yet been realized due to noisy qubits and lack of robust error correction schemes. Here we explore a promising, alternative method for prime factorization that uses wellestablished techniques from variational imaginary time evolution. We create a Hamiltonian whose ground state encodes the solution to the problem and use variational techniques to evolve a state iteratively towards these prime factors. We show that the number of circuits evaluated in each iteration scales as
 Award ID(s):
 1955907
 Publication Date:
 NSFPAR ID:
 10305515
 Journal Name:
 Scientific Reports
 Volume:
 11
 Issue:
 1
 ISSN:
 20452322
 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 In a Merlin–Arthur proof system, the proof verifier (Arthur) accepts valid proofs (from Merlin) with probability 1, and rejects invalid proofs with probability arbitrarily close to 1. The running time of such a system is defined to be the length of Merlin’s proof plus the running time of Arthur. We provide new Merlin–Arthur proof systems for some key problems in finegrained complexity. In several cases our proof systems have optimal running time. Our main results include:
Certifying that a list of
n integers has no 3SUM solution can be done in Merlin–Arthur time . Previously, Carmosino et al. [ITCS 2016] showed that the problem has a nondeterministic algorithm running in$$\tilde{O}(n)$$ $\stackrel{~}{O}\left(n\right)$ time (that is, there is a proof system with proofs of length$$\tilde{O}(n^{1.5})$$ $\stackrel{~}{O}\left({n}^{1.5}\right)$ and a deterministic verifier running in$$\tilde{O}(n^{1.5})$$ $\stackrel{~}{O}\left({n}^{1.5}\right)$ time).$$\tilde{O}(n^{1.5})$$ $\stackrel{~}{O}\left({n}^{1.5}\right)$Counting the number of
k cliques with total edge weight equal to zero in ann node graph can be done in Merlin–Arthur time (where$${\tilde{O}}(n^{\lceil k/2\rceil })$$ $\stackrel{~}{O}\left({n}^{\lceil k/2\rceil}\right)$ ). For odd$$k\ge 3$$ $k\ge 3$k , this bound can be further improved for sparse graphs: for example, counting the number of zeroweight triangles in anm edge graph can be done in Merlin–Arthur time . Previous Merlin–Arthur protocols by Williams [CCC’16] and Björklund and Kaski [PODC’16] could only count$${\tilde{O}}(m)$$ $\stackrel{~}{O}\left(m\right)$k cliques in unweighted graphs, and had worse running times for smallk .Computing the AllPairsmore »
Certifying that an
n variablek CNF is unsatisfiable can be done in Merlin–Arthur time . We also observe an algebrization barrier for the previous$$2^{n/2  n/O(k)}$$ ${2}^{n/2n/O\left(k\right)}$ time Merlin–Arthur protocol of R. Williams [CCC’16] for$$2^{n/2}\cdot \textrm{poly}(n)$$ ${2}^{n/2}\xb7\text{poly}\left(n\right)$ SAT: in particular, his protocol algebrizes, and we observe there is no algebrizing protocol for$$\#$$ $\#$k UNSAT running in time. Therefore we have to exploit nonalgebrizing properties to obtain our new protocol.$$2^{n/2}/n^{\omega (1)}$$ ${2}^{n/2}/{n}^{\omega \left(1\right)}$ Due to the centrality of these problems in finegrained complexity, our results have consequences for many other problems of interest. For example, our work implies that certifying there is no Subset Sum solution toCertifying a Quantified Boolean Formula is true can be done in Merlin–Arthur time
. Previously, the only nontrivial result known along these lines was an Arthur–Merlin–Arthur protocol (where Merlin’s proof depends on some of Arthur’s coins) running in$$2^{4n/5}\cdot \textrm{poly}(n)$$ ${2}^{4n/5}\xb7\text{poly}\left(n\right)$ time.$$2^{2n/3}\cdot \textrm{poly}(n)$$ ${2}^{2n/3}\xb7\text{poly}\left(n\right)$n integers can be done in Merlin–Arthur time , improving on the previous best protocol by Nederlof [IPL 2017] which took$$2^{n/3}\cdot \textrm{poly}(n)$$ ${2}^{n/3}\xb7\text{poly}\left(n\right)$ time.$$2^{0.49991n}\cdot \textrm{poly}(n)$$ ${2}^{0.49991n}\xb7\text{poly}\left(n\right)$ 
Abstract We prove that
depth local random quantum circuits with two qudit nearestneighbor gates on a$${{\,\textrm{poly}\,}}(t) \cdot n^{1/D}$$ $\phantom{\rule{0ex}{0ex}}\text{poly}\phantom{\rule{0ex}{0ex}}\left(t\right)\xb7{n}^{1/D}$D dimensional lattice withn qudits are approximatet designs in various measures. These include the “monomial” measure, meaning that the monomials of a random circuit from this family have expectation close to the value that would result from the Haar measure. Previously, the best bound was due to Brandão–Harrow–Horodecki (Commun Math Phys 346(2):397–434, 2016) for$${{\,\textrm{poly}\,}}(t)\cdot n$$ $\phantom{\rule{0ex}{0ex}}\text{poly}\phantom{\rule{0ex}{0ex}}\left(t\right)\xb7n$ . We also improve the “scrambling” and “decoupling” bounds for spatially local random circuits due to Brown and Fawzi (Scrambling speed of random quantum circuits, 2012). One consequence of our result is that assuming the polynomial hierarchy ($$D=1$$ $D=1$ ) is infinite and that certain counting problems are$${{\,\mathrm{\textsf{PH}}\,}}$$ $\phantom{\rule{0ex}{0ex}}\mathrm{PH}\phantom{\rule{0ex}{0ex}}$ hard “on average”, sampling within total variation distance from these circuits is hard for classical computers. Previously, exact sampling from the outputs of even constantdepth quantum circuits was known to be hard for classical computers under these assumptions. However the standard strategy for extending this hardness result to approximate sampling requires the quantum circuits to have a property called “anticoncentration”, meaning roughly that the output has nearmaximal entropy. Unitary 2designs have the desired anticoncentration property. Our result improves the required depth for this level of anticoncentration from linear depthmore »$$\#{\textsf{P}}$$ $\#P$ 
Abstract We perform pathintegral molecular dynamics (PIMD), ringpolymer MD (RPMD), and classical MD simulations of H
O and D$$_2$$ ${}_{2}$ O using the qTIP4P/F water model over a wide range of temperatures and pressures. The density$$_2$$ ${}_{2}$ , isothermal compressibility$$\rho (T)$$ $\rho \left(T\right)$ , and selfdiffusion coefficients$$\kappa _T(T)$$ ${\kappa}_{T}\left(T\right)$D (T ) of H O and D$$_2$$ ${}_{2}$ O are in excellent agreement with available experimental data; the isobaric heat capacity$$_2$$ ${}_{2}$ obtained from PIMD and MD simulations agree qualitatively well with the experiments. Some of these thermodynamic properties exhibit anomalous maxima upon isobaric cooling, consistent with recent experiments and with the possibility that H$$C_P(T)$$ ${C}_{P}\left(T\right)$ O and D$$_2$$ ${}_{2}$ O exhibit a liquidliquid critical point (LLCP) at low temperatures and positive pressures. The data from PIMD/MD for H$$_2$$ ${}_{2}$ O and D$$_2$$ ${}_{2}$ O can be fitted remarkably well using the TwoStateEquationofState (TSEOS). Using the TSEOS, we estimate that the LLCP for qTIP4P/F H$$_2$$ ${}_{2}$ O, from PIMD simulations, is located at$$_2$$ ${}_{2}$ MPa,$$P_c = 167 \pm 9$$ ${P}_{c}=167\pm 9$ K, and$$T_c = 159 \pm 6$$ ${T}_{c}=159\pm 6$ g/cm$$\rho _c = 1.02 \pm 0.01$$ ${\rho}_{c}=1.02\pm 0.01$ . Isotope substitution effects are important; the LLCP location in qTIP4P/F D$$^3$$ ${}^{3}$ O is estimated to be$$_2$$ ${}_{2}$ MPa,$$P_c = 176 \pm 4$$ ${P}_{c}=176\pm 4$ K, and$$T_c = 177 \pm 2$$ ${T}_{c}=177\pm 2$ g/cm$$\rho _c = 1.13 \pm 0.01$$ ${\rho}_{c}=1.13\pm 0.01$ . Interestingly, for the water model studied, differences in the LLCP location from PIMD and MD simulations suggest that nuclear quantum effectsmore »$$^3$$ ${}^{3}$ 
Abstract In this paper, we study multistage stochastic mixedinteger nonlinear programs (MSMINLP). This general class of problems encompasses, as important special cases, multistage stochastic convex optimization with
nonLipschitzian value functions and multistage stochastic mixedinteger linear optimization. We develop stochastic dual dynamic programming (SDDP) type algorithms with nested decomposition, deterministic sampling, and stochastic sampling. The key ingredient is a new type of cuts based on generalized conjugacy. Several interesting classes of MSMINLP are identified, where the new algorithms are guaranteed to obtain the global optimum without the assumption of complete recourse. This significantly generalizes the classic SDDP algorithms. We also characterize the iteration complexity of the proposed algorithms. In particular, for a stage stochastic MINLP satisfying$$(T+1)$$ $(T+1)$L exact Lipschitz regularization withd dimensional state spaces, to obtain an optimal root node solution, we prove that the number of iterations of the proposed deterministic sampling algorithm is upper bounded by$$\varepsilon $$ $\epsilon $ , and is lower bounded by$${\mathcal {O}}((\frac{2LT}{\varepsilon })^d)$$ $O\left({\left(\frac{2LT}{\epsilon}\right)}^{d}\right)$ for the general case or by$${\mathcal {O}}((\frac{LT}{4\varepsilon })^d)$$ $O\left({\left(\frac{\mathrm{LT}}{4\epsilon}\right)}^{d}\right)$ for the convex case. This shows that the obtained complexity bounds are rather sharp. It also reveals that the iteration complexity depends$${\mathcal {O}}((\frac{LT}{8\varepsilon })^{d/21})$$ $O\left({\left(\frac{\mathrm{LT}}{8\epsilon}\right)}^{d/21}\right)$polynomially on the number of stages. We further show that the iteration complexity dependslinearly onT , if all the state spaces are finite sets, or ifmore »