English
Related papers

Related papers: Ecmas: Efficient Circuit Mapping and Scheduling fo…

200 papers

The NP-hard scheduling problem P||C_max encompasses a set of tasks with known execution time which must be mapped to a set of identical machines such that the overall completion time is minimized. In this work, we improve existing…

Data Structures and Algorithms · Computer Science 2024-10-22 Matthew Akram , Nikolai Maas , Peter Sanders , Dominik Schreiber

Quantum computers have the potential to solve certain complex problems in a much more efficient way than classical computers. Nevertheless, current quantum computer implementations are limited by high physical error rates. This issue is…

Quantum Physics · Physics 2026-04-29 Alessio Cicero , Luigi Altamura , Moritz Lange , Mats Granath , Pedro Trancoso

Realizing the full potential of quantum computation requires quantum error correction (QEC), with most recent breakthrough demonstrations of QEC using the surface code. QEC codes use multiple noisy physical qubits to encode information in…

In the classical problem of scheduling on unrelated parallel machines, a set of jobs has to be assigned to a set of machines. The jobs have a processing time depending on the machine and the goal is to minimize the makespan, that is the…

Data Structures and Algorithms · Computer Science 2017-12-07 Klaus Jansen , Marten Maack

Achieving practical quantum advantage on fault-tolerant quantum computers (FTQC) is fundamentally constrained by the substantial spatial and temporal overheads required to map logical operations onto physical hardware. Existing compilation…

Quantum Physics · Physics 2026-05-15 Dhanvi Bharadwaj , Siddharth Dangwal , Yuewen Hou , Gokul Subramanian Ravi

Progress in the realm of quantum technologies is paving the way for a multitude of potential applications across different sectors. However, the reduced number of available quantum computers, their technical limitations and the high demand…

Quantum computing has proven to be capable of accelerating many algorithms by performing tasks that classical computers cannot. Currently, Noisy Intermediate Scale Quantum (NISQ) machines struggle from scalability and noise issues to render…

Emerging Technologies · Computer Science 2023-09-20 Chao Lu , Navnil Choudhury , Utsav Banerjee , Abdullah Ash Saki , Kanad Basu

Quantum error correction (QEC) is essential for scalable quantum computing, yet repeated syndrome-measurement cycles dominate its spacetime and hardware cost. Although stabilizers commute and admit many valid execution orders, different…

Emerging Technologies · Computer Science 2026-02-06 Yuhao Liu , Shuohao Ping , Junyu Zhou , Ethan Decker , Justin Kalloor , Mathias Weiden , Kean Chen , Yunong Shi , Ali Javadi-Abhari , Costin Iancu , Gushu Li

Trapped ion (TI) qubits are a leading quantum computing platform. Current TI systems have less than 60 qubits, but a modular architecture known as the Quantum Charge-Coupled Device (QCCD) is a promising path to scale up devices. There is a…

Quantum Physics · Physics 2026-05-04 Scott Jones , Prakash Murali

Error rates in current noisy quantum hardware are not static; they vary over time and across qubits. This temporal and spatial variation challenges the effectiveness of fixed-distance quantum error correction (QEC) codes. In this paper, we…

Quantum Physics · Physics 2025-05-12 Subrata Das , Swaroop Ghosh

Control of quantum operations is a crucial yet expensive construct for quantum computation. Efficient implementations of controlled operations often avoid applying control to certain subcircuits, which can significantly reduce the number of…

Quantum Physics · Physics 2025-05-27 Peleg Emanuel , Eyal Cornfeld , Ravid Alon , Shmuel Ur , Israel Reichental

The performance of a quantum error-correction process is determined by the likelihood that a random configuration of errors introduced to the system will lead to the corruption of encoded logical information. In this work we compare two…

State-of-the-art quantum computers can only reliably execute circuits with limited qubit numbers and computational depth. This severely reduces the scope of algorithms that can be run. While numerous techniques have been invented to exploit…

Quantum Physics · Physics 2023-12-25 Adrián Pérez-Salinas , Radoica Draškić , Jordi Tura , Vedran Dunjko

Surface codes are among the best candidates to ensure the fault-tolerance of a quantum computer. In order to avoid the accumulation of errors during a computation, it is crucial to have at our disposal a fast decoding algorithm to quickly…

Quantum Physics · Physics 2020-07-15 Nicolas Delfosse , Gilles Zémor

Lattice surgery protocols allow for the efficient implementation of universal gate sets with two-dimensional topological codes where qubits are constrained to interact with one another locally. In this work, we first introduce a decoder…

Quantum Physics · Physics 2022-03-01 Christopher Chamberland , Earl T. Campbell

Given a program and a time deadline, does the program finish before the deadline when executed on a given platform? With the requirement to produce a test case when such a violation can occur, we refer to this problem as the worst-case…

Programming Languages · Computer Science 2015-06-22 Daniel Bundala , Sanjit A. Seshia

We study how well topological quantum codes can tolerate coherent noise caused by systematic unitary errors such as unwanted $Z$-rotations. Our main result is an efficient algorithm for simulating quantum error correction protocols based on…

Quantum Physics · Physics 2018-11-01 Sergey Bravyi , Matthias Englbrecht , Robert Koenig , Nolan Peard

The recent progress in the physical realization of quantum computers (the first publicly available ones--IBM's QX architectures--have been launched in 2017) has motivated research on automatic methods that aid users in running quantum…

Quantum Physics · Physics 2023-01-11 Robert Wille , Lukas Burgholzer , Alwin Zulehner

Real-time systems are intrinsic components of many pivotal applications, such as self-driving vehicles, aerospace and defense systems. The trend in these applications is to incorporate multiple tasks onto fewer, more powerful hardware…

Operating Systems · Computer Science 2024-10-03 V. Gabriel Moyano , Zain A. H. Hammadeh , Selma Saidi , Daniel Lüdtke

In this paper, we consider how to partition the parity-check matrices (PCMs) to reduce the hardware complexity and computation delay for the row layered decoding of quasi-cyclic low-density parity-check (QC-LDPC) codes. First, we formulate…

Information Theory · Computer Science 2022-08-30 Teng Lu , Xuan He , Peng Kang , Jiongyue Xing , Xiaohu Tang
‹ Prev 1 4 5 6 7 8 10 Next ›