A Method of Majority Logic Reduction for Quantum Cellular Automata
The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
The basic Boolean primitive in quantum cellular automata (QCA) is the majority gate. In this paper, a method for reducing the number of majority gates required for computing three-variable Boolean functions is developed to facilitate the conversion of sum-of-products expression into QCA majority logic. Thirteen standard functions are introduced to represent all three-variable Boolean functions and the simplified majority expressions corresponding to these standard functions are presented. We describe a novel method for using these standard functions to convert the sum-of-products expression to majority logic. By applying this method, the hardware requirements for a QCA design can be reduced. As an example, a 1-bit QCA adder is constructed with only three majority gates and two inverters. The adder is designed and simulated using QCADesigner, a design and simulation tool for QCA. We will show that the proposed method is very efficient and fast in deriving the simplified majority expressions in QCA design.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Logic Minimization Algorithms for VLSI Synthesis
Brayton, R. K., Hachtel, G. D., McMullen, C. T., & Sangiovanni-Vincentelli, A. L. (1984) · Kluwer international series in engineering and computer science · doi:10.1007/978-1-4613-2821-6 · Cited by 2,070
Lent, C. S., Tougaw, P. D., Porod, W., & Bernstein, G. H. (1993) · Nanotechnology · doi:10.1088/0957-4484/4/1/004 · Cited by 1,793
Logical devices implemented using quantum cellular automata
Tougaw, P. D., & Lent, C. S. (1994) · Journal of Applied Physics · doi:10.1063/1.356375 · Cited by 1,276
A device architecture for computing with quantum dots
Lent, C. S., & Tougaw, P. D. (1997) · Proceedings of the IEEE · doi:10.1109/5.573740 · Cited by 1,273
Digital Logic Gate Using Quantum-Dot Cellular Automata
Amlani, I., Orlov, A. O., Toth, G., Bernstein, G. H., Lent, C. S., & Snider, G. L. (1999) · Science · doi:10.1126/science.284.5412.289 · Cited by 603
Quasiadiabatic switching for metal-island quantum-dot cellular automata
Tóth, G., & Lent, C. S. (1999) · Journal of Applied Physics · doi:10.1063/1.369063 · Cited by 242
Nanotechnology: basic science and emerging technologies
(2003) · Choice Reviews Online · doi:10.5860/choice.40-3423 · Cited by 207
Experimental demonstration of a binary wire for quantum-dot cellular automata
Orlov, A. O., Amlani, I., Toth, G., Lent, C. S., Bernstein, G. H., & Snider, G. L. (1999) · Applied Physics Letters · doi:10.1063/1.124043 · Cited by 181
Experimental demonstration of a leadless quantum-dot cellular automata cell
Amlani, I., Orlov, A. O., Kummamuru, R. K., Bernstein, G. H., Lent, C. S., & Snider, G. L. (2000) · Applied Physics Letters · doi:10.1063/1.127103 · Cited by 146
Experimental demonstration of clocked single-electron switching in quantum-dot cellular automata
Orlov, A. O., Amlani, I., Kummamuru, R. K., Ramasubramaniam, R., Tóth, G., Lent, C. S., Bernstein, G. H., & Snider, G. L. (2000) · Applied Physics Letters · doi:10.1063/1.126955 · Cited by 125
A memory design in QCAs using the SQUARES formalism
Berzon, D., & Fountain, T. J. (2003) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1109/glsv.1999.757402 · Cited by 85
Quantum-Dot Devices and Quantum-Dot Cellular Automata
Porod, W. (1997) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127497001606 · Cited by 79
Correlation and coherence in quantum-dot cellular automata
Tóth, G. (2000) · Cited by 52
Cited by
Adder Designs and Analyses for Quantum-Dot Cellular Automata
Cho, H., & Swartzlander, E. E. (2007) · IEEE Transactions On Nanotechnology · doi:10.1109/tnano.2007.894839 · Cited by 313
Metadata
- Authors
- Zhang, R., Walus, K., Wang, W., & Jullien, G. A.
- Venue
- IEEE Transactions On Nanotechnology
- Published
- 2004-12
- Volume
- 3
- Issue
- 4
- Pages
- 443-450
- ISSN
- 1536-125X (ISSN-L)
- OpenAlex
- W2138040286
- Cited by
- 392
- References
- 13
- FWCI
- 9.86
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.