Efficient and scalable designs for ternary quantum reversible multiplexer and demultiplexer systems

Abstract In recent years, ternary reversible logic has become a promising paradigm for advancing low-power, high-performance quantum digital systems that preserve information and are energy efficient. This paper focuses on two primary objectives: first, the efficient realization of ternary reversible $$3 \times 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>3</mml:mn> <mml:mo>×</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> multiplexers and $$1 \times 3$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>×</mml:mo> <mml:mn>3</mml:mn> </mml:mrow> </mml:math> demultiplexers using quantum gates, specifically 1-qutrit Shift and 3-qutrit Controlled Feynman gates, and second, the design of generalized $$n \times 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>×</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> multiplexers and $$1 \times n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>×</mml:mo> <mml:mi>n</mml:mi> </mml:mrow> </mml:math> demultiplexers. The proposed $$9 \times 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>9</mml:mn> <mml:mo>×</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> multiplexer we propose in this study has demonstrated notable improvements in terms of quantum cost (20%), depth (18%), number of constant inputs (60%), and garbage outputs (30%), while the proposed $$1 \times 9$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>×</mml:mo> <mml:mn>9</mml:mn> </mml:mrow> </mml:math> demultiplexer shows a 20% reduction in quantum cost, a 18% reduction in depth, a 33% reduction in constant inputs, and a 50% reduction in garbage outputs, compared to the most efficient existing designs. These optimizations represent an important step forward in the development of more efficient ternary and quantum reversible logic circuits, advancing the scalability of quantum systems.

Authors

Institutions

Publication Details

Journal
Quantum Information Processing
Published
2025-09-23
DOI
https://doi.org/10.1007/s11128-025-04927-y
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient and scalable designs for ternary quantum reversible multiplexer and demultiplexer systems

Majid Haghparast, Andrea Bombarda, Asma Taheri Monfared, Angelo Gargantini
1 citations
Quantum Information Processing
Quantum Computing Algorithms and Architecture
2.48
article

Efficient and scalable designs for ternary quantum reversible multiplexer and demultiplexer systems

Majid Haghparast, Andrea Bombarda, Asma Taheri Monfared, Angelo Gargantini
article en
1 citations

Abstract

Abstract In recent years, ternary reversible logic has become a promising paradigm for advancing low-power, high-performance quantum digital systems that preserve information and are energy efficient. This paper focuses on two primary objectives: first, the efficient realization of ternary reversible $$3 \times 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>3</mml:mn> <mml:mo>×</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> multiplexers and $$1 \times 3$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>×</mml:mo> <mml:mn>3</mml:mn> </mml:mrow> </mml:math> demultiplexers using quantum gates, specifically 1-qutrit Shift and 3-qutrit Controlled Feynman gates, and second, the design of generalized $$n \times 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>×</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> multiplexers and $$1 \times n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>×</mml:mo> <mml:mi>n</mml:mi> </mml:mrow> </mml:math> demultiplexers. The proposed $$9 \times 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>9</mml:mn> <mml:mo>×</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> multiplexer we propose in this study has demonstrated notable improvements in terms of quantum cost (20%), depth (18%), number of constant inputs (60%), and garbage outputs (30%), while the proposed $$1 \times 9$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>×</mml:mo> <mml:mn>9</mml:mn> </mml:mrow> </mml:math> demultiplexer shows a 20% reduction in quantum cost, a 18% reduction in depth, a 33% reduction in constant inputs, and a 50% reduction in garbage outputs, compared to the most efficient existing designs. These optimizations represent an important step forward in the development of more efficient ternary and quantum reversible logic circuits, advancing the scalability of quantum systems.

Quantum Information ProcessingVol. 24(10)
University of Bergamo (IT), University of Jyväskylä (FI)
Università degli studi di Bergamo, Business Finland
Openalex Percentile: Top 8%
Quantum Computing Algorithms and Architecture
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.