Ryan Bennink

QUANT-PH
3papers
6citations
Novelty20%
AI Score33

3 Papers

COMar 20, 2023
Seven open problems in applied combinatorics

Sinan G. Aksoy, Ryan Bennink, Yuzhou Chen et al.

We present and discuss seven different open problems in applied combinatorics. The application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods, hypergraph cut algorithms, and power systems.

41.1QUANT-PHMar 26
Uncertainty Quantification for Quantum Computing

Ryan Bennink, Olena Burkovska, Konstantin Pieper et al.

This review is designed to introduce mathematicians and computational scientists to quantum computing (QC) through the lens of uncertainty quantification (UQ) by presenting a mathematically rigorous and accessible narrative for understanding how noise and intrinsic randomness shape quantum computational outcomes in the language of mathematics. By grounding quantum computation in statistical inference, we highlight how mathematical tools such as probabilistic modeling, stochastic analysis, Bayesian inference, and sensitivity analysis, can directly address error propagation and reliability challenges in today's quantum devices. We also connect these methods to key scientific priorities in the field, including scalable uncertainty-aware algorithms and characterization of correlated errors. The purpose is to narrow the conceptual divide between applied mathematics, scientific computing and quantum information sciences, demonstrating how mathematically rooted UQ methodologies can guide validation, error mitigation, and principled algorithm design for emerging quantum technologies, in order to address challenges and opportunities present in modern-day quantum high performance and fault-tolerant quantum computing paradigms.

9.5QUANT-PHMay 4
Closed form logical error rate approximations for surface codes

Shaked Regev, Daniel Dilley, Andrea Delgado et al.

We propose a novel method to calculate logical error rates in surface codes, assuming independent and identically distributed physical errors. We show how to use our method to analyze hypothetical quantum computers with various configurations and select designs with lower error rates. Currently, this requires expensive classical simulations of quantum decoders for various distances and physical error rates or inaccurate extrapolation from minimal experimental data. Instead, we use the symmetry of the problem to count the configurations that result in a logical error with our novel software. Given a physical error rate, we can deduce the probability of a logical error, to provably good accuracy. We include an analysis of measurement errors to allow a more complete comparison of different surface code implementations.