Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation

• URL: http://arxiv.org/abs/2405.03754v1
• Date: Mon, 6 May 2024 18:00:03 GMT
• Title: Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
• Authors: Oriel Kiss, Utkarsh Azad, Borja Requena, Alessandro Roggero, David Wakeham, Juan Miguel Arrazola,
• Abstract summary: We address the computation of the cumulative distribution function (CDF) of the spectral measure of the Hamiltonian. We introduce a signal processing technique for identifying the inflection point of the CDF. We conduct numerical experiments on a 26-qubit fully-connected Heisenberg model using a truncated density-matrix renormalization group (DMRG) initial state of low bond dimension.
• Score: 39.20075231137991
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We explore the practicality of early fault-tolerant quantum algorithms, focusing on ground-state energy estimation problems. Specifically, we address the computation of the cumulative distribution function (CDF) of the spectral measure of the Hamiltonian and the identification of its discontinu- ities. Scaling to bigger system sizes unveils three challenges: the smoothness of the CDF for large supports, the absence of tight lower bounds on the overlap with the actual ground state, and the complexity of preparing high-quality initial states. To tackle these challenges, we introduce a signal processing technique for identifying the inflection point of the CDF. We argue that this change of paradigm significantly simplifies the problem, making it more accessible while still being accurate. Hence, instead of trying to find the exact ground-state energy, we advocate improving on the classical estimate by aiming at the low-energy support of the initial state. Furthermore, we offer quantitative resource estimates for the maximum number of samples required to identify an increase in the CDF of a given size. Finally, we conduct numerical experiments on a 26-qubit fully-connected Heisenberg model using a truncated density-matrix renormalization group (DMRG) initial state of low bond dimension. Results show that the prediction obtained with the quantum algorithm aligns well with the DMRG-converged energy at large bond dimensions and requires several orders of magnitude fewer samples than predicted by the theory. Hence, we argue that CDF-based quantum algorithms are a viable, practical alternative to quantum phase estimation in resource-limited scenarios.

Related papers

• Variational LOCC-assisted quantum circuits for long-range entangled states [1.6258326496071918]
  Long-range entanglement is an important quantum resource, especially for topological orders and quantum error correction. A promising avenue is offered by replacing some quantum resources with local operations and classical communication (LOCC) Here, we propose a quantum-classical hybrid algorithm to find ground states of given Hamiltonians based on parameterized LOCC protocols.
  arXiv  Detail & Related papers  (2024-09-11T14:08:33Z)
• Quantum Semidefinite Programming with Thermal Pure Quantum States [0.5639904484784125]
  We show that a quantization'' of the matrix multiplicative-weight algorithm can provide approximate solutions to SDPs quadratically faster than the best classical algorithms. We propose a modification of this quantum algorithm and show that a similar speedup can be obtained by replacing the Gibbs-state sampler with the preparation of thermal pure quantum (TPQ) states.
  arXiv  Detail & Related papers  (2023-10-11T18:00:53Z)
• Dual-GSE: Resource-efficient Generalized Quantum Subspace Expansion [2.3847436897240453]
  A generalized quantum subspace expansion (GSE) has been proposed that is significantly robust against coherent errors. We propose a resource-efficient implementation of GSE, which we name "Dual-GSE" Remarkably, Dual-GSE can further simulate larger quantum systems beyond the size of available quantum hardware.
  arXiv  Detail & Related papers  (2023-09-25T14:28:40Z)
• An SU(2)-symmetric Semidefinite Programming Hierarchy for Quantum Max Cut [0.6873984911061559]
  We introduce a family of semidefinite programming (SDP) relaxations based on the Navascues-Pironio-Acin hierarchy. We show that the hierarchy converges to the optimal QMaxCut value at a finite level. We numerically demonstrate that the SDP-solvability practically becomes an efficiently-computable generalization of frustration-freeness.
  arXiv  Detail & Related papers  (2023-07-28T17:26:31Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• 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)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)

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.