scholarly journals On Virtual Grey Box Obfuscation for General Circuits

Algorithmica ◽  
2016 ◽  
Vol 79 (4) ◽  
pp. 1014-1051 ◽  
Author(s):  
Nir Bitansky ◽  
Ran Canetti ◽  
Yael Tauman Kalai ◽  
Omer Paneth
Keyword(s):  
2021 ◽  
Vol 30 (6) ◽  
pp. 526-534
Author(s):  
Evelina Fedorenko ◽  
Cory Shain

Understanding language requires applying cognitive operations (e.g., memory retrieval, prediction, structure building) that are relevant across many cognitive domains to specialized knowledge structures (e.g., a particular language’s lexicon and syntax). Are these computations carried out by domain-general circuits or by circuits that store domain-specific representations? Recent work has characterized the roles in language comprehension of the language network, which is selective for high-level language processing, and the multiple-demand (MD) network, which has been implicated in executive functions and linked to fluid intelligence and thus is a prime candidate for implementing computations that support information processing across domains. The language network responds robustly to diverse aspects of comprehension, but the MD network shows no sensitivity to linguistic variables. We therefore argue that the MD network does not play a core role in language comprehension and that past findings suggesting the contrary are likely due to methodological artifacts. Although future studies may reveal some aspects of language comprehension that require the MD network, evidence to date suggests that those will not be related to core linguistic processes such as lexical access or composition. The finding that the circuits that store linguistic knowledge carry out computations on those representations aligns with general arguments against the separation of memory and computation in the mind and brain.


2003 ◽  
Vol 16 (2) ◽  
pp. 195-204
Author(s):  
Lyes Bouzerara ◽  
Mohand Belaroussi

A very high bandwidth class AB (Push-Pull) current amplifier using the compensation resistor technique is presented and analyzed. Such technique stands as a powerful method of bandwidth enhancement for general circuits using CMOS current mirrors. The proposed bandwidth is enhanced from 675 MHz for the uncompensated current amplifier to 745MHz for the compensated one without affecting the current gain and other design parameters such as power consumption and output swing. The circuit exhibits a current gain of 20 dB and consumes 1.48 mW for ?2.5V power supply voltage. All simulation results were performed using Hspice tool with 0.35^m CMOS TSMC parameters.


10.29007/rswk ◽  
2018 ◽  
Author(s):  
Cunxi Yu ◽  
Atif Yasin ◽  
Tiankai Su ◽  
Alan Mishchenko ◽  
Maciej Ciesielski

The paper describes a practical software tool for the verification of integer arithmetic circuits. It covers different types of integer multipliers, fused add-multiply circuits, and constant dividers - in general, circuits whose computation can be represented as a polynomial. The verification uses an algebraic model of the circuit and is accomplished by rewriting the polynomial of the binary encoding of the primary outputs (output signature), using the polynomial models of the logic gates, into a polynomial over the primary inputs (input signature). The resulting polynomial represents arithmetic function implemented by the circuit and hence can be used to extract functional specification from its gate-level implementation. The rewriting uses an efficient And-Inverter Graph (AIG) representation to enable extraction of the essential arithmetic components of the circuit. The tool is integrated with the popular ABC system. Its efficiency is illustrated with impressive results for integer multipliers, fused add-multiply circuits, and divide-by-constant circuits. The entire verification system is offered in an open source ABC environment together with an extensive set of benchmarks.


Author(s):  
James R. Seddon ◽  
Earl T. Campbell

The development of a framework for quantifying ‘non-stabilizerness’ of quantum operations is motivated by the magic state model of fault-tolerant quantum computation and by the need to estimate classical simulation cost for noisy intermediate-scale quantum (NISQ) devices. The robustness of magic was recently proposed as a well-behaved magic monotone for multi-qubit states and quantifies the simulation overhead of circuits composed of Clifford +  T gates, or circuits using other gates from the Clifford hierarchy. Here we present a general theory of the ‘non-stabilizerness’ of quantum operations rather than states, which are useful for classical simulation of more general circuits. We introduce two magic monotones, called channel robustness and magic capacity, which are well-defined for general n -qubit channels and treat all stabilizer-preserving CPTP maps as free operations. We present two complementary Monte Carlo-type classical simulation algorithms with sample complexity given by these quantities and provide examples of channels where the complexity of our algorithms is exponentially better than previously known simulators. We present additional techniques that ease the difficulty of calculating our monotones for special classes of channels.


2007 ◽  
Vol 05 (04) ◽  
pp. 627-640 ◽  
Author(s):  
M. GUPTA ◽  
A. PATHAK ◽  
R. SRIKANTH ◽  
K. PANIGRAHI

A question of theoretical and practical interest is how a quantum system may be measured indirectly by means of an ancilla that interacts with it, and furthermore, how a system of ancillas may be used to implement a coherent measurement of spatially separated qudits. We provide general circuits that can be used to implement such measurements. These circuits are relevant to quantum error correction, measurement-based quantum computation and Bell state discrimination across a quantum network involving multiple parties. The last mentioned problem is treated in detail. Our circuitry can also help to optimize the quantum communication complexity for performing measurements in distributed quantum computing.


2021 ◽  
Author(s):  
Alberto Hernández-Escobar ◽  
Elena Abdo-Sánchez ◽  
Jaime Esteban ◽  
Teresa María Martín-Guerrero ◽  
Carlos Camacho-Peñalosa

The use of an eigenstate based equivalent circuit topology is proposed for the analysis and modeling of lossless and lossy bi-periodic scatterers. It can significantly simplify the design of this kind of surfaces, since it reduces the number of elements with respect to other general circuits. It contains at most only two admittances and two transformers depending on one unique transformation ratio. The real parts of these admittances can be assured to be non-negative, an interesting aspect in the modeling of lossy surfaces such as those present in asorbers. Moreover, due to the capability of decomposition into the eigenexcitations of the structure, the circuit provides important physical insight. Different cases of scatterers have been analyzed: symmetric and asymmetric, lossy and lossless. In all these cases, the modeling of the circuit admittances has been successfully achieved with a few RLC elements, positive and frequency independent. In the case of structures with symmetries, the transformation ratio directly reflects the physical orientation of the eigenexcitations of the scatterer. Furthermore, in the case of lossy scatterers but without symmetries, the resulting equivalent circuit reveals that their eigenexcitations are not linear polarizations, but elliptic polarizations whose properties are described by the complex transformation ratio.


Sign in / Sign up

Export Citation Format

Share Document