# A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth

@article{Oliveira2018ANL,
title={A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth},
author={Mateus de Oliveira Oliveira},
journal={ArXiv},
year={2018},
volume={abs/1609.09643}
}
• Mateus de Oliveira Oliveira
• Published 2018
• Mathematics, Computer Science, Physics
• ArXiv
• 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 to compute the element distinctness function. 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 lower bound follows by an extension of Ne\v{c}iporuk's method to the context of quantum circuits of constant treewidth. This extension is… CONTINUE READING

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 36 REFERENCES

## Simulating Quantum Computation by Contracting Tensor Networks

• Mathematics, Physics, Computer Science
• SIAM J. Comput.
• 2008
VIEW 3 EXCERPTS

## On the Satisfiability of Quantum Circuits of Small Treewidth

VIEW 1 EXCERPT

## Quantum Formulas: A Lower Bound and Simulation

• Physics, Computer Science, Mathematics
• SIAM J. Comput.
• 2001
VIEW 3 EXCERPTS

## Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function

VIEW 3 EXCERPTS

## A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function

• Computer Science, Mathematics
• 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
• 2016
VIEW 1 EXCERPT

## Balancing Bounded Treewidth Circuits

• Mathematics, Computer Science
• Theory of Computing Systems
• 2013
VIEW 1 EXCERPT

## Quantum Circuit Complexity

VIEW 1 EXCERPT

## Explicit lower bound of 4.5n - o(n) for boolena circuits

• Mathematics, Computer Science
• STOC '01
• 2001
VIEW 1 EXCERPT