English
Related papers

Related papers: SDC-based Resource Constrained Scheduling for Quan…

200 papers

Progress in quantum computing hardware raises questions about how these devices can be controlled, programmed, and integrated with existing computational workflows. We briefly describe several prominent quantum computational models, their…

Emerging Technologies · Computer Science 2017-07-20 Keith A. Britt , Travis S. Humble

Real-time end-to-end task scheduling in networked control systems (NCSs) requires the joint consideration of both network and computing resources to guarantee the desired quality of service (QoS). This paper introduces a new model for…

Networking and Internet Architecture · Computer Science 2022-10-21 Peng Wu , Chenchen Fu , Tianyu Wang , Minming Li , Yingchao Zhao , Chun Jason Xue , Song Han

Quantum circuits utilizing real time feedback techniques (such as active reset and mid-circuit measurement) are a powerful tool for NISQ-era quantum computing. Such techniques are crucial for implementing error correction protocols, and can…

Recently, the makespan-minimization problem of compiling a general class of quantum algorithms into near-term quantum processors has been introduced to the AI community. The research demonstrated that temporal planning is a strong approach…

The successful implementation of algorithms on quantum processors relies on the accurate control of quantum bits (qubits) to perform logic gate operations. In this era of noisy intermediate-scale quantum (NISQ) computing, systematic…

Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources, such as quantum computers, to perform resource-intensive tasks. Like traditional cloud computing platforms, QCC providers can…

Quantum Physics · Physics 2023-07-26 Rakpong Kaewpuang , Minrui Xu , Dinh Thai Hoang , Dusit Niyato , Han Yu , Ruidong Li , Zehui Xiong , Jiawen Kang

We present two related anytime algorithms for control of nonlinear systems when the processing resources available are time-varying. The basic idea is to calculate tentative control input sequences for as many time steps into the future as…

Optimization and Control · Mathematics 2013-08-09 Daniel E. Quevedo , Vijay Gupta

The problem of scheduling in quantum networks amounts to choosing which entanglement swapping operations to perform to better serve user demand. The choice can be carried out following a variety of criteria (e.g. ensuring all users are…

Quantum Physics · Physics 2025-10-08 Paolo Fittipaldi

With the advent of interconnected quantum computers, i.e., distributed quantum computing (DQC), multiple quantum computers can now collaborate via quantum networks to perform massively complex computational tasks. However, DQC faces…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-07 Napat Ngoenriang , Minrui Xu , Sucha Supittayapornpong , Dusit Niyato , Han Yu , Xuemin , Shen

Circuit cutting allows quantum circuits larger than the available hardware to be executed. Cutting techniques split circuits into smaller subcircuits, run them on the hardware, and recombine results through classical post-processing.…

Quantum Physics · Physics 2024-11-28 Songqinghao Yang , Prakash Murali

Constraint programming is used for a variety of real-world optimisation problems, such as planning, scheduling and resource allocation problems. At the same time, one continuously gathers vast amounts of data about these problems. Current…

Quantum computers represent a radical technological advancement in the way information is processed by using the principles of quantum mechanics to solve very complex problems that exceed the capabilities of classical systems. However, in…

Quantum Physics · Physics 2025-08-28 Marcos Guillermo Lammers , Federico Hernán Holik , Alejandro Fernández

We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors. Moreover, we provide a tight analysis of the algorithm's competitiveness. Our results generalize and improve upon work by…

Data Structures and Algorithms · Computer Science 2012-09-19 Peter Kling , Peter Pietrzyk

As quantum computers continue to improve and support larger, more complex computations, smart control hardware and compilers are needed to efficiently leverage the capabilities of these systems. This paper introduces a novel approach to…

Quantum Physics · Physics 2025-11-19 Folkert de Ronde , Alexander Knapen , Stephan Wong , Sebastian Feld

Robust control design for quantum unitary transformations has been recognized as a fundamental and challenging task in the development of quantum information processing due to unavoidable decoherence or operational errors in the…

Quantum Physics · Physics 2018-06-07 Chengzhi Wu , Bo Qi , Chunlin Chen , Daoyi Dong

We introduce an algorithm called SQDP (Stochastic Quadratic Dynamic Programming) to solve some multistage stochastic optimization problems having strongly convex recourse functions. The algorithm extends the classical Stochastic Dual…

Optimization and Control · Mathematics 2026-05-21 Vincent Guigues , Adriana Washington

Radio Resource Management is a challenging topic in future 6G networks where novel applications create strong competition among the users for the available resources. In this work we consider the frequency scheduling problem in a multi-user…

Networking and Internet Architecture · Computer Science 2024-12-18 Anastasios Giovanidis , Mathieu Leconte , Sabrine Aroua , Tor Kvernvik , David Sandberg

Despite rapid evolution, embedded computing systems increasingly feature resource constraints and workload uncertainties. To achieve much better system performance in unpredictable environments than traditional design approaches, a novel…

Other Computer Science · Computer Science 2008-12-18 Feng Xia , Youxian Sun

Manipulating quantum computing hardware in the presence of imperfect devices and control systems is a central challenge in realizing useful quantum computers. Susceptibility to noise limits the performance and capabilities of noisy…

In the Scheduling Machines with Capacity Constraints problem, we are given k identical machines, each of which can process at most m_i jobs. M jobs are also given, where job j has a non-negative processing time length t_j >= 0. The task is…

Data Structures and Algorithms · Computer Science 2009-06-18 Chi Zhang , Gang Wang , Xiaoguang Liu , Jing Liu
‹ Prev 1 4 5 6 7 8 10 Next ›