Computational advantage of quantum random sampling

D Hangleiter, J Eisert - Reviews of Modern Physics, 2023 - APS
Quantum random sampling is the leading proposal for demonstrating a computational
advantage of quantum computers over classical computers. Recently the first large-scale …

HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware

NPD Sawaya, D Marti-Dafcik, Y Ho, DP Tabor… - Quantum, 2024 - quantum-journal.org
In order to characterize and benchmark computational hardware, software, and algorithms, it
is essential to have many problem instances on-hand. This is no less true for quantum …

Large-scale photonic network with squeezed vacuum states for molecular vibronic spectroscopy

HH Zhu, H Sen Chen, T Chen, Y Li, SB Luo… - Nature …, 2024 - nature.com
Although molecular vibronic spectra generation is pivotal for chemical analysis, tackling
such exponentially complex tasks on classical computers remains inefficient. Quantum …

Predicting molecular vibronic spectra using time-domain analog quantum simulation

RJ MacDonell, T Navickas, TF Wohlers-Reichel… - Chemical …, 2023 - pubs.rsc.org
Spectroscopy is one of the most accurate probes of the molecular world. However,
predicting molecular spectra accurately is computationally difficult because of the presence …

Quantum-inspired classical algorithms for molecular vibronic spectra

C Oh, Y Lim, Y Wong, B Fefferman, L Jiang - Nature Physics, 2024 - nature.com
Plausible claims for quantum advantage have been made using sampling problems such as
random circuit sampling in superconducting qubit devices, and Gaussian boson sampling in …

Walking through Hilbert space with quantum computers

T Jiang, J Zhang, MKA Baumgarten, MF Chen… - arxiv preprint arxiv …, 2024 - arxiv.org
Computations of chemical systems' equilibrium properties and non-equilibrium dynamics
have been suspected of being a" killer app" for quantum computers. This review highlights …

Quantum-inspired classical algorithm for graph problems by Gaussian boson sampling

C Oh, B Fefferman, L Jiang, N Quesada - PRX quantum, 2024 - APS
We present a quantum-inspired classical algorithm that can be used for graph-theoretical
problems, such as finding the densest k subgraph and finding the maximum weight clique …

Improved Resource‐Tunable Near‐Term Quantum Algorithms for Transition Probabilities, with Applications in Physics and Variational Quantum Linear Algebra

NPD Sawaya, J Huh - Advanced Quantum Technologies, 2023 - Wiley Online Library
Transition amplitudes and transition probabilities are relevant to many areas of physics
simulation, including the calculation of response properties and correlation functions. These …

Quantum algorithm for simulating single-molecule electron transport

S Jahangiri, JM Arrazola, A Delgado - The Journal of Physical …, 2021 - ACS Publications
An accurate description of electron transport at a molecular level requires a precise
treatment of quantum effects. These effects play a crucial role in determining the electron …

Simulation of condensed-phase spectroscopy with near-term digital quantum computers

CK Lee, CY Hsieh, S Zhang, L Shi - Journal of Chemical Theory …, 2021 - ACS Publications
Spectroscopy is an indispensable tool for understanding the structures and dynamics of
molecular systems. However, computational modeling of spectroscopy is challenging due to …