Variational quantum eigensolvers for sparse Hamiltonians

• URL: http://arxiv.org/abs/2012.07171v3
• Date: Thu, 9 Sep 2021 18:03:05 GMT
• Title: Variational quantum eigensolvers for sparse Hamiltonians
• Authors: William M. Kirby and Peter J. Love
• Abstract summary: Hybrid quantum-classical variational algorithms such as the variational quantum eigensolver (VQE) are promising applications for noisy, intermediate-scale quantum computers. We extend VQE to general sparse Hamiltonians.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hybrid quantum-classical variational algorithms such as the variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA) are promising applications for noisy, intermediate-scale quantum (NISQ) computers. Both VQE and QAOA variationally extremize the expectation value of a Hamiltonian. All work to date on VQE and QAOA has been limited to Pauli representations of Hamiltonians. However, many cases exist in which a sparse representation of the Hamiltonian is known but there is no efficient Pauli representation. We extend VQE to general sparse Hamiltonians. We provide a decomposition of a fermionic second-quantized Hamiltonian into a number of one-sparse, self-inverse, Hermitian terms linear in the number of ladder operator monomials in the second-quantized representation. We provide a decomposition of a general $d$-sparse Hamiltonian into $O(d^2)$ such terms. In both cases a single sample of any term can be obtained using two ansatz state preparations and at most six oracle queries. The number of samples required to estimate the expectation value to precision $\epsilon$ scales as $\epsilon^{-2}$ as for Pauli-based VQE. This widens the domain of applicability of VQE to systems whose Hamiltonian and other observables are most efficiently described in terms of sparse matrices.

Related papers

• New random compiler for Hamiltonians via Markov Chains [0.08192907805418585]
  Many quantum algorithms, such as adiabatic algorithms, require simulating Hamiltonian evolution. We develop a new compiler, similar to the first order randomized Trotter, but with an arguably simpler framework. It is more versatile as it supports a large class of randomisation schemes and as well as time-dependent weights.
  arXiv  Detail & Related papers  (2024-11-10T14:57:25Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Variational quantum Hamiltonian engineering [0.9002260638342727]
  We propose a variational quantum algorithm (VQA) called variational quantum Hamiltonian engineering (VQHE) to minimize the Pauli norm of Hamiltonian. First, we develop a theory to encode the Pauli norm optimization problem into the vector L1-norm minimization problem. Then we devise an appropriate cost function and utilize the parameterized quantum circuits (PQC) to minimize the cost function.
  arXiv  Detail & Related papers  (2024-06-13T10:57:35Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• Coherence generation with Hamiltonians [44.99833362998488]
  We explore methods to generate quantum coherence through unitary evolutions. This quantity is defined as the maximum derivative of coherence that can be achieved by a Hamiltonian. We identify the quantum states that lead to the largest coherence derivative induced by the Hamiltonian.
  arXiv  Detail & Related papers  (2024-02-27T15:06:40Z)
• Guidable Local Hamiltonian Problems with Implications to Heuristic Ansätze State Preparation and the Quantum PCP Conjecture [0.0]
  We study 'Merlinized' versions of the recently defined Guided Local Hamiltonian problem. These problems do not have a guiding state provided as a part of the input, but merely come with the promise that one exists. We show that guidable local Hamiltonian problems for both classes of guiding states are $mathsfQCMA$-complete in the inverse-polynomial precision setting.
  arXiv  Detail & Related papers  (2023-02-22T19:00:00Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Generalized phase-space description of non-linear Hamiltonian systems and the Harper-like dynamics [0.0]
  Phase-space features of the Wigner flow for generic one-dimensional systems with a Hamiltonian are analytically obtained. A framework can be extended to any quantum system described by Hamiltonians in the form of $HW(q,,p) = K(p) + V(q)$.
  arXiv  Detail & Related papers  (2022-02-24T11:31:54Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Dynamical Self-energy Mapping (DSEM) for quantum computing [0.0]
  For noisy intermediate-scale quantum (NISQ) devices only a moderate number of qubits with a limited coherence is available. We present how to bypass this challenge in practical molecular chemistry simulations on NISQ devices by employing a classical-quantum hybrid algorithm.
  arXiv  Detail & Related papers  (2020-10-12T04:12:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.