The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
RevLib: An Online Resource for Reversible Functions and Reversible Circuits
Abstract
Synthesis of reversible logic has become an active research area in the last years. But many proposed algorithms are evaluated with a small set of benchmarks only. Furthermore, results are often documented only in terms of gate counts or quantum costs, rather than presenting the specific circuit. In this paper RevLib (www.revlib.org) is introduced, an online resource for reversible functions and reversible circuits. RevLib provides a large database of functions with respective circuit realizations. RevLib is designed to ease the evaluation of new methods and facilitate the comparison of results. In addition, tools are introduced to support researchers in evaluating their algorithms and documenting their results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
TSPLIB—A Traveling Salesman Problem Library
Reinelt, G. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.4.376 · Cited by 2,616
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896 · cited 1×
“In the past many researchers have focused on synthesis of reversible logic (e.g. [16] [13] [1] [10] [8] [18] [19] [7]) using the different gate libraries including (multiple control) Toffoli gates [17], Fredkin gates [5], Peres gates [14], and elementary quantum gates [3].”
MethodToffoli, T. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_104 · Cited by 1,523 · cited 1×
“[16, 13, 1, 10, 8, 18, 19, 7]) using the different gate libraries including (multiple control) Toffoli gates [17], Fredkin gates [5], Peres gates [14], and elementary quantum gates [3].”
Fredkin, E., & Toffoli, T. (2001) · Cited by 1,302
Reversible logic and quantum computers
Peres, A. (1985) · Physical Review A · doi:10.1103/physreva.32.3266 · Cited by 892
Synthesis of reversible logic circuits
Shende, V. V., Prasad, A. K., Markov, I. L., & Hayes, J. P. (2003) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2003.811448 · Cited by 568
A transformation based algorithm for reversible logic synthesis
Miller, D. M., Maslov, D., & Dueck, G. W. (2003) · Proceedings of the 40th annual Design Automation Conference · doi:10.1145/775832.775915 · Cited by 493
Self-citationSATLIB: An Online Resource for Research on SAT
Hoos, H. H., Stützle, T., Gent, I. P., van Maaren, H., & Walsh, T. (2000) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 474
An Algorithm for Synthesis of Reversible Logic Circuits
Gupta, P., Agrawal, A., & Jha, N. K. (2006) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2006.871622 · Cited by 379
Cited by
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
Li, G., Ding, Y., & Xie, Y. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304023 · Cited by 594
An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures
Zulehner, A., Paler, A., & Wille, R. (2019) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2018.2846658 · Cited by 372
Self-citationBDD-based synthesis of reversible logic for large functions
Wille, R., & Drechsler, R. (2009) · Proceedings of the 46th Annual Design Automation Conference · doi:10.1145/1629911.1629984 · Cited by 323
Self-citationSynthesis and optimization of reversible circuits—a survey
Saeedi, M., & Markov, I. L. (2013) · ACM Computing Surveys · doi:10.1145/2431211.2431220 · Cited by 298
Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
Wille, R., Burgholzer, L., & Zulehner, A. (2019) · Proceedings of the 56th Annual Design Automation Conference 2019 · doi:10.1145/3316781.3317859 · Cited by 207
Self-citation(2014) · doi:10.1145/2597917.2597939 · Cited by 152
Optimal layout synthesis for quantum computing
Tan, B., & Cong, J. (2020) · Proceedings of the 39th International Conference on Computer-Aided Design · doi:10.1145/3400302.3415620 · Cited by 126
A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
Niu, S., Suau, A., Staffelbach, G., & Todri-Sanial, A. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3026544 · Cited by 103
“They include several functions taken from RevLib [45] as well as quantum algorithms from a variety of domains, including optimization, simulation, quantum arithmetic, etc.”
BackgroundZhang, C., Hayes, A. B., Qiu, L., Jin, Y., Chen, Y., & Zhang, E. Z. (2021) · Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3445814.3446706 · Cited by 74
Timing and Resource-Aware Mapping of Quantum Circuits to Superconducting Processors
Lao, L., van Someren, H., Ashraf, I., & Almudever, C. G. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2021.3057583 · Cited by 72
“In this section, we evaluate Qmap by mapping a set of benchmarks from RevLib [30] and QLib [31] on the super-conducting processor Surface-17 that has a distance-3 surface-code topology [28].”
Qubit Mapping and Routing via MaxSAT
Molavi, A., Xu, A., Diges, M., Pick, L., Tannu, S., & Albarghouthi, A. (2022) · 2022 55th IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro56248.2022.00077 · Cited by 54
“3 These 160 circuits were derived from the RevLib suite [15] and programs written in the Quipper [16] and ScaffoldCC [17] quantum programming languages.”
MethodCodar: A Contextual Duration-Aware Qubit Mapping for Various NISQ Devices
Deng, H., Zhang, Y., & Li, Q. (2020) · 2020 57th ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac18072.2020.9218561 · Cited by 23
Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
Cheng, C.-Y., Yang, C.-Y., Kuo, Y.-H., Wang, R.-C., Cheng, H.-C., & Huang, C.-Y. (. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3680291 · Cited by 19
Metadata
- Authors
- Wille, R., Gro, D., Teuber, L., Dueck, G. W., & Drechsler, R.
- Venue
- 38th International Symposium on Multiple Valued Logic (ismvl 2008)
- Publisher
- IEEE
- Published
- 2008-05
- Pages
- 220-225
- ISSN
- 0195-623X (ISSN-L)
- OpenAlex
- W2130753923
- Cited by
- 495
- References
- 18
- FWCI
- 16.18
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.