Výsledky vyhľadávania - Theory of computation → Circuit complexity

Circuit Complexity in Z2 EEFT Autor 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…”
Získať plný text

Circuit Complexity in \(\mathcal{Z}_{2}\) \({\cal EEFT}\) Autor 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…”
Získať plný text

Programmable Synapses and Dendritic Circuits for Superconducting Optoelectronic Neuromorphic Computing Autor 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…”
Získať plný text

Quantum Computation as Gravity Autor 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…”
Získať plný text

On the complexity and verification of quantum random circuit sampling Autor 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…”
Získať plný text

Circuit Complexity in Interacting Quenched Quantum Field Theory Autor 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…”
Získať plný text

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

“…Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families…”
Získať plný text

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

Získať plný text

Circuit complexity and functionality: A statistical thermodynamics perspective Autor 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…”
Zistit podrobnosti o prístupe

Circuit Complexity in IZ/I[sub.2] EEFT Autor 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…”
Získať plný text

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

“…Quantum computation is a promising emerging technology which, compared to conventional computation, allows for substantial speed-ups, e.g…”
Získať plný text

Quantum advantage with shallow circuits Autor 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…”
Zistit podrobnosti o prístupe

Unconditional quantum magic advantage in shallow circuit computation Autor 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…”
Získať plný text

Unconditionally Secure Computation Against Low-Complexity Leakage Autor 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…”
Získať plný text

Computation in generalised probabilisitic theories Autor 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…”
Získať plný text

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

“… The increasing interest in FHE-based secure computation underscores the need to accelerate homomorphic computations…”
Získať plný text

Covert Computation in Self-Assembled Circuits Autor 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…”
Získať plný text

Particle computation: complexity, algorithms, and logic Autor 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…”
Získať plný text

Decompositions of n-qubit Toffoli Gates with Linear Circuit Complexity Autor 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…”
Získať plný text

Toward Finding S-Box Circuits With Optimal Multiplicative Complexity Autor 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…”
Získať plný text