Evaluating ESOP Optimization Methods in Quantum Compilation Flows
From MaRDI portal
Publication:5237224
DOI10.1007/978-3-030-21500-2_12OpenAlexW2951716835MaRDI QIDQ5237224
Giulia Meuli, Heinz Riener, Giovanni De Micheli, Rüdiger Ehlers, Bruno V. Schmitt
Publication date: 17 October 2019
Published in: Reversible Computation (Search for Journal in Brave)
Full work available at URL: https://infoscience.epfl.ch/record/268484/files/RC19.pdf
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Related Items (3)
A framework for quantum-classical cryptographic translation ⋮ Boolean satisfiability in quantum compilation ⋮ An improved and cost reduced quantum circuit generator approach for image encoding applications
Uses Software
Cites Work
- Unnamed Item
- Young subgroups for reversible computers.
- PySAT: a Python toolkit for prototyping with SAT oracles
- Quantum circuits for floating-point arithmetic
- Application of Functional Decomposition in Synthesis of Reversible Circuits
- Minimization of Modulo-2 Sum of Products
- Pseudo-Kronecker expressions for symmetric functions
This page was built for publication: Evaluating ESOP Optimization Methods in Quantum Compilation Flows