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

Universality and optimality of quantum information processing primitives

Jozef Gruska

Published Jan 1, 2005• 0 citations
OpenAlex

Abstract

Analysis of universal sets of quantum primitives and state-of-the-art of optimalization of their usage.

Related papers

Universal Sets of Quantum Information Processing Primitives and Their Optimal Use

Jozef Gruska

Lecture notes in computer science•Jan 1, 2006•3 citations

Universal Sets of Quantum Information Processing Primitives and their optimal use

Jozef Gruska

Electronic Notes in Discrete Mathematics•Aug 1, 2005•0 citations

Universal sets of quantum information processing primitives andtheir optimal use

Jozef Gruska

Lecture notes in computer science•Jan 1, 2006•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 information theory and its application to quantum information processing

Osamu Hirota

Conference on Lasers and Electro-Optics•Jan 1, 2001•0 citations

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

Хаханов Владимир Иванович, 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
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.
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.