CodeMeta.json Export for Q-Synth

Copy to Clipboard Download

{
    "@context": "https:\/\/doi.org\/10.5063\/schema\/codemeta-2.0",
    "@type": "SoftwareSourceCode",
    "codeRepository": "https:\/\/github.com\/irfansha\/Q-Synth",
    "funder": {
        "@type": "Organization",
        "funding": "IFD (Innovation Fund Denmark)"
    },
    "author": [
        {
            "@type": "Person",
            "givenName": "Irfansha",
            "familyName": "Shaik",
            "email": "irfansha.shaik@cs.au.dk",
            "@id": "https:\/\/orcid.org\/0000-0002-7404-348X",
            "affiliation": {
                "@type": "Organization",
                "name": "Department of Computer Science, Aarhus University, Denmark; Kvantify Aps, Copenhagen S, Denmark"
            }
        },
        {
            "@type": "Person",
            "givenName": "Jaco",
            "familyName": "van de Pol",
            "email": "jaco@cs.au.dk",
            "@id": "https:\/\/orcid.org\/0000-0003-4305-0625",
            "affiliation": {
                "@type": "Organization",
                "name": "Department of Computer Science, Aarhus University, Denmark"
            }
        }
    ],
    "name": "Q-Synth",
    "softwareVersion": "2.0",
    "keywords": [
        "Optimal Layout Synthesis",
        "Quantum Circuits",
        "SAT solving",
        "Parallel Plans"
    ],
    "programmingLanguage": "Python",
    "developmentStatus": "Active",
    "dateCreated": "2023-08-11",
    "datePublished": "2024-11-28",
    "license": "https:\/\/spdx.org\/licenses\/MIT.html",
    "description": "This tool takes a quantum circuit in OPENQASM 2.0 format and the coupling graph of a physical quantum platform. The output is an optimal mapping of the circuit onto the platform, preserving the gates and their dependencies, respecting the coupling graph, and minimizing the number of SWAP operations (with or without using ancillary qubits). We also support ancillary qubits, bridges instead of SWAPS, and relaxed dependencies based on gate commutation rules. We employ two main approaches, classical planning (v1.0) and SAT-solver based parallel plans (v2.0).",
    "identifier": "https:\/\/archive.softwareheritage.org\/swh:1:dir:be31c57364bd541c6b65afac80603e9004cf4008;origin=https:\/\/github.com\/irfansha\/Q-Synth;visit=swh:1:snp:f376849e93533f1d9039b7cd543ed56b6edcf01d;anchor=swh:1:rev:553d54c9942b73a0246328d42565caaaaac38117"
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode