Related papers: A Jacobi Diagonalization and Anderson Acceleration…
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term…
Quantum simulation of chemical systems is one of the most promising near-term applications of quantum computers. The variational quantum eigensolver, a leading algorithm for molecular simulations on quantum hardware, has a serious…
We present a collection of optimizers tuned for usage on Noisy Intermediate-Scale Quantum (NISQ) devices. Optimizers have a range of applications in quantum computing, including the Variational Quantum Eigensolver (VQE) and Quantum…
We introduce a variational algorithm based on the quantum alternating operator ansatz (QAOA) for the approximate solution of computationally hard counting problems. Our algorithm, dubbed VQCount, is based on the equivalence between random…
Variational quantum algorithms (VQAs) are promising methods to demonstrate quantum advantage on near-term devices as the required resources are divided between a quantum simulator and a classical optimizer. As such, designing a VQA which is…
In this work, we introduce several technical and analytical extensions to our recent state-averaged orbital-optimized variational quantum eigensolver (SA-OO-VQE) algorithm (see Ref. [S. Yalouz et al. ,Quantum Sci. Technol. 6, 024004…
Variational quantum eigensolvers (VQEs) combine classical optimization with efficient cost function evaluations on quantum computers. We propose a new approach to VQEs using the principles of measurement-based quantum computation. This…
Developing quantum algorithms adaptive to specific constraints of near-term devices is an essential step towards practical quantum advantage. In a recent work [Phys. Rev. Lett. 131, 103601(2023)], we show cold atoms in an optical cavity can…
Mapping out phase diagrams of quantum systems using classical simulations can be challenging or intractable due to the computational resources required to simulate even small quantum systems far away from the thermodynamic limit. We…
Until high-fidelity quantum computers with a large number of qubits become widely available, classical simulation remains a vital tool for algorithm design, tuning, and validation. We present a simulator for the Quantum Approximate…
The Adaptive Variational Quantum Eigensolver (ADAPT-VQE) is a promising approach for quantum algorithms in the Noisy Intermediate-Scale Quantum (NISQ) era, offering advantages over traditional VQE methods by reducing circuit depth and…
The Quantum Approximate Optimization Algorithm (QAOA) is a standard method for combinatorial optimization with a gate-based quantum computer. The QAOA consists of a particular ansatz for the quantum circuit architecture, together with a…
In the rapidly advancing domain of quantum optimization, the confluence of quantum algorithms such as Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAOA) with robust optimization methodologies presents a…
Quantum computers are expected to accelerate solving combinatorial optimization problems, including algorithms such as Grover adaptive search and quantum approximate optimization algorithm (QAOA). However, many combinatorial optimization…
Variational Quantum Algorithms (VQAs) are a leading approach for near-term quantum computing but face major optimization challenges from noise, barren plateaus, and complex energy landscapes. We benchmarked more than fifty metaheuristic…
We propose an algorithm for variational quantum algorithms (VQAs) to optimize the structure of parameterized quantum circuits (PQCs) efficiently. The algorithm optimizes the PQC structure on-the-fly in VQA by sequentially replacing a…
The variational quantum eigensolver (VQE) has emerged as one of the leading quantum algorithms for solving electronic structure problems on near-term noisy intermediate-scale quantum devices. However, its practical application to quantum…
Anderson Acceleration is a well-established method that allows to speed up or encourage convergence of fixed-point iterations. It has been successfully used in a variety of applications, in particular within the Self-Consistent Field (SCF)…
Quantum computing is expected to transform a range of computational tasks beyond the reach of classical algorithms. In this work, we examine the application of variational quantum algorithms (VQAs) for unsupervised image segmentation to…
The emerging field of quantum simulation of many-body systems is widely recognized as a very important application of quantum computing. A crucial step towards its realization in the context of many-electron systems requires a rigorous…