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

INFORMS journal on computing

Code and Data Repository for A New Multicommodity Network Flow Model and Branch and Cut for Optimal Quantum Boolean Circuit Synthesis

Jeenah Jung, In-Chan Choi

Published Nov 14, 2024• 1 citation
Publisher

Abstract

This directory contains the entire set of result files that are reported in our paper.
DOI
10.1287/ijoc.2024.0562.cd

Related papers

Simulation Paths for Quantum Circuit Simulation with Decision Diagrams

Lukas Burgholzer, Robert Wille

Springer eBooks•Jan 1, 2026•0 citations

A New Multicommodity Network Flow Model and Branch and Cut for Optimal Quantum Boolean Circuit Synthesis

Jeenah Jung, In-Chan Choi

This study introduces a new optimization model and a branch-and-cut approach for synthesizing optimal quantum circuits for reversible Boolean functions, which are pivotal components in quantum algorithms. Although heuristic algorithms have been extensively explored for quantum circuit synthesis, research on exact counterparts remains relatively limited. However, the need to design quantum circuits with guaranteed optimality is increasing, especially for improving computational fidelity on noisy intermediate-scale quantum devices. This study presents mathematical optimization as a viable option for optimal synthesis, with the potential to accommodate practical considerations arising in fast-evolving quantum technologies. We set a demonstrative problem to implement reversible Boolean functions using high-level gates known as multiple control Toffoli gates while minimizing a technology-based proxy called quantum cost—the number of low-level gates used to realize each high-level gate. To address this problem, we propose a discrete optimization model based on a multicommodity network and discuss potential future variations at an abstract level to incorporate technical considerations. A customized branch and cut is then developed upon different aspects of our model, including polyhedron integrality, surrogate constraints, and variable prioritization. Our experiments demonstrate the robustness of the proposed approach in finding cost-optimal circuits for all benchmark instances within a two-hour time frame. Furthermore, we present interesting intuitions from these experiments and compare our computational results with relevant studies, highlighting newly discovered circuits with the lowest quantum costs reported in this paper. History: Accepted by Giacomo Nannicini, Area Editor for Quantum Computing. This paper has been accepted for the INFORMS Journal on Computing Special Issue on Quantum Computing. Funding: This research was supported by the Ministry of Science and Information and Communication Technology, South Korea [Grants 2017R1E1A1A0307098814 and 2020R1A4A307986411]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0562 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0562 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

INFORMS journal on computing•Nov 14, 2024•3 citations

Synthesis and Optimization by Quantum Circuit Description Language

Mariam Zomorodi Moghadam, Mohammad Amin Taherkhani, Keivan Navi

Lecture notes in computer science•Jan 1, 2014•10 citations

Engineered non-Gaussian Coherence as a Thermodynamic Resource for Quantum Batteries

Kingshuk Adhikary

This repository contains the numerical data and computational codes supporting the results presented in the manuscript: "Engineered non-Gaussian Coherence as a Thermodynamic Resource for Quantum Batteries". The archive (data_QB.zip) includes all datasets, Jupyter notebooks, and figure files required to reproduce the results reported in both the main text and the Supplemental Material. Each figure is organised in a separate directory containing the corresponding data (.txt), code (.ipynb), and generated plots (.png/.pdf). The provided materials are sufficient to reproduce all figures and results without restriction. Detailed instructions and directory structure are described in the accompanying README.txt file. This dataset is made openly available to ensure transparency and reproducibility of the reported results.

•Apr 11, 2026•0 citations

Decision Diagram Data Structure to Represent Quantum Circuit

茂 山下, D. Michael Miller

Distributed Computing•Nov 21, 2006•0 citations

Dynamical freezing and enhanced magnetometry in an interacting spin ensemble

Yanan Lu, Yuan, Dong, Yue Ma +10 more

This repository provides the figure data and numerical simulation codes supplement to the manuscript “Dynamical freezing and enhanced magnetometry in an interacting spin ensemble” (arXiv:2507.22982). Contents:--Main_text_figures--Extended_Data_figures Each folder contains the numerical or experimental data used to generate the corresponding figures in the manuscript. All figures can be reproduced by straightforward plotting of the included .csv files. A short description of each dataset is provided within the file headers. --Exact_diagonalization_code--Discrete_truncated_Wigner_approximation_code These directories contain the codes used in the numerical simulations presented in the paper. Each code package includes a detailed README file explaining the workflow, parameters, and usage.

arXiv:2507.22982•Jul 30, 2025•3 citations
This study introduces a new optimization model and a branch-and-cut approach for synthesizing optimal quantum circuits for reversible Boolean functions, which are pivotal components in quantum algorithms. Although heuristic algorithms have been extensively explored for quantum circuit synthesis, research on exact counterparts remains relatively limited. However, the need to design quantum circuits with guaranteed optimality is increasing, especially for improving computational fidelity on noisy intermediate-scale quantum devices. This study presents mathematical optimization as a viable option for optimal synthesis, with the potential to accommodate practical considerations arising in fast-evolving quantum technologies. We set a demonstrative problem to implement reversible Boolean functions using high-level gates known as multiple control Toffoli gates while minimizing a technology-based proxy called quantum cost—the number of low-level gates used to realize each high-level gate. To address this problem, we propose a discrete optimization model based on a multicommodity network and discuss potential future variations at an abstract level to incorporate technical considerations. A customized branch and cut is then developed upon different aspects of our model, including polyhedron integrality, surrogate constraints, and variable prioritization. Our experiments demonstrate the robustness of the proposed approach in finding cost-optimal circuits for all benchmark instances within a two-hour time frame. Furthermore, we present interesting intuitions from these experiments and compare our computational results with relevant studies, highlighting newly discovered circuits with the lowest quantum costs reported in this paper. History: Accepted by Giacomo Nannicini, Area Editor for Quantum Computing. This paper has been accepted for the INFORMS Journal on Computing Special Issue on Quantum Computing. Funding: This research was supported by the Ministry of Science and Information and Communication Technology, South Korea [Grants 2017R1E1A1A0307098814 and 2020R1A4A307986411]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0562 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0562 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
This repository contains the numerical data and computational codes supporting the results presented in the manuscript: "Engineered non-Gaussian Coherence as a Thermodynamic Resource for Quantum Batteries". The archive (data_QB.zip) includes all datasets, Jupyter notebooks, and figure files required to reproduce the results reported in both the main text and the Supplemental Material. Each figure is organised in a separate directory containing the corresponding data (.txt), code (.ipynb), and generated plots (.png/.pdf). The provided materials are sufficient to reproduce all figures and results without restriction. Detailed instructions and directory structure are described in the accompanying README.txt file. This dataset is made openly available to ensure transparency and reproducibility of the reported results.
This repository provides the figure data and numerical simulation codes supplement to the manuscript “Dynamical freezing and enhanced magnetometry in an interacting spin ensemble” (arXiv:2507.22982). Contents:--Main_text_figures--Extended_Data_figures Each folder contains the numerical or experimental data used to generate the corresponding figures in the manuscript. All figures can be reproduced by straightforward plotting of the included .csv files. A short description of each dataset is provided within the file headers. --Exact_diagonalization_code--Discrete_truncated_Wigner_approximation_code These directories contain the codes used in the numerical simulations presented in the paper. Each code package includes a detailed README file explaining the workflow, parameters, and usage.