Related papers: On the practical usefulness of the Hardware Effici…
Variational Quantum Algorithms (VQAs) are a class of hybrid quantum-classical algorithms that leverage on classical optimization tools to find the optimal parameters for a parameterized quantum circuit. One relevant application of VQAs is…
Quantum optimization allows for up to exponential quantum speedups for specific, possibly industrially relevant problems. As the key algorithm in this field, we motivate and discuss the Quantum Approximate Optimization Algorithm (QAOA),…
A key open question in quantum computing is whether quantum algorithms can potentially offer a significant advantage over classical algorithms for tasks of practical interest. Understanding the limits of classical computing in simulating…
Variational Quantum Eigensolvers (VQEs) are a powerful class of hybrid quantum-classical algorithms designed to approximate the ground state of a quantum system described by its Hamiltonian. VQEs hold promise for various applications,…
Current experimental quantum computing devices are limited by noise, mainly originating from entangling gates. If an efficient gate sequence for an operation is unknown, one often employs layered parameterized quantum circuits, especially…
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 variational optimization has been posed as an alternative to solve optimization problems faster and at a larger scale than what classical methods allow. In this paper we study systematically the role of entanglement, the structure…
This study introduces a novel minimalistic variational quantum ansatz inspired by algorithmic cooling principles. The proposed Heat Exchange algorithmic cooling ansatz (HE ansatz) facilitates efficient population redistribution without…
The task of learning a quantum circuit to prepare a given mixed state is a fundamental quantum subroutine. We present a variational quantum algorithm (VQA) to learn mixed states which is suitable for near-term hardware. Our algorithm…
Variational quantum algorithms are the leading candidate for advantage on near-term quantum hardware. When training a parametrized quantum circuit in this setting to solve a specific problem, the choice of ansatz is one of the most…
The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum algorithm for Near-term Intermediate-Scale Quantum computers (NISQ) providing approximate solutions for combinatorial optimiz\-ation problems. The QAOA utilizes…
The development of various dynamic ansatz-constructing techniques has ushered in a new era, rendering the practical exploitation of Noisy Intermediate-Scale Quantum (NISQ) hardware for molecular simulations increasingly viable. However,…
Hybrid quantum-classical algorithms have been proposed to circumvent noise limitations in quantum computers. Such algorithms delegate only a calculation of the expectation value to the quantum computer. Among them, the Variational Quantum…
Variational quantum algorithms (VQAs) represent a promising pathway toward achieving practical quantum advantage on near-term hardware. Despite this promise, for generic, expressive ans\"atze, their scalability is critically hindered by…
The number of measurements demanded by hybrid quantum-classical algorithms such as the variational quantum eigensolver (VQE) is prohibitively high for many problems of practical value. For such problems, realizing quantum advantage will…
Quantum computing has the potential to revolutionize quantum chemistry and material science by offering solutions to complex problems unattainable with classical computers. However, the development of efficient quantum algorithms that are…
The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by parameterized layers of quantum evolution. In theory, the…
In the era of noisy intermediate-scale quantum devices, variational quantum algorithms (VQAs) stand as a prominent strategy for constructing quantum machine learning models. These models comprise both a quantum and a classical component.…
We simulate a long-range extended Ising model in one dimension using a hybrid quantum algorithm, namely Variational Quantum Eigensolver (VQE). In this quantum simulation, we investigate how quantum resources scale with system size and…
Quantum Convolutional Neural Networks (QCNNs) have emerged as promising models for quantum machine learning tasks, including classification and data compression. This paper investigates the performance of QCNNs in comparison to the…