Related papers: Solving Nuclear Structure Problems with the Adapti…
The Variational Quantum Linear Solver (VQLS), a hybrid quantum-classical algorithm for solving linear systems, faces a practical scalability bottleneck: the Linear Combination of Unitaries (LCU) decomposition requires O(L^2) circuit…
Variational approaches, such as variational Monte Carlo (VMC) or the variational quantum eigensolver (VQE), are powerful techniques to tackle the ground-state many-electron problem. Often, the family of variational states is not invariant…
The variational quantum eigensolver (VQE) is a method that uses a hybrid quantum-classical computational approach to find eigenvalues and eigenvalues of a Hamiltonian. VQE has been proposed as an alternative to fully quantum algorithms such…
Quantum kernel methods offer significant theoretical benefits by rendering classically inseparable features separable in quantum space. Yet, the practical application of Quantum Machine Learning (QML), currently constrained by the…
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 computing is increasingly offering concrete solutions toward the simulation of nuclear structure, with the potential to overcome the exponential scaling that limits classical diagonalization methods in large spaces. A particularly…
The dynamical symmetries of the Fermion Dynamical Symmetry Model are used as a principle of truncation for the spherical shell model. Utilizing the usual principle of energy-dictated truncation to select a valence space, and…
Quantum ground-state problems are computationally hard problems; for general many-body Hamiltonians, there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating…
As a hybrid quantum-classical algorithm, the variational quantum eigensolver is widely applied in quantum chemistry simulations, especially in computing the electronic structure of complex molecular systems. However, on existing noisy…
Quantum chemistry is envisioned as an early and disruptive application for quantum computers. Yet, closer scrutiny of the proposed algorithms shows that there are considerable difficulties along the way. Here, we propose two criteria for…
Quantum Phase Estimation (QPE) is a cornerstone algorithm in quantum computing, with applications ranging from integer factorization to quantum chemistry simulations. However, the resource demands of standard QPE, which require a large…
We study the exact ground states of the Su--Schrieffer--Heeger open chain and of the Kitaev open chain, using the Variational Quantum Eigensolver (VQE) algorithm. These models host symmetry-protected topological phases, characterized by…
Variational quantum eigensolver~(VQE) typically optimizes variational parameters in a quantum circuit to prepare eigenstates for a quantum system. Its applications to many problems may involve a group of Hamiltonians, e.g., Hamiltonian of a…
Variational Quantum Algorithms (VQA) have emerged with a wide variety of applications. One question to ask is either they can efficiently be implemented and executed on existing architectures. Current hardware suffers from uncontrolled…
We experimentally demonstrate a qubit-efficient variational quantum eigensolver (VQE) algorithm using a superconducting quantum processor, employing minimal quantum resources with only a transmon qubit coupled to a high-coherence photonic…
Atomic basis sets are widely employed within quantum mechanics based simulations of matter. We introduce a machine learning model that adapts the basis set to the local chemical environment of each atom, prior to the start of self…
The Variational Quantum Eigensolver (VQE) is a promising candidate for quantum applications on near-term Noisy Intermediate-Scale Quantum (NISQ) computers. Despite a lot of empirical studies and recent progress in theoretical understanding…
A quantum computing algorithm is proposed to obtain low-lying excited states in many-body interacting systems. The approximate eigenstates are obtained by using a quantum space diagonalization method in a subspace of states selected from…
Performing a shell model calculation for heavy nuclei has been a long-standing problem in nuclear physics. Here we propose one possible solution. The central idea of this proposal is to take the advantages of two existing models, the…
Quantum computers promise to revolutionize our ability to simulate molecules, and cloud-based hardware is becoming increasingly accessible to a wide body of researchers. Algorithms such as Quantum Phase Estimation and the Variational…