247 citations · 988 across the 28 of their papers we have counts for
4 papers · 1 filter
Sharp complexity phase transitions generated by entanglement
Soumik Ghosh, Abhinav Deshpande, Dominik Hangleiter +2
Entanglement is one of the physical properties of quantum systems responsible for the computational hardness of simulating quantum systems. But while the runtime of specific algori…
Spoofing cross entropy measure in boson sampling
Changhun Oh, Liang Jiang, Bill Fefferman
Cross entropy (XE) measure is a widely used benchmarking to demonstrate quantum computational advantage from sampling problems, such as random circuit sampling using superconductin…
The learnability of Pauli noise
Senrui Chen, Yunchao Liu, Matthew Otten +3
Recently, several quantum benchmarking algorithms have been developed to characterize noisy quantum gates on today's quantum devices. A well-known issue in benchmarking is that not…
Quantum-inspired classical algorithm for molecular vibronic spectra
Changhun Oh, Youngrong Lim, Yat Wong +2
We have recently seen the first plausible claims for quantum advantage using sampling problems such as random circuit sampling and Gaussian boson sampling. The obvious next step is…