Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Switching energy-delay of all spin logic devices
A recent proposal called all spin logic (ASL) proposes to store information in nanomagnets that communicate with spin currents in order to construct spin based digital circuits. We present a coupled…
Low-power functionality enhanced computation architecture using spin-based devices
- C. Augustine, G. Panagopoulos, B. Behin-Aein, S. Srinivasan, A. Sarkar, K. Roy
- Engineering, Computer ScienceIEEE/ACM International Symposium on Nanoscale…
- 8 June 2011
This paper develops a Functionality Enhanced All Spin Logic (FEASL) architecture and a synthesis framework using Logically Passively Self Dual (LPSD) formulation and synthesized Discrete Cosine Transform (DCT) algorithm using adders and multipliers to show the efficacy of the proposed FEASL approach in designing digital signal processing (DSP) systems.
Dispersive photon blockade in a superconducting circuit.
This work differs from previous efforts in that the cavity-qubit excitations retain a photonic nature rather than a hybridization of qubit and photon and provides the needed tolerance to disorder for future condensed matter experiments.
Demonstration of quantum volume 64 on a superconducting quantum computing system
We improve the quality of quantum circuits on superconducting quantum computing systems, as measured by the quantum volume (QV), with a combination of dynamical decoupling, compiler optimizations,…
All-Spin Logic Device With Inbuilt Nonreciprocity
- S. Srinivasan, A. Sarkar, B. Behin-Aein, S. Datta
- Physics, Computer ScienceIEEE Transactions on Magnetics
- 14 June 2011
This paper uses an experimentally benchmarked coupled spin-transport/magnetization-dynamics model to show that a suitably engineered single ASL unit indeed switches in a nonreciprocal manner, and presents heuristic arguments explaining the origin of this directed information transfer.
Implementing a strand of a scalable fault-tolerant quantum computing fabric.
High-fidelity parity detection of two code qubits via measurement of a third syndrome qubit is demonstrated and a measurement tomography protocol is developed to fully characterize this parity readout.
A tail bound for read‐k families of functions
- Dmitry Gavinsky, Shachar Lovett, M. Saks, S. Srinivasan
- Mathematics, Computer ScienceRandom Struct. Algorithms
- 25 April 2012
It is proved that a Chernoff‐like large deviation bound is proved on the sum of non‐independent random variables that have the following dependence structure.
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits
- Ruiwen Chen, R. Santhanam, S. Srinivasan
- Computer Science, MathematicsComputational Complexity Conference
- 29 May 2016
The techniques include adaptive random restrictions, anti-concentration and the structural theory of linear threshold functions, and bounded-read Chernoff bounds, which give satisfiability algorithms beating brute force search for depth-d threshold circuits with a superlinear number of wires.
Demonstration of a quantum error detection code using a square lattice of four superconducting qubits
This work presents a quantum error detection protocol on a two-by-two planar lattice of superconducting qubits that detects an arbitrary quantum error on an encoded two-qubit entangled state via quantum non-demolition parity measurements on another pair of error syndrome qubits.
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas
- N. Kayal, N. Limaye, Chandan Saha, S. Srinivasan
- Computer ScienceIEEE 55th Annual Symposium on Foundations of…
- 18 October 2014
This work gives an explicit family of polynomials of degree d on N variables with 0, 1-coefficients such that for any representation of a polynomial f in this family of the form f = Σi,j, it must hold that 2Ω(√d·log N) ≥ 2.