69 citations · 160 across the 11 of their papers we have counts for
11 papers
Optimizing and Comparing Quantum Resources of Statistical Phase Estimation and Krylov Subspace Diagonalization
Oumarou Oumarou, Pauline J. Ollitrault, Stefano Polla +1
We develop a framework that enables direct and meaningful comparison of two early fault-tolerant methods for the computation of eigenenergies, namely \gls{qksd} and \gls{spe}, with…
Molecular Properties from Quantum Krylov Subspace Diagonalization
Oumarou Oumarou, Pauline J. Ollitrault, Cristian L. Cortes +3
Quantum Krylov subspace diagonalization is a prominent candidate for early fault tolerant quantum simulation of many-body and molecular systems, but so far the focus has been mainl…
Tailored and Externally Corrected Coupled Cluster with Quantum Inputs
Maximilian Scheurer, Gian-Luca R. Anselmetti, Oumarou Oumarou +2
We propose to use wavefunction overlaps obtained from a quantum computer as inputs for the classical split-amplitude techniques, tailored and externally corrected coupled cluster,…
Accelerating Quantum Computations of Chemistry Through Regularized Compressed Double Factorization
Oumarou Oumarou, Maximilian Scheurer, Robert M. Parrish +2
We propose the regularized compressed double factorization (RC-DF) method to classically compute compressed representations of molecular Hamiltonians that enable efficient simulati…
Purification-based quantum error mitigation of pair-correlated electron simulations
T. E. O'Brien, G. Anselmetti, F. Gkritsis +173
An important measure of the development of quantum computing platforms has been the simulation of increasingly complex physical systems. Prior to fault-tolerant quantum computing,…
Efficient Quantum Analytic Nuclear Gradients with Double Factorization
Edward G. Hohenstein, Oumarou Oumarou, Rachael Al-Saadon +4
Efficient representations of the Hamiltonian such as double factorization drastically reduce circuit depth or number of repetitions in error corrected and noisy intermediate scale…
Fast quantum circuit simulation using hardware accelerated general purpose libraries
Oumarou Oumarou, Alexandru Paler, Robert Basmadjian
Quantum circuit simulators have a long tradition of exploiting massive hardware parallelism. Most of the times, parallelism has been supported by special purpose libraries tailored…
Halving the width of Toffoli based constant modular addition to n+3 qubits
Oumarou Oumarou, Alexandru Paler, Robert Basmadjian
We present an arithmetic circuit performing constant modular addition having depth of Toffoli gates and using a total of qubits. This is an improvement by a…
On the realistic worst case analysis of quantum arithmetic circuits
Alexandru Paler, Oumarou Oumarou, Robert Basmadjian
We provide evidence that commonly held intuitions when designing quantum circuits can be misleading. In particular we show that: a) reducing the T-count can increase the total dept…
QUANTIFY: A framework for resource analysis and design verification of quantum circuits
Oumarou Oumarou, Alexandru Paler, Robert Basmadjian
Quantum resource analysis is crucial for designing quantum circuits as well as assessing the viability of arbitrary (error-corrected) quantum computations. To this end, we introduc…
Parallelising the Queries in Bucket Brigade Quantum RAM
Alexandru Paler, Oumarou Oumarou, Robert Basmadjian
Quantum algorithms often use quantum RAMs (QRAM) for accessing information stored in a database-like manner. QRAMs have to be fast, resource efficient and fault-tolerant. The latte…