scispace - formally typeset
Search or ask a question
Topic

Fredkin gate

About: Fredkin gate is a research topic. Over the lifetime, 314 publications have been published within this topic receiving 5769 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: A simple optical model to realize a reversible, potentially error-free logic gate a Fredkin gate is discussed, where the device dissipates no energy and makes use of the Kerr nonlinearity to produce intensity-dependent phase shifts.
Abstract: A simple optical model to realize a reversible, potentially error-free logic gate---a Fredkin gate---is discussed. The device dissipates no energy and makes use of the Kerr nonlinearity to produce intensity-dependent phase shifts. The analysis shows that quantum mechanics permits the operation of error-free logic gates which dissipate no energy. However, even though the device is nondissipative, error-free performance only occurs under particular operating conditions.

369 citations

Proceedings ArticleDOI
01 Oct 2006
TL;DR: A class of reversible logic gates is introduced (consisting of the well-known Fredkin gate and a newly defined Feynman double-gate) for which the parity of the outputs matches that of the inputs that allow any fault that affects no more than a single logic signal to be detectable at the circuit's primary outputs.
Abstract: Reversible hardware computation, that is, performing logic signal transforimations in a way that allows the original input signals to be recovered from the produced outputs, is helpful in diverse areas such as quantum computing, low-power design, nanotechnology, optical information processing, and bioinformatics. We propose a paradigm for performing such reversible computations in a manner that renders a wide class of circuit faults readily detectable at the circuit's outputs. More specifically, we introduce a class of reversible logic gates (consisting of the well-known Fredkin gate and a newly defined Feynman double-gate) for which the parity of the outputs matches that of the inputs. Such parity-preserving reversible gates, when used with an arbitrary synthesis strategy for reversible logic circuits, allow any fault that affects no more than a single logic signal to be detectable at the circuit's primary outputs. We show the applicability of our design strategy by demonstrating how the well-known, and very useful, Toffoli gate can be synthesized from parity-preserving gates and apply the results to the design of a binary full-adder circuit, which is a versatile and widely used element in digital arithmetic processing.

261 citations

Journal ArticleDOI
TL;DR: An analytic construction of the three-bit quantum conditional swap (Fredkin) gate that uses only five quantum gates, each acting on only two qubits is presented.
Abstract: We present an analytic construction of the three-bit quantum conditional swap (Fredkin) gate that uses only five quantum gates, each acting on only two qubits. Our implementation is based on previous work on the three-bit quantum conditional-NOT (Toffoli) gate. Numerical evidence suggests that this is a minimal implementation. \textcopyright{} 1996 The American Physical Society.

252 citations

Journal ArticleDOI
TL;DR: Novel designs of reversible sequential circuits that are optimized in terms of quantum cost, delay and the garbage outputs are presented and a novel strategy of cascading a Fredkin gate at the outputs of a reversible latch is introduced to realize the designs of the Fredkin Gate based asynchronous set/reset D latch and the master-slave D flip-flop.
Abstract: Reversible logic has shown potential to have extensive applications in emerging technologies such as quantum computing, optical computing, quantum dot cellular automata as well as ultra low power VLSI circuits. Recently, several researchers have focused their efforts on the design and synthesis of efficient reversible logic circuits. In these works, the primary design focus has been on optimizing the number of reversible gates and the garbage outputs. The number of reversible gates is not a good metric of optimization as each reversible gate is of different type and computational complexity, and thus will have a different quantum cost and delay. The computational complexity of a reversible gate can be represented by its quantum cost. Further, delay constitutes an important metric, which has not been addressed in prior works on reversible sequential circuits as a design metric to be optimized. In this work, we present novel designs of reversible sequential circuits that are optimized in terms of quantum cost, delay and the garbage outputs. The optimized designs of several reversible sequential circuits are presented including the D Latch, the JK latch, the T latch and the SR latch, and their corresponding reversible master-slave flip-flop designs. The proposed master-slave flip-flop designs have the special property that they don't require the inversion of the clock for use in the slave latch. Further, we introduce a novel strategy of cascading a Fredkin gate at the outputs of a reversible latch to realize the designs of the Fredkin gate based asynchronous set/reset D latch and the master-slave D flip-flop. Finally, as an example of complex reversible sequential circuits, the reversible logic design of the universal shift register is introduced. The proposed reversible sequential designs were verified through simulations using Verilog HDL and simulation results are presented.

199 citations

Proceedings ArticleDOI
07 Aug 2002
TL;DR: Novel full adder circuits using Fredkin gates are proposed which have lower hardware complexity than the current state-of-the-art, while generating the additional signals required for carry skip adder architectures.
Abstract: Conservative and reversible logic gates are widely known to be compatible with revolutionary computing paradigms such as optical and quantum computing. A fundamental conservative reversible logic gate is the Fredkin gate. This paper presents efficient adder circuits based on the Fredkin gate. Novel full adder circuits using Fredkin gates air proposed which have lower hardware complexity than the current state-of-the-art, while generating the additional signals required for carry skip adder architectures. The traditional ripple carry adder and several carry skip adder topologies are compared. Theoretical performance of each adder is determined and compared. Although the variable sized block carry skip adder is determined to have shorter delay than the fixed block size carry skip adder, the performance gains are not sufficient to warrant the required additional hardware complexity.

180 citations


Network Information
Related Topics (5)
Quantum computer
30K papers, 907.2K citations
77% related
Quantum information
22.7K papers, 911.3K citations
74% related
Open quantum system
20.4K papers, 924.6K citations
72% related
Quantum entanglement
39.5K papers, 1M citations
72% related
Quantum
60K papers, 1.2M citations
70% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20222
202121
202027
20199
201813
201723