Nearest-Neighbor and Fault-Tolerant Quantum Circuit Implementation

Biswal, Laxmidhar; Bandyopadhyay, Chandan; Chattopadhyay, Anupam; Wille, Robert; Drechsler, Rolf; Rahaman, Hafizur

doi:10.1109/ismvl.2016.48

Cited by 15 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is noteworthy to say that an equivalent fault-tolerant quantum architecture of conventional 1:2 and 2:4 decoder could be realized from proposed NCV-based quantum circuit of R-decoder by mapping all those CV/CV † into the universal transversal gate set viz. Clifford + T-group [22] followed by cancelation of redundancy gates using optimization algorithms like removal of two adjacent H-gate as net effect is identity. Now, apply inter-gate transfer relationship between NCV, and Clifford + T-group as depicted in Figure 1 and map each CV/C † into the equivalent Clifford + T-based fault-tolerant structure followed by optimization algorithms are adhered.…”

Section: Fault-tolerant Quantum Circuit Implementation Of 1:2 and 2:4-decodermentioning

confidence: 99%

“…It is noteworthy to say that an equivalent fault‐tolerant quantum architecture of conventional 1:2 and 2:4 decoder could be realized from proposed NCV‐based quantum circuit of R‐decoder by mapping all those CV / CV † into the universal transversal gate set viz. Clifford + T ‐group [22] followed by cancelation of redundancy gates using optimization algorithms like removal of two adjacent H ‐gate as net effect is identity.…”

Section: Proposed Techniquementioning

confidence: 99%

“…Definition (Clifford + T ‐group) . It is a set of universal transversal primitive gates, which contains CNOT‐gate with 1‐qubit H‐gate, S‐gate, Pauli (X, Y, Z) ‐gate, and non‐Clifford T‐gate [22]. Any design on NCV gate library [23] can be mapped to the Clifford + T‐group by using the identities presented in Figure 1.…”

Section: Introductionmentioning

confidence: 99%

“…(c) Equivalent Clifford + T‐based realization of 2a as depicted in Ref. [22, 1(c)]. (d) Equivalent unit T‐depth based realization of 2a as depicted in Ref.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Fault‐tolerant quantum implementation of conventional decoder logic with enable input

Biswal

Mondal

Rahaman

2021

IET Circuits, Devices & Syst

Self Cite

View full text Add to dashboard Cite

Decoherence is the greatest obstacle to the physical realization of scalable quantum computer, jeopardises coherent superposition of the qubit, and makes qubit extremely fragile. Quantum Error Correction Code (QECC), and Fault-tolerant quantum computation collectively could protect qubit and improve scalability. On the other hand, the conventional logic circuit is no more useful in quantum computing due to much difference from quantum logic. However, quantum computer has to perform classical tasks which can be addressed by translating to its equivalent quantum algorithm. Herein, zerogarbage-based reversible and fault-tolerant quantum circuit for 1 : 2, and 2 : 4 Decoder with enable signal using Clifford + T-group are proposed. Further, the design approach to implement n : 2 n decoder on fault-tolerant quantum logic in linear T − depth is extended. Besides, performance parameters likely T − count, T − depth, and garbage output have been evaluated for n : 2 n decoder. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

show abstract

Section: Fault-tolerant Quantum Circuit Implementation Of 1:2 and 2:4-decodermentioning

confidence: 99%

Section: Proposed Techniquementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…(c) Equivalent Clifford + T‐based realization of 2a as depicted in Ref. [22, 1(c)]. (d) Equivalent unit T‐depth based realization of 2a as depicted in Ref.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Fault‐tolerant quantum implementation of conventional decoder logic with enable input

Biswal

Mondal

Rahaman

2021

IET Circuits, Devices & Syst

Self Cite

View full text Add to dashboard Cite

show abstract

“…In parallel to the previous works, efficient LNN circuit construction has been studied for important quantum benchmarks, such as, quantum error correction [11] for Clifford+T gates [12]. In this work, we are primarily interested in the automated flow and for generic quantum circuits.…”

Section: Introductionmentioning

confidence: 99%

Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies

Bhattacharjee¹,

Chattopadhyay²

2017

Preprint

Self Cite

View full text Add to dashboard Cite

A significant hurdle towards realization of practical and scalable quantum computing is to protect the quantum states from inherent noises during the computation. In physical implementation of quantum circuits, a long-distance interaction between two qubits is undesirable since, it can be interpreted as a noise. Therefore, multiple quantum technologies and quantum error correcting codes strongly require the interacting qubits to be arranged in a nearest neighbor (NN) fashion. The current literature on converting a given quantum circuit to an NN-arranged one mainly considered chained qubit topologies or Linear Nearest Neighbor (LNN) topology. However, practical quantum circuit realizations, such as Nuclear Magnetic Resonance (NMR), may not have an LNN topology. To address this gap, we consider an arbitrary qubit topology. We present an Integer Linear Programming (ILP) formulation for achieving minimal logical depth while guaranteeing the nearest neighbor arrangement between the interacting qubits. We substantiate our claim with studies on diverse network topologies and prominent quantum circuit benchmarks.

show abstract