Related papers: Scalable quantum circuit generation for iterative …
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be…
In the noisy-intermediate-scale-quantum era, Variational Quantum Eigensolver (VQE) is a promising method to study ground state properties in quantum chemistry, materials science, and condensed physics. However, general quantum eigensolvers…
We develop and implement a novel pulse-based ansatz, which we call PANSATZ, for more efficient and accurate implementations of variational quantum algorithms (VQAs) on today's noisy intermediate-scale quantum (NISQ) computers. Our approach…
Under suitable assumptions, the quantum phase estimation (QPE) algorithm is able to achieve Heisenberg-limited precision scaling in estimating the ground state energy. However, QPE requires a large number of ancilla qubits and large circuit…
Variational quantum algorithms have emerged as a leading paradigm that extracts practical computation from near-term intermediate-scale quantum devices, enabling advances in quantum chemistry simulations, combinatorial optimization, and…
We propose a novel variational ansatz for the ground-state preparation of the $\mathbb{Z}_2$ lattice gauge theory (LGT) in quantum simulators. It combines dissipative and unitary operations in a completely deterministic scheme with a…
Gradient ascent pulse engineering algorithm (GRAPE) is a typical method to solve quantum optimal control problems. However, it suffers from an exponential resource in computing the time evolution of quantum systems with the increasing…
In this work, we compare three qubit-mapping strategies to study the structure of the nuclear ground state within the shell model description employing the Variational Quantum Eigensolver (VQE) approach. Although the initial point for…
We develop an extension of the variational quantum eigensolver (VQE) algorithm - multistate, contracted VQE (MC-VQE) - that allows for the efficient computation of the transition energies between the ground state and several low-lying…
This paper is an algorithmic study of quantum phase estimation with multiple eigenvalues. We present robust multiple-phase estimation (RMPE) algorithms with Heisenberg-limited scaling. The proposed algorithms improve significantly from the…
Molecular ground-state simulation is one of the most promising fields for demonstrating practical quantum advantage on near-term quantum computers. However, the Variational Quantum Eigensolver (VQE), a leading algorithm for this task, still…
We present a general systematic approach to design robust and high-fidelity quantum logic gates with Raman qubits using the technique of composite pulses. We use two mathematical tools -- the Morris-Shore and Majorana decompositions -- to…
Variational quantum algorithms (VQAs) have demonstrated great potentials in the Noisy Intermediate Scale Quantum (NISQ) era. In the workflow of VQA, the parameters of ansatz are iteratively updated to approximate the desired quantum states.…
Here we revisit the quantum phase estimation (QPE) algorithm, and devise an iterative method to improve the precision of QPE with propagators over a variety of time spans. For a given propagator and a certain eigenstate as input, QPE with…
We consider the preparation of all the eigenstates of spin chains using quantum circuits. It is known that generic eigenstates of free-fermionic spin chains can be prepared with circuits whose depth grows only polynomially with the length…
A new basis adaptive algorithm for hybrid quantum-classical platforms is introduced to efficiently find the ground-state (gs) properties of quantum many-body systems. The method addresses limitations of many algorithms, such as Variational…
Among variational quantum algorithms designed for NISQ devices, ADAPT-VQE stands out for its robustness against barren plateaus, particularly in estimating molecular ground states. On the other hand, counterdiabatic algorithms have shown…
Numerical approximation of quantum states via convex combinations of states with positive partial transposes (bi-PPT state) in multipartite systems constitutes a fundamental challenge in quantum information science. We reformulate this…
Here, we investigate the use of deep multi-scale entanglement renormalization (DMERA) circuits as a variational ansatz for ground states of gapless systems. We use the exactly-solvable one-dimensional critical transverse-field Ising model…
Ground-state preparation is a fundamental task in quantum simulation, because the overlap of the prepared state with the true ground state significantly affects the overall cost of subsequent quantum algorithms. We propose a three-stage…