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

PROGRAMMNAYA INGENERIA

Automated Generation of Quantum Circuit Specifications Based on Reed — Muller Expressions

В. А. Калмычков, I. V. Matveeva

Published Jun 29, 2020• 0 citations
Publisher
DOI
10.17587/prin.11.169-176

Related papers

Using Reed-Muller Expansions in the Synthesis and Optimization of Boolean Quantum Circuits

Ahmed Younes

Emergence, complexity and computation•Oct 26, 2017•2 citations

Automated Design of Quantum Circuits

Colin P. Williams, Alexander Gray

Lecture notes in computer science•Jan 1, 1999•52 citations

Model Design of Quantum Logic Circuits Based on Reed-Muller Expressions

Irina Matveeva, В. А. Калмычков, Anatolii Dorokhov

The article considers the design flow for automatic generation of the quantum circuit model specifications as a fragment of the logical unit of a quantum computer. Reed-Muller expressions is base for this generation. The model representation takes into account the features of the quantum circuit realization in the notation of the linear nearest neighborhood (LNN), the proposed templates provide the automatic selection of the optimal gates composition.

International Russian Automation Conference (RusAutoCon)•Sep 1, 2018•2 citations

Synthesis and Optimization by Quantum Circuit Description Language

Mariam Zomorodi Moghadam, Mohammad Amin Taherkhani, Keivan Navi

Lecture notes in computer science•Jan 1, 2014•10 citations

A Quantum Logic Circuit For Generating Fixed-Polarity Reed-Muller Coefficients

Mozammel H. A. Khan

Logic function representation using fixed-polarity Reed-Muller (FPRM) expression has manifold advantages over classical SOP expression. Moreover, FPRM expression is a very useful representation for logic function realization using quantum logic circuits. In this paper, we present a quantum logic circuit for generating FPRM coefficients for a given polarity vector from the truth vector of the function

International Conference on Electrical and Computer Engineering (ICECE)•Dec 1, 2006•0 citations

A Quantum CAD Accelerator Based on Grover’s Algorithm for Finding the Minimum Fixed Polarity Reed-Muller Form

Lun Li, Mitchell Aaron Thornton, Marek A. Perkowski

We describe the use of Grover’s algorithm as implemented in a quantum logic circuit that produces a solution for a classical switching circuit design problem. The particular application described here is to determine a Fixed Polarity Reed-Muller (FPRM) form that satisfies a threshold value constraint, thus we find a particular FPRM form among all 2^n FPRM forms that has a number of terms less than or equal to the threshold value. Grover’s algorithm is implemented in a quantum logic circuit that also contains a subcircuit that expresses all possible FPRM solutions of a given function. This approach illustrates how fast transforms as known from spectral theory can be combined with quantum computing as a part of an oracle.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•Jan 1, 2006•9 citations
We describe the use of Grover’s algorithm as implemented in a quantum logic circuit that produces a solution for a classical switching circuit design problem. The particular application described here is to determine a Fixed Polarity Reed-Muller (FPRM) form that satisfies a threshold value constraint, thus we find a particular FPRM form among all 2^n FPRM forms that has a number of terms less than or equal to the threshold value. Grover’s algorithm is implemented in a quantum logic circuit that also contains a subcircuit that expresses all possible FPRM solutions of a given function. This approach illustrates how fast transforms as known from spectral theory can be combined with quantum computing as a part of an oracle.