Quantum Eigensolver for General Matrices

• URL: http://arxiv.org/abs/2401.12091v1
• Date: Mon, 22 Jan 2024 16:29:08 GMT
• Title: Quantum Eigensolver for General Matrices
• Authors: Xiao-Ming Zhang, Yunkun Zhang, Wenhao He and Xiao Yuan
• Abstract summary: We present a novel family of quantum algorithms tailored for solving the eigenvalue problem for general matrices. Our algorithms find applications in diverse domains, including estimating the relaxation time of Markov chains. These applications underscore the significance of our quantum eigensolvers for problems across various disciplines.
• Score: 5.811990276393904
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The eigenvalue problem, a cornerstone in linear algebra, provides profound insights into studying matrix properties. Quantum algorithms addressing this problem have hitherto been constrained to special normal matrices assuming spectral decomposition, leaving the extension to general matrices an open challenge. In this work, we present a novel family of quantum algorithms tailored for solving the eigenvalue problem for general matrices, encompassing scenarios with complex eigenvalues or even defective matrices. Our approach begins by tackling the task of searching for an eigenvalue without additional constraints. For diagonalizable matrices, our algorithm has $\tilde O(\varepsilon^{-1})$ complexity with an error $\varepsilon$, achieving the nearly Heisenberg scaling. Subsequently, we study the identification of eigenvalues closest to a specified point or line, extending the results for ground energy and energy gap problems in Hermitian matrices. We achieve an accuracy scaling of $\tilde O(\varepsilon^{-2})$ for general diagonalizable matrices, further refining to $\tilde O(\varepsilon^{-1})$ under the condition of real eigenvalues or constant distance from the reference point. The algorithm's foundation lies in the synergy of three techniques: the relationship between eigenvalues of matrix $A$ and the minimum singular value of $A-\mu I$, quantum singular value threshold subroutine extended from quantum singular-value estimation, and problem-specific searching algorithms. Our algorithms find applications in diverse domains, including estimating the relaxation time of Markov chains, solving Liouvillian gaps in open quantum systems, and verifying PT-symmetry broken/unbroken phases. These applications underscore the significance of our quantum eigensolvers for problems across various disciplines.

Related papers

• Exponential distillation of dominant eigenproperties [0.0]
  Estimating observable expectation values in eigenstates of quantum systems has a broad range of applications.<n>We develop a hybrid quantum-classical algorithm that enables the estimation of an arbitrary observable expectation value in an eigenstate.
  arXiv  Detail & Related papers  (2025-06-04T18:49:08Z)
• Entanglement-assisted variational algorithm for discrete optimization problems [0.0]
  discrete optimization problems often exact intractable, necessitating the use of approximate methods. Heuristics inspired by classical physics have long played a central role in this domain. quantum annealing has emerged as a promising alternative, with hardware implementations realized on both analog and digital quantum devices.
  arXiv  Detail & Related papers  (2025-01-15T19:00:10Z)
• Computational supremacy in quantum simulation [22.596358764113624]
  We show that superconducting quantum annealing processors can generate samples in close agreement with solutions of the Schr"odinger equation. We conclude that no known approach can achieve the same accuracy as the quantum annealer within a reasonable timeframe.
  arXiv  Detail & Related papers  (2024-03-01T19:00:04Z)
• Exploring the topological sector optimization on quantum computers [5.458469081464264]
  topological sector optimization (TSO) problem attracts particular interests in the quantum many-body physics community. We demonstrate that the optimization difficulties of TSO problem are not restricted to the gaplessness, but are also due to the topological nature. To solve TSO problems, we utilize quantum imaginary time evolution (QITE) with a possible realization on quantum computers.
  arXiv  Detail & Related papers  (2023-10-06T14:51:07Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Effect of alternating layered ansatzes on trainability of projected quantum kernel [0.0]
  We analytically and numerically investigate the vanishing similarity issue in projected quantum kernels with alternating layered ansatzes. We find that variance depends on circuit depth, size of local unitary blocks and initial state, indicating the issue is avoidable if shallow alternating layered ansatzes are used.
  arXiv  Detail & Related papers  (2023-09-30T12:32:39Z)
• Variational quantum algorithms for scanning the complex spectrum of non-Hermitian systems [0.0]
  We propose a variational method for solving the non-Hermitian Hamiltonian on a quantum computer. The energy is set as a parameter in the cost function and can be tuned to obtain the whole spectrum. Our work suggests an avenue for solving non-Hermitian quantum many-body systems with variational quantum algorithms on near-term noisy quantum computers.
  arXiv  Detail & Related papers  (2023-05-31T12:50:22Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• 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)
• 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)
• Quantum amplitude damping for solving homogeneous linear differential equations: A noninterferometric algorithm [0.0]
  This work proposes a novel approach by using the Quantum Amplitude Damping operation as a resource, in order to construct an efficient quantum algorithm for solving homogeneous LDEs. We show that such an open quantum system-inspired circuitry allows for constructing the real exponential terms in the solution in a non-interferometric.
  arXiv  Detail & Related papers  (2021-11-10T11:25:32Z)
• Geometric Entropic Exploration [52.67987687712534]
  We introduce a new algorithm that maximises the geometry-aware Shannon entropy of state-visits in both discrete and continuous domains. Our key theoretical contribution is casting geometry-aware MSVE exploration as a tractable problem of optimising a simple and novel noise-contrastive objective function. In our experiments, we show the efficiency of GEM in solving several RL problems with sparse rewards, compared against other deep RL exploration approaches.
  arXiv  Detail & Related papers  (2021-01-06T14:15:07Z)
• Quantum computation of thermal averages in the presence of a sign problem [45.82374977939355]
  We illustrate the application of Quantum Computing techniques to the investigation of the thermodynamical properties of a simple system. We show how quantum algorithms completely solve the problem, and discuss how this can apply to more complex systems of physical interest.
  arXiv  Detail & Related papers  (2020-01-15T14:01:11Z)

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.