activity
20102024
most citedSupplementary information for "Quantum supremacy using a programmable superconducting processor"

7.2k citations · 9.1k across the 86 of their papers we have counts for

collaborators
Showing quant-phShow all

86 papers · 1 filter

quant-ph2024★ 11 cited

Noise-Resilient and Reduced Depth Approximate Adders for NISQ Quantum Computing

Bhaskar Gaur, Travis S. Humble, Himanshu Thapliyal

The "Noisy intermediate-scale quantum" NISQ machine era primarily focuses on mitigating noise, controlling errors, and executing high-fidelity operations, hence requiring shallow c…

quant-ph2023★ 8 cited

Deep Quantum Circuit Simulations of Low-Energy Nuclear States

Ang Li, Alessandro Baroni, Ionel Stetcu +1

Numerical simulation is an important method for verifying the quantum circuits used to simulate low-energy nuclear states. However, real-world applications of quantum computing for…

quant-ph2023

Adaptive mitigation of time-varying quantum noise

Samudra Dasgupta, Arshag Danageozian, Travis S. Humble

Current quantum computers suffer from non-stationary noise channels with high error rates, which undermines their reliability and reproducibility. We propose a Bayesian inference-b…

quant-ph2023★ 1 cited

Reliable Devices Yield Stable Quantum Computations

Samudra Dasgupta, Travis S. Humble

Stable quantum computation requires noisy results to remain bounded even in the presence of noise fluctuations. Yet non-stationary noise processes lead to drift in the varying char…

quant-ph2023★ 4 cited

Impact of unreliable devices on stability of quantum computations

Samudra Dasgupta, Travis S. Humble

Noisy intermediate-scale quantum (NISQ) devices are valuable platforms for testing the tenets of quantum computing, but these devices are susceptible to errors arising from de-cohe…

quant-ph2023★ 3 cited

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

Moises Ponce, Rebekah Herrman, Phillip C. Lotshaw +4

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current nois…