Related papers: High ground state overlap via quantum embedding me…
Preparing the ground state of a system is an important task in physics. We propose a quantum algorithm for preparing the ground state of a physical system that can be simulated on a quantum computer. The system is coupled to an ancillary…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Computing ground-state properties of molecules is a promising application for quantum computers operating in concert with classical high-performance computing resources. Quantum embedding methods are a family of algorithms particularly…
We developed a general framework for hybrid quantum-classical computing of molecular and periodic embedding approaches based on an orbital space separation of the fragment and environment degrees of freedom. We demonstrate its potential by…
Considering recent advancements and successes in the development of efficient quantum algorithms for electronic structure calculations --- alongside impressive results using machine learning techniques for computation --- hybridizing…
In quantum physics, multiparticle systems are described by quantum states acting on tensor products of Hilbert spaces. This product structure leads to the distinction between product states and entangled states; moreover, one can quantify…
We estimate the resources required to prepare the ground state of a quantum many-body system on a quantum computer of intermediate size. This estimate is made possible using a combination of quantum many-body methods and analytic upper…
Despite rapid recent progress towards the development of quantum computers capable of providing computational advantages over classical computers, it seems likely that such computers will, initially at least, be required to run in a hybrid…
Quantum computers have the potential to efficiently simulate large-scale quantum systems for which classical approaches are bound to fail. Even though several existing quantum devices now feature total qubit numbers of more than one…
A large-scalable quantum computer model, whose qubits are represented by the subspace subtended by the ground state and the single exciton state on semiconductor quantum dots, is proposed. A universal set of quantum gates in this system may…
We analyze the ground state entanglement in a quantum adiabatic evolution algorithm designed to solve the NP-complete Exact Cover problem. The entropy of entanglement seems to obey linear and universal scaling at the point where the mass…
Quantum state tomography (QST) aims at estimating a quantum state from averaged quantum measurements made on copies of the state. Most quantum algorithms rely on QST at some point and it is a well explored topic in the literature, mostly…
Many-body ground state preparation is an important subroutine used in the simulation of physical systems. In this paper, we introduce a flexible and efficient framework for obtaining a state preparation circuit for a large class of…
Ground-state properties are central to our understanding of quantum many-body systems. At first glance, it seems natural and essential to obtain the ground state before analyzing its properties; however, its exponentially large Hilbert…
Kernel methods are a cornerstone of classical machine learning. The idea of using quantum computers to compute kernels has recently attracted attention. Quantum embedding kernels (QEKs) constructed by embedding data into the Hilbert space…
Quantum computers face inherent scaling challenges, a fact that necessitates investigation of distributed quantum computing systems, whereby scaling is achieved through interconnection of smaller quantum processing units. However,…
Quantum annealing is a promising technique which leverages quantum mechanics to solve hard optimization problems. Considerable progress has been made in the development of a physical quantum annealer, motivating the study of methods to…
Quantum computing offers the promise of revolutionizing quantum chemistry by enabling the solution of chemical problems for substantially less computational cost. While most demonstrations of quantum computation to date have focused on…
Quantum annealing provides a promising route for the development of quantum optimization devices, but the usefulness of such devices will be limited in part by the range of implementable problems as dictated by hardware constraints. To…
Preparing the ground state of a system of interacting classical particles is an NP-hard problem. Thus, there is in general no better algorithm to solve this problem than exhaustively going through all N configurations of the system to…