ARAlexis Ralli

Alexis Ralli

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Alexis Ralli has a total of 28 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Renormalized Yukawa Hamiltonian: Spectrum, parton distribution functions, and resource estimates for quantum simulation

    by Carter M. Gustin, Kamil Serafin, William A. Simon, Alexis Ralli, Gary R. Goldstein, Peter J. Love

    We apply the renormalization group procedure for effective particles (RGPEP) to the front form Yukawa Hamiltonian, yielding a renormalized (effective) Hamiltonian, accurate up to second order in the coupling strength. Subsequently, we examine the spectrum and parton distribution functions produced by the renormalized Hamiltonian, and show that the addition of counterterms leads to finite results. Resource estimates for quantum simulation are calculated for a single “ladder operator block encoding” (LOBE), and show that the cost to block encode the renormalized Hamiltonian is comparable to block encoding the bare Hamiltonian.

  • Open Access

    Ladder Operator Block-Encoding

    by William A. Simon, Carter M. Gustin, Kamil Serafin, Alexis Ralli, Gary R. Goldstein, Peter J. Love

    We describe and analyze LOBE (Ladder Operator Block-Encoding), a framework for block-encoding ladder operators that act upon fermionic and bosonic modes. In this framework, we achieve efficient block-encodings by applying the desired action of the operator onto the quantum state and pushing any undesired effects outside of the encoded subspace. This direct approach avoids any overhead caused by expanding the operators in another basis. We numerically benchmark these constructions using models arising in quantum field theories including the quartic harmonic oscillator, and ϕ 4 and Yukawa Hamiltonians on the light front. These benchmarks show that LOBE often produces block-encodings with fewer non-Clifford operations, fewer block-encoding ancillae and overall number of qubits, and lower rescaling factors for various operators as compared to frameworks that expand the ladder operators in the Pauli basis. LOBE constructions also demonstrate favorable scaling with respect to key parameters, including the maximum occupation of bosonic modes, the total number of fermionic and bosonic modes, and the locality of the operators. LOBE is implemented as an open-source python package to enable further applications.


  • Open Access

    Extending quantum computing through subspace, embedding and classical molecular dynamics techniques

    by Thomas M. Bickley, Angus Mingare, Tim Weaving, Michael Williams de la Bastida, Shunzhou Wan, Martina Nibbi, Philipp Seitz, Alexis Ralli, Peter J. Love, Minh Chung, et al.

    We offer a perspective on the integration of quantum computers within scientific computing in the chemical sciences. Several classical methods for extending the applicability of near-term quantum hardware are reviewed and applied in a demonstration.


  • Bridging Quantum Chemistry and MaxCut: Classical Performance Guarantees and Quantum Algorithms for the Hartree–Fock Method

    by Alexis Ralli, Tim Weaving, Peter V. Coveney, Peter J. Love

    In quantum chemistry, self-consistent field (SCF) algorithms define a nonlinear optimization problem, with both continuous and discrete components. In this work, we derive Hartree-Fock-inspired SCF algorithms that can be exactly written as a sequence of Quadratic Unconstrained Spin/Binary Optimization problems (QUSO/QUBO). We reformulate the optimization problem as a series of MaxCut graph problems, which can be efficiently solved using semidefinite programming techniques. This procedure provides performance guarantees at each SCF step, irrespective of the complexity of the optimization landscape. We numerically demonstrate the QUBO-SCF and MaxCut-SCF methods by studying the hydroxide anion OH- and molecular Nitrogen N2. The largest problem addressed in this study involves a system comprised of 220 qubits (equivalently, spin-orbitals). Our results show that QUBO-SCF and MaxCut-SCF suffer much less from internal instabilities compared with conventional SCF calculations. Additionally, we show that the new SCF algorithms can enhance single-reference methods, such as configuration interaction. Finally, we explore how quantum algorithms for optimization can be applied to the QUSO problems arising from the Hartree-Fock method. Four distinct hybrid-quantum classical approaches are introduced: GAS-SCF, QAOA-SCF, QA-SCF and DQI-SCF.


  • Noncontextual Pauli Hamiltonians

    by Alexis Ralli, Tim Weaving, Peter J Love

    Contextuality is a key feature of quantum mechanics, and identification of noncontextual subtheories of quantum mechanics is of both fundamental and practical importance. Recently, noncontextual Pauli Hamiltonians have been defined in the setting of variational quantum algorithms. In this work we rigorously establish a number of properties of noncontextual Pauli Hamiltonians. We prove that these Hamiltonians can be composed of more Pauli operators than diagonal Hamiltonians. This establishes that noncontextual Hamiltonians are able to describe a greater number of physical interactions. We then show that the eigenspaces admit an efficient classical description. We analyze the eigenspace of these Hamiltonians and prove that for every eigenvalue there exists an associated eigenvector whose stabilizer rank scales linearly with the number of qubits. We prove that further structure in these Hamiltonians allow us to derive where degeneracies in the eigenspectrum can arise. We thus open the field to a new class of efficiently simulatable states.

  • Carleman-lattice-Boltzmann quantum circuit with matrix access oracles

    by Claudio Sanavio, William A. Simon, Alexis Ralli, Peter Love, Sauro Succi

    We apply Carleman linearization of the Lattice Boltzmann (CLB) representation of fluid flows to quantum emulate the dynamics of a two-dimensional Kolmogorov-like flow. We assess the accuracy of the result and find a relative error of the order of 10−3 with just two Carleman iterates for a range of the Reynolds number up to a few hundreds. We first define a gate-based quantum circuit for the implementation of the CLB method and then exploit the sparse nature of the CLB matrix to build a quantum circuit based on block-encoding techniques which makes use of matrix oracles. It is shown that the gate complexity of the algorithm is thereby dramatically reduced, from exponential to quadratic. However, due to the need of employing up to seven ancilla qubits, the probability of success of the corresponding circuit for a single time step is too low to enable multi-step time evolution. Several possible directions to circumvent this problem are briefly outlined.


  • Open Access

    Contextual subspace variational quantum eigensolver calculation of the dissociation curve of molecular nitrogen on a superconducting quantum computer

    by Tim Weaving, Alexis Ralli, Peter J. Love, Sauro Succi, Peter V. Coveney

    We present an experimental demonstration of the Contextual Subspace Variational Quantum Eigensolver on superconducting hardware. Calculating the potential energy curve of molecular nitrogen proves challenging for many conventional quantum chemistry techniques, since static correlation dominates in the dissociation limit. Our quantum simulations retain good agreement with the Full Configuration Interaction energy, outperforming all benchmarked single-reference wavefunction techniques in capturing the bond-breaking appropriately. Moreover, our methodology is competitive with multiconfigurational approaches but at a saving of quantum resource, meaning larger active spaces can be treated for a fixed qubit allowance. To achieve this result, we deploy an error mitigation/suppression strategy comprised of Dynamical Decoupling, Measurement-Error Mitigation and Zero-Noise Extrapolation. Circuit parallelization also provides passive noise-averaging and improves the effective shot yield to reduce the measurement overhead. Furthermore, we introduce a modified adaptive ansatz construction algorithm that incorporates hardware awareness into our variational circuits, minimizing the transpilation cost for the target qubit topology.


  • Open Access

    Scalable approach to quantum simulation via projection-based embedding

    by Alexis Ralli, Michael Williams de la Bastida, Peter V. Coveney

    Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Many believe quantum computers will transcend such limitations although in the current era the size and noise of these devices militates against significant progress. Here we describe a chemically intuitive approach that permits a subdomain of a molecule's electronic structure to be calculated accurately on a quantum device, while the rest of the molecule is described at a lower level of accuracy using density functional theory running on a classical computer. We demonstrate that this approach produces improved results for molecules that cannot be simulated fully on current quantum computers but which can be resolved classically at a cheaper level of approximation. The algorithm is tunable, so that the size of the quantum simulation can be adjusted to run on available quantum resources. Therefore, as quantum devices become larger, this method will enable increasingly large subdomains to be studied accurately. Published by the American Physical Society 2024


  • Open Access

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

    by Alexis Ralli, Gabriel Greene-Diniz, David Muñoz Ramo, Nathan Fitzpatrick

    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.