English
Related papers

Related papers: DYNAMO: Dynamic Neutral Atom Multi-programming Opt…

200 papers

Quantum simulation represents the most promising quantum application to demonstrate quantum advantage on near-term noisy intermediate-scale quantum (NISQ) computers, yet available quantum simulation algorithms are prone to errors and thus…

Quantum Physics · Physics 2024-10-01 Shin Sun , Li-Chai Shih , Yuan-Chung Cheng

Compilation and optimization of quantum circuits are critical components in the execution of algorithms on quantum computers. These components must successfully balance two competing priorities: minimizing the number of expensive resources,…

Round Robin, considered as the most widely adopted CPU scheduling algorithm, undergoes severe problems directly related to quantum size. If time quantum chosen is too large, the response time of the processes is considered too high. On the…

Operating Systems · Computer Science 2011-11-24 Abbas Noon , Ali Kalakech , Seifedine Kadry

Current quantum computers suffer from noise that stems from interactions between the quantum system that constitutes the quantum device and its environment. These interactions can be suppressed through dynamical decoupling to reduce…

Quantum Physics · Physics 2024-12-06 Arefur Rahman , Daniel J. Egger , Christian Arenz

Major players in the global aerospace industry are shifting their focus toward achieving net carbon-neutral operations by 2050. A considerable portion of the overall carbon emission reduction is expected to come from new aircraft…

Currently available quantum computers are prone to errors. Circuit optimization and error mitigation methods are needed to design quantum circuits to achieve better fidelity when executed on NISQ hardware. Dynamical decoupling (DD) is…

Quantum Physics · Physics 2022-09-05 Siyuan Niu , Aida Todri-Sanial

The simulation of many industrially relevant physical processes can be executed up to exponentially faster using quantum algorithms. However, this speedup can only be leveraged if the data input and output of the simulation can be…

Dynamically field-programmable qubit arrays based on neutral atoms feature high fidelity and highly parallel gates for quantum computing. However, it is challenging for compilers to fully leverage the novel flexibility offered by such…

Emerging Technologies · Computer Science 2024-11-05 Daniel Bochen Tan , Wan-Hsuan Lin , Jason Cong

As quantum computing progresses, the need for scalable solutions to address large-scale computational problems has become critical. Quantum supercomputers are the next upcoming frontier by enabling multiple quantum processors to collaborate…

Quantum Physics · Physics 2025-11-20 Peiyi Li , Chenxu Liu , Ji Liu , Huiyang Zhou , Ang Li

Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during…

Quantum Physics · Physics 2024-07-03 Daniel Bochen Tan , Dolev Bluvstein , Mikhail D. Lukin , Jason Cong

With the advantages of high-speed parallel processing, quantum computers can efficiently solve large-scale complex optimization problems in future networks. However, due to the uncertain qubit fidelity and quantum channel noise, distributed…

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

Neutral atoms are a promising choice for scalable quantum computing architectures. Features such as long distance interactions and native multiqubit gates offer reductions in communication costs and operation count. However, the trapped…

Quantum Physics · Physics 2022-11-30 Andrew Litteken , Jonathan M. Baker , Frederic T. Chong

Dynamical decoupling (DD) is a promising technique for mitigating errors in near-term quantum devices. However, its effectiveness depends on both hardware characteristics and algorithm implementation details. This paper explores the…

Quantum Physics · Physics 2024-08-20 Yanjun Ji , Ilia Polian

In this paper, an operating system scheduling algorithm based on Double DQN (Double Deep Q network) is proposed, and its performance under different task types and system loads is verified by experiments. Compared with the traditional…

Machine Learning · Computer Science 2025-04-01 Xiaoxuan Sun , Yifei Duan , Yingnan Deng , Fan Guo , Guohui Cai , Yuting Peng

Quantum computers process information with the laws of quantum mechanics. Current quantum hardware is noisy, can only store information for a short time, and is limited to a few quantum bits, i.e., qubits, typically arranged in a planar…

We present a composable design scheme for the development of hybrid quantum/classical algorithms and workflows for applications of quantum simulation. Our object-oriented approach is based on constructing an expressive set of common data…

In this paper, we present a quantum algorithm for the dynamic programming approach for problems on directed acyclic graphs (DAGs). The running time of the algorithm is $O(\sqrt{\hat{n}m}\log \hat{n})$, and the running time of the best known…

Quantum Physics · Physics 2023-01-02 Kamil Khadiev , Liliya Safina

The demand for executing Deep Neural Networks (DNNs) with low latency and minimal power consumption at the edge has led to the development of advanced heterogeneous Systems-on-Chips (SoCs) that incorporate multiple specialized computing…

Machine Learning · Computer Science 2025-02-24 Matteo Risso , Alessio Burrello , Daniele Jahier Pagliari

Neutral-atom arrays are a leading platform for quantum technologies, offering a promising route toward large-scale, fault-tolerant quantum computing. We propose a novel quantum processing architecture based on dual-type, dual-element atom…

Atomic Physics · Physics 2025-03-24 Zhanchuan Zhang , Jeth Arunseangroj , Wenchao Xu

In this paper, we present a quantum algorithm for dynamic programming approach for problems on directed acyclic graphs (DAGs). The running time of the algorithm is $O(\sqrt{\hat{n}m}\log \hat{n})$, and the running time of the best known…

Data Structures and Algorithms · Computer Science 2019-06-21 Kamil Khadiev , Liliya Safina