Related papers: Demonstration of the Rodeo Algorithm on a Quantum …
In this paper, we implement a quantum algorithm -on IBM quantum devices, IBM QASM simulator and PPRC computer cluster -to find the energy values of the ground state and the first excited state of a particle in a finite square-well…
We calculate rovibrational energy levels of H$_2$O using a trapped-ion quantum computer. We first derive the qubit form of Watson's Hamiltonian, including the rovibrational coupling terms. In a second step, we employ a variant of the…
Variational algorithms are promising candidates to be implemented on near-term quantum computers. The variational quantum eigensolver (VQE) is a prominent example, where a parametrized trial state of the quantum mechanical wave function is…
Quantum Hamiltonian identification is important for characterizing the dynamics of quantum systems, calibrating quantum devices and achieving precise quantum control. In this paper, an effective two-step optimization (TSO) quantum…
Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is…
Quantum phase estimation is the workhorse behind any quantum algorithm and a promising method for determining ground state energies of strongly correlated quantum systems. Low-cost quantum phase estimation techniques make use of circuits…
In an ideal quantum measurement, the wave function of a quantum system collapses to an eigenstate of the measured observable, and the corresponding eigenvalue determines the measurement outcome. If the observable commutes with the system…
In this work we combine two distinct machine learning methodologies, sequential Monte Carlo and Bayesian experimental design, and apply them to the problem of inferring the dynamical parameters of a quantum system. We design the algorithm…
Quantum computers can be used to address molecular structure, materials science and condensed matter physics problems, which currently stretch the limits of existing high-performance computing resources. Finding exact numerical solutions to…
Time symmetry in quantum mechanics, where the current quantum state is determined jointly by both the past and the future, offers a more comprehensive description of physical phenomena. This symmetry facilitates both forward and backward…
A computation in adiabatic quantum computing is implemented by traversing a path of nondegenerate eigenstates of a continuous family of Hamiltonians. We introduce a method that traverses a discretized form of the path: At each step we apply…
We consider the task of approximating the ground state energy of two-local quantum Hamiltonians on bounded-degree graphs. Most existing algorithms optimize the energy over the set of product states. Here we describe a family of shallow…
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly…
Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…
We initiate the systematic study of experimental quantum physics from the perspective of computational complexity. To this end, we define the framework of quantum algorithmic measurements (QUALMs), a hybrid of black box quantum algorithms…
Estimating observable expectation values in eigenstates of quantum systems has a broad range of applications and is an area where early fault-tolerant quantum computers may provide practical quantum advantage. We develop a hybrid…
Many applications of quantum simulation require to prepare and then characterize quantum states by performing an efficient partial tomography to estimate observables corresponding to $k$-body reduced density matrices ($k$-RDMs). For…
Calculating the energy spectrum of a quantum system is an important task, for example to analyse reaction rates in drug discovery and catalysis. There has been significant progress in developing algorithms to calculate the ground state…
Variational algorithms have received significant attention in recent years due to their potential to solve practical problems using noisy intermediate-scale quantum (NISQ) devices. A fundamental step of these algorithms is the evaluation of…
An important step in building a quantum computer is calibrating experimentally implemented quantum gates to produce operations that are close to ideal unitaries. The calibration step involves estimating the systematic errors in gates and…