Using $$\pi $$ DDs for Nearest Neighbor Optimization of Quantum Circuits

DOI10.1007/978-3-319-40578-0_14zbMath1480.81032OpenAlexW2482466809WikidataQ62513075 ScholiaQ62513075MaRDI QIDQ3186599

Shin-ichi Minato, Nils Quetschlich, Norihito Yasuda, Robert Wille, Yuma Inoue

Publication date: 10 August 2016

Published in: Reversible Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40578-0_14

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (1)

Multi-strategy based quantum cost reduction of linear nearest-neighbor quantum circuit

Uses Software

• RevLib

Cites Work

• Synthesis of quantum circuits for linear nearest neighbor architectures
• πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space
• Conflict-Driven Answer Set Enumeration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using $$\pi $$ DDs for Nearest Neighbor Optimization of Quantum Circuits