Automated Design Architecture for 1-D Cellular Automata Using Quantum Cellular Automata
The DOI matches its Crossref record; 81 of the 86 references it cites were found in a registry or an index.
Abstract
Cellular automata (CAs) have been widely used to model and simulate physical systems and processes. CAs have also been successfully used as a VLSI architecture that proved to be very efficient at least in terms of silicon-area utilization and clock-speed maximization. Quantum cellular automata (QCAs) as one of the promising emerging technologies for nanoscale and quantum computing circuit implementation, provides very high scale integration, very high switching frequency and extremely low power characteristics. In this paper we present a new automated design architecture and a tool, namely DATICAQ (Design Automation Tool of 1-D CAs using QCAs), that builds a bridge between 1-D CAs as models of physical systems and processes and 1-D QCAs as nanoelectronic architecture. The QCA implementation of CAs not only drives the already developed CAs circuits to the nanoelectronics era but improves their performance significantly. The inputs of the proposed architecture are CA dimensionality, size, local rule, and initial and boundary conditions imposed by the particular problem. DATICAQ produces as output the layout of the QCA implementation of the particular 1-D CA model. Simulations of CA models for zero and periodic boundary conditions and the corresponding QCA circuits showed that the CA models have been successfully implemented.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Theory of Self-Reproducing Automata
Schwartz, J. T., von Neumann, J., & Burks, A. W. (1967) · Mathematics of Computation · doi:10.2307/2005041 · Cited by 5,422
Theory and Applications of Cellular Automata
Wolfram, S. (1986) · Cited by 1,971
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
QCADesigner: A Rapid Design and Simulation Tool for Quantum-Dot Cellular Automata
Walus, K., Dysart, T. J., Jullien, G. A., & Budiman, R. A. (2004) · IEEE Transactions On Nanotechnology · doi:10.1109/tnano.2003.820815 · Cited by 1,106
Cellular Automata Modeling of Physical Systems
Chopard, B., & Droz, M. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511549755 · Cited by 1,043
Realization of a Functional Cell for Quantum-Dot Cellular Automata
Orlov, A. O., Amlani, I., Bernstein, G. H., Lent, C. S., & Snider, G. L. (1997) · Science · doi:10.1126/science.277.5328.928 · Cited by 640
Additive Cellular Automata: Theory and Applications
Chaudhuri, P. P., Chowdhury, D. R., Nandi, S., & Chattopadhyay, S. (1997) · Cited by 471
Molecular Quantum-Dot Cellular Automata
Lent, C. S., Isaksen, B., & Lieberman, M. (2003) · Journal of the American Chemical Society · doi:10.1021/ja026856g · Cited by 444
Research works printed but not linked: 5
- wolfram, 2002, A New Kind of Science
- 10.1109/DAC.2000.855308 · doi:10.1109/dac.2000.855308
- bubna, 0, Designing cellular automata structures using quantum-dot cellular automata, 14th Annu IEEE Int Conf High Performance Comput
- kim, 0, Towards designing robust QCA architectures in the presence of sneak noise paths, Proc Des Autom Test Eur, 1214
- mardiris, 0, Design and simulation of modular 2n to 1 quantum-dot cellular automata (QCA) multiplexers, Int J Circ Theor Appl
Cited by
Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
Mitigating 5G security challenges for next-gen industry using quantum computing
Mangla, C., Rani, S., Qureshi, N. M. F., & Singh, A. D. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2022.07.009 · Cited by 71
On Routine Evolution of Complex Cellular Automata
Bidlo, M. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2516242 · Cited by 23
Hyperspectral Anomaly Detection via Image Super-Resolution Processing and Spatial Correlation
Li, Z., & Zhang, Y. (2020) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2020.3005924 · Cited by 23
Threshold Function Identification by Redundancy Removal and Comprehensive Weight Assignments
Liu, C.-H., Lin, C.-C., Chen, Y., Wu, C., Wang, C.-Y., & Yamashita, S. (2018) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2018.2878181 · Cited by 14
Image encryption and decryption using exclusive-OR based on ternary value logic
Zakaria, S. B., & Navi, K. (2022) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2022.108021 · Cited by 10
Cellular Automata Applications in Shortest Path Problem
Tsompanas, M., Dourvas, N. I., Ioannidis, K., Sirakoulis, G. C., Hoffmann, R., & Adamatzky, A. (2018) · Emergence, complexity and computation · doi:10.1007/978-3-319-77510-4_8 · Cited by 10
Self-citationCellular Automata Hardware Implementation
Sirakoulis, G. C. (2018) · Springer eBooks · doi:10.1007/978-3-642-27737-5_673-1 · Cited by 8
Self-citationCellular Automata Hardware Implementation
Sirakoulis, G. C. (2018) · Springer eBooks · doi:10.1007/978-1-4939-8700-9_673 · Cited by 8
Self-citationA Constructive Approach for Threshold Function Identification
Li, M.-J., Yen, Y. L., Li, Y., Chen, Y., & Wang, C.-Y. (2023) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/3606371 · Cited by 3
Makarenko, A. S. (2020) · WSEAS Transactions on Information Science and Applications archive · doi:10.37394/23209.2020.17.8 · Cited by 3
Energy Analysis of Metal QCA Circuits Behavior Based on Particle-Wave Duality
Shirichian, M., Akbari‐Hasanjani, R., & Sabbaghi‐Nadooshan, R. (2022) · IETE Journal of Research · doi:10.1080/03772063.2022.2048701 · Cited by 2
9-Input Threshold Function Identification Using a New Necessary Condition of Threshold Function
Yen, Y. L., Li, M.-J., Li, Y., Chen, Y., Chen, I., & Wang, C.-Y. (2024) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2024.3399664 · Cited by 2
Comparison of Evolutionary Development of Cellular Automata Using Various Representations
Bidlo, M. (2019) · MENDEL · doi:10.13164/mendel.2019.1.095 · Cited by 2
Design and Implementation of Cellular Automata Computing Architectures
Chatzinikolaou, T. P., Tompris, I., Passias, A., Stavroulakis, E., Chatzipaschalis, I. K., Tsipas, E., Τσάκαλος, Κ.-Α., Karamani, R.-E., Rallis, K., Fyrigos, I.-A., et al. (2025) · Emergence, complexity and computation · doi:10.1007/978-3-031-81097-8_13 · Cited by 1
Self-citationOn Reduction of Computations for Threshold Function Identification
Hsu, W.-C., Lin, C.-C., Li, Y., Chen, Y., & Wang, C.-Y. (2021) · IEEE International System-on-Chip Conference (SOCC) · doi:10.1109/socc52499.2021.9739224 · Cited by 1
Advances in the Evolution of Complex Cellular Automata
Bidlo, M. (2018) · Studies in computational intelligence · doi:10.1007/978-3-319-99283-9_7 · Cited by 1
Metadata
- Authors
- Mardiris, V. A., Sirakoulis, G. C., & Karafyllidis, I. G.
- Affiliations
- Technological Educational Institute of Eastern Macedonia and Thrace (GR)
- Democritus University of Thrace (GR)
- Venue
- IEEE Transactions on Computers
- Published
- 2015-09-01
- Volume
- 64
- Issue
- 9
- Pages
- 2476-2489
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W1986622474
- Cited by
- 17
- References
- 86
- Citations by year
- 2025: 1 · 2024: 1 · 2023: 1 · 2022: 3 · 2021: 1 · 2020: 2 · 2019: 2 · 2018: 5 · 2016: 1
- FWCI
- 0.34
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Computers (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Cellular Automata and Applications
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Quantum-Dot Cellular Automata
- Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing
- Keywords
- quantum cellular automata, VLSI architecture, local rules, periodic boundary conditions, zero boundary conditions, low-power circuits
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.