Related papers: Practical Quantum Computation of Chemical and Nucl…
Simulating quantum imaginary-time evolution (QITE) is a major promise of quantum computation. However, the known algorithms are either probabilistic (repeat until success) with impractically small success probabilities or coherent (quantum…
Quantum computers are expected to perform the full-configuration interaction calculations with less computational resources compared to classical ones, thanks to the use of the quantum phase estimation (QPE) algorithms. However, only a…
Many computationally hard problems can be encoded in quantum Hamiltonians. The solution to these problems is given by the ground states of these Hamiltonians. A state-of-the-art algorithm for finding the ground state of a Hamiltonian is the…
There is increasing interest in quantum algorithms that are based on the imaginary-time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy post-processing…
We calculate the energy levels of a system of neutrinos undergoing collective oscillations as functions of an effective coupling strength and radial distance from the neutrino source using the quantum Lanczos (QLanczos) algorithm…
Imaginary time evolution is a powerful tool for studying quantum systems. While it is possible to simulate with a classical computer, the time and memory requirements generally scale exponentially with the system size. Conversely, quantum…
Quantum computing has emerged as a promising technology for solving problems that are intractable for classical computers. In this study, we introduce quantum computing and implement the Variational Quantum Eigensolver (VQE) algorithm using…
Quantum phase estimation (QPE) plays a pivotal role in many quantum algorithms, offering provable speedups in applications such as Shor's factoring algorithm. While fault-tolerant quantum algorithms for combinatorial and Hamiltonian…
Efficiently preparing approximate ground-states of large, strongly correlated systems on quantum hardware is challenging and yet nature is innately adept at this. This has motivated the study of thermodynamically inspired approaches to…
Quantum computing is viewed as a promising technology because of its potential for polynomial growth in complexity, in contrast to the exponential growth observed in its classical counterparts. In the current Noisy Intermediate-Scale…
The calculation time for the energy of atoms and molecules scales exponentially with system size on a classical computer but polynomially using quantum algorithms. We demonstrate that such algorithms can be applied to problems of chemical…
Quantum simulation of molecular electronic structure is one of the most promising applications of quantum computing. However, achieving chemically accurate predictions for strongly correlated systems requires quantum phase estimation (QPE)…
The quantum imaginary time evolution (QITE) algorithm is a direct implementation of the classical imaginary time evolution algorithm on quantum computer. We implement the QITE algorithm for the case of nuclear Hartree-Fock equations in a…
We compare several quantum phase estimation (QPE) protocols intended for early fault-tolerant quantum computers (EFTQCs) in the context of models of their implementations on a surface code architecture. We estimate the logical and physical…
Variational Quantum Imaginary Time Evolution (VQITE) is a leading technique for ground state preparation on quantum computers. A significant computational challenge of VQITE is the determination of the quantum geometric tensor. We show that…
Computing excited-state properties of molecules and solids is considered one of the most important near-term applications of quantum computers. While many of the current excited-state quantum algorithms differ in circuit architecture,…
The time evolution operator plays a crucial role in the precise computation of chemical experiments on quantum computers and holds immense promise for advancing the fields of physical and computer sciences, with applications spanning…
The computation of excited electronic states is an important application for quantum computers. In this work, we simulate the excited state spectra of four aromatic heterocycles on IBM superconducting quantum computers, focusing on active…
We propose a unifying framework for the state preparation using quantum power method algorithms based on generalized quantum signal processing (GQSP). We apply GQSP to realize quantum analogs of classical power iteration, power Lanczos,…
Time evolution and scattering simulation in phenomenological models are of great interest for testing and validating the potential for near-term quantum computers to simulate quantum field theories. Here, we simulate one-particle…