Results 261 to 270 of about 93,203 (297)
Circuit Complexity in Interacting Quenched Quantum Field Theory
Symmetry, 2023 In this work, we explore the effects of quantum quenching on the circuit complexity of quenched quantum field theory with weakly coupled quartic interactions. We use the invariant operator method under a perturbative framework to compute the ground state
Sayantan Choudhury, Choudhury Sayantan
exaly +2 more sources
Circuit Complexity from Supersymmetric Quantum Field Theory with Morse Function
Symmetry, 2022 Computation of circuit complexity has gained much attention in the theoretical physics community in recent times, to gain insights into the chaotic features and random fluctuations of fields in the quantum regime.
Sayantan Choudhury +2 more
exaly +2 more sources
Wire length as a circuit complexity measure
Journal of Computer and System Sciences, 2005 We introduce wire length as a salient complexity measure for analyzing the circuit complexity of sensory processing in biological neural systems. This new complexity measure is applied in this paper to two basic computational problems that arise in ...
Legenstein, Robert A., Maass, Wolfgang
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
THE COMPLEXITY OF WORD CIRCUITS
Discrete Mathematics, Algorithms and Applications, 2010A word circuit [1] is a directed acyclic graph in which each edge holds a w-bit word (i.e., some x ∈ {0, 1}w) and each node is a gate computing some binary function g : {0, 1}w × {0, 1}w → {0, 1}w. The following problem was studied in [1]: How many binary gates are needed to compute a ternary function f : ({0, 1}w)3 → {0, 1}w.
Xue Chen 0001 +2 more
openaire +1 more source
An isomorphism theorem for circuit complexity
Proceedings of Computational Complexity (Formerly Structure in Complexity Theory), 2002We show that all sets complete for NC/sup 1/ under AC/sup 0/ reductions are isomorphic under AC/sup 0/-computable isomorphisms. Although our proof does not generalize directly to other complexity classes, we do show that, for all complexity classes C closed under NC/sup 1/-computable many-one reductions, the sets complete for C under NC/sup 0 ...
Manindra Agrawal, Eric Allender
openaire +2 more sources
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 2002
We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomial-size quantum circuit. This result also enables us to construct a universal quantum computer which can simulate, with a polynomial factor ...
openaire +1 more source
We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomial-size quantum circuit. This result also enables us to construct a universal quantum computer which can simulate, with a polynomial factor ...
openaire +1 more source
VC dimension in circuit complexity
Proceedings of Computational Complexity (Formerly Structure in Complexity Theory), 2002The main result of this paper is a /spl Omega/(n/sup 1/4/) lower bound on the size of a sigmoidal circuit computing a specific AC/sub 2//sup 0/ function. This is the first lower bound for the computation model of sigmoidal circuits with unbounded weights.
openaire +3 more sources
Complex dynamics in circuits with memristors
2017 European Conference on Circuit Theory and Design (ECCTD), 2017Innovative memristor-centered strategies to sense, store, and process information may be tested inexpensively and reliably exploiting the nonlinear dynamics of simple emulators based upon standard two-terminal devices from electrical circuit theory. Should a promising outcome emerge from the emulator-based tests, the novel strategies would be later ...
Ascoli A, Tetzlaff R, Biey M, Chua LO
openaire +1 more source
Circuit Complexity of Regular Languages
Theory of Computing Systems, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On the Complexity of Unique Circuit SAT
Journal of Mathematical Sciences, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source