Results 1 to 10 of about 93,203 (297)
Circuit complexity for coherent states [PDF]
Journal of High Energy Physics, 2018 We examine the circuit complexity of coherent states in a free scalar field theory, applying Nielsen’s geometric approach as in [1]. The complexity of the coherent states have the same UV divergences as the vacuum state complexity and so we consider the ...
Minyong Guo +3 more
doaj +4 more sources
Circuit complexity and 2D bosonisation [PDF]
Journal of High Energy Physics, 2019 We consider the circuit complexity of free bosons and free fermions in 1+1 dimensions. Motivated by the results of [1, 2, 3] who found different behavior in the complexity of free bosons and fermions, in any dimension, we consider the 1+1 dimensional ...
Dongsheng Ge, Giuseppe Policastro
doaj +5 more sources
A note on the circuit complexity of PP
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources
Complexity of Modular Circuits
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, 2022 We study how the complexity of modular circuits computing AND depends on the depth of the circuits and the prime factorization of the modulus they use. In particular our construction of subexponential circuits of depth 2 for AND helps us to classify (modulo Exponential Time Hypothesis) modular circuits with respect to the complexity of their ...
Pawel M. Idziak +2 more
openaire +3 more sources
Renormalized Circuit Complexity [PDF]
Physical Review Letters, 2020 12 pages, 2 figures, v3: to appear in Physical Review ...
Arpan Bhattacharyya +2 more
openaire +3 more sources
Entropy, 2023 This work applies concepts from algorithmic probability to Boolean and quantum combinatorial logic circuits. The relations among the statistical, algorithmic, computational, and circuit complexities of states are reviewed.
Bao Gia Bach +3 more
doaj +1 more source
Learnability of the Boolean Innerproduct in Deep Neural Networks
Entropy, 2022 In this paper, we study the learnability of the Boolean inner product by a systematic simulation study. The family of the Boolean inner product function is known to be representable by neural networks of threshold neurons of depth 3 with only 2n+1 units (
Mehmet Erdal, Friedhelm Schwenker
doaj +1 more source
A Degree-Decreasing Lemma for (MOD_q-MOD_p) Circuits [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 Consider a (MOD_q,MOD_p) circuit, where the inputs of the bottom MOD_p gates are degree-d polynomials with integer coefficients of the input variables (p, q are different primes).
Vince Grolmusz
doaj +1 more source
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 In this paper, we examined the computational complexity of systems of monomials for some models that allow multiple use of intermediate results, such as composition circuits and multiplication circuits.
S.A. Korneev
doaj +1 more source
Bounds of non-monotone complexity for the multi-valued logic functions
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 The non-monotone complexity of realization of k-valued logic functions by circuits in a special basis was investigated. The basis consists of elements of two types: the first type comprises all monotone functions (with respect to the order 0 < 1 < 2
V.V. Kochergin, A.V. Mikhailovich
doaj +1 more source