Micheline B. Soley
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Micheline B. Soley has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
- Victor Salvador Batista
Department of Chemistry Yale University New Haven Connecticut USA
9 shared publications - Ningyi Lyu
Department of Chemistry, Yale University, New Haven, Connecticut 06520, United States
3 shared publications Andreas Markmann
Department of Chemistry, Yale University, P.O. Box 208107, New Haven, Connecticut 06520-8107, United States
2 shared publications- Eleanor Crane
Massachusetts Institute of Technology
2 shared publications Eric J. Heller
Department of Physics and Department of Chemistry and Chemical Biology, Harvard University, Cambridge, Massachusetts 02138, USA
2 shared publications- Feliks Nüske
Max-Planck-Institute for Dynamics of Complex Technical Systems
2 shared publications
Latest Publications
- Open Access
- 9 March 2026
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 22 (6) , 2687-2701
Molecular Resonance Identification in Complex Absorbing Potentials via Integrated Quantum Computing and High-Throughput Computing
Recent advancements in quantum algorithms have reached a state where we can consider how to capitalize on quantum and classical computational resources to accelerate molecular resonance state identification. Here, we identify molecular resonances with a method that combines quantum computing with classical high-throughput computing (HTC). This algorithm, which we term qDRIVE (the quantum deflation resonance identification variational eigensolver), exploits the complex absorbing potential formalism to distill the problem of molecular resonance identification into a network of hybrid quantum-classical variational quantum eigensolver tasks and harnesses HTC resources to execute these interconnected but independent tasks both asynchronously and in parallel, a strategy that minimizes wall time to completion. We show qDRIVE successfully identifies resonance energies and wave functions in simulated quantum processors with current and planned specifications, which bodes well for qDRIVE's ultimate application in disciplines ranging from photocatalysis to quantum control and places a spotlight on the potential offered by integrated heterogeneous quantum computing/HTC approaches in computational chemistry.
- 9 March 2026
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 22 (6) , 2687-2701
Open AccessMolecular Resonance Identification in Complex Absorbing Potentials via Integrated Quantum Computing and High-Throughput Computing
Recent advancements in quantum algorithms have reached a state where we can consider how to capitalize on quantum and classical computational resources to accelerate molecular resonance state identification. Here, we identify molecular resonances with a method that combines quantum computing with classical high-throughput computing (HTC). This algorithm, which we term qDRIVE (the quantum deflation resonance identification variational eigensolver), exploits the complex absorbing potential formalism to distill the problem of molecular resonance identification into a network of hybrid quantum-classical variational quantum eigensolver tasks and harnesses HTC resources to execute these interconnected but independent tasks both asynchronously and in parallel, a strategy that minimizes wall time to completion. We show qDRIVE successfully identifies resonance energies and wave functions in simulated quantum processors with current and planned specifications, which bodes well for qDRIVE's ultimate application in disciplines ranging from photocatalysis to quantum control and places a spotlight on the potential offered by integrated heterogeneous quantum computing/HTC approaches in computational chemistry.
- Top Cited PapersOpen Access
- 7 January 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (1)
Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
This tutorial offers a pedagogical guide to hybrid quantum processors that integrate discrete-variable (DV) qubits and continuous-variable (CV) oscillators. Aimed at computer scientists, engineers, and physicists, it provides an overview of the experimental, algorithmic, and architectural aspects of this novel and rapidly developing hardware model. Experimental realizations of this model include superconducting, trapped-ion, and neutral-atom platforms. By combining DV and CV components, hybrid oscillator-qubit processors enable a powerful new paradigm that offers complementary strengths for quantum control, error correction, computation, and simulation. Working toward the goal of a full-stack system connecting applications to CV-DV hardware, we define and formulate abstract machine models and instruction set architectures. These essential abstractions enable codesign of hardware and software, and resource estimation for exploring the potential of current and future hardware for computational and simulation tasks. Using these abstractions, we present both new and existing examples that illustrate the benefits of hybrid CV-DV processors relative to traditional DV-only hardware in computation as well as quantum simulation of physical models. Examples include algorithms for transferring states between DV and CV systems, performing the quantum Fourier transform, and simulation of lattice gauge theories. Relative to qubit-only hardware, the bosonic degrees of freedom natively available in hybrid architectures can substantially reduce the circuit complexity of simulations for physical models containing bosons. A key technique is the extension of quantum signal processing ideas to CV-DV systems. This work is intended to serve as a timely and comprehensive guide to this relatively unexplored yet promising approach to quantum computation and to provide a road map to guide future development.
- 7 January 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (1)
Top Cited PapersOpen AccessHybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
This tutorial offers a pedagogical guide to hybrid quantum processors that integrate discrete-variable (DV) qubits and continuous-variable (CV) oscillators. Aimed at computer scientists, engineers, and physicists, it provides an overview of the experimental, algorithmic, and architectural aspects of this novel and rapidly developing hardware model. Experimental realizations of this model include superconducting, trapped-ion, and neutral-atom platforms. By combining DV and CV components, hybrid oscillator-qubit processors enable a powerful new paradigm that offers complementary strengths for quantum control, error correction, computation, and simulation. Working toward the goal of a full-stack system connecting applications to CV-DV hardware, we define and formulate abstract machine models and instruction set architectures. These essential abstractions enable codesign of hardware and software, and resource estimation for exploring the potential of current and future hardware for computational and simulation tasks. Using these abstractions, we present both new and existing examples that illustrate the benefits of hybrid CV-DV processors relative to traditional DV-only hardware in computation as well as quantum simulation of physical models. Examples include algorithms for transferring states between DV and CV systems, performing the quantum Fourier transform, and simulation of lattice gauge theories. Relative to qubit-only hardware, the bosonic degrees of freedom natively available in hybrid architectures can substantially reduce the circuit complexity of simulations for physical models containing bosons. A key technique is the extension of quantum signal processing ideas to CV-DV systems. This work is intended to serve as a timely and comprehensive guide to this relatively unexplored yet promising approach to quantum computation and to provide a road map to guide future development.
- Open Access
- 25 June 2025
- Published by American Chemical Society (ACS) in Chemical Reviews
- Vol. 125 (14) , 6609-6652
Ultracold Molecular Collisions: Quasiclassical, Semiclassical, and Classical Approaches in the Quantum Regime
Ultracold atoms and molecules provide an unprecedented view into the role of quantum effects in chemical reactions. However, these same quantum effects make ultracold chemical reactions notoriously difficult to simulate. Contrary to conventional wisdom that ultracold systems necessitate quantum approaches, with classical mechanics offering a rough approximation at best, the past three decades have seen an explosion in classical, quasiclassical, and semiclassical approaches that yield near-exact results for ultracold systems─including in cases where today's quantum methods would be computationally intractable. This review illustrates the power of these approaches with 30 years' worth of numerical and experimental evidence. The review provides a comprehensive account of the successes of universal classical post-threshold laws for low-energy atomic and molecular scattering systems, as well as the cutting edge in quasiclassical approaches that unravel the ongoing controversy surrounding long-lived collision complex lifetimes in ultracold collisions. Special attention is placed on atomic systems where classical scaling laws hold directly at zero Kelvin, which underline the predictive power classical methods can offer even in the most extreme quantum chemical environments. The review culminates with a discussion of broader implications for classically inspired approaches to prototypically quantum chemistry in the second quantum revolution.
- 25 June 2025
- Published by American Chemical Society (ACS) in Chemical Reviews
- Vol. 125 (14) , 6609-6652
Open AccessUltracold Molecular Collisions: Quasiclassical, Semiclassical, and Classical Approaches in the Quantum Regime
Ultracold atoms and molecules provide an unprecedented view into the role of quantum effects in chemical reactions. However, these same quantum effects make ultracold chemical reactions notoriously difficult to simulate. Contrary to conventional wisdom that ultracold systems necessitate quantum approaches, with classical mechanics offering a rough approximation at best, the past three decades have seen an explosion in classical, quasiclassical, and semiclassical approaches that yield near-exact results for ultracold systems─including in cases where today's quantum methods would be computationally intractable. This review illustrates the power of these approaches with 30 years' worth of numerical and experimental evidence. The review provides a comprehensive account of the successes of universal classical post-threshold laws for low-energy atomic and molecular scattering systems, as well as the cutting edge in quasiclassical approaches that unravel the ongoing controversy surrounding long-lived collision complex lifetimes in ultracold collisions. Special attention is placed on atomic systems where classical scaling laws hold directly at zero Kelvin, which underline the predictive power classical methods can offer even in the most extreme quantum chemical environments. The review culminates with a discussion of broader implications for classically inspired approaches to prototypically quantum chemistry in the second quantum revolution.
- Open Access
- 28 April 2025
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 58 (17) , 175301
Leveraging Hamiltonian simulation techniques to compile operations on bosonic devices
Circuit quantum electrodynamics enables the combined use of qubits and oscillator modes. Despite a variety of available gate sets, many hybrid qubit-boson (i.e. qubit-oscillator) operations are realizable only through optimal control theory, which is oftentimes intractable and uninterpretable. We introduce an analytic approach with rigorously proven error bounds for realizing specific classes of operations via two matrix product formulas commonly used in Hamiltonian simulation, the Lie–Trotter–Suzuki and Baker–Campbell–Hausdorff product formulas. We show how this technique can be used to realize a number of operations of interest, including polynomials of annihilation and creation operators, namely ( a ) p ( a † ) q for integer p , q . We show examples of this paradigm including obtaining universal control within a subspace of the entire Fock space of an oscillator, state preparation of a fixed photon number in the cavity, simulation of the Jaynes–Cummings Hamiltonian, and simulation of the Hong-Ou-Mandel effect. This work demonstrates how techniques from Hamiltonian simulation can be applied to better control hybrid qubit-boson devices.
- 28 April 2025
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 58 (17) , 175301
Open AccessLeveraging Hamiltonian simulation techniques to compile operations on bosonic devices
Circuit quantum electrodynamics enables the combined use of qubits and oscillator modes. Despite a variety of available gate sets, many hybrid qubit-boson (i.e. qubit-oscillator) operations are realizable only through optimal control theory, which is oftentimes intractable and uninterpretable. We introduce an analytic approach with rigorously proven error bounds for realizing specific classes of operations via two matrix product formulas commonly used in Hamiltonian simulation, the Lie–Trotter–Suzuki and Baker–Campbell–Hausdorff product formulas. We show how this technique can be used to realize a number of operations of interest, including polynomials of annihilation and creation operators, namely ( a ) p ( a † ) q for integer p , q . We show examples of this paradigm including obtaining universal control within a subspace of the entire Fock space of an oscillator, state preparation of a fixed photon number in the cavity, simulation of the Jaynes–Cummings Hamiltonian, and simulation of the Hong-Ou-Mandel effect. This work demonstrates how techniques from Hamiltonian simulation can be applied to better control hybrid qubit-boson devices.
- 21 April 2025
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 21 (9) , 4855-4866
AMUSET-TICA: A Tensor-Based Approach for Identifying Slow Collective Variables in Biomolecular Dynamics
Elucidating collective variables (CVs) for biomolecular dynamics is crucial for understanding numerous biological processes. By leveraging the tensor-train data structure, a multilinear version of the AMUSE (Algorithm for Multiple Unknown Signals) algorithm for Koopman approximation (AMUSEt) was recently developed to identify CVs for biomolecular dynamics. To find slow CVs, AMUSEt transforms input features (e.g., pairwise atomic distances) into nonlinear basis functions (e.g., Gaussian functions) and encodes these nonlinear basis functions within a tensor-train structure via time-lagged correlation functions. Due to the need to fit these tensor-train data structures into computer memory, AMUSEt can handle only a limited number of input features. Consequently, AMUSEt relies on manually selecting and ranking features based on physical intuition to fully capture the slow dynamics. However, when applied to complex biological systems with numerous features, this selection and ranking process becomes increasingly challenging. To address this challenge, here we present AMUSET-TICA (AMUSEt-based Time-lagged Independent Component Analysis), a CV-identification method using time-structure-independent components (tICs) as the input features for AMUSEt. The key insight of AMUSET-TICA lies in its highly effective embedding of high-dimensional atomistic protein conformations, achieved by expanding orthogonal tICs into overlapping Gaussian basis functions through a tensor-product data structure. This eliminates the need for manually selecting and ranking input features for a wide range of biomolecular systems. We demonstrate that AMUSET-TICA consistently and significantly outperforms AMUSEt and tICA in identifying slow CVs for three different biomolecular systems: alanine dipeptide, the N-terminal domain of L9 (NTL9), and the FIP35 WW domain. For all these systems, the CVs generated by AMUSET-TICA accurately describe the slowest dynamical modes underlying these biological conformational changes. Furthermore, we show that AMUSET-TICA achieves performance comparable to deep-learning approaches like VAMPnets in identifying the slowest dynamical modes, while being significantly more computationally efficient in terms of CPU time. In addition, the CVs yielded by AMUSET-TICA provide insights into the folding mechanisms of NTL9 and the FIP35 WW domain, including CV3 and CV4 of the WW domain, which capture its two parallel folding pathways. We expect AMUSET-TICA can be widely applied to facilitate the investigation of biomolecular dynamics.
- 21 April 2025
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 21 (9) , 4855-4866
AMUSET-TICA: A Tensor-Based Approach for Identifying Slow Collective Variables in Biomolecular Dynamics
Elucidating collective variables (CVs) for biomolecular dynamics is crucial for understanding numerous biological processes. By leveraging the tensor-train data structure, a multilinear version of the AMUSE (Algorithm for Multiple Unknown Signals) algorithm for Koopman approximation (AMUSEt) was recently developed to identify CVs for biomolecular dynamics. To find slow CVs, AMUSEt transforms input features (e.g., pairwise atomic distances) into nonlinear basis functions (e.g., Gaussian functions) and encodes these nonlinear basis functions within a tensor-train structure via time-lagged correlation functions. Due to the need to fit these tensor-train data structures into computer memory, AMUSEt can handle only a limited number of input features. Consequently, AMUSEt relies on manually selecting and ranking features based on physical intuition to fully capture the slow dynamics. However, when applied to complex biological systems with numerous features, this selection and ranking process becomes increasingly challenging. To address this challenge, here we present AMUSET-TICA (AMUSEt-based Time-lagged Independent Component Analysis), a CV-identification method using time-structure-independent components (tICs) as the input features for AMUSEt. The key insight of AMUSET-TICA lies in its highly effective embedding of high-dimensional atomistic protein conformations, achieved by expanding orthogonal tICs into overlapping Gaussian basis functions through a tensor-product data structure. This eliminates the need for manually selecting and ranking input features for a wide range of biomolecular systems. We demonstrate that AMUSET-TICA consistently and significantly outperforms AMUSEt and tICA in identifying slow CVs for three different biomolecular systems: alanine dipeptide, the N-terminal domain of L9 (NTL9), and the FIP35 WW domain. For all these systems, the CVs generated by AMUSET-TICA accurately describe the slowest dynamical modes underlying these biological conformational changes. Furthermore, we show that AMUSET-TICA achieves performance comparable to deep-learning approaches like VAMPnets in identifying the slowest dynamical modes, while being significantly more computationally efficient in terms of CPU time. In addition, the CVs yielded by AMUSET-TICA provide insights into the folding mechanisms of NTL9 and the FIP35 WW domain, including CV3 and CV4 of the WW domain, which capture its two parallel folding pathways. We expect AMUSET-TICA can be widely applied to facilitate the investigation of biomolecular dynamics.
- Open Access
- 17 January 2025
- Published by American Chemical Society (ACS) in ChemRxiv
AMUSET-TICA: A Tensor-Based Approach for Identifying Slow Collective Variables in Biomolecular Dynamics
Elucidating Collective Variables (CVs) for biomolecular dynamics is crucial for understanding numerous biological processes. By leveraging the tensor-train data structure, a multilinear version of the AMUSE (Algorithm for Multiple Unknown Signals) algorithm for Koopman approximation (AMUSEt) was recently developed to identify CVs for biomolecular dynamics. To find slow CVs, AMUSEt transforms input features (e.g., pairwise atomic distances) into nonlinear basis functions (e.g., Gaussian functions) and encodes nonlinear basis functions within a tensor-train structure via the time-lagged correlation functions. Due to the need to fit these tensor-train data structures into computer memory, AMUSEt can handle only a limited number of input features. Consequently, AMUSEt relies on manually selecting and ranking features based on physical intuition to fully capture the slow dynamics. However, when applied to complex biological systems with numerous features, this selection and ranking process becomes increasingly challenging. To address this challenge, here we present AMUSET-TICA (AMUSEt-based Time-lagged Independent Component Analysis), a CV-identification method using time-structure-independent components (tICs) as the input features for AMUSEt. The key insight of AMUSET-TICA lies in its highly effective embedding of high-dimensional atomistic protein conformations, achieved by expanding orthogonal tICs into overlapping Gaussian basis functions through a tensor-product data structure. This eliminates the need for manually selecting and ranking input features for a wide range of biomolecular systems. We demonstrate that AMUSET-TICA consistently and significantly outperforms AMUSEt and tICA in identifying slow CVs for three different biomolecular systems: alanine dipeptide, the N-terminal domain of L9 (NTL9), and the FIP35 WW domain. For all these systems, the CVs generated by AMUSET-TICA accurately describe the slowest dynamical modes underlying these biological conformational changes. Furthermore, we show that AMUSET-TICA achieves performance comparable to deep-learning approaches like VAMPnets in identifying the slowest dynamical modes, while being significantly more computationally efficient in terms of CPU time. In addition, the CVs yielded by AMUSET-TICA provide insights into the folding mechanisms of NTL9 and the FIP35 WW domain, including CV3 and CV4 of the WW domain, which capture its two parallel folding pathways. We expect AMUSET-TICA can be widely applied to facilitate the investigation of biomolecular dynamics.
- 17 January 2025
- Published by American Chemical Society (ACS) in ChemRxiv
Open AccessAMUSET-TICA: A Tensor-Based Approach for Identifying Slow Collective Variables in Biomolecular Dynamics
Elucidating Collective Variables (CVs) for biomolecular dynamics is crucial for understanding numerous biological processes. By leveraging the tensor-train data structure, a multilinear version of the AMUSE (Algorithm for Multiple Unknown Signals) algorithm for Koopman approximation (AMUSEt) was recently developed to identify CVs for biomolecular dynamics. To find slow CVs, AMUSEt transforms input features (e.g., pairwise atomic distances) into nonlinear basis functions (e.g., Gaussian functions) and encodes nonlinear basis functions within a tensor-train structure via the time-lagged correlation functions. Due to the need to fit these tensor-train data structures into computer memory, AMUSEt can handle only a limited number of input features. Consequently, AMUSEt relies on manually selecting and ranking features based on physical intuition to fully capture the slow dynamics. However, when applied to complex biological systems with numerous features, this selection and ranking process becomes increasingly challenging. To address this challenge, here we present AMUSET-TICA (AMUSEt-based Time-lagged Independent Component Analysis), a CV-identification method using time-structure-independent components (tICs) as the input features for AMUSEt. The key insight of AMUSET-TICA lies in its highly effective embedding of high-dimensional atomistic protein conformations, achieved by expanding orthogonal tICs into overlapping Gaussian basis functions through a tensor-product data structure. This eliminates the need for manually selecting and ranking input features for a wide range of biomolecular systems. We demonstrate that AMUSET-TICA consistently and significantly outperforms AMUSEt and tICA in identifying slow CVs for three different biomolecular systems: alanine dipeptide, the N-terminal domain of L9 (NTL9), and the FIP35 WW domain. For all these systems, the CVs generated by AMUSET-TICA accurately describe the slowest dynamical modes underlying these biological conformational changes. Furthermore, we show that AMUSET-TICA achieves performance comparable to deep-learning approaches like VAMPnets in identifying the slowest dynamical modes, while being significantly more computationally efficient in terms of CPU time. In addition, the CVs yielded by AMUSET-TICA provide insights into the folding mechanisms of NTL9 and the FIP35 WW domain, including CV3 and CV4 of the WW domain, which capture its two parallel folding pathways. We expect AMUSET-TICA can be widely applied to facilitate the investigation of biomolecular dynamics.
- 5 July 2024
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 20 (14) , 6402-6413
Holographic Gaussian Boson Sampling with Matrix Product States on 3D cQED Processors
We introduce quantum circuits for simulations of multimode state vectors on 3D circuit quantum electrodynamics (cQED) processors using matrix product state representations. The circuits are demonstrated as applied to simulations of molecular docking based on holographic Gaussian boson sampling (GBS), as illustrated for the binding of a thiol-containing aryl sulfonamide ligand to the tumor necrosis factor-alpha converting enzyme receptor. We show that cQED devices with a modest number of modes could be employed to simulate multimode systems by repurposing working modes through measurement and reinitialization. We anticipate that a wide range of GBS applications could be implemented on compact 3D cQED processors analogously using the holographic approach. Simulations on qubit-based quantum computers could be implemented analogously using circuits that represent continuous variables in terms of truncated expansions of Fock states.
- 5 July 2024
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 20 (14) , 6402-6413
Holographic Gaussian Boson Sampling with Matrix Product States on 3D cQED Processors
We introduce quantum circuits for simulations of multimode state vectors on 3D circuit quantum electrodynamics (cQED) processors using matrix product state representations. The circuits are demonstrated as applied to simulations of molecular docking based on holographic Gaussian boson sampling (GBS), as illustrated for the binding of a thiol-containing aryl sulfonamide ligand to the tumor necrosis factor-alpha converting enzyme receptor. We show that cQED devices with a modest number of modes could be employed to simulate multimode systems by repurposing working modes through measurement and reinitialization. We anticipate that a wide range of GBS applications could be implemented on compact 3D cQED processors analogously using the holographic approach. Simulations on qubit-based quantum computers could be implemented analogously using circuits that represent continuous variables in terms of truncated expansions of Fock states.
- Open Access
- 10 October 2023
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 9 (1) , 01LT01
Boosting quantum amplitude exponentially in variational quantum algorithms
We introduce a family of variational quantum algorithms, which we coin as quantum iterative power algorithms (QIPAs), and demonstrate their capabilities as applied to global-optimization numerical experiments. Specifically, we demonstrate the QIPA based on a double exponential oracle as applied to ground state optimization of the H 2 molecule, search for the transmon qubit ground-state, and biprime factorization. Our results indicate that QIPA outperforms quantum imaginary time evolution (QITE) and requires a polynomial number of queries to reach convergence even with exponentially small overlap between an initial quantum state and the final desired quantum state, under some circumstances. We analytically show that there exists an exponential amplitude amplification at every step of the variational quantum algorithm, provided the initial wavefunction has non-vanishing probability with the desired state and that the unique maximum of the oracle is given by λ 1 > 0 , while all other values are given by the same value 0 < λ 2 < λ 1 (here λ can be taken as eigenvalues of the problem Hamiltonian). The generality of the global-optimization method presented here invites further application to other problems that currently have not been explored with QITE-based near-term quantum computing algorithms. Such approaches could facilitate identification of reaction pathways and transition states in chemical physics, as well as optimization in a broad range of machine learning applications. The method also provides a general framework for adaptation of a class of classical optimization algorithms to quantum computers to further broaden the range of algorithms amenable to implementation on current noisy intermediate-scale quantum computers.
- 10 October 2023
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 9 (1) , 01LT01
Open AccessBoosting quantum amplitude exponentially in variational quantum algorithms
We introduce a family of variational quantum algorithms, which we coin as quantum iterative power algorithms (QIPAs), and demonstrate their capabilities as applied to global-optimization numerical experiments. Specifically, we demonstrate the QIPA based on a double exponential oracle as applied to ground state optimization of the H 2 molecule, search for the transmon qubit ground-state, and biprime factorization. Our results indicate that QIPA outperforms quantum imaginary time evolution (QITE) and requires a polynomial number of queries to reach convergence even with exponentially small overlap between an initial quantum state and the final desired quantum state, under some circumstances. We analytically show that there exists an exponential amplitude amplification at every step of the variational quantum algorithm, provided the initial wavefunction has non-vanishing probability with the desired state and that the unique maximum of the oracle is given by λ 1 > 0 , while all other values are given by the same value 0 < λ 2 < λ 1 (here λ can be taken as eigenvalues of the problem Hamiltonian). The generality of the global-optimization method presented here invites further application to other problems that currently have not been explored with QITE-based near-term quantum computing algorithms. Such approaches could facilitate identification of reaction pathways and transition states in chemical physics, as well as optimization in a broad range of machine learning applications. The method also provides a general framework for adaptation of a class of classical optimization algorithms to quantum computers to further broaden the range of algorithms amenable to implementation on current noisy intermediate-scale quantum computers.
- 22 June 2023
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 130 (25) , 250404
Experimentally Realizable Phase Transitions in Reflectionless Quantum ScatteringAbove-barrier quantum scattering with truncated real potentials provides an experimentally accessible platform that exhibits spontaneous parity-time symmetry breaking as is varied. The unbroken phase has reflectionless states that correspond to bound states in the continuum of the nontruncated potentials at arbitrarily high discrete real energies. In the fully broken phase there are no bound states. There is a mixed phase in which exceptional points occur at specific energies and values of . These effects should be observable in cold-atom scattering experiments.- 22 June 2023
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 130 (25) , 250404
Experimentally Realizable Phase Transitions in Reflectionless Quantum ScatteringAbove-barrier quantum scattering with truncated real potentials provides an experimentally accessible platform that exhibits spontaneous parity-time symmetry breaking as is varied. The unbroken phase has reflectionless states that correspond to bound states in the continuum of the nontruncated potentials at arbitrarily high discrete real energies. In the fully broken phase there are no bound states. There is a mixed phase in which exceptional points occur at specific energies and values of . These effects should be observable in cold-atom scattering experiments.- 31 January 2023
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 19 (4) , 1111-1129
Tensor-Train Thermo-Field Memory Kernels for Generalized Quantum Master Equations
The generalized quantum master equation (GQME) approach provides a rigorous framework for deriving the exact equation of motion for any subset of electronic reduced density matrix elements (e.g., the diagonal elements). In the context of electronic dynamics, the memory kernel and inhomogeneous term of the GQME introduce the implicit coupling to nuclear motion and dynamics of electronic density matrix elements that are projected out (e.g., the off-diagonal elements), allowing for efficient quantum dynamics simulations. Here, we focus on benchmark quantum simulations of electronic dynamics in a spin-boson model system described by various types of GQMEs. Exact memory kernels and inhomogeneous terms are obtained from short-time quantum-mechanically exact tensor-train thermo-field dynamics (TT-TFD) simulations and are compared with those obtained from an approximate linearized semiclassical method, allowing for assessment of the accuracy of these approximate memory kernels and inhomogeneous terms. Moreover, we have analyzed the computational cost of the full and reduced-dimensionality GQMEs. The scaling of the computational cost is dependent on several factors, sometimes with opposite scaling trends. The TT-TFD memory kernels can provide insights on the main sources of inaccuracies of GQME approaches when combined with approximate input methods and pave the road for the development of quantum circuits that implement GQMEs on digital quantum computers.
- 31 January 2023
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 19 (4) , 1111-1129
Tensor-Train Thermo-Field Memory Kernels for Generalized Quantum Master Equations
The generalized quantum master equation (GQME) approach provides a rigorous framework for deriving the exact equation of motion for any subset of electronic reduced density matrix elements (e.g., the diagonal elements). In the context of electronic dynamics, the memory kernel and inhomogeneous term of the GQME introduce the implicit coupling to nuclear motion and dynamics of electronic density matrix elements that are projected out (e.g., the off-diagonal elements), allowing for efficient quantum dynamics simulations. Here, we focus on benchmark quantum simulations of electronic dynamics in a spin-boson model system described by various types of GQMEs. Exact memory kernels and inhomogeneous terms are obtained from short-time quantum-mechanically exact tensor-train thermo-field dynamics (TT-TFD) simulations and are compared with those obtained from an approximate linearized semiclassical method, allowing for assessment of the accuracy of these approximate memory kernels and inhomogeneous terms. Moreover, we have analyzed the computational cost of the full and reduced-dimensionality GQMEs. The scaling of the computational cost is dependent on several factors, sometimes with opposite scaling trends. The TT-TFD memory kernels can provide insights on the main sources of inaccuracies of GQME approaches when combined with approximate input methods and pave the road for the development of quantum circuits that implement GQMEs on digital quantum computers.