Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Booting a quantum computer: A QUA-based graph framework for automatic qubit calibration, measurement, and execution of hybrid classical-quantum algorithms

Gal Winer, Spencer Tomarken, Ilan Mitnikov, Arthur Strauss, Steven H. Frankel, Jonathan L. DuBois, Lior Ella, Yonatan Cohen

Published Mar 17, 2021• 0 citations
OpenAlex

Related papers

Origin Pilot: a Quantum Operating System for Effecient Usage of Quantum Resources

Weicheng Kong, Junchao Wang, Yong‐Jian Han +5 more

The operating system is designed to manage the hardware and software resources of a computer. With the development of quantum computing, the management of quantum resources and cooperation between quantum systems and other computing resources (e.g. CPU, GPU and FPGA etc.) become the key challenge for the application of quantum computing to solve real world problems. In this paper we propose a quantum operating system, Origin Pilot. Origin Pilot includes the module of quantum task scheduling, quantum resource management, quantum program compilation and qubits' automatic calibration. With these modules, Origin Pilot can manage the quantum computing resources and solve the multi-quantum processor scheduling problem. It can also allow the parallel execution of multiple quantum programs and calibrate the quantum resource effectively. Thus, the performance of resources is guaranteed and the resource utilization is improved. By comparing the results with and without Origin Pilot, we evaluate the impact on a quantum circuit's fidelity of qubits mapping algorithm. We also evaluate the effectiveness of automatic calibration and parallel execution of multi-quantum processors. Finally, Origin Pilot can be easily customized for hybrid computing resources.

arXiv:2105.10730•May 22, 2021•6 citations

Software and Algorithms for Quantum Computing

Damian S. Steiger

•Jan 1, 2018•0 citations

An Effective Framework for Full-Stack Benchmarking of Quantum Computers

Michele Amoretti

•Apr 26, 2021•4 citations

Tierkreis: a Dataflow Framework for Hybrid Quantum-Classical Computing

Seyon Sivarajah, Lukas Heidemann, Alan J. Lawrence +1 more

We present Tierkreis, a higher-order dataflow graph program representation and runtime designed for compositional, quantum-classical hybrid algorithms. The design of the system is motivated by the remote nature of quantum computers, the need for hybrid algorithms to involve cloud and distributed computing, and the long-running nature of these algorithms. The graph-based representation reflects how designers reason about and visualise algorithms, and allows automatic parallelism and asynchronicity. A strong, static type system and higher-order semantics allow for high expressivity and compositionality in the program. The flexible runtime protocol enables third-party developers to add functionality using any language or environment. With Tierkreis, quantum software developers can easily build, visualise, verify, test, and debug complex hybrid workflows, and immediately deploy them to the cloud or a custom distributed environment.

arXiv:2211.02350•IEEE/ACM International Workshop on Quantum Computing Software (QCS)•Nov 1, 2022•12 citations

Understanding Quantum Computing: From Qubits to Quantum Algorithms

Vikash Kumar, Ankush Joshi, Gesu Thakur +2 more

Information systems engineering and management•Jan 1, 2025•1 citation

Hybrid quantum computation

Arun Sehrawat, Daniel Zemann, Berthold‐Georg Englert

We present a hybrid model of the unitary-evolution-based quantum computation model and the measurement-based quantum computation model. In the hybrid model, part of a quantum circuit is simulated by unitary evolution and the rest by measurements on star graph states, thereby combining the advantages of the two standard quantum computation models. In the hybrid model, a complicated unitary gate under simulation is decomposed in terms of a sequence of single-qubit operations, the controlled-z gates, and multiqubit rotations around the $z$ axis. Every single-qubit and the controlled-z gate are realized by a respective unitary evolution, and every multiqubit rotation is executed by a single measurement on a required star graph state. The classical information processing in our model requires only an information flow vector and propagation matrices. We provide the implementation of multicontrol gates in the hybrid model. They are very useful for implementing Grover's search algorithm, which is studied as an illustrative example.

arXiv:1008.1118•Physical Review A•Feb 22, 2011•11 citations
The operating system is designed to manage the hardware and software resources of a computer. With the development of quantum computing, the management of quantum resources and cooperation between quantum systems and other computing resources (e.g. CPU, GPU and FPGA etc.) become the key challenge for the application of quantum computing to solve real world problems. In this paper we propose a quantum operating system, Origin Pilot. Origin Pilot includes the module of quantum task scheduling, quantum resource management, quantum program compilation and qubits' automatic calibration. With these modules, Origin Pilot can manage the quantum computing resources and solve the multi-quantum processor scheduling problem. It can also allow the parallel execution of multiple quantum programs and calibrate the quantum resource effectively. Thus, the performance of resources is guaranteed and the resource utilization is improved. By comparing the results with and without Origin Pilot, we evaluate the impact on a quantum circuit's fidelity of qubits mapping algorithm. We also evaluate the effectiveness of automatic calibration and parallel execution of multi-quantum processors. Finally, Origin Pilot can be easily customized for hybrid computing resources.
We present Tierkreis, a higher-order dataflow graph program representation and runtime designed for compositional, quantum-classical hybrid algorithms. The design of the system is motivated by the remote nature of quantum computers, the need for hybrid algorithms to involve cloud and distributed computing, and the long-running nature of these algorithms. The graph-based representation reflects how designers reason about and visualise algorithms, and allows automatic parallelism and asynchronicity. A strong, static type system and higher-order semantics allow for high expressivity and compositionality in the program. The flexible runtime protocol enables third-party developers to add functionality using any language or environment. With Tierkreis, quantum software developers can easily build, visualise, verify, test, and debug complex hybrid workflows, and immediately deploy them to the cloud or a custom distributed environment.
We present a hybrid model of the unitary-evolution-based quantum computation model and the measurement-based quantum computation model. In the hybrid model, part of a quantum circuit is simulated by unitary evolution and the rest by measurements on star graph states, thereby combining the advantages of the two standard quantum computation models. In the hybrid model, a complicated unitary gate under simulation is decomposed in terms of a sequence of single-qubit operations, the controlled-z gates, and multiqubit rotations around the zzz axis. Every single-qubit and the controlled-z gate are realized by a respective unitary evolution, and every multiqubit rotation is executed by a single measurement on a required star graph state. The classical information processing in our model requires only an information flow vector and propagation matrices. We provide the implementation of multicontrol gates in the hybrid model. They are very useful for implementing Grover's search algorithm, which is studied as an illustrative example.