Nikolaj Moll
Research Subjects
Recognitions
Nikolaj Moll has a total of 343 co-authors. Here are the top co-authors by number of shared publications:
- Rainer Friedbert Mahrt
IBM Research Europe – Zurich, Rüschlikon, Switzerland
29 shared publications Gerhard Meyer
IBM Research-Zurich, Säumerstrasse 4, 8803 Rüschlikon, Switzerland
22 shared publications- Leo Gross
IBM Research Europe – Zurich, Rüschlikon, Switzerland
22 shared publications - Raffaele Santagati
Boehringer Ingelheim
20 shared publications - Matthias Degroote
Quantum Lab, Boehringer Ingelheim, 55218 Ingelheim am Rhein, Germany
19 shared publications - Thilo Stöferle
IBM Research Europe – Zurich, Rüschlikon, Switzerland
15 shared publications
Latest Publications
- Open Access
- 8 October 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (4) , 049901
Erratum: Faster Quantum Chemistry Simulations on a Quantum Computer with Improved Tensor Factorization and Active Volume Compilation [PRX Quantum 6 , 030337 (2025)]
- 8 October 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (4) , 049901
Open AccessErratum: Faster Quantum Chemistry Simulations on a Quantum Computer with Improved Tensor Factorization and Active Volume Compilation [PRX Quantum 6 , 030337 (2025)]
- Open Access
- 10 August 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (3)
Classical optimization of reduced density matrix estimations with classical shadows using N -representability conditions under shot noise considerations
Classical shadow tomography has become a powerful tool in learning about quantum states prepared on a quantum computer. Recent works have used classical shadows to variationally enforce N -representability conditions on the two-particle reduced density matrix. In this paper, we build upon previous research by choosing an improved estimator within classical shadow tomography and rephrasing the optimization constraints, resulting in an overall enhancement in performance under comparable measurement shot budgets. We further explore the specific regimes where these methods outperform the unbiased estimator of the stand-alone classical shadow protocol and quantify the potential savings in numerical studies.
- 10 August 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (3)
Open AccessClassical optimization of reduced density matrix estimations with classical shadows using N -representability conditions under shot noise considerations
Classical shadow tomography has become a powerful tool in learning about quantum states prepared on a quantum computer. Recent works have used classical shadows to variationally enforce N -representability conditions on the two-particle reduced density matrix. In this paper, we build upon previous research by choosing an improved estimator within classical shadow tomography and rephrasing the optimization constraints, resulting in an overall enhancement in performance under comparable measurement shot budgets. We further explore the specific regimes where these methods outperform the unbiased estimator of the stand-alone classical shadow protocol and quantify the potential savings in numerical studies.
- Open Access
Improving the runtime of quantum phase estimation for chemistry through basis set optimization
Quantum phase estimation (QPE) is a promising quantum algorithm for obtaining molecular ground-state energies with chemical accuracy. However, its computational cost, dominated by the Hamiltonian 1-norm $λ$ and the cost of the block encoding, scales at least quadratically with the number of molecular orbitals, making it challenging to incorporate dynamic correlation by enlarging the active space. In this work, we investigate two strategies to mitigate this cost through the optimization of the basis set. First, we investigate whether adjusting the coefficients of Gaussian basis functions can minimize the 1-norm while preserving the accuracy of the ground state energy. Although this method leads to a reduction in the 1-norm up to 10%, this reduction is system-dependent and diminishes with increasing molecular size. Second, we demonstrate that employing a large-basis-set frozen natural orbital (FNO) strategy results in a substantial reduction in QPE resources without compromising accuracy. We study a dataset of 58 small organic molecules and the dissociation curve of N2, and demonstrate that an active space constructed from orbitals derived from larger basis sets captures correlation effects more effectively. This approach yields up to an 80% reduction in the 1-norm $λ$ and also leads to a 55% reduction in the number of orbitals. Our results highlight that improving the quality, not just the size, of the orbital basis is a viable strategy for extending QPE to include dynamical correlation, making progress toward scalable and chemically accurate quantum simulations with tractable resource requirements.Open AccessImproving the runtime of quantum phase estimation for chemistry through basis set optimization
Quantum phase estimation (QPE) is a promising quantum algorithm for obtaining molecular ground-state energies with chemical accuracy. However, its computational cost, dominated by the Hamiltonian 1-norm $λ$ and the cost of the block encoding, scales at least quadratically with the number of molecular orbitals, making it challenging to incorporate dynamic correlation by enlarging the active space. In this work, we investigate two strategies to mitigate this cost through the optimization of the basis set. First, we investigate whether adjusting the coefficients of Gaussian basis functions can minimize the 1-norm while preserving the accuracy of the ground state energy. Although this method leads to a reduction in the 1-norm up to 10%, this reduction is system-dependent and diminishes with increasing molecular size. Second, we demonstrate that employing a large-basis-set frozen natural orbital (FNO) strategy results in a substantial reduction in QPE resources without compromising accuracy. We study a dataset of 58 small organic molecules and the dissociation curve of N2, and demonstrate that an active space constructed from orbitals derived from larger basis sets captures correlation effects more effectively. This approach yields up to an 80% reduction in the 1-norm $λ$ and also leads to a 55% reduction in the number of orbitals. Our results highlight that improving the quality, not just the size, of the orbital basis is a viable strategy for extending QPE to include dynamical correlation, making progress toward scalable and chemically accurate quantum simulations with tractable resource requirements. - Open Access
- 28 August 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (3)
Faster Quantum Chemistry Simulations on a Quantum Computer with Improved Tensor Factorization and Active Volume Compilation
Electronic structure calculations of molecular systems are among the most promising applications for fault-tolerant quantum computing (FTQC) in quantum chemistry and drug design. However, while recent algorithmic advancements such as qubitization and tensor hypercontraction (THC) have significantly reduced the complexity of such calculations, they do not yet achieve computational runtimes short enough to be practical for industrially relevant use cases. In this work, we combine several advances to electronic structure calculation for molecular systems, resulting in a 2-orders-of-magnitude speedup of estimated runtimes over prior-art algorithms run on comparable quantum devices. One of these advances is a novel framework for block-invariant symmetry-shifted tensor hypercontraction, with which we achieve the tightest Hamiltonian factorizations reported to date. We compile our algorithm for an active volume (AV) architecture, a technical layout that has recently been proposed for fusion-based photonic quantum hardware. AV compilation contributes towards a lower runtime of our computation by eliminating overheads stemming from connectivity issues in the underlying surface code. We present a detailed benchmark of our approach, focusing primarily on the computationally challenging benchmark molecule P450. Leveraging a number of hardware trade-offs in interleaving-based photonic FTQC, we estimate runtimes for the electronic structure calculation of P450 as a function of the device footprint.
- 28 August 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (3)
Open AccessFaster Quantum Chemistry Simulations on a Quantum Computer with Improved Tensor Factorization and Active Volume Compilation
Electronic structure calculations of molecular systems are among the most promising applications for fault-tolerant quantum computing (FTQC) in quantum chemistry and drug design. However, while recent algorithmic advancements such as qubitization and tensor hypercontraction (THC) have significantly reduced the complexity of such calculations, they do not yet achieve computational runtimes short enough to be practical for industrially relevant use cases. In this work, we combine several advances to electronic structure calculation for molecular systems, resulting in a 2-orders-of-magnitude speedup of estimated runtimes over prior-art algorithms run on comparable quantum devices. One of these advances is a novel framework for block-invariant symmetry-shifted tensor hypercontraction, with which we achieve the tightest Hamiltonian factorizations reported to date. We compile our algorithm for an active volume (AV) architecture, a technical layout that has recently been proposed for fusion-based photonic quantum hardware. AV compilation contributes towards a lower runtime of our computation by eliminating overheads stemming from connectivity issues in the underlying surface code. We present a detailed benchmark of our approach, focusing primarily on the computationally challenging benchmark molecule P450. Leveraging a number of hardware trade-offs in interleaving-based photonic FTQC, we estimate runtimes for the electronic structure calculation of P450 as a function of the device footprint.
- Open Access
Fullqubit alchemist: Quantum algorithm for alchemical free energy calculations
Accurately computing the free energies of biological processes is a cornerstone of computer-aided drug design but it is a daunting task. The need to sample vast conformational spaces and account for entropic contributions makes the estimation of binding free energies very expensive. While classical methods, such as thermodynamic integration and alchemical free energy calculations, have significantly contributed to reducing computational costs, they still face limitations in terms of efficiency and scalability. We tackle this through a quantum algorithm for the estimation of free energy differences by adapting the existing Liouvillian approach and introducing several key algorithmic improvements. We directly implement the Liouvillian operator and provide an efficient description of electronic forces acting on both nuclear and electronic particles on the quantum ground state potential energy surface. This leads to super-polynomial runtime scaling improvements in the precision of our Liouvillian simulation approach and quadratic improvements in the scaling with the number of particles. Second, our algorithm calculates free energy differences via a fully quantum implementation of thermodynamic integration and alchemy, thereby foregoing expensive entropy estimation subroutines used in prior works. Our results open new avenues towards the application of quantum computers in drug discovery.
Open AccessFullqubit alchemist: Quantum algorithm for alchemical free energy calculations
Accurately computing the free energies of biological processes is a cornerstone of computer-aided drug design but it is a daunting task. The need to sample vast conformational spaces and account for entropic contributions makes the estimation of binding free energies very expensive. While classical methods, such as thermodynamic integration and alchemical free energy calculations, have significantly contributed to reducing computational costs, they still face limitations in terms of efficiency and scalability. We tackle this through a quantum algorithm for the estimation of free energy differences by adapting the existing Liouvillian approach and introducing several key algorithmic improvements. We directly implement the Liouvillian operator and provide an efficient description of electronic forces acting on both nuclear and electronic particles on the quantum ground state potential energy surface. This leads to super-polynomial runtime scaling improvements in the precision of our Liouvillian simulation approach and quadratic improvements in the scaling with the number of particles. Second, our algorithm calculates free energy differences via a fully quantum implementation of thermodynamic integration and alchemy, thereby foregoing expensive entropy estimation subroutines used in prior works. Our results open new avenues towards the application of quantum computers in drug discovery.
- Open Access
Faster quantum chemistry simulations on a quantum computer with improved tensor factorization and active volume compilation
Electronic structure calculations of molecular systems are among the most promising applications for fault-tolerant quantum computing (FTQC) in quantum chemistry and drug design. However, while recent algorithmic advancements such as qubitization and Tensor Hypercontraction (THC) have significantly reduced the complexity of such calculations, they do not yet achieve computational runtimes short enough to be practical for industrially relevant use cases. In this work, we introduce several advances to electronic structure calculation for molecular systems, resulting in a two-orders-of-magnitude speedup of estimated runtimes over prior-art algorithms run on comparable quantum devices. One of these advances is a novel framework for block-invariant symmetry-shifted Tensor Hypercontraction (BLISS-THC), with which we achieve the tightest Hamiltonian factorizations reported to date. We compile our algorithm for an Active Volume (AV) architecture, a technical layout that has recently been proposed for fusion-based photonic quantum hardware. AV compilation contributes towards a lower runtime of our computation by eliminating overheads stemming from connectivity issues in the underlying surface code. We present a detailed benchmark of our approach, focusing primarily on the computationally challenging benchmark molecule P450. Leveraging a number of hardware tradeoffs in interleaving-based photonic FTQC, we estimate runtimes for the electronic structure calculation of P450 as a function of the device footprint.
Open AccessFaster quantum chemistry simulations on a quantum computer with improved tensor factorization and active volume compilation
Electronic structure calculations of molecular systems are among the most promising applications for fault-tolerant quantum computing (FTQC) in quantum chemistry and drug design. However, while recent algorithmic advancements such as qubitization and Tensor Hypercontraction (THC) have significantly reduced the complexity of such calculations, they do not yet achieve computational runtimes short enough to be practical for industrially relevant use cases. In this work, we introduce several advances to electronic structure calculation for molecular systems, resulting in a two-orders-of-magnitude speedup of estimated runtimes over prior-art algorithms run on comparable quantum devices. One of these advances is a novel framework for block-invariant symmetry-shifted Tensor Hypercontraction (BLISS-THC), with which we achieve the tightest Hamiltonian factorizations reported to date. We compile our algorithm for an Active Volume (AV) architecture, a technical layout that has recently been proposed for fusion-based photonic quantum hardware. AV compilation contributes towards a lower runtime of our computation by eliminating overheads stemming from connectivity issues in the underlying surface code. We present a detailed benchmark of our approach, focusing primarily on the computationally challenging benchmark molecule P450. Leveraging a number of hardware tradeoffs in interleaving-based photonic FTQC, we estimate runtimes for the electronic structure calculation of P450 as a function of the device footprint.
- Open Access
- 17 December 2024
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 133 (25) , 250601
Enhancing Initial State Overlap through Orbital Optimization for Faster Molecular Electronic Ground-State Energy Estimation
The phase estimation algorithm is crucial for computing the ground-state energy of a molecular electronic Hamiltonian on a quantum computer. Its efficiency depends on the overlap between the Hamiltonian’s ground state and an initial state, which tends to decay exponentially with system size. We showcase a practical orbital optimization scheme to alleviate this issue. Applying our method to four iron-sulfur molecules, we achieve a notable enhancement, up to 2 orders of magnitude, compared to localized orbitals. Furthermore, our approach yields improved overlaps in cytochrome P450 enzyme models. Published by the American Physical Society 2024
- 17 December 2024
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 133 (25) , 250601
Open AccessEnhancing Initial State Overlap through Orbital Optimization for Faster Molecular Electronic Ground-State Energy Estimation
The phase estimation algorithm is crucial for computing the ground-state energy of a molecular electronic Hamiltonian on a quantum computer. Its efficiency depends on the overlap between the Hamiltonian’s ground state and an initial state, which tends to decay exponentially with system size. We showcase a practical orbital optimization scheme to alleviate this issue. Applying our method to four iron-sulfur molecules, we achieve a notable enhancement, up to 2 orders of magnitude, compared to localized orbitals. Furthermore, our approach yields improved overlaps in cytochrome P450 enzyme models. Published by the American Physical Society 2024
- 14 August 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (2) , 022420
Assessing the query complexity limits of quantum phase estimation using symmetry-aware spectral bounds
The computational cost of quantum algorithms for physics and chemistry is closely linked to the spectrum of the Hamiltonian, a property that manifests in the necessary rescaling of its eigenvalues. The typical approach of using the 1-norm as an upper bound to the spectral norm to rescale the Hamiltonian suits the most general case of bounded Hermitian operators but neglects the influence of symmetries commonly found in chemical systems. In this work, we introduce a hierarchy of symmetry-aware spectral bounds that provide a unified understanding of the performance of quantum phase estimation algorithms using block-encoded electronic structure Hamiltonians. We present a variational and numerically tractable method for computing these bounds, based on orbital optimization, to demonstrate that the computed bounds are smaller than conventional spectral bounds for a variety of molecular benchmark systems. We also highlight the unique analytical and numerical scaling behavior of these bounds in the thermodynamic and complete basis set limits. Our work shows that there is room for improvement in reducing the 1-norm, not yet achieved through methods like double factorization and tensor hypercontraction, but highlights the potential challenges in improving the performance of current quantum algorithms beyond small constant factors through 1-norm reduction techniques alone.
- 14 August 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (2) , 022420
Assessing the query complexity limits of quantum phase estimation using symmetry-aware spectral bounds
The computational cost of quantum algorithms for physics and chemistry is closely linked to the spectrum of the Hamiltonian, a property that manifests in the necessary rescaling of its eigenvalues. The typical approach of using the 1-norm as an upper bound to the spectral norm to rescale the Hamiltonian suits the most general case of bounded Hermitian operators but neglects the influence of symmetries commonly found in chemical systems. In this work, we introduce a hierarchy of symmetry-aware spectral bounds that provide a unified understanding of the performance of quantum phase estimation algorithms using block-encoded electronic structure Hamiltonians. We present a variational and numerically tractable method for computing these bounds, based on orbital optimization, to demonstrate that the computed bounds are smaller than conventional spectral bounds for a variety of molecular benchmark systems. We also highlight the unique analytical and numerical scaling behavior of these bounds in the thermodynamic and complete basis set limits. Our work shows that there is room for improvement in reducing the 1-norm, not yet achieved through methods like double factorization and tensor hypercontraction, but highlights the potential challenges in improving the performance of current quantum algorithms beyond small constant factors through 1-norm reduction techniques alone.
- Open Access
Enhancing initial state overlap through orbital optimization for faster molecular electronic ground-state energy estimation
The quantum phase estimation algorithm stands as the primary method for determining the ground state energy of a molecular electronic Hamiltonian on a quantum computer. In this context, the ability to initialize a classically tractable state that has a strong overlap with the desired ground state is critical as it directly affects the runtime of the algorithm. However, several numerical studies have shown that this overlap decays exponentially with system size. In this work, we demonstrate that this decay can be alleviated by optimizing the molecular orbital basis, for an initial state constructed from a single Slater determinant. We propose a practical method to achieve this optimization without knowledge of the true molecular ground state and test this method numerically. By comparing the resulting optimized orbitals to the natural orbitals, we find improved overlap. Specifically, for four iron-sulfur molecules, which are known to suffer from the mentioned decay, we show that our method yields one to two orders of magnitude improvement compared to localized molecular orbitals.
Open AccessEnhancing initial state overlap through orbital optimization for faster molecular electronic ground-state energy estimation
The quantum phase estimation algorithm stands as the primary method for determining the ground state energy of a molecular electronic Hamiltonian on a quantum computer. In this context, the ability to initialize a classically tractable state that has a strong overlap with the desired ground state is critical as it directly affects the runtime of the algorithm. However, several numerical studies have shown that this overlap decays exponentially with system size. In this work, we demonstrate that this decay can be alleviated by optimizing the molecular orbital basis, for an initial state constructed from a single Slater determinant. We propose a practical method to achieve this optimization without knowledge of the true molecular ground state and test this method numerically. By comparing the resulting optimized orbitals to the natural orbitals, we find improved overlap. Specifically, for four iron-sulfur molecules, which are known to suffer from the mentioned decay, we show that our method yields one to two orders of magnitude improvement compared to localized molecular orbitals.
- Open Access
Classical and quantum cost of measurement strategies for quantum-enhanced auxiliary field Quantum Monte Carlo
Quantum-enhanced auxiliary field quantum Monte Carlo (QC-AFQMC) uses output from a quantum computer to increase the accuracy of its classical counterpart. The algorithm requires the estimation of overlaps between walker states and a trial wavefunction prepared on the quantum computer. We study the applicability of this algorithm in terms of the number of measurements required from the quantum computer and the classical costs of post-processing those measurements. We compare the classical post-processing costs of state-of-the-art measurement schemes using classical shadows to determine the overlaps and argue that the overall post-processing cost stemming from overlap estimations scales like $\mathcal{O}(N^9)$ per walker throughout the algorithm. With further numerical simulations, we compare the variance behavior of the classical shadows when randomizing over different ensembles, e.g., Cliffords and (particle-number restricted) matchgates beyond their respective bounds, and uncover the existence of covariances between overlap estimations of the AFQMC walkers at different imaginary time steps. Moreover, we include analyses of how the error in the overlap estimation propagates into the AFQMC energy and discuss its scaling when increasing the system size.Open AccessClassical and quantum cost of measurement strategies for quantum-enhanced auxiliary field Quantum Monte Carlo
Quantum-enhanced auxiliary field quantum Monte Carlo (QC-AFQMC) uses output from a quantum computer to increase the accuracy of its classical counterpart. The algorithm requires the estimation of overlaps between walker states and a trial wavefunction prepared on the quantum computer. We study the applicability of this algorithm in terms of the number of measurements required from the quantum computer and the classical costs of post-processing those measurements. We compare the classical post-processing costs of state-of-the-art measurement schemes using classical shadows to determine the overlaps and argue that the overall post-processing cost stemming from overlap estimations scales like $\mathcal{O}(N^9)$ per walker throughout the algorithm. With further numerical simulations, we compare the variance behavior of the classical shadows when randomizing over different ensembles, e.g., Cliffords and (particle-number restricted) matchgates beyond their respective bounds, and uncover the existence of covariances between overlap estimations of the AFQMC walkers at different imaginary time steps. Moreover, we include analyses of how the error in the overlap estimation propagates into the AFQMC energy and discuss its scaling when increasing the system size.