output
20102023
most citedLong short-term memory networks in memristor crossbars

400 citations

47 papers

cs.CV2023★ 33 cited

A Global Model Approach to Robust Few-Shot SAR Automatic Target Recognition

Nathan Inkawhich

In real-world scenarios, it may not always be possible to collect hundreds of labeled samples per class for training deep learning-based SAR Automatic Target Recognition (ATR) mode…

cs.CR2023★ 28 cited

Keystroke Dynamics: Concepts, Techniques, and Applications

Rashik Shadman, Ahmed Anu Wahab, Michael Manno +3

Reliably identifying and verifying subjects remains integral to computer system security. Various novel authentication techniques, such as biometric authentication systems, have be…

physics.optics2023★ 16 cited

Process Variation-Aware Compact Model of Strip Waveguides for Photonic Circuit Simulation

Aneek James, Anthony Rizzo, Yuyang Wang +6

We report a novel process variation-aware compact model of strip waveguides that is suitable for circuit-level simulation of waveguide-based process design kit (PDK) elements. The…

eess.SP2022★ 19 cited

Semantic Communication with Conceptual Spaces

Dylan Wheeler, Erin E. Tripp, Balasubramaniam Natarajan

Despite the fact that Shannon and Weaver's Mathematical Theory of Communication was published over 70 years ago, all communication systems continue to operate at the first of three…

physics.optics2022★ 30 cited

Fabrication-Robust Silicon Photonic Devices in Standard Sub-Micron Silicon-on-Insulator Processes

Anthony Rizzo, Utsav Dave, Asher Novick +5

Perturbations to the effective refractive index from nanometer-scale fabrication variations in waveguide geometry plague high index-contrast photonic platforms including the ubiqui…

quant-ph2021

Gaussian Amplitude Amplification for Quantum Pathfinding

Daniel Koch, Massimiliano Cutugno, Samuel Karlson +3

We study an oracle operation, along with its circuit design, which combined with the Grover diffusion operator boosts the probability of finding minimum or maximum solutions on a w…

nlin.AO2021★ 3 cited

The Essential Synchronization Backbone Problem

C. Tyler Diggans, Jeremie Fish, Abd AlRahman R. AlMomani +1

Network optimization strategies for the process of synchronization have generally focused on the re-wiring or re-weighting of links in order to: (1) expand the range of coupling st…

cs.LG2021

Generalized Adversarial Distances to Efficiently Discover Classifier Errors

Walter Bennette, Sally Dufek, Karsten Maurer +2

Given a black-box classification model and an unlabeled evaluation dataset from some application domain, efficient strategies need to be developed to evaluate the model. Random sam…

quant-ph2020★ 6 cited

Information Geometric Aspects of Probability Paths with Minimum Entropy Production for Quantum State Evolution

Steven Gassner, Carlo Cafaro, Sean A. Ali +1

We present an information geometric analysis of both entropic speeds and entropy production rates arising from geodesic evolution on manifolds parametrized by pure quantum states.…

quant-ph2020★ 19 cited

Quantifying Tri-partite Entanglement with Entropic Correlations

James Schneeloch, Christopher C. Tison, Michael L. Fanto +2

We show how to quantify tri-partite entanglement using entropies derived from experimental correlations. We use a multi-partite generalization of the entanglement of formation that…

quant-ph2020★ 5 cited

Vector Properties of Entanglement in a Three-Qubit System

Dmitry B. Uskov, Paul M. Alsing

We suggest a dynamical vector model of entanglement in a three qubit system based on isomorphism between and Lie algebras. Generalizing Plücker-type description of…

quant-ph2020★ 23 cited

Demonstrating NISQ Era Challenges in Algorithm Design on IBM's 20 Qubit Quantum Computer

Daniel Koch, Brett Martin, Saahil Patel +2

As superconducting qubits continue to advance technologically, the realization of quantum algorithms from theoretical abstraction to physical implementation requires knowledge of b…

physics.soc-ph2020★ 13 cited

Stochastic and mixed flower graphs

C. Tyler Diggans, Erik M. Bollt, Daniel ben-Avraham

Stochasticity is introduced to a well studied class of recursively grown graphs: -flower nets, which have power-law degree distributions as well as small-world properties (w…

quant-ph2019★ 7 cited

Phase effects in coherently-stimulated down-conversion with a quantized pump field

Richard J. Birrittella, Paul M. Alsing, Christopher C. Gerry

We investigate the effect of the cumulative phase on the photon statistics of the three-mode state whose evolution is described by the trilinear Hamiltonian $\hat{H}_{I}=i\hbarκ\bi…

quant-ph2019★ 1 cited

A tripartite entanglement in de Sitter spacetime

Sang-Eon Bak, Paul M. Alsing, Warner A. Miller +2

We investigate the quantum correlation for tripartite entangled states in de Sitter space. First, we adopt the noisy quantum channel model. In this model, the expansion effect is r…

quant-ph2019★ 17 cited

A scalable Controlled NOT gate for linear optical computing using microring resonators

Ryan E. Scott, Paul M. Alsing, A. Matthew Smith +5

We propose a scalable version of a KLM CNOT gate based upon integrated waveguide microring resonators (MRR), vs the original KLM-approach using beam splitters (BS). The core elemen…

quant-ph2019★ 10 cited

Theoretical analysis of a nearly optimal analog quantum search

Carlo Cafaro, Paul M. Alsing

We analyze the possibility of modifying the original Farhi-Gutmann Hamiltonian algorithm in order to speed up the procedure for producing a suitably distributed unknown normalized…

quant-ph2019★ 2 cited

Quantum Reactivity: A Measure of Quantum Correlation

Shahabeddin Mostafanazhad Aslmarand, Warner A. Miller, Paul M. Alsing +1

Defining a robust measure of quantum correlation for multipartite states is an unresolved and challenging problem. Existing measures of quantum correlation are either not scalable…

cs.DC2018★ 2 cited

Compressed Distributed Gradient Descent: Communication-Efficient Consensus over Networks

Xin Zhang, Jia Liu, Zhengyuan Zhu +1

Network consensus optimization has received increasing attention in recent years and has found important applications in many scientific and engineering fields. To solve network co…

quant-ph2018★ 4 cited

Scattering Quantum Random Walks on Square Grids and Randomly Generated Mazes

Daniel Koch

The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at loc…

quant-ph2018★ 90 cited

Introduction to the Absolute Brightness and Number Statistics in Spontaneous Parametric Down-Conversion

James Schneeloch, Samuel H. Knarr, Daniela F. Bogorin +6

As a tutorial, we examine the absolute brightness and number statistics of photon pairs generated in Spontaneous Parametric Down-Conversion (SPDC) from first principles. In doing s…

math.NA2018

Sparse tensor recovery via N-mode FISTA with support augmentation

Ashley Prater-Bennette, Lixin Shen

A common approach for performing sparse tensor recovery is to use an N-mode FISTA method. However, this approach may fail in some cases by missing some values in the true support o…

cs.ET2018★ 400 cited

Long short-term memory networks in memristor crossbars

Can Li, Zhongrui Wang, Mingyi Rao +14

Recent breakthroughs in recurrent deep neural networks with long short-term memory (LSTM) units has led to major advances in artificial intelligence. State-of-the-art LSTM models w…

quant-ph2018★ 19 cited

Decrease of Fisher information and the information geometry of evolution equations for quantum mechanical probability amplitudes

Carlo Cafaro, Paul M. Alsing

The relevance of the concept of Fisher information is increasing in both statistical physics and quantum computing. From a statistical mechanical standpoint, the application of Fis…