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

IEEE East-West Design & Test Symposium (EWDTS)

Qubit model for solving the coverage problem

Vladimir I. Hahanov, Eugenia I. Litvinova, Svetlana V. Chumachenko, Baghdadi Ammar Awni Abbas, Eshetie Abebech Mandefro

Published Sep 1, 2013• 28 citations
Publisher

Abstract

Qubit (quantum) structures of data and computational processes for significantly improving performance when solving problems of discrete optimization and fault-tolerant design are proposed. We describe a hardware-focused models for parallel (one cycle) calculating the power set (the set of all subsets) on the universe of n primitives for solving coverage problems, minimization of Boolean functions, data compression, analysis and synthesis of digital systems through the implementation of the processor structure in the form of the Hasse diagram. A prototype of quantum device, implemented by programmable logic, is described.

DOI
10.1109/ewdts.2013.6673167

Related papers

Квантовые модели вычислительных процессов

Хаханов Владимир Иванович, Ahtsham Ali, Литвинова Евгения Ивановна +2 more

Qubit (quantum) structures of data and computational processes for significantly improving performance when solving problems of discrete optimization and fault-tolerant design are proposed. We describe a hardware-focused models for parallel (one cycle) calculating the power set (the set of all subsets) on the universe of n primitives for solving coverage problems, minimization of Boolean functions, data compression, analysis and synthesis of digital systems through the implementation of the processor structure in the form of the Hasse diagram. A prototype of quantum device, implemented by programmable logic, is described.

Радиоэлектроника и информатика•Jan 1, 2011•0 citations

Coverage Problem Solving on Quantum Computing

Irina Hahanova

Abstract – The qubit (quantum) structure of data and computing processes that allows significantly increasing the speed of binary optimization problem decisions was proposed. The hardware parallel models (one cycle) for Boolean (set of all subsets) calculation on the basis of n-element universum for coverage decision solutions, boolean function optimizations, compression of data, digital systems synthesis and analysis that use the Hasse diagram for implementation processor structure were described. Index Terms – quantum computing, hardware model, Boolean function, processor. I. I NTRODUCTION The purpose of the qubit-processor creation is significant reduction of time that needs to decision of the optimization problems by using concurrent calculation of the vector logical operations [1-3] over the set of all subsets of the primitives through the cost of increasing the memory size for intermediate data saving. Problems of the research are the follows: 1) Definition of data structures for boolean decision coverage problem of columns of a matrix M =M

Радиоэлектроника и информатика•Jan 1, 2012•0 citations

Квантовый процессор оптимального покрытия

Хаханова Ирина Витальевна

Qubit (quantum) structures of data and computational processes to considerably improve performance when solving discrete optimization problems are proposed. The hardware-oriented models for parallel (one cycle) calculating the power set (the set of all subsets) on the universe of n primitives are described. They are focused to solve coverage problems, minimization of Boolean functions, data compression, analysis and synthesis of digital systems through implementing the processor structure in the form of the Hasse diagram. Fig. 1. Ref.: 17 items.

Автоматизированные системы управления и приборы автоматики•Jan 1, 2012•0 citations

Quantum processor for the optimal coverage

Irina Hahanova

The qubit (quantum) structure of data and computing processes that allows significantly increasing the speed of binary optimization problem decisions was proposed. The hardware parallel models (one cycle) for Boolean (set of all subsets) calculation on the basis of n-element universum for coverage decision solutions, boolean function optimizations, compression of data, digital systems synthesis and analysis that use the Hasse diagram for implementation processor structure were described.

International Conference on Experience of Designing and Applications of CAD Systems in Microelectronics•Jun 20, 2013•0 citations

Quantum models for data structures and computing

Vladimir I. Hahanov, Irina Hahanova, Гузь Олеся Алексеевна +1 more

The qubit (quantum) data structures and computational processes are proposed to significantly improve the performance in solving problems of discrete optimization and fault-tolerant design. A quantum device prototype is implemented by programmable logic.

International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science•May 7, 2012•5 citations

Synthesis of qubit models for logic circuits

Wajeb Gharibi, Sergiy Zaychenko, Farid Dahiri +4 more

Qubit (quantum) structures of data and computational processes for significantly improving performance when solving problems of discrete optimization and fault-tolerant design are proposed. We describe superpositional method for synthesizing cube of functionality for its implementation in the structural components of programmable logic chips. The estimates of synthesis time, as well as hardware costs for creating qubit models of logic circuits are represented.

IEEE East-West Design & Test Symposium (EWDTS)•Sep 1, 2013•0 citations
Qubit (quantum) structures of data and computational processes for significantly improving performance when solving problems of discrete optimization and fault-tolerant design are proposed. We describe a hardware-focused models for parallel (one cycle) calculating the power set (the set of all subsets) on the universe of n primitives for solving coverage problems, minimization of Boolean functions, data compression, analysis and synthesis of digital systems through the implementation of the processor structure in the form of the Hasse diagram. A prototype of quantum device, implemented by programmable logic, is described.
Qubit (quantum) structures of data and computational processes for significantly improving performance when solving problems of discrete optimization and fault-tolerant design are proposed. We describe a hardware-focused models for parallel (one cycle) calculating the power set (the set of all subsets) on the universe of n primitives for solving coverage problems, minimization of Boolean functions, data compression, analysis and synthesis of digital systems through the implementation of the processor structure in the form of the Hasse diagram. A prototype of quantum device, implemented by programmable logic, is described.
Abstract – The qubit (quantum) structure of data and computing processes that allows significantly increasing the speed of binary optimization problem decisions was proposed. The hardware parallel models (one cycle) for Boolean (set of all subsets) calculation on the basis of n-element universum for coverage decision solutions, boolean function optimizations, compression of data, digital systems synthesis and analysis that use the Hasse diagram for implementation processor structure were described. Index Terms – quantum computing, hardware model, Boolean function, processor. I. I NTRODUCTION The purpose of the qubit-processor creation is significant reduction of time that needs to decision of the optimization problems by using concurrent calculation of the vector logical operations [1-3] over the set of all subsets of the primitives through the cost of increasing the memory size for intermediate data saving. Problems of the research are the follows: 1) Definition of data structures for boolean decision coverage problem of columns of a matrix M =M
Qubit (quantum) structures of data and computational processes to considerably improve performance when solving discrete optimization problems are proposed. The hardware-oriented models for parallel (one cycle) calculating the power set (the set of all subsets) on the universe of n primitives are described. They are focused to solve coverage problems, minimization of Boolean functions, data compression, analysis and synthesis of digital systems through implementing the processor structure in the form of the Hasse diagram. Fig. 1. Ref.: 17 items.