ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Circuit depth”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

quant-phcs.CCTheoreticalRecentJun 15, 2026

Worst-case depth hierarchy for shallow quantum circuits

Min-Hsiu Hsieh, Michael de Oliveira, Sathyawageeswar Subramanian, Xingjian Zhang

This paper proves an explicit depth hierarchy theorem for QNC^0, showing that increasing depth strictly increases computational power within this class.

View →
cs.CCTheoreticalRecentJun 16, 2026

Depth Lower Bounds for ReLU Networks with Binary Inputs

Neil Krishnan, Elchanan Mossel

This paper establishes all-depths depth separation for ReLU networks on {0,1}^n.

View →
cs.CCcs.LOTheoreticalRecentOct 24, 2026

Meta-Mathematics of Algebraic Complexity

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.

View →
cs.ARRecentMay 31, 2026

Linear Complexity Fermionic Simulation on Quantum Devices with Hardware Connectivity Constraints

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…

View →
quant-phcond-mat.dis-nncs.CCTheoreticalRecentJul 15, 2026

Circuit complexity lower bounds for quantum spin glasses

Omar Al-Ghattas, David Gamarnik

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.

View →
cs.ARRecentMay 28, 2026

Constant Depth Threshold Circuits For Exhaustive Epistasis Detection

André Ribeiro, Aleksandar Ilic, Leonel Sousa

The paper proposes constant depth threshold circuits for efficiently detecting epistasis by calculating the relative frequencies of all dataset combinations using specialized hardware architectures.

View →
cs.CCTheoreticalRecentAug 9, 2026

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism

Haoxing Lin

This paper proves lower bounds for $k$-OV, $k$-XOR, and $k$-SUM in nonuniform AC$^0$, without using running-time hypotheses.

View →
cs.CRMar 17, 2026

Ciphertext-Policy ABE for $\mathsf{NC}^1$ Circuits with Constant-Size Ciphertexts from Succinct LWE

Jiaqi Liu, Yuanyi Zhang, Fang-Wei Fu

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.

View →
cs.ARcs.DCmath.NAEmpiricalRecentJun 30, 2026

PEERS: A Parallel and Exact Effective Resistance Solver via Implicit Inversion and Augmented Symbolic Analysis

Baiyu Chen, Lin Gan, Guangwen Yang, Wenjian Yu

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…

View →
cs.ARTheoreticalRecentJul 30, 2026

Analog Courant Numbers and their Role in Analog Computing

Arash Ghasemi

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…

View →
cs.AREmpiricalRecentOct 1, 2026

Design Space Exploration of Backside Clock Meshes for 2 nm GAAFET BSPDN Technology

Wajid Ali, Muhammad Hadir Khan, Dalton Gaddy, Matthew Guthaus

This paper explores the use of backside clock meshes in VLSI designs to minimize skew and tolerate on-chip variation.

View →
cs.ARcs.LGEmpiricalRecentJul 4, 2026

Weave: Verified Netlist-to-Schematic Conversion via Layered Graph Layout

Senol Gulgonul

This paper presents Weave, a deterministic method to convert SPICE netlists into LTspice schematics with guaranteed connectivity preservation.

View →
cs.AREmpiricalRecentJun 19, 2026

Row-Based Layout Synthesis for Analog Circuits Using Height-Quantized Primitives

Endalk Y. Gebru, Ramprasath S., Ramesh Harjani, Sachin S. Sapatnekar

A quantized row-height layout synthesis methodology for AMS circuits is proposed to reduce the simulation-to-silicon gap.

View →
cs.AREmpiricalRecentOct 7, 2026

ATLAS: Adaptive TDA-guided Landscape-Aware Transistor Sizing

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.

View →
cs.ETcs.AREmpiricalRecentOct 1, 2026

Duplication-Aware Retiming and Cell Interface Redesign for Superconductor Circuit Minimization

Panagiotis Papanikolaou, Alex Vanasse, Haoran Jin, Georgios Tzimpragos +1 more

This paper presents a duplication-aware retiming methodology for minimizing Josephson junction count in superconductor electronics.

View →