Search Results - Theory of computation → Circuit complexity

Circuit Complexity in Z2 EEFT by Adhikari, Kiran, Choudhury, Sayantan, Kumar, Sourabh, Mandal, Saptarshi, Pandey, Nilesh, Roy, Abhishek, Sarkar, Soumya, Sarker, Partha, Shariff, Saadat Salman

“…Motivated by recent studies of circuit complexity in weakly interacting scalar field theory, we explore the computation of circuit complexity in Z2 Even Effective Field Theories (Z2 EEFTs…”
Get full text

Circuit Complexity in \(\mathcal{Z}_{2}\) \({\cal EEFT}\) by Adhikari, Kiran, Choudhury, Sayantan, Kumar, Sourabh, Mandal, Saptarshi, Pandey, Nilesh, Roy, Abhishek, Sarkar, Soumya, Sarker, Partha, Shariff, Saadat Salman

“…Motivated by recent studies of circuit complexity in weakly interacting scalar field theory, we explore the computation of circuit complexity in \(\mathcal{Z}_2…”
Get full text

Programmable Synapses and Dendritic Circuits for Superconducting Optoelectronic Neuromorphic Computing by Primavera, Bryce A., Khan, Saeed, Adler, Samuel R., Shainline, Jeffrey M.

“… In this work, analog circuits combining Josephson junctions and superconducting single-photon detectors are fabricated and shown to exhibit a variety of neuromorphic functions…”
Get full text

Quantum Computation as Gravity by Caputa, Paweł, Magan, Javier M.

“…We formulate Nielsen's geometric approach to circuit complexity in the context of two-dimensional conformal field theories, where series of conformal transformations are interpreted as "unitary…”
Get full text

On the complexity and verification of quantum random circuit sampling by Bouland, Adam, Fefferman, Bill, Nirkhe, Chinmay, Vazirani, Umesh

“…A critical milestone on the path to useful quantum computers is the demonstration of a quantum computation that is prohibitively hard for classical computers…”
Get full text

Circuit Complexity in Interacting Quenched Quantum Field Theory by Choudhury, Sayantan, Gharat, Rakshit Mandish, Mandal, Saptarshi, Pandey, Nilesh

“… Using a particular cost functional, we show the analytical computation of circuit complexity for the quenched and interacting field theory…”
Get full text

Characterizing Valiant's algebraic complexity classes by Malod, Guillaume, Portier, Natacha

“…Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families…”
Get full text

Wasserstein complexity of quantum circuits by Li, Lu, Bu, Kaifeng, Enshan Koh, Dax, Jaffe, Arthur, Lloyd, Seth

Get full text

Circuit complexity and functionality: A statistical thermodynamics perspective by Chamon, Claudio, Ruckenstein, Andrei E, Mucciolo, Eduardo R, Canetti, Ran

“…Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science…”
Get more information

Circuit Complexity in IZ/I[sub.2] EEFT by Adhikari, Kiran, Choudhury, Sayantan, Kumar, Sourabh, Mandal, Saptarshi, Pandey, Nilesh, Roy, Abhishek, Sarkar, Soumya, Sarker, Partha, Shariff, Saadat Salman

“…Motivated by recent studies of circuit complexity in weakly interacting scalar field theory, we explore the computation of circuit complexity in Z[sub.2…”
Get full text

Advanced Simulation of Quantum Computations by Zulehner, Alwin, Wille, Robert

“…Quantum computation is a promising emerging technology which, compared to conventional computation, allows for substantial speed-ups, e.g…”
Get full text

Quantum advantage with shallow circuits by Bravyi, Sergey, Gosset, David, König, Robert

“…Quantum effects can enhance information-processing capabilities and speed up the solution of certain computational problems. Whether a quantum advantage can be…”
Get more information

Unconditional quantum magic advantage in shallow circuit computation by Zhang, Xingjian, Pan, Zhaokai, Liu, Guoding

“…Quantum theory promises computational speed-ups over classical approaches. The celebrated Gottesman-Knill Theorem implies that the full power of quantum computation resides in the specific resource of “magic” states…”
Get full text

Unconditionally Secure Computation Against Low-Complexity Leakage by Bogdanov, Andrej, Ishai, Yuval, Srinivasan, Akshayaram

“… By global, we mean that the leakage can depend on all circuit wires and output a low-complexity function…”
Get full text

Computation in generalised probabilisitic theories by Lee, Ciarán M, Barrett, Jonathan

“… To this end, we define a circuit-based model of computation in a class of operationally-defined theories more general than quantum theory, and ask…”
Get full text

Faster Homomorphic Operations and Beyond: Expediting Homomorphic Computation via Boolean Circuit Optimization by Yu, Mingfei, De Micheli, Giovanni

“… The increasing interest in FHE-based secure computation underscores the need to accelerate homomorphic computations…”
Get full text

Covert Computation in Self-Assembled Circuits by Cantu, Angel A., Luchsinger, Austin, Schweller, Robert, Wylie, Tim

“…Traditionally, computation within self-assembly models is hard to conceal because the self-assembly process generates a crystalline assembly whose computational history is inherently part of the structure itself…”
Get full text

Particle computation: complexity, algorithms, and logic by Becker, Aaron T., Demaine, Erik D., Fekete, Sándor P., Lonsford, Jarrett, Morris-Wright, Rose

“…We investigate algorithmic control of a large swarm of mobile particles (such as robots, sensors, or building material) that move in a 2D workspace using a…”
Get full text

Decompositions of n-qubit Toffoli Gates with Linear Circuit Complexity by He, Yong, Luo, Ming-Xing, Zhang, E., Wang, Hong-Ke, Wang, Xiao-Feng

“…Toffoli gates are natural elements for the circuit model based quantum computation…”
Get full text

Toward Finding S-Box Circuits With Optimal Multiplicative Complexity by Jeon, Yongjin, Baek, Seungjun, Kim, Jongsung

“…In this paper, we present a new method to find S-box circuits with optimal multiplicative complexity (MC), i.e…”
Get full text