Sep 30, 2016 · Our result generalizes a near-quadratic lower bound for quantum formula size obtained by Roychowdhury and Vatan [SIAM J. on Computing, 2001].
We show that any quantum circuit of treewidth t, built from r-qubit gates, requires at least gates to compute the element distinctness function.
with multiplicative precision in polynomial time [21]. In this work we prove near-quadratic size lower bounds for quantum circuits of constant treewidth.
We show that any quantum circuit of treewidth $t$, built from $r$-qubit gates, requires at least $\Omega(\frac{n^{2}}{2^{O(r\cdot t)}\cdot \log^4 n})$ gates ...
Jan 7, 2018 · Our result generalizes a near-quadratic lower bound for quantum formula size obtained by Roychowdhury and Vatan [SIAM J. on Computing, 2001].
Our result generalizes a near-quadratic lower bound for quantum formula size obtained by Roychowdhury and Vatan [SIAM J. on Computing, 2001]. The proof of our ...
A near-quadratic lower bound for the size of quantum circuits of constant treewidth. Mateus de Oliveira Oliveira. 2018. Published: 2018. View in: zbMATH.
Request PDF | On Jan 2, 2018, Mateus de Oliveira Oliveira published A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth | Find,
In this work we study the relationship between size and treewidth of circuits computing variants of the element distinctness function. First, we show that for ...
Mateus de Oliveira Oliveira: A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth. 29. SODA 2018: New Orleans, LA, USA: 136 ...