Synthesis of quantum arrays from Kronecker Functional Lattice Diagrams

Martin Lukac, Dipal Shah, Marek Perkowski, Michitaka Kameyama

Research output: Contribution to journalArticle

Abstract

Reversible logic is becoming more and more popular due to the fact that many novel technologies such as quantum computing, low power CMOS circuit design or quantum optical computing are becoming more and more realistic. In quantum computing, reversible computing is the main venue for the realization and design of classical functions and circuits. We present a new approach to synthesis of reversible circuits using Kronecker Functional Lattice Diagrams (KFLD). Unlike many of contemporary algorithms for synthesis of reversible functions that use n×n Toffoli gates, our method synthesizes functions using 3 × 3 Toffoli gates, Feynman gates and NOT gates. This reduces the quantum cost of the designed circuit but adds additional ancilla bits. The resulting circuits are always regular in a 4-neighbor model and all connections are predictable. Consequently resulting circuits can be directly mapped in to a quantum device such as quantum FPGA [14]. This is a significant advantage of our method, as it allows us to design optimum circuits for a given quantum technology.

Original languageEnglish
Pages (from-to)2262-2269
Number of pages8
JournalIEICE Transactions on Information and Systems
VolumeE97-D
Issue number9
DOIs
Publication statusPublished - 2014
Externally publishedYes

Fingerprint

Networks (circuits)
Optical data processing
Field programmable gate arrays (FPGA)
Costs

Keywords

  • Kronecker lattices
  • Quantum computing
  • Reversible circuits synthesis

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Artificial Intelligence
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition

Cite this

Synthesis of quantum arrays from Kronecker Functional Lattice Diagrams. / Lukac, Martin; Shah, Dipal; Perkowski, Marek; Kameyama, Michitaka.

In: IEICE Transactions on Information and Systems, Vol. E97-D, No. 9, 2014, p. 2262-2269.

Research output: Contribution to journalArticle

Lukac, Martin ; Shah, Dipal ; Perkowski, Marek ; Kameyama, Michitaka. / Synthesis of quantum arrays from Kronecker Functional Lattice Diagrams. In: IEICE Transactions on Information and Systems. 2014 ; Vol. E97-D, No. 9. pp. 2262-2269.
@article{b74b3e106afa4d97aa8c2f88bcb493f1,
title = "Synthesis of quantum arrays from Kronecker Functional Lattice Diagrams",
abstract = "Reversible logic is becoming more and more popular due to the fact that many novel technologies such as quantum computing, low power CMOS circuit design or quantum optical computing are becoming more and more realistic. In quantum computing, reversible computing is the main venue for the realization and design of classical functions and circuits. We present a new approach to synthesis of reversible circuits using Kronecker Functional Lattice Diagrams (KFLD). Unlike many of contemporary algorithms for synthesis of reversible functions that use n×n Toffoli gates, our method synthesizes functions using 3 × 3 Toffoli gates, Feynman gates and NOT gates. This reduces the quantum cost of the designed circuit but adds additional ancilla bits. The resulting circuits are always regular in a 4-neighbor model and all connections are predictable. Consequently resulting circuits can be directly mapped in to a quantum device such as quantum FPGA [14]. This is a significant advantage of our method, as it allows us to design optimum circuits for a given quantum technology.",
keywords = "Kronecker lattices, Quantum computing, Reversible circuits synthesis",
author = "Martin Lukac and Dipal Shah and Marek Perkowski and Michitaka Kameyama",
year = "2014",
doi = "10.1587/transinf.2013LOP0015",
language = "English",
volume = "E97-D",
pages = "2262--2269",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "9",

}

TY - JOUR

T1 - Synthesis of quantum arrays from Kronecker Functional Lattice Diagrams

AU - Lukac, Martin

AU - Shah, Dipal

AU - Perkowski, Marek

AU - Kameyama, Michitaka

PY - 2014

Y1 - 2014

N2 - Reversible logic is becoming more and more popular due to the fact that many novel technologies such as quantum computing, low power CMOS circuit design or quantum optical computing are becoming more and more realistic. In quantum computing, reversible computing is the main venue for the realization and design of classical functions and circuits. We present a new approach to synthesis of reversible circuits using Kronecker Functional Lattice Diagrams (KFLD). Unlike many of contemporary algorithms for synthesis of reversible functions that use n×n Toffoli gates, our method synthesizes functions using 3 × 3 Toffoli gates, Feynman gates and NOT gates. This reduces the quantum cost of the designed circuit but adds additional ancilla bits. The resulting circuits are always regular in a 4-neighbor model and all connections are predictable. Consequently resulting circuits can be directly mapped in to a quantum device such as quantum FPGA [14]. This is a significant advantage of our method, as it allows us to design optimum circuits for a given quantum technology.

AB - Reversible logic is becoming more and more popular due to the fact that many novel technologies such as quantum computing, low power CMOS circuit design or quantum optical computing are becoming more and more realistic. In quantum computing, reversible computing is the main venue for the realization and design of classical functions and circuits. We present a new approach to synthesis of reversible circuits using Kronecker Functional Lattice Diagrams (KFLD). Unlike many of contemporary algorithms for synthesis of reversible functions that use n×n Toffoli gates, our method synthesizes functions using 3 × 3 Toffoli gates, Feynman gates and NOT gates. This reduces the quantum cost of the designed circuit but adds additional ancilla bits. The resulting circuits are always regular in a 4-neighbor model and all connections are predictable. Consequently resulting circuits can be directly mapped in to a quantum device such as quantum FPGA [14]. This is a significant advantage of our method, as it allows us to design optimum circuits for a given quantum technology.

KW - Kronecker lattices

KW - Quantum computing

KW - Reversible circuits synthesis

UR - http://www.scopus.com/inward/record.url?scp=84906901823&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84906901823&partnerID=8YFLogxK

U2 - 10.1587/transinf.2013LOP0015

DO - 10.1587/transinf.2013LOP0015

M3 - Article

VL - E97-D

SP - 2262

EP - 2269

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 9

ER -