Design automation and design space exploration for quantum computers

@article{Soeken2017DesignAA,
  title={Design automation and design space exploration for quantum computers},
  author={Mathias Soeken and Martin Roetteler and Nathan Wiebe and Giovanni De Micheli},
  journal={Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017},
  year={2017},
  pages={470-475}
}
  • Mathias Soeken, Martin Roetteler, +1 author Giovanni De Micheli
  • Published 2017
  • Mathematics, Physics, Computer Science
  • Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017
  • A major hurdle to the deployment of quantum linear systems algorithms and recent quantum simulation algorithms lies in the difficulty to find inexpensive reversible circuits for arithmetic using existing hand coded methods. Motivated by recent advances in reversible logic synthesis, we synthesize arithmetic circuits using classical design automation flows and tools. The combination of classical and reversible logic synthesis enables the automatic design of large components in reversible logic… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 20 CITATIONS

    Design automation for quantum architectures

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Optimizing Quantum Circuits for Modular Exponentiation

    VIEW 1 EXCERPT
    CITES METHODS

    Quantum circuits for floating-point arithmetic

    VIEW 1 EXCERPT
    CITES METHODS

    Programming quantum computers using design automation

    VIEW 3 EXCERPTS
    CITES METHODS

    Reversible Pebbling Game for Quantum Memory Management

    VIEW 1 EXCERPT
    CITES METHODS

    Logic Synthesis for Quantum Computing

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    LUT-Based Hierarchical Reversible Logic Synthesis

    VIEW 3 EXCERPTS
    CITES METHODS & BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 27 REFERENCES

    Synthesis of the optimal 4-bit reversible circuits

    VIEW 1 EXCERPT

    Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits

    VIEW 4 EXCERPTS

    Unlocking efficiency and scalability of reversible logic synthesis using conventional logic synthesis

    VIEW 2 EXCERPTS

    Quantum algorithms and circuits for scientific computing

    VIEW 3 EXCERPTS

    Exact Multiple-Control Toffoli Network Synthesis With SAT Techniques

    VIEW 2 EXCERPTS

    A transformation based algorithm for reversible logic synthesis

    VIEW 1 EXCERPT

    A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits

    VIEW 1 EXCERPT

    Reversible circuit compilation with space constraints

    VIEW 3 EXCERPTS