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

doi 10.1137/1.9781611975031.9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

A Quadratic Lower Bound for Subset Sums

Acta Arithmetica
Number TheoryAlgebra
2007English

An Improved Lower Bound for the De Bruijn-Newman Constant

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2011English

New Upper Bound Heuristics for Treewidth

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Characterization of Associative Operations With Prefix Circuits of Constant Depth and Linear Size

SIAM Journal on Computing
MathematicsComputer Science
1990English

Improved Lower Bound on the Size of Kakeya Sets Over Finite Fields

Analysis and PDE
Applied MathematicsNumerical AnalysisAnalysis
2008English

Derivation of the Cut-Off Length From the Quantum Quadratic Enhancement of a Mass in Vacuum Energy Constant Lambda

European Physical Journal C
EngineeringAstronomyPhysics
2018English

A Lower Bound for the Rank of $J_0(q)$

Acta Arithmetica
Number TheoryAlgebra
2000English

A Lower Bound for Jumbled Indexing

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy