Related papers: Benchmarking a wide range of optimisers for solvin…
VQA have attracted a lot of attention from the quantum computing community for the last few years. Their hybrid quantum-classical nature with relatively shallow quantum circuits makes them a promising platform for demonstrating the…
Current state-of-the-art optimizers are adaptive gradient-based optimization methods such as Adam. Recently, there has been an increasing interest in formulating gradient-based optimizers in a probabilistic framework for better modeling the…
Solutions to many-body problem instances often involve an intractable number of degrees of freedom and admit no known approximations in general form. In practice, representing quantum-mechanical states of a given Hamiltonian using available…
Efficient quantum circuit optimization schemes are central to quantum simulation of strongly interacting quantum many body systems. Here, we present an optimization algorithm which combines machine learning techniques and tensor network…
We study an adiabatic variant of the variational quantum eigensolver (VQE) in which VQE is performed iteratively for a sequence of Hamiltonians along an adiabatic path. We derive the conditions under which gradient-based optimization…
In the context of Noisy Intermediate-Scale Quantum (NISQ) computing, parameterized quantum circuits (PQCs) represent a promising paradigm for tackling challenges in quantum sensing, optimal control, optimization, and machine learning on…
Hybrid quantum-classical optimization using near-term quantum technology is an emerging direction for exploring quantum advantage in high-dimensional systems. However, precise characterization of all experimental parameters is often…
A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum…
This paper presents a hybrid quantum-classical approach to prime factorization. The proposed algorithm is based on the Variational Quantum Eigensolver (VQE), which employs a classical optimizer to find the ground state of a given…
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…
This work explores the potential of the Variational Quantum Eigensolver in solving Dynamic Portfolio Optimization problems surpassing the 100 qubit utility frontier. We systematically analyze how to scale this strategy in complexity and…
The Fermi-Hubbard model (FHM) on a two dimensional square lattice has long been an important testbed and target for simulating fermionic Hamiltonians on quantum hardware. We present an alternative for quantum simulation of FHMs based on an…
Parameterized quantum circuits (PQCs) play an essential role in the application of variational quantum algorithms (VQAs) in noisy intermediate-scale quantum (NISQ) devices. The PQCs are a leading candidate to achieve a quantum advantage in…
When does a variational quantum algorithm converge to a globally optimal solution? Despite the large literature around variational approaches to quantum computing, the answer is largely unknown. We address this open question by developing a…
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…
Variational quantum circuits characterise the state of a quantum system through the use of parameters that are optimised using classical optimisation procedures that typically rely on gradient information. The circuit-execution complexity…
Variational quantum algorithms are tailored to perform within the constraints of current quantum devices, yet they are limited by performance-degrading errors. In this study, we consider a noise model that reflects realistic gate errors…
We present quantum algorithms, for Hamiltonians of linear combinations of local unitary operators, for Hamiltonian matrix-vector products and for preconditioning with the inverse of shifted reduced Hamiltonian operator that contributes to…
We propose a qubit efficient scheme to study ground state properties of quantum many-body systems on near-term noisy intermediate scale quantum computers. One can obtain a tensor network representation of the ground state using a number of…
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…