We give two new quantum algorithms for solving semidefinite programs (SDPs) providing quantum speed-ups. We consider SDP instances with m constraint matrices, each of dimension n, rank r, and sparsity s. The first algorithm assumes an input model where one is given access to entries of the matrices at unit cost. We show that it has run time O~(s2(m−−√ε−10+n−−√ε−12)), where ε is the error. This gives an optimal dependence in terms of m,n and quadratic improvement over previous quantum algorithms when m≈n. The second algorithm assumes a fully quantum input model in which the matrices are given as quantum states. We show that its run time is O~(m−−√+poly(r))⋅poly(logm,logn,B,ε−1), with B an upper bound on the trace-norm of all input matrices. In particular the complexity depends only poly-logarithmically in n and polynomially in r. We apply the second SDP solver to the problem of learning a good description of a quantum state with respect to a set of measurements: Given m measurements and copies of an unknown state ρ, we show we can find in time m−−√⋅poly(logm,logn,r,ε−1) a description of the state as a quantum circuit preparing a density matrix which has the same expectation values as ρ on the m measurements, up to error ε. The density matrix obtained is an approximation to the maximum entropy state consistent with the measurement data considered in Jaynes' principle from statistical mechanics. As in previous work, we obtain our algorithm by "quantizing" classical SDP solvers based on the matrix multiplicative weight method. One of our main technical contributions is a quantum Gibbs state sampler for low-rank Hamiltonians with a poly-logarithmic dependence on its dimension, which could be of independent interest.

1 aBrandão, Fernando, G. S. L.1 aKalev, Amir1 aLi, Tongyang1 aLin, Cedric, Yen-Yu1 aSvore, Krysta, M.1 aWu, Xiaodi uhttps://arxiv.org/abs/1710.0258101217nas a2200169 4500008004100000245006400041210006200105260001500167300001100182490000800193520070900201100001900910700002300929700003300952700002500985856003701010 2017 eng d00a{E}ntanglement area laws for long-range interacting systems0 aE ntanglement area laws for longrange interacting systems c2017/07/31 a0505010 v1193 aWe prove that the entanglement entropy of any state evolved under an arbitrary 1/rα long-range-interacting D-dimensional lattice spin Hamiltonian cannot change faster than a rate proportional to the boundary area for any α > D + 1. We also prove that for any α > 2D + 2, the ground state of such a Hamiltonian satisfies the entanglement area law if it can be transformed along a gapped adiabatic path into a ground state known to satisfy the area law. These results significantly generalize their existing counterparts for short-range interacting systems, and are useful for identifying dynamical phase transitions and quantum phase transitions in the presence of long-range interactions.

1 aGong, Zhe-Xuan1 aFoss-Feig, Michael1 aBrandão, Fernando, G. S. L.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1702.0536802582nas a2200169 4500008004100000245010100041210006900142260001500211520202200226100003302248700001602281700001702297700002402314700002202338700001502360856003702375 2017 eng d00aExponential Quantum Speed-ups for Semidefinite Programming with Applications to Quantum Learning0 aExponential Quantum Speedups for Semidefinite Programming with A c2017/10/063 aWe give semidefinite program (SDP) quantum solvers with an exponential speed-up over classical ones. Specifically, we consider SDP instances with m constraint matrices of dimension n, each of rank at most r, and assume that the input matrices of the SDP are given as quantum states (after a suitable normalization). Then we show there is a quantum algorithm that solves the SDP feasibility problem with accuracy ǫ by using √ m log m · poly(log n,r, ǫ −1 ) quantum gates. The dependence on n provides an exponential improvement over the work of Brand ˜ao and Svore [6] and the work of van Apeldoorn et al. [23], and demonstrates an exponential quantum speed-up when m and r are small. We apply the SDP solver to the problem of learning a good description of a quantum state with respect to a set of measurements: Given m measurements and a supply of copies of an unknown state ρ, we show we can find in time √ m log m · poly(log n,r, ǫ −1 ) a description of the state as a quantum circuit preparing a density matrix which has the same expectation values as ρ on the m measurements up to error ǫ. The density matrix obtained is an approximation to the maximum entropy state consistent with the measurement data considered in Jaynes’ principle. As in previous work, we obtain our algorithm by “quantizing” classical SDP solvers based on the matrix multiplicative weight update method. One of our main technical contributions is a quantum Gibbs state sampler for low-rank Hamiltonians with a poly-logarithmic dependence on its dimension based on the techniques developed in quantum principal component analysis, which could be of independent interest. Our quantum SDP solver is different from previous ones in the following two aspects: (1) it follows from a zero-sum game approach of Hazan [11] of solving SDPs rather than the primal-dual approach by Arora and Kale [5]; and (2) it does not rely on any sparsity assumption of the input matrices.

1 aBrandão, Fernando, G. S. L.1 aKalev, Amir1 aLi, Tongyang1 aLin, Cedric, Yen-Yu1 aSvore, Krysta, M.1 aWu, Xiaodi uhttps://arxiv.org/abs/1710.02581