NRNicholas C. Rubin

Nicholas C. Rubin

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

Recognitions

Top Cited Young Scholar (2026)
Top Cited Scholar (2026)

Nicholas C. Rubin has a total of 844 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Near-Frustration-Free Electronic Structure Hamiltonian Representations and Lower-Bound Certificates

    by Nicholas C. Rubin, Guang Hao Low, A. Eugene DePrince III

    Hamiltonian representations based on the sum-of-squares (SOS) hierarchy provide rigorous lower bounds on ground-state energies and facilitate the design of efficient classical and quantum simulation algorithms. This work presents a unified framework connecting SOS decompositions with variational two-particle reduced density matrix (v2RDM) theory. We demonstrate that the “weighted” SOS ansatz naturally recovers the dual of the v2RDM program, enabling the strict enforcement of symmetry constraints such as particle number and spin. We provide explicit SOS constructions for the Hubbard model and electronic structure Hamiltonians, ranging from spin-free approximations to full rank-2 expansions. We also highlight theoretical connections to block-invariant symmetry shifts. Numerical benchmarks on molecular systems and iron–sulfur clusters validate these near-frustration-free representations, demonstrating their utility in improving spectral gap amplification and reducing block-encoding costs in quantum algorithms.

  • Open Access

    Quantum Simulation with Sum-of-Squares Spectral Amplification

    by Robbie King, Guang Hao Low, Ryan Babbush, Rolando D. Somma, Nicholas C. Rubin

    We present sum-of-squares spectral amplification (SOSSA), a framework for improving quantum simulation relevant to low-energy problems. We show how SOSSA can be applied to problems like energy and phase estimation and provide fast quantum algorithms for these problems that significantly improve over prior art. To illustrate the power of SOSSA in applications, we consider the Sachdev-Ye-Kitaev model, a representative strongly correlated system, and demonstrate asymptotic speedups over generic simulation methods by a factor of the square root of the system size. Our results reinforce those observed in [G. H. Low , ], where SOSSA was used to achieve state-of-the-art gate costs for phase estimation of real-world quantum chemistry systems.


  • Open Access

    Near-frustration-free electronic structure Hamiltonian representations and lower bound certificates

    by Nicholas C. Rubin, Guang Hao Low, A. Eugene DePrince

    Hamiltonian representations based on the sum-of-squares (SOS) hierarchy provide rigorous lower bounds on ground-state energies and facilitate the design of efficient classical and quantum simulation algorithms. This work presents a unified framework connecting SOS decompositions with variational two-particle reduced density matrix (v2RDM) theory. We demonstrate that the ``weighted'' SOS ansatz naturally recovers the dual of the v2RDM program, enabling the strict enforcement of symmetry constraints such as particle number and spin. We provide explicit SOS constructions for the Hubbard model and electronic structure Hamiltonians, ranging from spin-free approximations to full rank-2 expansions. We also highlight theoretical connections to block-invariant symmetry shifts. Numerical benchmarks on molecular systems and Iron-Sulfur clusters validate these near frustration-free representations, demonstrating their utility in improving spectral gap amplification and reducing block encoding costs in quantum algorithms.

  • Top Cited Papers
    Open Access

    Fast Quantum Simulation of Electronic Structure by Spectral Amplification

    by Guang Hao Low, Robbie King, Dominic W. Berry, Qiushi Han, A. Eugene DePrince, Alec F. White, Ryan Babbush, Rolando D. Somma, Nicholas C. Rubin

    The most advanced techniques using fault-tolerant quantum computers to estimate the ground-state energy of a chemical Hamiltonian involve compression of the Coulomb operator through tensor factorizations, enabling efficient block encodings of the Hamiltonian. A natural challenge of these methods is the degree to which block-encoding costs can be reduced. We address this challenge through the technique of spectral amplification, which magnifies the spectrum of the low-energy states of Hamiltonians that can be expressed as sums of squares. Spectral amplification enables estimating ground-state energies with significantly improved cost scaling in the block encoding normalization factor Λ to just 2 Λ E gap , where E gap ≪ Λ is the lowest energy of the sum-of-squares Hamiltonian. To achieve this, we show that sum-of-squares representations of the electronic structure Hamiltonian are efficiently computable by a family of classical simulation techniques that approximate the ground-state energy from below. In order to further optimize, we also develop a novel factorization that provides a trade-off between the two leading Coulomb integral factorization schemes—namely, double factorization and tensor hypercontraction—that when combined with spectral amplification yields a factor of 4 to 195 speedup over the state of the art in ground-state energy estimation for models of iron-sulfur complexes and a CO 2 -fixation catalyst.


  • Open Access

    Quantum computation of molecular geometry via many-body nuclear spin echoes

    by C. Zhang, R. G. Cortiñas, A. H. Karamlou, N. Noll, J. Provazza, J. Bausch, S. Shirobokov, A. White, M. Claassen, S. H. Kang, et al.

    Quantum-information-inspired experiments in nuclear magnetic resonance spectroscopy may yield a pathway towards determining molecular structure and properties that are otherwise challenging to learn. We measure out-of-time-ordered correlators (OTOCs) [1-4] on two organic molecules suspended in a nematic liquid crystal, and investigate the utility of this data in performing structural learning tasks. We use OTOC measurements to augment molecular dynamics models, and to correct for known approximations in the underlying force fields. We demonstrate the utility of OTOCs in these models by estimating the mean ortho-meta H-H distance of toluene and the mean dihedral angle of 3',5'-dimethylbiphenyl, achieving similar accuracy and precision to independent spectroscopic measurements of both quantities. To ameliorate the apparent exponential classical cost of interpreting the above OTOC data, we simulate the molecular OTOCs on a Willow superconducting quantum processor, using AlphaEvolve-optimized [5] quantum circuits and arbitrary-angle fermionic simulation gates. We implement novel zero-noise extrapolation techniques based on the Pauli pathing model of operator dynamics [6], to repeat the learning experiments with root-mean-square error $0.05$ over all circuits used. Our work highlights a computational protocol to interpret many-body echoes from nuclear magnetic systems using low resource quantum computation.


  • Open Access

    Quantum simulation with sum-of-squares spectral amplification

    by Robbie King, Guang Hao Low, Ryan Babbush, Rolando D. Somma, Nicholas C. Rubin

    We present sum-of-squares spectral amplification (SOSSA), a framework for improving quantum simulation relevant to low-energy problems. We show how SOSSA can be applied to problems like energy and phase estimation and provide fast quantum algorithms for these problems that significantly improve over prior art. To illustrate the power of SOSSA in applications, we consider the Sachdev-Ye-Kitaev model, a representative strongly correlated system, and demonstrate asymptotic speedups over generic simulation methods by a factor of the square root of the system size. Our results reinforce those observed in [G.H. Low \textit{et al.}, arXiv:2502.15882 (2025)], where SOSSA was used to achieve state-of-the-art gate costs for phase estimation of real-world quantum chemistry systems.


  • Open Access

    Fast quantum simulation of electronic structure by spectrum amplification

    by Guang Hao Low, Robbie King, Dominic W. Berry, Qiushi Han, A. Eugene DePrince, Alec White, Ryan Babbush, Rolando D. Somma, Nicholas C. Rubin

    The most advanced techniques using fault-tolerant quantum computers to estimate the ground-state energy of a chemical Hamiltonian involve compression of the Coulomb operator through tensor factorizations, enabling efficient block-encodings of the Hamiltonian. A natural challenge of these methods is the degree to which block-encoding costs can be reduced. We address this challenge through the technique of spectrum amplification, which magnifies the spectrum of the low-energy states of Hamiltonians that can be expressed as sums of squares. Spectrum amplification enables estimating ground-state energies with significantly improved cost scaling in the block encoding normalization factor $Λ$ to just $\sqrt{2ΛE_{\text{gap}}}$, where $E_{\text{gap}} \ll Λ$ is the lowest energy of the sum-of-squares Hamiltonian. To achieve this, we show that sum-of-squares representations of the electronic structure Hamiltonian are efficiently computable by a family of classical simulation techniques that approximate the ground-state energy from below. In order to further optimize, we also develop a novel factorization that provides a trade-off between the two leading Coulomb integral factorization schemes -- namely, double factorization and tensor hypercontraction -- that when combined with spectrum amplification yields a factor of 4 to 195 speedup over the state of the art in ground-state energy estimation for models of Iron-Sulfur complexes and a CO$_{2}$-fixation catalyst.


  • Top Cited Papers
    Open Access

    Thermalization and criticality on an analogue–digital quantum simulator

    by T. I. Andersen, N. Astrakhantsev, A. H. Karamlou, J. Berndtsson, J. Motruk, A. Szasz, J. A. Gross, A. Schuckert, T. Westerhout, Y. Zhang, et al.

    Understanding how interacting particles approach thermal equilibrium is a major challenge of quantum simulators1,2. Unlocking the full potential of such systems towards this goal requires flexible initial state preparation, precise time evolution and extensive probes for final state characterization. Here we present a quantum simulator comprising 69 superconducting qubits that supports both universal quantum gates and high-fidelity analogue evolution, with performance beyond the reach of classical simulation in cross-entropy benchmarking experiments. This hybrid platform features more versatile measurement capabilities compared with analogue-only simulators, which we leverage here to reveal a coarsening-induced breakdown of Kibble–Zurek scaling predictions3 in the XY model, as well as signatures of the classical Kosterlitz–Thouless phase transition4. Moreover, the digital gates enable precise energy control, allowing us to study the effects of the eigenstate thermalization hypothesis5–7 in targeted parts of the eigenspectrum. We also demonstrate digital preparation of pairwise-entangled dimer states, and image the transport of energy and vorticity during subsequent thermalization in analogue evolution. These results establish the efficacy of superconducting analogue–digital quantum processors for preparing states across many-body spectra and unveiling their thermalization dynamics.


  • Open Access

    Quantum simulation of realistic materials in first quantization using non-local pseudopotentials

    by Dominic W. Berry, Nicholas C. Rubin, Ahmed O. Elnabawy, Gabriele Ahlers, A. Eugene DePrince, Joonho Lee, Christian Gogolin, Ryan Babbush


  • Top Cited Papers
    Open Access

    Quantum error correction below the surface code threshold

    by Rajeev Acharya, Dmitry A. Abanin, Laleh Aghababaie-Beni, Igor Aleiner, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Abraham Asfaw, Nikita Astrakhantsev, et al.

    Quantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. Here, we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: a distance-7 code, and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of \(\varLambda \mathrm{=2.14}\pm 0.02\) when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% ± 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit’s lifetime by a factor of \(2.4\pm 0.3\). Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 μs at distance-5 up to a million cycles, with a cycle time of 1.1 μs. We also run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or \(3\) \(\times \) \({10}^{9}\) cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.