RPRaphael C. Pooser

Raphael C. Pooser

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Raphael C. Pooser has a total of 215 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Variational Optical Phase Learning on a Continuous-Variable Quantum Compiler

    by Matthew A. Feldman, Tyler Volkoff, Seongjin Hong, Claire E. Marvinney, Zoë Holmes, Raphael C. Pooser, Andrew Sornborger, Alberto M. Marino

    Quantum process learning is a fundamental primitive that draws inspiration from machine learning with the goal of better studying the dynamics of quantum systems. One approach to quantum process learning is quantum compilation, whereby an analog quantum operation is digitized by compiling it into a series of basic gates. While there has been significant focus on quantum compiling for discrete-variable systems, the continuous-variable (CV) framework has received comparatively less attention. We present an experimental implementation of a CV quantum compiler that uses two-mode squeezed light to learn a Gaussian unitary operation. We demonstrate the compiler by learning a parameterized linear phase unitary through the use of target and control phase unitaries to demonstrate a factor of 5.4 increase in the precision of the phase estimation and a 3.6-fold acceleration in the time-to-solution metric when leveraging quantum resources. We further show how our approach can be extended to higher-dimensional compilation tasks. Our results are enabled by the tunable control of our cost landscape via variable squeezing, thus providing a critical framework to simultaneously increase precision and reduce time-to-solution.

  • Open Access

    Quantum-enhanced distributed phase sensing with a truncated SU(1,1) interferometer

    by Seongjin Hong, Matthew A. Feldman, Claire E. Marvinney, Donghwa Lee, Changhyoup Lee, Michael T. Febbraro, Alberto M. Marino, Raphael C. Pooser

    In recent years, distributed quantum sensing has gained interest for a range of applications requiring networks of sensors, from global-scale clock synchronization to high energy physics. In particular, a network of entangled sensors can improve not only the sensitivity beyond the shot noise limit, but also enable a Heisenberg scaling with the number of sensors. Here, using bright entangled twin beams, we theoretically and experimentally demonstrate the detection of a linear combination of two distributed phases beyond the shot noise limit with a truncated SU(1,1) interferometer. Specifically, we show a quantum noise reduction of 1.7 ± 0.3 dB below what is possible with the corresponding classical configuration. Additionally, we theoretically extend the use of a truncated SU(1,1) interferometer to a multi-phase-distributed sensing scheme that leverages entanglement as a resource to achieve a quantum improvement in the scaling with the number of sensors in the network. Our results pave the way for developing quantum-enhanced sensor networks that can achieve an entanglement-enhanced sensitivity.


  • Open Access

    Molecular Symmetry in VQE: A Dual Approach for Trapped-Ion Simulations of Benzene

    by Joshua Goings, Luning Zhao, Jacek Jakowski, Titus Morris, Raphael Pooser

    Understanding complex chemical systems -- such as biomolecules, catalysts, and novel materials -- is a central goal of quantum simulations. Near-term strategies hinge on the use of variational quantum eigensolver (VQE) algorithms combined with a suitable ansatz. However, straightforward application of many chemically-inspired ansatze yields prohibitively deep circuits. In this work, we employ several circuit optimization methods tailored for trapped-ion quantum devices to enhance the feasibility of intricate chemical simulations. The techniques aim to lessen the depth of the unitary coupled cluster with singles and doubles (uCCSD) ansatz's circuit compilation, a considerable challenge on current noisy quantum devices. Furthermore, we use symmetry-inspired classical post-selection methods to further refine the outcomes and minimize errors in energy measurements, without adding quantum overhead. Our strategies encompass optimal mapping from orbital to qubit, term reordering to minimize entangling gates, and the exploitation of molecular spin and point group symmetry to eliminate redundant parameters. The inclusion of error mitigation via post-selection based on known molecular symmetries improves the results to near milli-Hartree accuracy. These methods, when applied to a benzene molecule simulation, enabled the construction of an 8-qubit circuit with 69 two-qubit entangling operations, pushing the limits for variational quantum eigensolver (VQE) circuits executed on quantum hardware to date.


  • Open Access

    Quantum error mitigation by hidden inverses protocol in superconducting quantum devices *

    by V Leyton-Ortega, S Majumder, R C Pooser

    We present a method to improve the convergence of variational algorithms based on hidden inverses (HIs) to mitigate coherent errors. In the context of error mitigation, this means replacing the hardware implementation of certain Hermitian gates with their inverses. Doing so results in noise cancellation and a more resilient quantum circuit. This approach improves performance in a variety of two-qubit error models where the noise operator also inverts with the gate inversion. We apply the mitigation scheme on superconducting quantum processors running the variational quantum eigensolver (VQE) algorithm to find the H 2 ground-state energy. When implemented on superconducting hardware we find that the mitigation scheme effectively reduces the energy fluctuations in the parameter learning path in VQE, reducing the number of iterations for a converged value. We also provide a detailed numerical simulation of VQE performance under different noise models and explore how HIs and randomized compiling affect the underlying loss landscape of the learning problem. These simulations help explain our experimental hardware outcomes, helping to connect lower-level gate performance to application-specific behavior in contrast to metrics like fidelity which often do not provide an intuitive insight into observed high level performance.


  • Collective neutrino oscillations on a quantum computer

    by Kübra Yeter-Aydeniz, Shikha Bangar, George Siopsis, Raphael C. Pooser


  • Open Access

    Magneto‐Optical Sensing Beyond the Shot Noise Limit

    by Yun‐Yi Pai, Claire E. Marvinney, Chengyun Hua, Raphael C. Pooser, Benjamin J. Lawrie


  • Mode connectivity in the QCBM loss landscape: ICCAD Special Session Paper

    by Kathleen E. Hamilton, Emily Lynn, Vicente Leyton-Ortega, Swarnadeep Majumder, Raphael C. Pooser

    Quantum circuit Born machines (QCBMs) and training via variational quantum algorithms (VQAs) are key applications for near-term quantum hardware. QCBM ansäatze designs are unique in that they do not require prior knowledge of a physical Hamiltonian. Many ansätze are built from fixed designs. In this work, we train and compare the performance of QCBM models built using two commonly employed parameterizations and two commonly employed entangling layer designs. In addition to comparing the overall performance of these models, we look at features and characteristics of the loss landscape-connectivity of minima in particular - to help understand the advantages and disadvantages of each design choice. We show that the rotational gate choices can improve loss landscape connectivity.


  • Benchmarking Quantum Chemistry Computations with Variational, Imaginary Time Evolution, and Krylov Space Solver Algorithms

    by Kübra Yeter‐Aydeniz, Bryan T. Gard, Jacek Jakowski, Swarnadeep Majumder, George S. Barron, George Siopsis, Travis S. Humble, Raphael C. Pooser

    Quantum chemistry is a key application area for noisy‐intermediate scale quantum (NISQ) devices, and therefore serves as an important benchmark for current and future quantum computer performance. Previous benchmarks in this field have focused on variational methods for computing ground and excited states of various molecules, including a benchmarking suite focused on the performance of computing ground states for alkali‐hydrides under an array of error mitigation methods. State‐of‐the‐art methods to reach chemical accuracy in hybrid quantum‐classical electronic structure calculations of alkali hydride molecules on NISQ devices from IBM are outlined here. It is demonstrated how to extend the reach of variational eigensolvers with symmetry preserving Ansätze. Next, it is outlined how to use quantum imaginary time evolution and Lanczos as a complementary method to variational techniques, highlighting the advantages of each approach. Finally, a new error mitigation method is demonstrated which uses systematic error cancellation via hidden inverse gate constructions, improving the performance of typical variational algorithms. These results show that electronic structure calculations have advanced rapidly, to routine chemical accuracy for simple molecules, from their inception on quantum computers a few short years ago, and they point to further rapid progress to larger molecules as the power of NISQ devices grows.


  • Open Access

    Scattering in the Ising model with the quantum Lanczos algorithm *

    by Kübra Yeter-Aydeniz, George Siopsis, Raphael C Pooser

    Time evolution and scattering simulation in phenomenological models are of great interest for testing and validating the potential for near-term quantum computers to simulate quantum field theories. Here, we simulate one-particle propagation and two-particle scattering in the one-dimensional transverse Ising model for 3 and 4 spatial sites with periodic boundary conditions on a quantum computer. We use the quantum Lanczos algorithm to obtain all energy levels and corresponding eigenstates of the system. We simplify the quantum computation by taking advantage of the symmetries of the system. These results enable us to compute one- and two-particle transition amplitudes, particle numbers for spatial sites, and the transverse magnetization as functions of time. The quantum circuits were executed on various IBM Q superconducting hardware. The experimental results are in very good agreement with the values obtained using exact diagonalization.


  • Open Access

    Scattering in the Ising Model Using Quantum Lanczos Algorithm

    by Kübra Yeter-Aydeniz, George Siopsis, Raphael C. Pooser

    Time evolution and scattering simulation in phenomenological models are of great interest for testing and validating the potential for near-term quantum computers to simulate quantum field theories. Here, we simulate one-particle propagation and two-particle scattering in the one-dimensional transverse Ising model for 3 and 4 spatial sites with periodic boundary conditions on a quantum computer. We use the quantum Lanczos algorithm to obtain all energy levels and corresponding eigenstates of the system. We simplify the quantum computation by taking advantage of the symmetries of the system. These results enable us to compute one- and two-particle transition amplitudes, particle numbers for spatial sites, and the transverse magnetization as functions of time. The quantum circuits were executed on IBM 5-qubit superconducting hardware. The experimental results with readout error mitigation are in very good agreement with the values obtained using exact diagonalization.