When to Reject a Ground State Preparation Algorithm

• URL: http://arxiv.org/abs/2212.09492v2
• Date: Thu, 22 Dec 2022 15:08:02 GMT
• Title: When to Reject a Ground State Preparation Algorithm
• Authors: Katerina Gratsea, Chong Sun and Peter D. Johnson
• Abstract summary: We introduce a criteria for accepting or rejecting a GSP method for the purposes of GSEE. We consider different methods ranging from algorithms with provable performance guarantees to benchmark their performance on different chemical systems. This work sets a foundation from which to further explore the requirements to achieve quantum advantage in quantum chemistry.
• Score: 3.8624049174917214
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In recent years substantial research effort has been devoted to quantum algorithms for ground state energy estimation (GSEE) in chemistry and materials. Given the many heuristic and non-heuristic methods being developed, it is challenging to assess what combination of these will ultimately be used in practice. One important metric for assessing utility is runtime. For most GSEE algorithms, the runtime depends on the ground state preparation (GSP) method. Towards assessing the utility of various combinations of GSEE and GSP methods, we asked under which conditions a GSP method should be accepted over a reference method, such as the Hartree-Fock state. We introduce a criteria for accepting or rejecting a GSP method for the purposes of GSEE. We consider different GSP methods ranging from heuristics to algorithms with provable performance guarantees and perform numerical simulations to benchmark their performance on different chemical systems, starting from small molecules like the hydrogen atom to larger systems like the jellium. In the future this approach may be used to abandon certain VQE ansatzes and other heursitics. Yet so far our findings do not provide evidence against the use of VQE and more expensive heuristic methods, like the low-depth booster. This work sets a foundation from which to further explore the requirements to achieve quantum advantage in quantum chemistry.

Related papers

• Comparing Classical and Quantum Ground State Preparation Heuristics [44.99833362998488]
  Ground state preparation (GSP) is a crucial component in GSEE algorithms. In this study, we investigated whether in those cases quantum GSP methods could improve the overlap values compared to Hartree-Fock.
  arXiv  Detail & Related papers  (2024-01-10T18:16:36Z)
• Q-Seg: Quantum Annealing-Based Unsupervised Image Segmentation [4.737806718785056]
  We present Q-Seg, a novel unsupervised image segmentation method based on quantum annealing. We formulate the pixel-wise segmentation problem, which assimilates spectral and spatial information of the image, as a graph-cut optimization task. Empirical evaluations on synthetic datasets have shown that Q-Seg has better runtime performance than the state-of-the-art classical solution.
  arXiv  Detail & Related papers  (2023-11-21T17:27:20Z)
• Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping [55.47824411563162]
  Estimation of the energy of quantum many-body systems is a paradigmatic task in various research fields. We aim to find the optimal strategy with single-qubit measurements that yields the highest provable accuracy given a total measurement budget. We develop a practical, efficient estimation strategy, which we call ShadowGrouping.
  arXiv  Detail & Related papers  (2023-01-09T14:41:07Z)
• Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation [50.591267188664666]
  Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
  arXiv  Detail & Related papers  (2022-03-14T16:51:36Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• MQBench: Towards Reproducible and Deployable Model Quantization Benchmark [53.12623958951738]
  MQBench is a first attempt to evaluate, analyze, and benchmark the and deployability for model quantization algorithms. We choose multiple platforms for real-world deployments, including CPU, GPU, ASIC, DSP, and evaluate extensive state-of-the-art quantization algorithms. We conduct a comprehensive analysis and find considerable intuitive or counter-intuitive insights.
  arXiv  Detail & Related papers  (2021-11-05T23:38:44Z)
• Evaluation on Genetic Algorithms as an optimizer of Variational Quantum Eigensolver(VQE) method [1.0742675209112622]
  Variational-Quantum-Eigensolver(VQE) method on a quantum computer is a well-known hybrid algorithm to solve the eigenstates and eigenvalues that uses both quantum and classical computers. This method has the potential to solve quantum chemical simulation including polymer and complex optimization problems that are never able to be solved in a realistic time.
  arXiv  Detail & Related papers  (2021-10-14T15:10:16Z)
• Quantum Alternating Operator Ansatz (QAOA) Phase Diagrams and Applications for Quantum Chemistry [0.0]
  We modify QAOA to apply to finding ground states of molecules and empirically evaluate the modified algorithm on several molecules. We find robust qualitative behavior for QAOA as a function of a number of steps and size of the parameters, and demonstrate this behavior also occurs in standard QAOA search.
  arXiv  Detail & Related papers  (2021-08-30T08:24:38Z)
• Adaptive shot allocation for fast convergence in variational quantum algorithms [0.0]
  We present a new gradient descent method using an adaptive number of shots at each step, called the global Coupled Adaptive Number of Shots (gCANS) method. These improvements reduce both the time and money required to run VQAs on current cloud platforms.
  arXiv  Detail & Related papers  (2021-08-23T22:29:44Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)

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.