output
20212026
most citedThe Boundary for Quantum Advantage in Gaussian Boson Sampling

92 citations

Showing 2025Show all

9 papers · 1 filter

cs.PF2025★ 1 cited

EDAN: Towards Understanding Memory Parallelism and Latency Sensitivity in HPC

Siyuan Shen, Mikhail Khalilov, Lukas Gianinazzi +6

Resource disaggregation is a promising technique for improving the efficiency of large-scale computing systems. However, this comes at the cost of increased memory access latency d…

physics.optics2025

Resonate-and-Fire Photonic-Electronic Spiking Neurons for Fast and Efficient Light-Enabled Neuromorphic Processing Systems

Andrew Adair, Dafydd Owen-Newns, Giovanni Donati +7

Neuromorphic computing seeks to replicate the spiking dynamics of biological neurons for brain-inspired computation. While electronic implementations of artificial spiking neurons…

cs.DC2025★ 4 cited

Testing and benchmarking emerging supercomputers via the MFC flow solver

Benjamin Wilfong, Anand Radhakrishnan, Henry A. Le Berre +3

Deploying new supercomputers requires testing and evaluation via application codes. Portable, user-friendly tools enable evaluation, and the Multicomponent Flow Code (MFC), a compu…

quant-ph2025

Integration of quantum random number generators with post-quantum cryptography algorithms

Paula Alonso Blanco, Luis Trigo Vidarte, Marc Romeu Casas +4

As quantum technologies advance, the security of popular cryptographic protocols becomes more threatened by the capabilities of Cryptographically Relevant Quantum Computers (CRQCs)…

physics.comp-ph2025

Simulating many-engine spacecraft: Exceeding 1 quadrillion degrees of freedom via information geometric regularization

Benjamin Wilfong, Anand Radhakrishnan, Henry Le Berre +9

We present an optimized implementation of the recently proposed information geometric regularization (IGR) for unprecedented scale simulation of compressible fluid flows applied to…

cs.ET2025

Accelerating Hybrid XORCNF Boolean Satisfiability Problems Natively with In-Memory Computing

Haesol Im, Fabian Böhm, Giacomo Pedretti +14

The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit desig…

quant-ph2025★ 4 cited

Hardware-level Interfaces for Hybrid Quantum-Classical Computing Systems

Konstantinos Rallis, Ioannis Liliopoulos, Evangelos Tsipas +5

The technology of Quantum Computing (QC) is continuously evolving, as researchers explore new technologies and the public gains access to quantum computers with an increasing numbe…

math.OC2025

Hardware-Compatible Single-Shot Feasible-Space Heuristics for Solving the Quadratic Assignment Problem

Haesol Im, Chan-Woo Yang, Moslem Noori +10

Research into the development of special-purpose computing architectures designed to solve quadratic unconstrained binary optimization (QUBO) problems has flourished in recent year…

cs.LG2025★ 2 cited

Reinforcement Learning Platform for Adversarial Black-box Attacks with Custom Distortion Filters

Soumyendu Sarkar, Ashwin Ramesh Babu, Sajad Mousavi +5

We present a Reinforcement Learning Platform for Adversarial Black-box untargeted and targeted attacks, RLAB, that allows users to select from various distortion filters to create…