2 citations · 2 across the 3 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2019
Additive-error fine-grained quantum supremacy
Tomoyuki Morimae, Suguru Tamaki
It is known that several sub-universal quantum computing models, such as the IQP model, the Boson sampling model, the one-clean qubit model, and the random circuit model, cannot be…
quant-ph2019
Fine-grained quantum supremacy based on Orthogonal Vectors, 3-SUM and All-Pairs Shortest Paths
Ryu Hayakawa, Tomoyuki Morimae, Suguru Tamaki
Fine-grained quantum supremacy is a study of proving (nearly) tight time lower bounds for classical simulations of quantum computing under "fine-grained complexity" assumptions. We…
quant-ph2019
Fine-grained quantum computational supremacy
Tomoyuki Morimae, Suguru Tamaki
Output probability distributions of several sub-universal quantum computing models cannot be classically efficiently sampled unless some unlikely consequences occur in classical co…