Related papers: Deterministic Ans\"atze for the Measurement-based …
The measurement-based architecture is a paradigm of quantum computing, relying on the entanglement of a cluster of qubits and the measurements of a subset of it, conditioning the state of the unmeasured output qubits. While methods to map…
Quantum computing presents a promising path toward precise quantum chemical simulations, particularly for systems that challenge classical methods. This work investigates the performance of the Variational Quantum Eigensolver (VQE) in…
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 approach is a cornerstone of computational physics, considering both conventional and quantum computing computational platforms. The variational quantum eigensolver (VQE) algorithm aims to prepare the ground state of a…
The vacuum of the lattice Schwinger model is prepared on up to 100 qubits of IBM's Eagle-processor quantum computers. A new algorithm to prepare the ground state of a gapped translationally-invariant system on a quantum computer is…
We introduce the Cyclic Variational Quantum Eigensolver (CVQE), a hardware-efficient framework for accurate ground-state quantum simulation on noisy intermediate-scale quantum (NISQ) devices. CVQE departs from conventional VQE by…
The variational quantum eigensolver (VQE) remains one of the most popular near-term quantum algorithms for solving the electronic structure problem. Yet, for its practicality, the main challenge to overcome is improving the quantum…
Quantum computers hold immense potential in the field of chemistry, ushering new frontiers to solve complex many body problems that are beyond the reach of classical computers. However, noise in the current quantum hardware limits their…
The variational quantum eigensolver (VQE) algorithm combines the ability of quantum computers to efficiently compute expectation values with a classical optimization routine in order to approximate ground state energies of quantum systems.…
We investigate the potential of near-term quantum algorithms for solving partial differential equations (PDEs), focusing on a linear one-dimensional advection-diffusion equation as a test case. This study benchmarks a ground-state…
The near-term utility of quantum computers is hindered by hardware constraints in the form of noise. One path to achieving noise resilience in hybrid quantum algorithms is to decrease the required circuit depth -- the number of applied…
Variational quantum eigensolver (VQE) emerged as a first practical algorithm for near-term quantum computers. Its success largely relies on the chosen variational ansatz, corresponding to a quantum circuit that prepares an approximate…
Dissipative processes have long been proposed as a means of performing computational tasks on quantum computers that may be intrinsically more robust to noise. In this work, we prove two main results concerning the error-resilience…
The variational quantum eigensolver (VQE) is an algorithm for finding the ground states of a given Hamiltonian. Its application to binary-formulated combinatorial optimization (CO) has been widely studied in recent years. However, typical…
Distributed quantum computing (DQC) is a promising technique for scaling up quantum systems. While significant progress has been made in DQC for quantum circuit models, there exists much less research on DQC for measurement-based quantum…
Quantum chemistry is among the most promising applications of quantum computing, offering the potential to solve complex electronic structure problems more efficiently than classical approaches. A critical component of any quantum algorithm…
Quantum systems have historically been formidable to simulate using classical computational methods, particularly as the system size grows. In recent years, advancements in quantum computing technology have offered new opportunities for…
Quantum computing offers a promising paradigm for electromagnetic eigenmode analysis, enabling compact representations of complex field interactions and potential exponential speedup over classical numerical solvers. Recent efforts have…
In this work, we introduce a new qubit mapping strategy for the Variational Quantum Eigensolver (VQE) applied to nuclear shell model calculations, where each Slater determinant (SD) is mapped to a qubit, rather than assigning qubits to…
In measurement-based quantum computation (MBQC), local adaptive measurements are performed on the quantum state of a lattice of qubits. Quantum gates are associated with a particular measurement sequence, and one way of viewing MBQC is that…