Showing cs.CCShow all
2 papers · 1 filter
cs.CC2020
Parallel repetition with a threshold in quantum interactive proofs
Abel Molina
In this note, we show that rounds of parallel repetition with a threshold suffice to reduce completeness and soundness error to for single-prover quantum intera…
cs.CC2018
Revisiting the simulation of quantum Turing machines by quantum circuits
Abel Molina, John Watrous
Yao (1993) proved that quantum Turing machines and uniformly generated quantum circuits are polynomially equivalent computational models: steps of a quantum Turing machi…