20 results for “Circuit depth”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper proves an explicit depth hierarchy theorem for QNC^0, showing that increasing depth strictly increases computational power within this class.
This paper establishes all-depths depth separation for ReLU networks on {0,1}^n.
Michal Garlik, Svyatoslav Gryaznov, Jiaqi Lu, Rahul Santhanam +1 more
The paper studies the meta-mathematics of algebraic circuit lower bounds and their relationship with proof systems and bounded arithmetic theories.
Xiangyu Gao, Winston Li, Jiakang Li, Zirui Li +3 more
The paper introduces Accordion, an end-to-end framework that significantly improves the efficiency of compiling fermionic Hamiltonians into quantum circuits for simulation on constrained quantum hardw…
This paper shows that shallow circuits cannot prepare near-optimal states for random quantum $p$-spin glasses, and proves depth lower bounds for such preparations.
The paper proposes constant depth threshold circuits for efficiently detecting epistasis by calculating the relative frequencies of all dataset combinations using specialized hardware architectures.
This paper proves lower bounds for $k$-OV, $k$-XOR, and $k$-SUM in nonuniform AC$^0$, without using running-time hypotheses.
The paper presents a lattice-based Ciphertext-Policy Attribute-Based Encryption (CP-ABE) scheme that supports $\mathsf{NC}^1$ access policies while maintaining constant-size ciphertexts.
Proposed PEERS, a parallel and exact effective resistance solver using implicit inverse computing model of Cholesky factor, achieving optimal parallel span and memory complexity, and demonstrating sig…
This paper derives a constraint on the fastest normalized mode of analog-computing approaches represented by impedance networks, which is no more than 2π times the largest combined unity-gain bandwidt…
This paper explores the use of backside clock meshes in VLSI designs to minimize skew and tolerate on-chip variation.
This paper presents Weave, a deterministic method to convert SPICE netlists into LTspice schematics with guaranteed connectivity preservation.
A quantized row-height layout synthesis methodology for AMS circuits is proposed to reduce the simulation-to-silicon gap.
Youngmin Oh, Jihwan Won, Yuntae Park, Bosun Hwang +1 more
This paper proposes a new Bayesian optimization framework called ATLAS that uses topological data analysis to efficiently find feasible designs in analog circuit design.
This paper presents a duplication-aware retiming methodology for minimizing Josephson junction count in superconductor electronics.