Results 251 to 260 of about 93,203 (297)
On the Complexity of Quantum Circuit Compilation
Proceedings of the International Symposium on Combinatorial Search, 2021 Quantum circuit compilation (QCC) is an important problem in the emerging field of quantum computing. The problem has a strong relevance to combinatorial search, as solving approaches recently published include constraint programming and temporal planning.
Adi Botea +2 more
openaire +2 more sources
Primordial Gravitational Wave Circuit Complexity
Symmetry, 2023 In this article, we investigate the various physical implications of quantum circuit complexity using the squeezed state formalism of Primordial Gravitational Waves (PGW). Recently, quantum information-theoretic concepts, such as entanglement entropy and
Sayantan Choudhury, Choudhury Sayantan
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Circuit Complexity and Multiplicative Complexity of Boolean Functions
Lecture Notes in Computer Science, 2010In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 - c lower bound on the circuit complexity of a large class of functions representable by high degree polynomials over GF(2). The key idea of the proof is a circuit complexity measure assigning
Alexander S Kulikov, Kulikov Alexander S
exaly +2 more sources
Circuit complexity and (some of) its applications
International Journal of Modern Physics E, 2021 Motivated by recent interesting holographic results, several attempts have been made to study complexity (rather "Circuit Complexity") for quantum field theories using Nielsen's geometric method. Since then, it has found many interesting applications. We
Arpan Bhattacharyya
exaly +2 more sources