Related papers: Variational quantum algorithm based on the minimum…
We present a hybrid numerical-quantum method for solving the Poisson equation under homogeneous Dirichlet boundary conditions, leveraging the Quantum Fourier Transform (QFT) to enhance computational efficiency and reduce time and space…
Perturbation theory is an important technique for reducing computational cost and providing physical insights in simulating quantum systems with classical computers. Here, we provide a quantum algorithm to obtain perturbative energies on…
We propose a hybrid quantum-classical algorithm to compute approximate solutions of binary combinatorial problems. We employ a shallow-depth quantum circuit to implement a unitary and Hermitian operator that block-encodes the weighted…
Open quantum systems host a wide range of intriguing phenomena, yet their simulation on well-controlled quantum devices is challenging, owing to the exponential growth of the Hilbert space and the inherently non-unitary nature of the…
Electronic structure simulation is an anticipated application for quantum computers. Due to high-dimensional quantum entanglement in strongly correlated systems, the quantum resources required to perform such simulations are far beyond the…
Variational quantum algorithms and, in particular, variants of the varational quantum eigensolver have been proposed to address combinatorial optimization (CO) problems. Using only shallow ansatz circuits, these approaches are deemed…
Variational quantum algorithms (VQAs) provide a promising approach to achieve quantum advantage in the noisy intermediate-scale quantum era. In this era, quantum computers experience high error rates and quantum error detection and…
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…
We present a cascaded variational quantum eigensolver algorithm that only requires the execution of a set of quantum circuits once rather than at every iteration during the parameter optimization process, thereby increasing the…
The paper presents a variational quantum algorithm to solve initial-boundary value problems described by second-order partial differential equations. The approach uses hybrid classical/quantum hardware that is well suited for quantum…
Differential equations (DEs) serve as the cornerstone for a wide range of scientific endeavors, their solutions weaving through the core of diverse fields such as structural engineering, fluid dynamics, and financial modeling. DEs are…
Quantum computers can be used to address molecular structure, materials science and condensed matter physics problems, which currently stretch the limits of existing high-performance computing resources. Finding exact numerical solutions to…
Universal fault-tolerant quantum computers will require error-free execution of long sequences of quantum gate operations, which is expected to involve millions of physical qubits. Before the full power of such machines will be available,…
The prosperous development of both hardware and algorithms for quantum computing (QC) potentially prompts a paradigm shift in scientific computing in various fields. As an increasingly active topic in QC, the variational quantum algorithm…
Quantum computing opens up new possibilities for the simulation of many-body nuclear systems. As the number of particles in a many-body system increases, the size of the space if the associated Hamiltonian increases exponentially. This…
Although quantum computing holds promise for solving Combinatorial Optimization Problems (COPs), the limited qubit capacity of NISQ hardware makes large-scale instances intractable. Conventional methods attempt to bridge this gap through…
In the current noisy intermediate scale quantum era of quantum computation, available hardware is severely limited by both qubit count and noise levels, precluding the application of many current hybrid quantum-classical algorithms to…
Imaginary time evolution is a powerful tool for studying quantum systems. While it is possible to simulate with a classical computer, the time and memory requirements generally scale exponentially with the system size. Conversely, quantum…
Quantum chemistry has been viewed as one of the potential early applications of quantum computing. Two techniques have been proposed for electronic structure calculations: (i) the variational quantum eigensolver and (ii) the…
A local and distributive algorithm is proposed to find an optimal trial wave-function minimizing the Hamiltonian expectation in a quantum system. To this end, the quantum state of the system is connected to the Gibbs state of a classical…