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

Communications in computer and information science

Boolean Function Decomposition Based on Grover Algorithm and Its Simulation Using Quantum Language Quipper

Dong Wang, Yiwei Li, Edison Tsai, Xiaoyu Song B, Marek A. Perkowski, Han Li

Published Jan 1, 2020• 1 citation
Publisher
DOI
10.1007/978-981-15-8083-3_52

Related papers

Grover-based Ashenhurst-Curtis decomposition using quantum language quipper

Yiwei Li, Edison Tsai, Marek A. Perkowski +1 more

Functional decomposition plays a key role in several areas such as system design, digital circuits, database systems, and Machine Learning. This paper presents a novel quantum computing approach based on Grover’s search algorithm for a generalized Ashenhurst-Curtis decomposition. The method models the decomposition problem as a search problem and constructs the oracle circuit based on the set-theoretic partition algebra. A hybrid quantum-based algorithm takes advantage of the quadratic speedup achieved by Grover’s search algorithm with quantum oracles for finding the minimum-cost decomposition. The method is implemented and simulated in the quantum programming language Quipper. This work constitutes the first attempt to apply quantum computing to functional decomposition.

Quantum Information and Computation•Feb 1, 2019•11 citations

Quantum Algorithms for Cryptographically Significant Boolean Functions

Tharrmashastha Sapv, Debajyoti Bera, Arpita Maitra +1 more

SpringerBriefs in computer science•Jan 1, 2021•1 citation

Computing Boolean Functions via Quantum Hashing

Farid Mansurovich Ablayev, Alexander Vasiliev

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

Five Quantum Algorithms Using Quipper

Safat Siddiqui, Mohammed Jahirul Islam, Omar Shehab

Quipper is a recently released quantum programming language. In this report, we explore Quipper's programming framework by implementing the Deutsch's, Deutsch-Jozsa's, Simon's, Grover's, and Shor's factoring algorithms. It will help new quantum programmers in an instructive manner. We choose Quipper especially for its usability and scalability though it's an ongoing development project. We have also provided introductory concepts of Quipper and prerequisite backgrounds of the algorithms for readers' convenience. We also have written codes for oracles (black boxes or functions) for individual algorithms and tested some of them using the Quipper simulator to prove correctness and introduce the readers with the functionality. As Quipper 0.5 does not include more than \ensuremath{4 \times 4} matrix constructors for Unitary operators, we have also implemented \ensuremath{8 \times 8} and \ensuremath{16 \times 16} matrix constructors.

arXiv:1406.4481•Jun 17, 2014•4 citations

Quantum Algorithms for Cryptographically Significant Boolean Functions: An IBMQ Experience

Tharrmashastha Sapv, Debajyoti Bera, Arpita Maitra +1 more

•Jul 26, 2021•4 citations

Grover-based ashenhurst-curtis decomposition using quantum language quipper

LiYiwei, TsaiEdison, PerkowskiMarek +1 more

Functional decomposition plays a key role in several areas such as system design, digital circuits, database systems, and Machine Learning. This paper presents a novel quantum computing approach ba...

Quantum Information and Computation•Feb 1, 2019•0 citations
Functional decomposition plays a key role in several areas such as system design, digital circuits, database systems, and Machine Learning. This paper presents a novel quantum computing approach based on Grover’s search algorithm for a generalized Ashenhurst-Curtis decomposition. The method models the decomposition problem as a search problem and constructs the oracle circuit based on the set-theoretic partition algebra. A hybrid quantum-based algorithm takes advantage of the quadratic speedup achieved by Grover’s search algorithm with quantum oracles for finding the minimum-cost decomposition. The method is implemented and simulated in the quantum programming language Quipper. This work constitutes the first attempt to apply quantum computing to functional decomposition.
Quipper is a recently released quantum programming language. In this report, we explore Quipper's programming framework by implementing the Deutsch's, Deutsch-Jozsa's, Simon's, Grover's, and Shor's factoring algorithms. It will help new quantum programmers in an instructive manner. We choose Quipper especially for its usability and scalability though it's an ongoing development project. We have also provided introductory concepts of Quipper and prerequisite backgrounds of the algorithms for readers' convenience. We also have written codes for oracles (black boxes or functions) for individual algorithms and tested some of them using the Quipper simulator to prove correctness and introduce the readers with the functionality. As Quipper 0.5 does not include more than \ensuremath{4 \times 4} matrix constructors for Unitary operators, we have also implemented \ensuremath{8 \times 8} and \ensuremath{16 \times 16} matrix constructors.