Related papers: Postponing the orthogonality catastrophe: efficien…
We develop a scheme to prepare a desired state or subspace in high-dimensional Hilbert-spaces using repeated applications of a single static projection operator onto the desired target and fixed unitary dynamics. Benchmarks against other…
We explore the application of quantum optimal control (QOC) techniques to state preparation of lattice field theories on quantum computers. As a first example, we focus on the Schwinger model, quantum electrodynamics in 1+1 dimensions. We…
Ground state preparation is a central application of quantum algorithms for electronic structure. We introduce the classical reservoir approach, a low cost variational ansatz tailored to near-term hardware, requiring only nearest-neighbor…
Preparing algebraically correlated ground states of quantum many-body systems is an important, yet challenging task for quantum simulation. We introduce a protocol that employs local projective measurements and unitary feedback for…
High-dimensional quantum systems offer a new playground for quantum information applications due to their remarkable advantages such as higher capacity and noise resistance. We propose potentially practical schemes for remotely preparing…
Reliable preparation of many-body ground states is an essential task in quantum computing, with applications spanning areas from chemistry and materials modeling to quantum optimization and benchmarking. A variety of approaches have been…
The symmetry-projected Hartree--Fock ansatz for the electronic structure problem can efficiently account for static correlation in molecules, yet it is often unable to describe dynamic correlation in a balanced manner. Here, we consider a…
We introduce a method called resolution refinement that allows one to bootstrap eigenstate preparation on a quantum computer. We first prepare an eigenstate of a low-resolution Hamiltonian using any method of choice. The eigenstate is then…
Quantum computers can accurately compute ground state energies using phase estimation, but this requires a guiding state that has significant overlap with the true ground state. For large molecules and extended materials, it becomes…
Solving for quantum ground states is important for understanding the properties of quantum many-body systems, and quantum computers are potentially well-suited for solving for quantum ground states. Recent work has presented a nearly…
Controlled quantum mechanical devices provide a means of simulating more complex quantum systems exponentially faster than classical computers. Such "quantum simulators" rely heavily upon being able to prepare the ground state of…
The important problem of how to prepare a quantum mechanical system, $S$, in a specific initial state of interest - e.g., for the purposes of some experiment - is addressed. Three distinct methods of state preparation are described. One of…
We prove classical simulation hardness, under the generalized $\mathsf{P}\neq\mathsf{NP}$ conjecture, for quantum circuit families with applications in near-term chemical ground state estimation. The proof exploits a connection to particle…
While dissipation has traditionally been viewed as an obstacle to quantum coherence, it is increasingly recognized as a powerful computational resource. Dissipative protocols can prepare complex many-body quantum states by leveraging…
Quantum computers attract much attention as they promise to outperform their classical counterparts in solving certain type of problems. One of them with practical applications in quantum chemistry is simulation of complex quantum systems.…
We propose a quantum algorithm, inspired by ADAPT-VQE, to variationally prepare the ground state of a quantum Hamiltonian, with the desirable property that if it fails to find the ground state, it still yields a physically meaningful…
Standard one-way quantum computers (1WQC) combine time symmetric unitary evolution, with asymmetric treatment of boundaries: state preparation allows to enforce a chosen initial state, however, for the final state measurement chooses a…
Quantum algorithms for simulating electronic ground states are slower than popular classical mean-field algorithms such as Hartree-Fock and density functional theory, but offer higher accuracy. Accordingly, quantum computers have been…
We propose a quantum protocol that allows preparing a ground state (GS) of the honeycomb Kitaev model. Our approach efficiently uses underlying symmetries and techniques from topological error correction. It is based on the stabilization…
We present a novel method for improving the quantum simulation of the ground state energy of molecules. We perform a pre-processing step classically, which reduces the dimensionality of the problem by generating a custom mapping which…