Optimal T-depth Quantum Circuits for Implementing Arbitrary Boolean Functions Cover

.blurhash-client-img { display: none !important; }

Optimal T-depth Quantum Circuits for Implementing Arbitrary Boolean Functions

Quantum Information & Computation

Volume 25 (2025): Issue 6 (December 2025)

By: Suman Dutta, Anik Basu Bhaumik, Anupam Chattopadhyay and Subhamoy Maitra

Open Access

|Mar 2026

Authors

Suman Dutta

sumand.iiserb@gmail.com

Applied Statistics Unit, Indian Statistical Institute, Kolkata, India

Anik Basu Bhaumik

anikbasu001@e.ntu.edu.sg

College of Computing and Data Science, Nanyang Technological University, Singapore, Singapore

Anupam Chattopadhyay

anupam@ntu.edu.sg

College of Computing and Data Science, Nanyang Technological University, Singapore, Singapore

Subhamoy Maitra

maitra.subhamoy@gmail.com

Applied Statistics Unit, Indian Statistical Institute, Kolkata, India

DOI: https://doi.org/10.2478/qic-2025-0032 | Journal eISSN: 3106-0544 | Journal ISSN: 1533-7146

Journal RSS Feed

Language: English

Page range: 586 - 597

Submitted on: Jun 1, 2025

|

Accepted on: Sep 1, 2025

|

Published on: Mar 9, 2026

Published by: Cerebration Science Publishing Co., Limited

In partnership with: Paradigm Publishing Services

Publication frequency: 1 issue per year

Keywords:

Boolean function,

efficient circuit implementation,

S-box synthesis,

universal gate sets

Related subjects:

Quantum physics,

Applied mathematics,

Computer sciences,

Computer sciences in the humanities,

Computer sciences,

Computer sciences in natural sciences

© 2026 Suman Dutta, Anik Basu Bhaumik, Anupam Chattopadhyay, Subhamoy Maitra, published by Cerebration Science Publishing Co., Limited
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous article Volume 25 (2025): Issue 6 (December 2025)Next article