Scalable Quantum Computation of Highly Excited Eigenstates with Spectral Transforms

• URL: http://arxiv.org/abs/2302.06638v2
• Date: Thu, 12 Oct 2023 15:03:39 GMT
• Title: Scalable Quantum Computation of Highly Excited Eigenstates with Spectral Transforms
• Authors: Shao-Hen Chiew, Leong-Chuan Kwek
• Abstract summary: We use the HHL algorithm to prepare excited interior eigenstates of physical Hamiltonians in a variational and targeted manner. This is enabled by the efficient computation of the expectation values of inverse Hamiltonians on quantum computers. We detail implementations of this scheme for both fault-tolerant and near-term quantum computers.
• Score: 0.76146285961466
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a natural application of Quantum Linear Systems Problem (QLSP) solvers such as the HHL algorithm to efficiently prepare highly excited interior eigenstates of physical Hamiltonians in a variational and targeted manner. This is enabled by the efficient computation of the expectation values of inverse Hamiltonians on quantum computers, in situations where Hamiltonian simulation and the representation of eigenstates on quantum computers are efficient. Importantly, the usage of the QLSP solver as a subroutine within our algorithm -- with its inputs and outputs corresponding to physically meaningful objects such as Hamiltonians and eigenstates arising from physical systems -- does not conceal exponentially costly pre/post-processing steps that usually accompanies it in generic linear algebraic applications. We detail implementations of this scheme for both fault-tolerant and near-term quantum computers, analyze their efficiency and implementability, and detail conditions under which the QLSP solvers' exponentially better scaling in problem size render it advantageous over existing classical and quantum approaches. Simulation results for applications in many-body physics and quantum chemistry further demonstrate its effectiveness and scalability over existing approaches.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Demonstration of a variational quantum eigensolver with a solid-state spin system under ambient conditions [15.044543674753308]
  Quantum simulators offer the potential to utilize the quantum nature of a physical system to study another physical system. The variational-quantum-eigensolver algorithm is a particularly promising application for investigating molecular electronic structures. Spin-based solid-state qubits have the advantage of long decoherence time and high-fidelity quantum gates.
  arXiv  Detail & Related papers  (2024-07-23T09:17:06Z)
• Sparse Quantum State Preparation for Strongly Correlated Systems [0.0]
  In principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register offers a promising solution to overcome the limitations of traditional quantum chemistry methods. An essential requirement for ground state quantum algorithms to be practical is the initialisation of the qubits to a high-quality approximation of the sought-after ground state. Quantum State Preparation (QSP) allows the preparation of approximate eigenstates obtained from classical calculations, but it is frequently treated as an oracle in quantum information.
  arXiv  Detail & Related papers  (2023-11-06T18:53:50Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Identification of topological phases using classically-optimized variational quantum eigensolver [0.6181093777643575]
  Variational quantum eigensolver (VQE) is regarded as a promising candidate of hybrid quantum-classical algorithm for quantum computers. We propose classically-optimized VQE (co-VQE), where the whole process of the optimization is efficiently conducted on a classical computer. In co-VQE, we only use quantum computers to measure nonlocal quantities after the parameters are optimized.
  arXiv  Detail & Related papers  (2022-02-07T02:26:58Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Improved accuracy on noisy devices by non-unitary Variational Quantum Eigensolver for chemistry applications [0.0]
  We propose a modification of the Variational Quantum Eigensolver algorithm for electronic structure optimization using quantum computers. A non-unitary operator is combined with the original system Hamiltonian leading to a new variational problem with a simplified wavefunction Ansatz.
  arXiv  Detail & Related papers  (2021-01-22T20:17:37Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular Simulations on Quantum Computing Devices [0.0]
  We introduce a quantum solver of contracted eigenvalue equations, the quantum analogue of classical methods for the energies. We demonstrate the algorithm though computations on both a quantum simulator and two IBM quantum processing units.
  arXiv  Detail & Related papers  (2020-04-23T18:35:26Z)

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.