Results 21 to 30 of about 93,203 (297)
Boolean Circuit Complexity of Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC-complexity, as an alternative to the state complexity.
Maris Valdats
doaj +1 more source
Complexity of Linear Circuits and Geometry [PDF]
Foundations of Computational Mathematics, 2015 We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border) rigidity, (ii) compute degrees of varieties associated to rigidity, (iii) describe algebraic varieties associated to ...
Fulvio Gesmundo +3 more
openaire +4 more sources
On the complexity of hazard-free circuits [PDF]
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018 The problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows the existence of functions whose circuit complexity is polynomially bounded while every hazard-free implementation is provably of exponential size. Previous lower bounds on the
Christian Ikenmeyer +5 more
openaire +7 more sources
Variational quantum eigensolver with reduced circuit complexity
npj Quantum Information, 2022 The variational quantum eigensolver (VQE) is one of the most promising algorithms to find eigenstates of a given Hamiltonian on noisy intermediate-scale quantum devices (NISQ).
Yu Zhang +8 more
doaj +1 more source
Circuit complexity and entanglement in many-body quantum systems [PDF]
, 2021 Entanglement and circuit complexity are fundamental concepts in quantum information theory which turned out to have considerable applications in various contexts ranging from many-body systems and condensed matter theory to quantum gravity and black hole
Di Giulio, Giuseppe
core
Design of Low Power Full-Adder Circuit using Quantum-dot Cellular Automata [PDF]
International Journal of Industrial Electronics, Control and Optimization, 2022 Quantum-dot Cellular Automata (QCA) is a new technology for eliminating some of the problems of existing technologies such as CMOS. Some of the key advantages of QCA are an intersection of wires in the same plane, high speed, small area, power ...
Faezeh Motalebi, Samira Sayedsalehi
doaj +1 more source
Circuit complexity in Proca theory [PDF]
Physical Review D, 2021 19 pages, 1 ...
Kun Meng +4 more
openaire +2 more sources
, 2022 A gain-enhanced low hardware complexity charge-domain read-out integrated circuit is implemented. By adopting a sampled charge redistribution technique, low hardware complexity is achieved, which in turn saves 10% of the die area and provides 33% gain ...
Sung-Hun Jo
core +1 more source
Designing quantum-dot cellular automata circuits using a robust one layer crossover scheme
The Journal of Engineering, 2014 Quantum-dot cellular automata (QCA) is a novel nanotechnology which is considered as a solution to the scaling problems in complementary metal oxide semiconductor technology. In this Letter, a robust one layer crossover scheme is introduced. It uses only
Sara Hashemi, Keivan Navi
doaj +1 more source
On the statistical complexity of quantum circuits
CoRR, 2021 6+19 ...
Kaifeng Bu +4 more
openaire +2 more sources