Related papers: Pruned-ADAPT-VQE: compacting molecular ans\"atze b…
By exploiting the invariance of the molecular Hamiltonian by a unitary transformation of the orbitals it is possible to significantly shorter the depth of the variational circuit in the Variational Quantum Eigensolver (VQE) algorithm by…
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 investigate the performance of the variational quantum eigensolver (VQE) for the optimal flight gate assignment problem. This problem is a combinatorial optimization problem that aims at finding an optimal assignment of flights to the…
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…
Quantum chemistry and materials is one of the most promising applications of quantum computing. Yet much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them. Most…
Variational wave function ansatze are an invaluable tool to study the properties of strongly correlated systems. We propose such a wave function, based on the theory of auxiliary fields and combining aspects of auxiliary-field quantum Monte…
The variational quantum eigensolver (VQE) framework has been instrumental in advancing near-term quantum algorithms. However, parameter optimization remains a significant bottleneck for VQE, requiring a large number of measurements for…
Variational quantum eigensolver (VQE) is a promising algorithm suitable for near-term quantum machines. VQE aims to approximate the lowest eigenvalue of an exponentially sized matrix in polynomial time. It minimizes quantum resource…
Reducing circuit depth is essential for implementing quantum simulations of electronic structure on near-term quantum devices. In this work, we propose a variational quantum eigensolver (VQE) based perturbation theory algorithm to…
We present a hybrid classical-quantum algorithm to solve optimization problems in current quantum computers, whose basic idea is to assist variational quantum eigensolvers (VQE) with adiabatic change of the Hamiltonian. The rational for…
Crypto-currency markets are known to exhibit inefficiencies, which presents opportunities for profitable cyclic transactions or arbitrage, where one currency is traded for another in a way that results in a net gain without incurring any…
A balanced description of both static and dynamic correlations in electronic systems with nearly degenerate low-lying states presents a challenge for multi-configurational methods on classical computers. We present here a quantum algorithm…
Quantum algorithms have gained increasing attention for addressing complex combinatorial problems in finance, notably portfolio optimization. This study systematically benchmarks two prominent variational quantum approaches, Variational…
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm for finding the minimum eigenvalue of a Hamiltonian that involves the optimization of a parameterized quantum circuit. Since the resulting optimization…
The variational quantum eigensolver (VQE) is a promising algorithm for demonstrating quantum advantage in the noisy intermediate-scale quantum (NISQ) era. However, optimizing VQE from random initial starting parameters is challenging due to…
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…
The Variational Quantum Eigensolver (VQE) algorithm has been developed to target near term Noisy Intermediate Scale Quantum (NISQ) computers as a method to find the eigenvalues of Hamiltonians. Unlike fully quantum algorithms such as…
Ab initio electronic excited state calculations are necessary for the quantitative study of photochemical reactions, but their accurate computation on classical computers is plagued by prohibitive scaling. The Variational Quantum Deflation…
Algorithms based on non-unitary evolution have attracted much interest for ground state preparation on quantum computers. One recently proposed method makes use of ancilla qubits and controlled unitary operators to implement weak…
The study of spontaneous supersymmetry breaking (SSB) on the lattice is obstructed by a severe sign problem. Quantum computing provides a promising alternative approach. In particular, properties of supersymmetry relate SSB to the…