International Russian Automation Conference (RusAutoCon)

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

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

Published Sep 1, 2018• 2 citations

Abstract

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.

DOI: 10.1109/rusautocon.2018.8501822

Related papers

Quantum Circuits Specifications based on Multiformity of Flexible Design Flows

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

The article deals with the interrelated set of design flows for quantum circuit, providing an integrative view on the basic procedures of their specifications design. The proposed use of flexible design flows should provide an analysis of model representations of quantum circuits from different sides (levels of perception and technological maintenance), their integration into modern means of development and simulation of quantum computing. The results of our approach application are demonstrated. Multistage procedures for designing of quantum circuits specifications with necessary characteristics are considered by means of the example of fixed polarity Reed-Muller expressions synthesis. The results of templates using for minimization of SWAP gates groups are presented for the purpose of quantum circuits obtaining in the linearly nearest neighborhood architecture. The analysis of automatically generated specifications of quantum circuits is based on a set of criteria.

International Russian Automation Conference (RusAutoCon)Sep 1, 20190 citations

A fast algorithm for synthesis of quantum reversible logic circuits based on Reed-Muller

Zhiqiang Li, Hanwu Chen

Combining several kinds of ideas of synthesis of reversible logic circuits,this paper presents a novel and efficient algorithm which can automatically derive the positive polarity Reed-Muller expansion(RM).A solution space tree of creating quantum reversible logic circuits is constructed.Firstly floor traversal is used in whole,and depth-first search is used in local.Secondly according to the technique of template optimization,the bound function is created which can rapidly eliminate the branches of none result or none optimal result.Thirdly factors of RM are considered first.Therefore the algorithm can effectively construct optimal result and saves computational cost significantly.

Journal of Yangzhou UniversityJan 1, 20060 citations

Quantum circuits specifications design with lexical verification

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

In this paper we present our experience in quantum circuits design automation on the different notations basis. The need of rules and methods for generation of primitive quantum gates sequence for the quantum circuits on the basis of the Linear Nearest Neighbor (LNN) notation is shown. Our lexical verification methodology for quantum circuit specifications in each stage of its design is represented.

IEEE International Conference on Soft Computing and Measurements (SCM)May 1, 20155 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 lettersJan 1, 200729 citations

Representation of Boolean Quantum Circuits as Reed-Muller Expansions

Ahmed Younes, Julian Francis Miller

In this paper we show that there is a direct correspondence between quantum Boolean operations and certain forms of classical (non-quantum) logic known as Reed-Muller expansions. This allows us to readily convert Boolean circuits into their quantum equivalents. A direct result of this is that the problem of synthesis and optimization of quantum Boolean logic can be tackled within the field of Reed-Muller logic.

arXiv:quant-ph/0305134May 22, 20030 citations

Проектирование спецификаций квантовой цепи на основе анализа статистической информации

Irina Matveeva, К. В. Власова, М. А. Линник +2 more

The article describes the method of design of quantum circuit specifications, based on tabulated Boolean functions data. The method is considered as an example of building a set of new Boolean quantum circuits synthesized based on Reed – Muller polarized polynomials (FPRM) to have the best polynomial forms on the basis of preliminary statistical analysis of certain FPRM characteristics at all polarities. Matrix entry and software implementation of basic quantum converters is described, includind: NOT, C1NOT, C2NOT, SWAP. An example of the construction of a set of quantum circuits for quantum Boolean function for a given 1–0 table presented. The article shows, that the problem of synthesis and optimization of quantum circuits can be reduced to the traditional logical decisions. Illustrations, demonstrating transitions from automatically synthesized quantum circuits for different polarities of the Reed-Muller polynomials to quantum circuits with the least number of converters, presented.

Современные проблемы науки и образованияJan 1, 20130 citations