Related papers: Iterative Qubit Coupled Cluster approach with effi…
Quantum phase estimation (QPE) serves as a building block of many different quantum algorithms and finds important applications in computational chemistry problems. Despite the rapid development of quantum hardware, experimental…
The variational quantum eigensolver has been proposed as a low-depth quantum circuit that can be employed to examine strongly correlated systems on today's noisy intermediate-scale quantum computers. We examine details associated with the…
Two novel measurement-based, quantum clustering algorithms are proposed based on quantum parallelism and entanglement. The first algorithm follows a divisive approach. The second algorithm is based on unsharp measurements, where we…
The recent advent of quantum algorithms for noisy quantum devices offers a new route toward simulating strong light-matter interactions of molecules in optical cavities for polaritonic chemistry. In this work, we introduce a general…
We present two techniques that can greatly reduce the number of gates required to realize an energy measurement, with application to ground state preparation in quantum simulations. The first technique realizes that to prepare the ground…
Quantum-selected configuration interaction (QSCI) utilizes an input quantum state on a quantum device to select important bases (electron configurations in quantum chemistry) that define a subspace in which to diagonalize a target…
A goal of quantum information technology is to control the quantum state of a system, including its preparation, manipulation, and measurement. However, scalability to many qubits and controlled connectivity between any selected qubits are…
The cluster state quantum computation is a versatile approach to build a scalable quantum computer. In this thesis we theoretically demonstrate that a one dimensional array of double quantum dots with long spin relaxation time can evolve to…
Quantum field theory (QFT) simulations are a potentially important application for noisy intermediate scale quantum (NISQ) computers. The ability of a quantum computer to emulate a QFT, therefore, constitutes a natural application-centric…
We explore the preparation of specific nuclear states on gate-based quantum hardware using variational algorithms. Large scale classical diagonalization of the nuclear shell model have reached sizes of $10^9 - 10^{10}$ basis states, but are…
Advances in quantum simulator technology is increasingly required because research on quantum algorithms is becoming more sophisticated and complex. State vector simulation utilizes CPU and memory resources in computing nodes exponentially…
The well-known algorithm for quantum phase estimation requires that the considered unitary is available as a conditional transformation depending on the quantum state of an ancilla register. We present an algorithm converting an unknown…
Clustering on NISQ hardware is constrained by data loading and limited qubits. We present \textbf{qc-kmeans}, a hybrid compressive $k$-means that summarizes a dataset with a constant-size Fourier-feature sketch and selects centroids by…
The recent quantum information boom has effected a resurgence of interest in unitary coupled cluster (UCC) theory. Our group's interest in local energy landscapes of unitary ans\"atze prompted us to investigate the classical approach of…
We develop a resource efficient step-merged quantum imaginary time evolution approach (smQITE) to solve for the ground state of a Hamiltonian on quantum computers. This heuristic method features a fixed shallow quantum circuit depth along…
Quantum machine learning has proven to be a fruitful area in which to search for potential applications of quantum computers. This is particularly true for those available in the near term, so called noisy intermediate-scale quantum (NISQ)…
A quantum eigensolver is designed under a multi-layer cluster mean-field (CMF) algorithm by partitioning a quantum system into spatially-separated clusters. For each cluster, a reduced Hamiltonian is obtained after a partial average over…
We present high-precision quantum computing simulations of three-body atoms (He, H$^-$) and molecules (H$_2^+$, HD$^+$), the latter being studied beyond the Born-Oppenheimer approximation. The Non-Iterative Disentangled Unitary Coupled…
The coupled cluster method (CCM) is a method of quantum many-body theory that may provide accurate results for the ground-state properties of lattice quantum spin systems even in the presence of strong frustration and for lattices of…
The coupled cluster method is considered a gold standard in quantum chemistry, reliably giving energies that are exact within chemical accuracy (1.6 mHartree). However, even in the CCSD approximation, where the cluster operator is truncated…