output
20022026
most citedSupplementary information for "Quantum supremacy using a programmable superconducting processor"

7.2k citations

researchers with a paper here
collaborating institutions
Showing 2015 · cs.LOShow all

1 paper · 2 filters

cs.LO2015

On the Hardness of Almost-Sure Termination

Benjamin Lucien Kaminski, Joost-Pieter Katoen

This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost-sure termination of probabilistic programs. It is shown th…