A near-quadratic lower bound for the size of quantum circuits of constant treewidth
From MaRDI portal
Publication:4607882
zbMATH Open1402.68061arXiv1609.09643MaRDI QIDQ4607882FDOQ4607882
Authors: Mateus de Oliveira Oliveira 
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1609.09643
Recommendations
- On the satisfiability of quantum circuits of small treewidth
- On the satisfiability of quantum circuits of small treewidth
- Simulating Quantum Computation by Contracting Tensor Networks
- Size-treewidth tradeoffs for circuits computing the element distinctness function
- Size-treewidth tradeoffs for circuits computing the element distinctness function
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)
Cited In (8)
- Simulating Quantum Computation by Contracting Tensor Networks
- Size-treewidth tradeoffs for circuits computing the element distinctness function
- Size-treewidth tradeoffs for circuits computing the element distinctness function
- Entropy lower bounds for quantum decision tree complexity
- Differential geometric treewidth estimation in adiabatic quantum computation
- Lyapunov-type inequalities for nonlinear fractional differential equations and systems involving Caputo-type fractional derivatives
- On the satisfiability of quantum circuits of small treewidth
- On the satisfiability of quantum circuits of small treewidth
This page was built for publication: A near-quadratic lower bound for the size of quantum circuits of constant treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607882)
