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

arXiv:0802.2367

QuanFou, QuanGlue, QuanOracle and QuanShi, Four Special Purpose Quantum Compilers

Robert R. Tucci

Published Feb 17, 2008• 4 citations
arXivHTMLPDF

Abstract

This paper introduces QuanFou v1.1, QuanGlue v1.1, QuanOracle v1.1, QuanShi v1.1, four Java applications available for free. (Source code included in the distribution.) Each application compiles a different kind of input quantum evolution operator. The applications output a quantum circuit that equals the input evolution operator.
DOI
10.48550/arxiv.0802.2367

Related papers

QuanTree and QuanLin, Two Special Purpose Quantum Compilers

Robert R. Tucci

This paper introduces QuanTree v1.1 and QuanLin v1.1, two Java applications available for free. (Source code included in the distribution.) Each application compiles a different type of input quantum evolution operator. The applications output a quantum circuit that is approximately equal to the input evolution operator. QuanTree compiles an input evolution operator whose Hamiltonian is proportional to the incidence matrix of a balanced, binary tree graph. QuanLin compiles an input evolution operator whose Hamiltonian is proportional to the incidence matrix of a line (open string) graph. Both applications also output an error, defined as the distance in the Frobenius norm between the input evolution operator and the output quantum circuit.

arXiv:0712.3887•Dec 23, 2007•4 citations

QOperAv, a Code Generator for Generating Quantum Circuits for Evaluating Certain Quantum Operator Averages

Robert R. Tucci

This paper introduces QOperAv v1.5, a Java application available for free. (Source code included in the distribution.) QOperAv is a "code generator" for generating quantum circuits. The quantum circuits generated by QOperAv can be used to evaluate with polynomial efficiency the average of $f(A)$ for some simple (that is, computable with polynomial efficiency) function $f$ and a Hermitian operator $A$, provided that we know how to compile $\exp(iA)$ with polynomial efficiency. QOperAv implements an algorithm described in earlier papers, that combines various standard techniques such as quantum phase estimation and quantum multiplexors.

arXiv:1010.4926•Oct 24, 2010•0 citations

ScaffCC

Ali Javadi-Abhari, Shruti R. Patil, Daniel Kudrow +4 more

Quantum computing is a promising technology for high-performance computation, but requires mature toolflows that can map large-scale quantum programs onto targeted hardware. In this paper, we present a scalable compiler for large-scale quantum applications, and show the opportunities for reducing compilation and analysis time, as well as output code size. We discuss the similarities and differences between compiling for a quantum computer as opposed to a classical computer, and present a state-of-the-art approach for compilation of classical circuits into quantum circuits. Our work also highlights the importance of high-level quantum compilation for logical circuit translation, quantitative analysis of algorithms, and optimization of circuit lengths.

ACM International Conference on Computing Frontiers (CF)•May 20, 2014•152 citations

Quibbs, a Code Generator for Quantum Gibbs Sampling

Robert R. Tucci

This paper introduces Quibbs v1.3, a Java application available for free. (Source code included in the distribution.) Quibbs is a "code generator" for quantum Gibbs sampling: after the user inputs some files that specify a classical Bayesian network, Quibbs outputs a quantum circuit for performing Gibbs sampling of that Bayesian network on a quantum computer. Quibbs implements an algorithm described in earlier papers, that combines various apple pie techniques such as: an adaptive fixed-point version of Grover's algorithm, Szegedy operators, quantum phase estimation and quantum multiplexors.

arXiv:1004.2205•Apr 11, 2010•2 citations

A Quantum Computation Language-based Quantum Compiler

S. Jaya Amruth, T.M. Nigelesh, V. Sai Shruthik +2 more

Quantum computing is a revolution in computational theory that uses the principles of quantum mechanics to perform computations that are beyond the capacity of classical computers. It works with the special features of the quantum bits or qubits to encode and transform the information in manners conventional bits cannot imagine. A quantum compiler is a software tool designed to translate high-level quantum language code into executable quantum instructions. This paper aims to develop a quantum compiler for translating Quantum Computation Language source codes into quantum bytecodes which can later be executed on a Quantum Virtual Machine. This compiler will have a combinational structure that includes a frontend for interpreting the QCL code, an intermediate representation for optimizing quantum algorithms, and a backend for generating efficient quantum bytecode. Optimization techniques will be applied to improve the functioning of the quantum circuits. The compiler will also include an error handling module to handle the errors. The successful deployment of a quantum compiler for QCL has many implications and unlocks opportunities for advancements in quantum technologies.

International Conference on Computing, Communication and Networking Technologies (ICCCNT)•Jun 24, 2024•0 citations

AriaQuanta: A Quantum Software for Quantum Computing

A. Cheraghi, H. Davoodi Yeganeh

We introduce AriaQuanta, a powerful and flexible tool for designing, simulating, and implementing quantum circuits. This open-source software is designed to make it easy for users of all experience levels to learn and use quantum computing. The first version includes a compiler for implementing various quantum circuits and algorithms. Additionally, parametric circuits allow for the implementation of variational quantum algorithms, and various noise models are available for simulating noisy circuits. We performed numerous numerical simulations on AriaQuanta in various applications, including quantum algorithms and noisy circuits. The results, compared with popular counterparts, demonstrate the high performance of AriaQuanta.

arXiv:2504.06024•Apr 8, 2025•0 citations
This paper introduces QuanTree v1.1 and QuanLin v1.1, two Java applications available for free. (Source code included in the distribution.) Each application compiles a different type of input quantum evolution operator. The applications output a quantum circuit that is approximately equal to the input evolution operator. QuanTree compiles an input evolution operator whose Hamiltonian is proportional to the incidence matrix of a balanced, binary tree graph. QuanLin compiles an input evolution operator whose Hamiltonian is proportional to the incidence matrix of a line (open string) graph. Both applications also output an error, defined as the distance in the Frobenius norm between the input evolution operator and the output quantum circuit.
This paper introduces QOperAv v1.5, a Java application available for free. (Source code included in the distribution.) QOperAv is a "code generator" for generating quantum circuits. The quantum circuits generated by QOperAv can be used to evaluate with polynomial efficiency the average of f(A)f(A)f(A) for some simple (that is, computable with polynomial efficiency) function fff and a Hermitian operator AAA, provided that we know how to compile exp⁡(iA)\exp(iA)exp(iA) with polynomial efficiency. QOperAv implements an algorithm described in earlier papers, that combines various standard techniques such as quantum phase estimation and quantum multiplexors.
Quantum computing is a promising technology for high-performance computation, but requires mature toolflows that can map large-scale quantum programs onto targeted hardware. In this paper, we present a scalable compiler for large-scale quantum applications, and show the opportunities for reducing compilation and analysis time, as well as output code size. We discuss the similarities and differences between compiling for a quantum computer as opposed to a classical computer, and present a state-of-the-art approach for compilation of classical circuits into quantum circuits. Our work also highlights the importance of high-level quantum compilation for logical circuit translation, quantitative analysis of algorithms, and optimization of circuit lengths.
This paper introduces Quibbs v1.3, a Java application available for free. (Source code included in the distribution.) Quibbs is a "code generator" for quantum Gibbs sampling: after the user inputs some files that specify a classical Bayesian network, Quibbs outputs a quantum circuit for performing Gibbs sampling of that Bayesian network on a quantum computer. Quibbs implements an algorithm described in earlier papers, that combines various apple pie techniques such as: an adaptive fixed-point version of Grover's algorithm, Szegedy operators, quantum phase estimation and quantum multiplexors.
Quantum computing is a revolution in computational theory that uses the principles of quantum mechanics to perform computations that are beyond the capacity of classical computers. It works with the special features of the quantum bits or qubits to encode and transform the information in manners conventional bits cannot imagine. A quantum compiler is a software tool designed to translate high-level quantum language code into executable quantum instructions. This paper aims to develop a quantum compiler for translating Quantum Computation Language source codes into quantum bytecodes which can later be executed on a Quantum Virtual Machine. This compiler will have a combinational structure that includes a frontend for interpreting the QCL code, an intermediate representation for optimizing quantum algorithms, and a backend for generating efficient quantum bytecode. Optimization techniques will be applied to improve the functioning of the quantum circuits. The compiler will also include an error handling module to handle the errors. The successful deployment of a quantum compiler for QCL has many implications and unlocks opportunities for advancements in quantum technologies.
We introduce AriaQuanta, a powerful and flexible tool for designing, simulating, and implementing quantum circuits. This open-source software is designed to make it easy for users of all experience levels to learn and use quantum computing. The first version includes a compiler for implementing various quantum circuits and algorithms. Additionally, parametric circuits allow for the implementation of variational quantum algorithms, and various noise models are available for simulating noisy circuits. We performed numerous numerical simulations on AriaQuanta in various applications, including quantum algorithms and noisy circuits. The results, compared with popular counterparts, demonstrate the high performance of AriaQuanta.