# Q-Map: Quantum Circuit Implementation of Boolean Functions

## TL;DR

This paper introduces Q-Map, a visual technique for implementing classical Boolean functions on quantum computers, aiming to optimize quantum gate usage and facilitate quantum algorithm development.

## Contribution

The paper presents a novel visual method, Q-Map, for efficiently translating Boolean functions into quantum circuits with minimal gates.

## Key findings

- Q-Map effectively reduces quantum gate count.
- The method simplifies quantum circuit design for Boolean functions.
- Q-Map enhances the practicality of quantum logic implementation.

## Abstract

Quantum computing has gained attention in recent years due to the significant progress in quantum computing technology. Today many companies like IBM, Google and Microsoft have developed quantum computers and simulators for research and commercial use. The development of quantum techniques and algorithms is essential to exploit the full power of quantum computers. In this paper we propose a simple visual technique (we call Q-Map) for quantum realisation of classical Boolean logic circuits. The proposed method utilises concepts from Boolean algebra to produce a quantum circuit with minimal number of quantum gates.