Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

Physical synthesis of quantum circuits using templates

Zahra Mirkhani, Naser Mohammadzadeh

Published Jun 30, 2016• 7 citations
Publisher
DOI
10.1007/s11128-016-1377-x

Related papers

Efficient template matching in quantum circuits

Raban Iten, David Sutter, Stefan Woerner

•Sep 11, 2019•1 citation

Synthesis of Quantum Circuits for Dedicated Physical Machine Descriptions

Philipp Niemann, Saikat Basu, Amlan Chakrabarti +2 more

Lecture notes in computer science•Jan 1, 2015•11 citations

Physical synthesis of quantum circuits using Q-learning

Dengli Bu, Zhiyan Bin, Jing Sun

Quantum Information Processing•Jan 27, 2025•0 citations

Quantum circuit physical design methodology with emphasis on physical synthesis

Naser Mohammadzadeh, Morteza Saheb Zamani, Mehdi Sedighi

Quantum Information Processing•Nov 7, 2013•16 citations

Nearest Neighbour based Synthesis of Quantum Boolean Circuits

Amlan Chakrabarti, Susmita Sur‐Kolay

Abstract—Quantum Boolean circuit synthesis issues are becoming a key area of research in the domain of quantum computing. For gate-level synthesis, minterm based and Reed-Muller canonical decomposition techniques are adopted as common approaches. Physical implementation of quantum circuits have inherent constraints and hence nearest neighbour template of input lines is gaining importance. In this work, we present a brief analysis of the various Fixed Polarity Reed Muller (FPRM) expressions for a given quantum Boolean circuit and also introduce the rules for the nearest neighbour template-based synthesis of these forms. The corresponding circuit costs are evaluated.

Engineering letters•Jan 1, 2007•29 citations

Synthesis of Quantum Circuits

Philipp Niemann, Robert Wille

SpringerBriefs in physics•Jan 1, 2017•0 citations
Abstract—Quantum Boolean circuit synthesis issues are becoming a key area of research in the domain of quantum computing. For gate-level synthesis, minterm based and Reed-Muller canonical decomposition techniques are adopted as common approaches. Physical implementation of quantum circuits have inherent constraints and hence nearest neighbour template of input lines is gaining importance. In this work, we present a brief analysis of the various Fixed Polarity Reed Muller (FPRM) expressions for a given quantum Boolean circuit and also introduce the rules for the nearest neighbour template-based synthesis of these forms. The corresponding circuit costs are evaluated.