Related papers: Hamiltonian-based graph-state ansatz for variation…
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 algorithms are one of the most promising applications of near-term quantum computers; however, recent studies have demonstrated that unless the variational quantum circuits are configured in a problem-specific manner,…
In conventional circuit-based quantum computing architectures, the standard gate set includes arbitrary single-qubit rotations and two-qubit entangling gates. This choice is not always aligned with the native operations available in certain…
Variational quantum eigensolver (VQE) solves the ground state problem of a given Hamiltonian by finding the parameters of a quantum circuit ansatz that minimizes the Hamiltonian expectation value. Among possible quantum circuit ans\"{a}tze,…
Quantum computing is a promising technology because of the ability of quantum computers to process vector spaces with dimensions that increase exponentially with the simulated system size. Extracting the solution, however, is challenging as…
Calculating the energy spectrum of a quantum system is an important task, for example to analyse reaction rates in drug discovery and catalysis. There has been significant progress in developing algorithms to calculate the ground state…
One of the most promising applications for near term quantum computers is the simulation of physical quantum systems, particularly many-electron systems in chemistry and condensed matter physics. In solid state physics, finding the correct…
Variational quantum algorithms have been a promising candidate to utilize near-term quantum devices to solve real-world problems. The powerfulness of variational quantum algorithms is ultimately determined by the expressiveness of the…
Quantum computation represents an emerging framework to solve lattice gauge theories (LGT) with arbitrary gauge groups, a general and long-standing problem in computational physics. While quantum computers may encode LGT using only…
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…
We present a quantum variational algorithm based on a novel circuit that generates all permutations that can be spanned by one- and two-qubits permutation gates. The construction of the circuits follows from group-theoretical results, most…
A key goal of digital quantum computing is the simulation of fermionic systems such as molecules or the Hubbard model. Unfortunately, for present and near-future quantum computers the use of quantum error correction schemes is still out of…
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…
A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. This circuit is most commonly designed to respect the symmetries of the problem Hamiltonian and, in this…
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…
Variational quantum algorithms, which combine highly expressive parameterized quantum circuits (PQCs) and optimization techniques in machine learning, are one of the most promising applications of a near-term quantum computer. Despite their…
Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with speedup over classical cost…
For the variational quantum eigensolver we propose to generate trial wavefunctions from a small amount of selected Pauli terms of the problem Hamiltonian. Two different approaches, one inspired by the quantum approximate optimization…
The Variational Quantum Eigensolver (VQE) is a promising tool for simulating ground states of quantum many-body systems on noisy quantum computers. Its effectiveness relies heavily on the ansatz, which must be both hardware-efficient for…
The variational quantum eigensolver (VQE) is an attracting possible application of near-term quantum computers. Originally, the aim of the VQE is to find a ground state for a given specific Hamiltonian. It is achieved by minimizing the…