Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Applied Physics

Fault tolerance calculations for clocked quantum-dot cellular automata devices

Mahfuza Khatun, Travis Barclay, Ioan Sturzu, P. Douglas Tougaw

Published Nov 1, 2005• 19 citations
Publisher

Abstract

We present a numerical study of fault tolerance properties in quantum-dot cellular automata (QCA) devices. A full-basis quantum method is used for calculations of the Hamiltonian, and a statistical model has been introduced to simulate the influence of position defects of the dots within cells on the logical output. Combined effects of temperature and cell defects on a shift register have been studied. Uniform and normal distributions have been used for the cell defect simulations. Normal distribution simulations produce realistic results compared to the uniform distribution. In order to show the operational limit of a device, parameters such as “displacement factor” and “success rate” are introduced. Results show that the fault tolerance of a QCA device is strongly dependent on temperature as well as on the cell defects. The robustness of a shift register is also dependent on the size of the device.

DOI
10.1063/1.2128473

Related papers

Variational quantum eigensolver models of molecular quantum dot cellular automata

Nischal Binod Gautam, Enrique Pacis Blair

Molecular quantum-dot cellular automata (QCA) may provide low-power, high-speed computational hardware for processing classical information. Simulation and modeling play an important role in the design of QCA circuits because fully coherent models of QCA scale exponentially with the number of devices, and such models are severely limited in size. For larger circuits, approximations become necessary. In the era of fault-tolerant quantum computation, however, it may become possible to model large QCA circuits without such limitations. This work explores the use of the noisy-intermediate scale quantum (NISQ) variational quantum eigensolver (VQE) method for estimating the ground state of QCA circuits. This is relevant because the computational result of a QCA calculation is encoded in the circuit’s ground state. In this study, VQE is used to model logic circuits, including binary wires, inverters, and majority gates. VQE models are performed by ideal simulators, noisy simulators, and actual quantum hardware. This study demonstrates that VQE may indeed be used to model molecular QCA circuits. It is observed that using modern NISQ hardware, results are still quite sensitive to noise, so measures should be taken to minimize noise. These include simplifying the ansatz circuit whenever possible and using low-noise hardware.

arXiv:2510.12656•Journal of Applied Physics•Jan 9, 2026•0 citations

The fault-tolerance study of QCA adder based on probability model

Huang Hong-Tu, Li Cai, Yang Xiao-Kuo +2 more

The probability models of 2 different quantum cellular automaton (QCA) adders are based on the theory of probabilistic transfer matrix and circuit partition. The effect of individual component on the overall fault-tolerance is fully analyzed at the same level. The simulation shows that the effect of the wire is minor when the success probability is low, while the overall fault-tolerance rises sharply once the success probability is high. And the inverter is considered to be a major factor that affects the overall fault-tolerance in the variation range of parameter. Frobenbius norm of the overall error probabilistic transfer matrix is employed to study the fault-tolerance difference. The result shows that the overall fault-tolerance of QCA adder consisting of 5-input majority is superior to the other. Such fault-tolerance analyses should be used for a better characterization of QCA circuit design and fault-tolerance improvement.

Acta Physica Sinica•Jan 1, 2012•0 citations

Repositioning Quantum Cellular Automata for Dependable Quantum-Classical Systems

Nicholas H. Stapleton, Vicente Leyton‐Ortega

Quantum Cellular Automata (QCA) provides a structured model of distributed quantum computation with inherent locality and regularity properties that are suited to dependable execution. However, QCA remain largely absent from discussions on reproducibility, fault management, and orchestration in heterogeneous quantum-classical systems. We propose a dual-axis framework that situates QCA within both computation and physical realizability, revealing regions where robust, scalable, and hardware-constrained quantum dynamics may reside. By revisiting prior results through the lens of reproducibility and architecture resilience, we suggest that QCA offers a potential substrate for benchmarking and system-level co-design.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Quantum cellular automata: the physics of computing with arrays of quantum dot molecules

Craig S. Lent, P. Douglas Tougaw, Wolfgang Porod

We discuss the fundamental limits of computing using a new paradigm for quantum computation, cellular automata composed of arrays of coulombically coupled quantum dot molecules, which we term quantum cellular automata (QCA). Any logical or arithmetic operation can be performed in this scheme. QCA's provide a valuable concrete example of quantum computation in which a number of fundamental issues come to light. We examine the physics of the computing process in this paradigm. We show to what extent thermodynamic considerations impose limits on the ultimate size of individual QCA arrays. Adiabatic operation of the QCA is examined and the implications for dissipationless computing are explored.>

Workshop on Physics and Computation (PhysComp)•Dec 17, 2002•196 citations

Quantum-Dot Cellular Automata for Arithmetic Circuits: A Novel Approach to Adders, Subtractors and Comparators

B. L. Lavanya, Durga Prasad

The design of arithmetic and logical unit is a crucial block schematic of quantum computing, which has gained popularity in recent years. While division is a successive subtraction, a logical multiplier employs the technique of successive addition, which are the essential blocks of the quantum computing. The key components including comparator design, adders, and subtractors are considered with the help of Quantum-Dot Cellular Automata (QCA) in this work. Such essential blocks of the Arithmetic Logic Unit (ALU) are designed, implemented, and tested in the simulation using QCADesigner version 2.0.3. The results are found to be appealing with the standard truth tables of the above logical circuits. Hence, the designs could be utilized in the practical applications of Internet of Things, Block chains and Cryptographic solutions catering to the challenges of industry, healthcare and finance sectors. Addressing challenges such as a reduced number of qubits and complexity reduction could make way for more robust and practical ALU designs in QCA-based quantum systems. In the proposed novel work, the number of qubits required has been reduced to 24, offering a notable reduction compared to several recent approaches. Hence, the novelty of the work lies in the architectural-level reorganization and logic-level minimization strategy, which collectively enable a significant reduction in design complexity (up to 93%) without introducing additional fabrication or simulation overhead, optimizing clock zone assignments to enhance timing efficiency.

International Conference on Data Science and Network Security (ICDSNS)•Jul 25, 2025•1 citation

Quantum Cellular Automata for Simulation of Complex Systems

Jincheng Zhang

This paper explores the potential of Quantum Cellular Automata (QCA) for simulating complex systems with enhanced efficiency compared to their classical counterparts. Classical Cellular Automata (CCA) face limitations when modeling systems exhibiting quantum phenomena or requiring computational power for intricate simulations. QCA, leveraging the principles of quantum mechanics, offers a fundamentally different approach. This work details the design of a QCA where cells are represented by qubits, and the governing rules are defined by quantum gates. The core argument presented is that QCA's inherent parallelism and superposition capabilities can lead to significant speedups in simulating complex systems. This research proposes a novel methodology for applying QCA to various complex systems, highlighting its potential advantages and exploring the theoretical foundations underpinning this approach. The investigation focuses on the theoretical aspects of QCA design and simulation, without the need for experimental validation.

•Sep 6, 2026•0 citations
We present a numerical study of fault tolerance properties in quantum-dot cellular automata (QCA) devices. A full-basis quantum method is used for calculations of the Hamiltonian, and a statistical model has been introduced to simulate the influence of position defects of the dots within cells on the logical output. Combined effects of temperature and cell defects on a shift register have been studied. Uniform and normal distributions have been used for the cell defect simulations. Normal distribution simulations produce realistic results compared to the uniform distribution. In order to show the operational limit of a device, parameters such as “displacement factor” and “success rate” are introduced. Results show that the fault tolerance of a QCA device is strongly dependent on temperature as well as on the cell defects. The robustness of a shift register is also dependent on the size of the device.
Molecular quantum-dot cellular automata (QCA) may provide low-power, high-speed computational hardware for processing classical information. Simulation and modeling play an important role in the design of QCA circuits because fully coherent models of QCA scale exponentially with the number of devices, and such models are severely limited in size. For larger circuits, approximations become necessary. In the era of fault-tolerant quantum computation, however, it may become possible to model large QCA circuits without such limitations. This work explores the use of the noisy-intermediate scale quantum (NISQ) variational quantum eigensolver (VQE) method for estimating the ground state of QCA circuits. This is relevant because the computational result of a QCA calculation is encoded in the circuit’s ground state. In this study, VQE is used to model logic circuits, including binary wires, inverters, and majority gates. VQE models are performed by ideal simulators, noisy simulators, and actual quantum hardware. This study demonstrates that VQE may indeed be used to model molecular QCA circuits. It is observed that using modern NISQ hardware, results are still quite sensitive to noise, so measures should be taken to minimize noise. These include simplifying the ansatz circuit whenever possible and using low-noise hardware.
The probability models of 2 different quantum cellular automaton (QCA) adders are based on the theory of probabilistic transfer matrix and circuit partition. The effect of individual component on the overall fault-tolerance is fully analyzed at the same level. The simulation shows that the effect of the wire is minor when the success probability is low, while the overall fault-tolerance rises sharply once the success probability is high. And the inverter is considered to be a major factor that affects the overall fault-tolerance in the variation range of parameter. Frobenbius norm of the overall error probabilistic transfer matrix is employed to study the fault-tolerance difference. The result shows that the overall fault-tolerance of QCA adder consisting of 5-input majority is superior to the other. Such fault-tolerance analyses should be used for a better characterization of QCA circuit design and fault-tolerance improvement.
Quantum Cellular Automata (QCA) provides a structured model of distributed quantum computation with inherent locality and regularity properties that are suited to dependable execution. However, QCA remain largely absent from discussions on reproducibility, fault management, and orchestration in heterogeneous quantum-classical systems. We propose a dual-axis framework that situates QCA within both computation and physical realizability, revealing regions where robust, scalable, and hardware-constrained quantum dynamics may reside. By revisiting prior results through the lens of reproducibility and architecture resilience, we suggest that QCA offers a potential substrate for benchmarking and system-level co-design.
We discuss the fundamental limits of computing using a new paradigm for quantum computation, cellular automata composed of arrays of coulombically coupled quantum dot molecules, which we term quantum cellular automata (QCA). Any logical or arithmetic operation can be performed in this scheme. QCA's provide a valuable concrete example of quantum computation in which a number of fundamental issues come to light. We examine the physics of the computing process in this paradigm. We show to what extent thermodynamic considerations impose limits on the ultimate size of individual QCA arrays. Adiabatic operation of the QCA is examined and the implications for dissipationless computing are explored.>
The design of arithmetic and logical unit is a crucial block schematic of quantum computing, which has gained popularity in recent years. While division is a successive subtraction, a logical multiplier employs the technique of successive addition, which are the essential blocks of the quantum computing. The key components including comparator design, adders, and subtractors are considered with the help of Quantum-Dot Cellular Automata (QCA) in this work. Such essential blocks of the Arithmetic Logic Unit (ALU) are designed, implemented, and tested in the simulation using QCADesigner version 2.0.3. The results are found to be appealing with the standard truth tables of the above logical circuits. Hence, the designs could be utilized in the practical applications of Internet of Things, Block chains and Cryptographic solutions catering to the challenges of industry, healthcare and finance sectors. Addressing challenges such as a reduced number of qubits and complexity reduction could make way for more robust and practical ALU designs in QCA-based quantum systems. In the proposed novel work, the number of qubits required has been reduced to 24, offering a notable reduction compared to several recent approaches. Hence, the novelty of the work lies in the architectural-level reorganization and logic-level minimization strategy, which collectively enable a significant reduction in design complexity (up to 93%) without introducing additional fabrication or simulation overhead, optimizing clock zone assignments to enhance timing efficiency.
This paper explores the potential of Quantum Cellular Automata (QCA) for simulating complex systems with enhanced efficiency compared to their classical counterparts. Classical Cellular Automata (CCA) face limitations when modeling systems exhibiting quantum phenomena or requiring computational power for intricate simulations. QCA, leveraging the principles of quantum mechanics, offers a fundamentally different approach. This work details the design of a QCA where cells are represented by qubits, and the governing rules are defined by quantum gates. The core argument presented is that QCA's inherent parallelism and superposition capabilities can lead to significant speedups in simulating complex systems. This research proposes a novel methodology for applying QCA to various complex systems, highlighting its potential advantages and exploring the theoretical foundations underpinning this approach. The investigation focuses on the theoretical aspects of QCA design and simulation, without the need for experimental validation.