arXiv subjects

David Muñoz Ramo

Publications and source records attributed to David Muñoz Ramo.

31 records · Page 2Linked to original sources

arXiv2023

Demonstrating Bayesian Quantum Phase Estimation with Quantum Error Detection

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 demonstration of QPE for chemistry problems remains challenging due to its large circuit depth and the lack of quantum resources to protect the hardware from noise with fully fault-tolerant protocols. In the present work, we take a step towards fault-tolerant quantum computing by demonstrating a QPE algorithm on a Quantinuum trapped-ion computer. We employ a Bayesian approach to QPE and introduce a routine for optimal parameter selection, which we combine with a $[[ n+2,n,2 ]]$ quantum error detection code carefully tailored to the hardware capabilities. As a simple quantum chemistry example, we take a hydrogen molecule represented by a two-qubit Hamiltonian and estimate its ground state energy using our QPE protocol. In the experiment, we use the quantum circuits containing as many as 920 physical two-qubit gates to estimate the ground state energy within $6\times 10^{-3}$ hartree of the exact value.

quant-ph↗

arXiv2023

Calculating the Single-Particle Many-body Green's Functions via the Quantum Singular Value Transform Algorithm

The Quantum Singular Value Transformation (QSVT) is a technique that provides a unified framework for describing many of the quantum algorithms discovered to date. We implement a noise-free simulation of the technique to investigate how it can be used to perform matrix inversion, which is an important step in calculating the single-particle Green's function in the Lehmann representation. Due to the inverse function not being defined at zero, we explore the effect of approximating f(x)=1/x with a polynomial. This is carried out by calculating the single-particle Green's function of the two-site single-impurity Anderson model. We also propose a new circuit construction for the linear combination of unitaries block encoding technique, that reduces the number of single and two-qubit gates required.

quant-ph↗

arXiv2023

Simulating non-unitary dynamics using quantum signal processing with unitary block encoding

We adapt a recent advance in resource-frugal quantum signal processing - the Quantum Eigenvalue Transform with Unitary matrices (QET-U) - to explore non-unitary imaginary time evolution on early fault-tolerant quantum computers using exactly emulated quantum circuits. We test strategies for optimising the circuit depth and the probability of successfully preparing the desired imaginary-time evolved states. For the task of ground state preparation, we confirm that the probability of successful post-selection is quadratic in the initial reference state overlap $γ$ as $O(γ^2)$. When applied instead to thermal state preparation, we show QET-U can directly estimate partition functions at exponential cost. Finally, we combine QET-U with Trotter product formula to perform non-normal Hamiltonian simulation in the propagation of Lindbladian open quantum system dynamics. We find that QET-U for non-unitary dynamics is flexible, intuitive and straightforward to use, and suggest ways for delivering quantum advantage in simulation tasks.

quant-ph↗

arXiv2023

Modelling Carbon Capture on Metal-Organic Frameworks with Quantum Computing

Despite the recent progress in quantum computational algorithms for chemistry, there is a dearth of quantum computational simulations focused on material science applications, especially for the energy sector, where next generation sorbing materials are urgently needed to battle climate change. To drive their development, quantum computing is applied to the problem of CO$_2$ adsorption in Al-fumarate Metal-Organic Frameworks. Fragmentation strategies based on Density Matrix Embedding Theory are applied, using a variational quantum algorithm as a fragment solver, along with active space selection to minimise qubit number. By investigating different fragmentation strategies and solvers, we propose a methodology to apply quantum computing to Al-fumarate interacting with a CO$_2$ molecule, demonstrating the feasibility of treating a complex porous system as a concrete application of quantum computing. Our work paves the way for the use of quantum computing techniques in the quest of sorbents optimisation for more efficient carbon capture and conversion applications.

quant-ph↗

arXiv2022

Strongly Contracted N-Electron Valence State Perturbation Theory Using Reduced Density Matrices from a Quantum Computer

We introduce QRDM-NEVPT2: a hybrid quantum-classical implementation of strongly-contracted N-electron Valence State $2^{nd}$-order Perturbation Theory (SC-NEVPT2), in which the Complete Active Space Configuration Interaction (CASCI) step, capturing static correlation effects, is replaced by a simulation performed on a quantum computer. Subsequently, n-particle Reduced Density Matrices (n-RDMs) measured on a quantum device are used directly in a classical SC-NEVPT2 calculation, which recovers remaining dynamic electron correlation effects approximately. We also discuss the use of the cumulant expansion to approximate the whole 4-RDM matrix or only its zeros. In addition to noiseless state-vector quantum simulations, we demonstrate, for the first time, a hybrid quantum-classical multi-reference perturbation theory calculation, with the quantum part performed on a quantum computer.

quant-ph↗

arXiv2022

Preentangling Quantum Algorithms -- the Density Matrix Renormalization Group-assisted Quantum Canonical Transformation

We propose the use of parameter-free preentanglers as initial states for quantum algorithms. We apply this idea to the electronic structure problem, combining a quantized version of the Canonical Transformation by Yanai and Chan [J. Chem. Phys. 124, 194106 (2006)] with the Complete Active Space Density Matrix Renormalization Group. This new ansatz allows to shift the computational burden between the quantum and the classical processor. In the vicinity of multi-reference points in the potential energy surfaces of H$_2$O, N$_2$, BeH$_2$ and the P4 system, we find this strategy to require significantly less parameters than corresponding generalized unitary coupled cluster circuits. We propose a new algorithm to prepare Matrix Product States based on the Linear Combination of Unitaries and compare it to the Sequential Unitary Algorithm proposed by Ran in [Phys. Rev. A 101, 032310 (2020)].

quant-ph↗

arXiv2022

Reducing Unitary Coupled Cluster Circuit Depth by Classical Stochastic Amplitude Pre-Screening

Unitary Coupled Cluster (UCC) approaches are an appealing route to utilising quantum hardware to perform quantum chemistry calculations, as quantum computers can in principle perform UCC calculations in a polynomially scaling fashion, as compared to the exponential scaling required on classical computers. Current noisy intermediate scale quantum (NISQ) computers are limited by both hardware capacity in number of logical qubits and the noise introduced by the deep circuits required for UCC calculations using the Variational Quantum Eigensolver (VQE) approach. We present a combined classical--quantum approach where a stochastic classical UCC pre-processing step is used to determine the important excitations in the UCC ansatz. The reduced number of selected excitations are then used in a UCC-based VQE calculation. This approach gives a systematically improvable approximation, and we show that significant reductions in quantum resources can be achieved, with simulations on the CH$_2$, N$_2$ and N$_2$H$_2$ molecules giving sub-milliHartree errors.

quant-ph↗

arXiv2022

Quantum hardware calculations of periodic systems with partition-measurement symmetry verification: simplified models of hydrogen chain and iron crystals

Running quantum algorithms on real hardware is essential for understanding their strengths and limitations, especially in the noisy intermediate scale quantum (NISQ) era. Herein we focus on the practical aspect of quantum computational calculations of solid-state crystalline materials based on theory developed in our group by using real quantum hardware with a novel noise mitigation technique referred to as partition-measurement symmetry verification, which performs post-selection of shot counts based on $Z_{2}$ and $U_{1}$ symmetry verification. We select two periodic systems with different level of complexity for these calculations. One of them is the distorted hydrogen chain as an example of very simple systems, and the other one is iron crystal in the BCC and FCC phases as it is considered to be inaccessible by using classical computational wavefunction methods. The ground state energies are evaluated based on the translational quantum subspace expansion (TransQSE) method for the hydrogen chain, and periodic boundary condition adapted VQE for our iron models. By applying these techniques for the simplest 2 qubit iron model systems, the correlation energies obtained by the hardware calculations agree with those of the state-vector simulations within $\sim$5 kJ/mol. Although the quantum computational resources used for those experiments are still limited, the techniques applied to obtain our simplified models will be applicable in essentially the same manner to more complicated cases as quantum hardware matures.

quant-ph↗

arXiv2021

Quantum Computational Quantification of Protein-Ligand Interactions

We have demonstrated a prototypical hybrid classical and quantum computational workflow for the quantification of protein-ligand interactions. The workflow combines the Density Matrix Embedding Theory (DMET) embedding procedure with the Variational Quantum Eigensolver (VQE) approach for finding molecular electronic ground states. A series of $β$-secretase (BACE1) inhibitors is rank-ordered using binding energy differences calculated on the latest superconducting transmon (IBM) and trapped-ion (Honeywell) Noisy Intermediate Scale Quantum (NISQ) devices. This is the first application of real quantum computers to the calculation of protein-ligand binding energies. The results shed light on hardware and software requirements which would enable the application of NISQ algorithms in drug design.

quant-ph↗

arXiv2021

Evaluating low-depth quantum algorithms for time evolution on fermion-boson systems

Simulating time evolution of quantum systems is one of the most promising applications of quantum computing and also appears as a subroutine in many applications such as Green's function methods. In the current era of NISQ machines we assess the state of algorithms for simulating time dynamics with limited resources. We propose the Jaynes-Cummings model and extensions to it as useful toy models to investigate time evolution algorithms on near-term quantum computers. Using these simple models, direct Trotterisation of the time evolution operator produces deep circuits, requiring coherence times out of reach on current NISQ hardware. Therefore we test two alternative responses to this problem: variational compilation of the time evolution operator, and variational quantum simulation of the wavefunction ansatz. We demonstrate numerically to what extent these methods are successful in time evolving this system. The costs in terms of circuit depth and number of measurements are compared quantitatively, along with other drawbacks and advantages of each method. We find that computational requirements for both methods make them suitable for performing time evolution simulations of our models on NISQ hardware. Our results also indicate that variational quantum compilation produces more accurate results than variational quantum simulation, at the cost of a larger number of measurements.

quant-ph↗

arXiv2021

Momentum-Space Unitary Coupled Cluster and Translational Quantum Subspace Expansion for Periodic Systems on Quantum Computers

We demonstrate the use of the Variational Quantum Eigensolver (VQE) to simulate solid state crystalline materials. We adapt the Unitary Coupled Cluster ansatz to periodic boundary conditions in real space and momentum space representations and directly map complex cluster operators to a quantum circuit ansatz to take advantage of the reduced number of excitation operators and Hamiltonian terms due to momentum conservation. To further reduce required quantum resources, such as the number of UCCSD amplitudes, circuit depth, required number of qubits and number of measurement circuits, we investigate a translational Quantum Subspace Expansion method (TransQSE) for the localized representation of the periodic Hamiltonian. Additionally, we also demonstrate an extension of the point group symmetry based qubit tapering method to periodic systems. We compare accuracy and computational costs for a range of geometries for 1D chains of dimerized hydrogen, helium and lithium hydride with increasing number of momentum space grid points and also demonstrate VQE calculations for 2D and 3D hydrogen and helium lattices. Our presented strategies enable the use of near-term quantum hardware to perform solid state simulation with variational quantum algorithms.

quant-ph↗

arXiv2020

Evaluating the noise resilience of variational quantum algorithms

We simulate the effects of different types of noise in state preparation circuits of variational quantum algorithms. We first use a variational quantum eigensolver to find the ground state of a Hamiltonian in presence of noise, and adopt two quality measures in addition to the energy, namely fidelity and concurrence. We then extend the task to the one of constructing, with a layered quantum circuit ansatz, a set of general random target states. We determine the optimal circuit depth for different types and levels of noise, and observe that the variational algorithms mitigate the effects of noise by adapting the optimised parameters. We find that the inclusion of redundant parameterised gates makes the quantum circuits more resilient to noise. For such overparameterised circuits different sets of parameters can result in the same final state in the noiseless case, which we denote as parameter degeneracy. Numerically, we show that this degeneracy can be lifted in the presence of noise, with some states being significantly more resilient to noise than others. We also show that the average deviation from the target state is linear in the noise level, as long as this is small compared to a circuit-dependent threshold. In this region the deviation is well described by a stochastic model. Above the threshold, the optimisation can converge to states with largely different physical properties from the true target state, so that for practical applications it is critical to ensure that noise levels are below this threshold.

quant-ph↗

arXiv2020

Generalized unitary coupled cluster excitations for multireference molecular states optimized by the Variational Quantum Eigensolver

The variational quantum eigensolver (VQE) algorithm, designed to calculate the energy of molecular ground states on near-term quantum computers, requires specification of symmetries that describe the system, e.g. spin state and number of electrons. This opens the possibility of using VQE to obtain excited states as the lowest energy solutions of a given set of symmetries. In this paper, the performances of various unitary coupled cluster (UCC) ansätze applied to VQE calculations on excited states are investigated, using quantum circuits designed to represent single reference and multireference wavefunctions to calculate energy curves with respect to variations in the molecular geometry. These ansätze include standard UCCSD, as well as modified versions of UCCGSD and k-UpCCGSD which are engineered to tackle excited states without undesired spin symmetry cross-over to lower states during VQE optimization. These studies are carried out on a range of systems including H$_2$, H$_3$, H$_4$, NH, and OH$^{+}$, CH$_2$, NH$^{+}_{2}$, covering examples of spin singlet, doublet and triplet molecular ground states with single and multireference excited states. In most cases, our calculations are in excellent agreement with results from full configuration interaction calculations on classical machines, thus showing that the VQE algorithm is capable of calculating the lowest excited state at a certain symmetry, including multireference closed and open shell states, by setting appropriate restrictions on the excitations considered in the cluster operator, and appropriate constraints in the qubit register encoding the starting mean field state.

quant-ph↗