44 citations · 57 across the 4 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2024★ 1 cited
Unconditional verification of quantum computation with classical light
Yuki Takeuchi, Akihiro Mizutani
Verification of quantum computation is a task to efficiently check whether an output given from a quantum computer is correct. Existing verification protocols conducted between a q…
quant-ph2016★ 8 cited
Ancilla-driven instantaneous quantum polynomial time circuit for quantum supremacy
Yuki Takeuchi, Yasuhiro Takahashi
Instantaneous quantum polynomial time (IQP) is a model of (probably) non-universal quantum computation. Since it has been proven that IQP circuits are unlikely to be simulated clas…