EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
نویسندگان
چکیده
منابع مشابه
Simulating Sparse Hamiltonians with Star Decompositions
Quantum simulation of Hamiltonian dynamics is a well-studied problem [1–3] and is one of the main motivations for building a quantum computer. Since the best known classical algorithms for simulating quantum systems are inefficient, this was the original application of quantum computers [4]. Besides simulating physics, Hamiltonian simulation has many algorithmic applications, such as adiabatic ...
متن کاملA quantum algorithm for simulating non-sparse Hamiltonians
We present a quantum algorithm for simulating the dynamics of Hamiltonians that are not necessarily sparse. Our algorithm is based on the assumption that the entries of the Hamiltonian are stored in a data structure that allows for the efficient preparation of states that encode the rows of the Hamiltonian. We use a linear combination of quantum walks to achieve a poly-logarithmic dependence on...
متن کاملSparse Accelerated Exponential Weights
We consider the stochastic optimization problem where a convex function is minimized observing recursively the gradients. We introduce SAEW, a new procedure that accelerates exponential weights procedures with the slow rate 1/ √ T to procedures achieving the fast rate 1/T . Under the strong convexity of the risk, we achieve the optimal rate of convergence for approximating sparse parameters in ...
متن کاملSparse Polynomial Exponential Sums
(1.2) f(x) = a1x k1 + · · ·+ arx with 0 < k1 < k2 < · · · < kr. We assume always that the content of f , (a1, a2, . . . , ar), is relatively prime to the modulus q. Let d = d(f) = kr denote the degree of f and for any prime p let dp(f) denote the degree of f read modulo p. A fundamental problem is to determine whether there exists an absolute constant C such that for an arbitrary positive integ...
متن کاملSimulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds
We address the problem of simulating pair-interaction Hamiltonians in n node quantum networks where the subsystems have arbitrary, possibly different, dimensions. We show that any pair-interaction can be used to simulate any other by applying sequences of appropriate local control sequences. Efficient schemes for decoupling and time reversal can be constructed from orthogonal arrays. Conditions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Forum of Mathematics, Sigma
سال: 2017
ISSN: 2050-5094
DOI: 10.1017/fms.2017.2