Related papers: Efficient step-merged quantum imaginary time evolu…
Developing scalable quantum algorithms to study finite-temperature physics of quantum many-body systems has attracted considerable interest due to recent advancements in quantum hardware. However, such algorithms in their present form…
We propose a new variational quantum algorithm, which we refer to as TIMES-ADAPT, that prepares time-evolved states in a low-energy or symmetric subspace of a time-independent Hamiltonian on a quantum computer. Using a specially trained…
The Variational Quantum Eigensolver (VQE) is a key algorithm for near-term quantum computers, yet its performance is often limited by the classical optimization of circuit parameters. We propose using the velocity Verlet algorithm, inspired…
Ground-state preparation is an important task in quantum computation. The probabilistic imaginary-time evolution (PITE) method is a promising candidate for preparing the ground state of the Hamiltonian, which comprises a single ancilla…
Quantum computing offers a scalable approach to solving the nuclear shell model, a highly complex and exponentially scaled many-body problem. This work presents a numerical simulation of the subspace search variational quantum eigensolver…
Quantum computing presents a promising path toward precise quantum chemical simulations, particularly for systems that challenge classical methods. This work investigates the performance of the Variational Quantum Eigensolver (VQE) in…
Quantum simulations are bound to be one of the main applications of near-term quantum computers. Quantum chemistry and condensed matter physics are expected to benefit from these technological developments. Several quantum simulation…
We present a hardware-efficient optimization scheme for quantum chemistry calculations, utilizing the Sampled Quantum Diagonalization (SQD) method. Our algorithm, optimized SQD (SQDOpt), combines the classical Davidson method technique with…
Many promising quantum applications depend on the efficient quantum simulation of an exponentially large sparse Hamiltonian, a task known as sparse Hamiltonian simulation, which is fundamentally important in quantum computation. Although…
Finding ground state energies on current quantum processing units (QPUs) using algorithms like the variational quantum eigensolver (VQE) continues to pose challenges. Hardware noise severely affects both the expressivity and trainability of…
The Variational Quantum Eigensolver (VQE) algorithm, as applied to finding the ground state of a Hamiltonian, is particularly well-suited for deployment on noisy intermediate-scale quantum (NISQ) devices. Here we utilize the VQE algorithm…
The variational quantum eigensolver (VQE) is a hybrid quantum-classical variational algorithm that produces an upper-bound estimate of the ground-state energy of a Hamiltonian. As quantum computers become more powerful and go beyond the…
The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In the era of near-term, noisy, intermediate-scale quantum (NISQ) hardware with…
The Variational Quantum Eigensolver (VQE) is a hybrid quantum-classical algorithm for preparing ground states in the current era of noisy devices. The classical component of the algorithm requires a large number of measurements on…
The Variational Quantum Eigensolver (VQE) is a method of choice to solve the electronic structure problem for molecules on near-term gate-based quantum computers. However, the circuit depth is expected to grow significantly with problem…
A probabilistic imaginary-time evolution (PITE) method was proposed as a nonvariational method to obtain a ground state on a quantum computer. In this formalism, the success probability of obtaining all imaginary-time evolution operators…
Determining the ground and low-lying excited states is critical in numerous scenarios. Recent work has proposed the ancilla-entangled variational quantum eigensolver (AEVQE) that utilizes entanglement between ancilla and physical qubits to…
The development of Fault-Tolerant Quantum Computer (FTQC) gradually raises a possibility to implement the Quantum Phase Estimation (QPE) algorithm. However, QPE works only for normalized systems. This requires the minimum and maximum of…
Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. The existing algorithms generally approximate the time evolution operators, which may need a deep…
The accurate computation of Hamiltonian ground, excited, and thermal states on quantum computers stands to impact many problems in the physical and computer sciences, from quantum simulation to machine learning. Given the challenges posed…