English
Related papers

Related papers: VME Readout at and Below the Conversion Time Limit

200 papers

Near-term quantum computers are accessed through repeated circuit executions, which produce finite measurement records rather than exact deterministic outputs. In quantum reservoir computing, these records are converted to feature vectors…

Quantum Physics · Physics 2026-05-01 Markus Baumann , Maximilian Zorn , Thomas Gabor , Claudia Linnhoff-Popien , Jonas Stein

When processing large amounts of data, the rate at which reading and writing can take place is a critical factor. High energy physics data processing relying on ROOT is no exception. The recent parallelisation of LHC experiments' software…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-04-11 Guilherme Amadio , Brian Bockelman , Philippe Canal , Danilo Piparo , Enric Tejedor , Zhe Zhang

The duration and fidelity of qubit readout is a critical factor for applications in quantum information processing as it limits the fidelity of algorithms which reuse qubits after measurement or apply feedback based on the measurement…

The technologies of heterogeneous multi-core architectures, co-location, and virtualization can be used to reduce server power consumption and improve system utilization, which are three important technologies for data centers. This article…

Operating Systems · Computer Science 2023-10-24 Yecheng Yang , Pu Pang , Jiawen Wang , Quan Chen , Minyi Guo

Many virtual machines exist for sensor nodes with only a few KB RAM and tens to a few hundred KB flash memory. They pack an impressive set of features, but suffer from a slowdown of one to two orders of magnitude compared to optimised…

Programming Languages · Computer Science 2017-12-19 Niels Reijers , Chi-Sheng Shih

An important desired ingredient of superconducting quantum circuits is a readout scheme whose complexity does not increase with the number of qubits involved in the measurement. Here, we present a readout scheme employing a single microwave…

The process of measuring a qubit and re-initializing it to the ground state practically lead to long qubit idle times between re-runs of experiments on a superconducting quantum computer. Here, we propose a protocol for a \textit{demolition…

Quantum Physics · Physics 2025-04-01 Ashutosh Mishra , Frank K. Wilhelm , Shai Machnes

Near term quantum computers suffer from the presence of different noise sources. In order to mitigate for this effect and acquire results with significantly better accuracy, there is the urge of designing efficient error correction or error…

Improved mobile device battery lifetime and latency mini-mization are critical requirements for enhancing the mobile broadband services and user experience. Long-term evolution (LTE) networks have adopted discontinuous reception (DRX) as…

Information Theory · Computer Science 2020-01-06 Soheil Rostami , Kari Heiska , Oleksandr Puchko , Kari Leppanen , Mikko Valkama

In this paper, a novel time-based modulation scheme is proposed in the time-asynchronous channel for diffusion-based molecular communication systems with drift. Based on this modulation scheme, we demonstrate that the sample variance of…

Information Theory · Computer Science 2019-05-31 Qingchao Li

We consider the on-time transmissions of a sequence of packets over a fading channel.Different from traditional in-time communications, we investigate how many packets can be received $\delta$-on-time, meaning that the packet is received…

Information Theory · Computer Science 2022-02-18 Yan Li , Yunquan Dong , Byonghyo Shim

Stream processing is a compute paradigm that promises safe and efficient parallelism. Modern big-data problems are often well suited for stream processing's throughput-oriented nature. Realization of efficient stream processing requires…

Performance · Computer Science 2015-04-14 Jonathan C. Beard , Roger D. Chamberlain

The next-generation of cryogenic neutrinoless double-beta decay experiments require increasingly fast readout in order to improve background discrimination. These experiments, operated as cryogenic calorimeters at $\sim$10 mK, are usually…

Attentional sequence-to-sequence models have become the new standard for machine translation, but one challenge of such models is a significant increase in training and decoding cost compared to phrase-based systems. Here, we focus on…

Computation and Language · Computer Science 2017-05-08 Jacob Devlin

The Belle II experiment at the SuperKEKB collider at KEK, Tsukuba, Japan has successfully started taking data with the full detector in March 2019. Belle II is a luminosity frontier experiment of the new generation to search for physics…

Volunteer computing is being used successfully for large scale scientific computations. This research is in the context of Volpex, a programming framework that supports communicating parallel processes in a volunteer environment. Redundancy…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-03-14 Mohammad Tanvir Rahman , Hien Nguyen , Jaspal Subhlok , Gopal Pandurangan

Modern computing systems are embracing non-volatile memory (NVM) to implement high-capacity and low-cost main memory. Elevated operating voltages of NVM accelerate the aging of CMOS transistors in the peripheral circuitry of each memory…

Hardware Architecture · Computer Science 2020-12-02 Shihao Song , Anup Das , Onur Mutlu , Nagarajan Kandasamy

Recent advances in neuromorphic signal processing have introduced time encoding machines as a promising alternative to conventional uniform sampling for low-power communication receivers. In this paradigm, analog signals are converted into…

Signal Processing · Electrical Eng. & Systems 2026-02-25 Neil Irwin Bernardo

Spiking neural networks (SNNs) are the third generation of neural networks and can explore both rate and temporal coding for energy-efficient event-driven computation. However, the decision accuracy of existing SNN designs is contingent…

Neural and Evolutionary Computing · Computer Science 2020-02-25 Changqing Xu , Wenrui Zhang , Yu Liu , Peng Li

Maintaining a dynamic $k$-core decomposition is an important problem that identifies dense subgraphs in dynamically changing graphs. Recent work by Liu et al. [SPAA 2022] presents a parallel batch-dynamic algorithm for maintaining an…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-01-17 Quanquan C. Liu , Julian Shun , Igor Zablotchi