Estimating the Number of States via the Rodeo Algorithm for Quantum
Computation
- URL: http://arxiv.org/abs/2312.04322v2
- Date: Wed, 27 Dec 2023 15:04:09 GMT
- Title: Estimating the Number of States via the Rodeo Algorithm for Quantum
Computation
- Authors: Julio Cesar Siqueira Rocha, Raphael Fortes Infante Gomes, Wallon
Anderson Tadaiesky Nogueira, Rodrigo Alves Dias
- Abstract summary: We develop an algorithm that determines the number of states associated with all energy levels of a quantum system without explicitly solving the Schr"odinger equation.
Quantum computers, with their innate ability to address the intricacies of quantum systems, make this approach particularly promising for the study of the thermodynamics of quantum systems.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Our proposal introduces a customization of the rodeo algorithm that enables
us to determine the number of states associated with all energy levels of a
quantum system without explicitly solving the Schr\"odinger equation. Quantum
computers, with their innate ability to address the intricacies of quantum
systems, make this approach particularly promising for the study of the
thermodynamics of quantum systems. To illustrate the effectiveness of our
approach, we apply it to compute the number of states of the 1D
transverse-field Ising model and, consequently, its specific heat.
Related papers
- Weighted Feedback-Based Quantum Algorithm for Excited States Calculation [0.6554326244334868]
We propose a novel weighted feedback-based quantum algorithm for excited state calculation.
We show that depending on how we design the weights and the feedback law, we can prepare the $p$th excited state or lowest energy states up to the $p$th excited state.
arXiv Detail & Related papers (2024-04-30T09:20:58Z) - Feedback-Based Quantum Algorithm for Excited States Calculation [0.6554326244334868]
We propose a new design methodology that combines the layer-wise construction of the quantum circuit in feedback-based quantum algorithms with a new feedback law based on a new Lyapunov function to assign the quantum circuit parameters.
We demonstrate the algorithm through an illustrative example and through an application in quantum chemistry.
arXiv Detail & Related papers (2024-04-06T12:51:17Z) - Quantum simulation of excited states from parallel contracted quantum
eigensolvers [5.915403570478968]
We show that a ground-state contracted quantum eigensolver can be generalized to compute any number of quantum eigenstates simultaneously.
We introduce two excited-state CQEs that perform the excited-state calculation while inheriting many of the remarkable features of the original ground-state version of the algorithm.
arXiv Detail & Related papers (2023-11-08T23:52:31Z) - Quantum Thermal State Preparation [39.91303506884272]
We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations.
We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states.
Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
arXiv Detail & Related papers (2023-03-31T17:29:56Z) - Calculating the many-body density of states on a digital quantum
computer [58.720142291102135]
We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer.
We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
arXiv Detail & Related papers (2023-03-23T17:46:28Z) - Quantum Davidson Algorithm for Excited States [42.666709382892265]
We introduce the quantum Krylov subspace (QKS) method to address both ground and excited states.
By using the residues of eigenstates to expand the Krylov subspace, we formulate a compact subspace that aligns closely with the exact solutions.
Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems.
arXiv Detail & Related papers (2022-04-22T15:03:03Z) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - Quantum Stochastic Walk Models for Quantum State Discrimination [6.85316573653194]
Quantum Walks (QSW) allow for a generalization of both quantum and classical random walks.
We consider the problem of quantum state discrimination on such a system, and we solve it by optimizing the network topology weights.
arXiv Detail & Related papers (2020-03-30T08:07:12Z) - 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) - Variational Quantum Algorithms for Steady States of Open Quantum Systems [2.740982822457262]
We propose a variational quantum algorithm to find the steady state of open quantum systems.
The fidelity between the optimal mixed state and the true steady state is over 99%.
This algorithm is derived from the natural idea of expressing mixed states with purification.
arXiv Detail & Related papers (2020-01-08T14:47:36Z)
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.