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

arXiv:1312.5665

Implementing a Quantum CNOT and Quantum Memory Using a Quantum-Dot Cellular Automata Array

S. Arash Sheikholeslam, Konrad Walus

Published Dec 19, 2013• 0 citations
arXivHTMLPDF

Abstract

In this work, we develop a method to use Quantum- Dot Cellular Automata (QCA) for universal quantum computing. This method is based conceptually on refocusing in NMR systems. We show how an array of QCA cells can be used for isolated single qubit, as well as multi-qubit operations, such as the CNOT, by dividing the cells into active and passive sets such that the active cells undergo the transform while passive cells hold their quantum states. The same technique is used for developing a multi-qubit quantum memory. The effect of imperfect control parameters is discussed and the total time for a typical quantum operation is given. Using this approach, different quantum gates are implemented using pulse sequences applied to the QCA cells via control fields and potentials, while the layout remains the same.

DOI
10.48550/arxiv.1312.5665

Related papers

Entanglement dynamics in one-dimensional quantum cellular automata

Gavin K. Brennen, Jamie Williams

Several proposed schemes for the physical realization of a quantum computer consist of qubits arranged in a cellular array. In the quantum circuit model of quantum computation, an often complex series of two-qubit gate operations is required between arbitrarily distant pairs of lattice qubits. An alternative model of quantum computation based on quantum cellular automata (QCA) requires only homogeneous local interactions that can be implemented in parallel. This would be a huge simplification in an actual experiment. We find some minimal physical requirements for the construction of unitary QCA in a one-dimensional Ising spin chain and demonstrate optimal pulse sequences for information transport and entanglement distribution. We also introduce the theory of nonunitary QCA and show by example that nonunitary rules can generate environment assisted entanglement.

arXiv:quant-ph/0306056•Physical Review A•Oct 13, 2003•61 citations

Quantum Cellular Automata: Theory and Applications

Pérez Delgado, Carlos Alberto Conceição António

This thesis presents a model of Quantum Cellular Automata (QCA). The presented formalism is a natural quantization of the classical Cellular Automata (CA). It is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations. One purpose of this model is to act as a theoretical model of quantum computation, similar to the quantum circuit model. The main advantage that QCA have over quantum circuits is that QCA make considerably fewer demands on the underlying hardware. In particular, as opposed to direct implementations of quantum circuits, the global evolution of the lattice in the QCA model does not assume independent control over individual \emph{qudits}. Rather, all qudits are to be addressed collectively in parallel. The QCA model is also shown to be an appropriate abstraction for space-homogeneous quantum phenomena, such as quantum lattice gases, spin chains and others. Some results that show the benefits of basing the model on local unitary operators are shown: computational universality, strong connections to the circuit model, simple implementation on quantum hardware, and a series of applications. A detailed discussion will be given on one particular application of QCA that lies outside either computation or simulation: single-spin measurement. This algorithm uses the techniques developed in this thesis to achieve a result normally considered hard in physics. It serves well as an example of why QCA are interesting in their own right.

•Sep 26, 2007•4 citations

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

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

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•192 citations

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

All-optical electron spin quantum computer with ancilla bits for operations in each coupled-dot cell

Toshio Ohshima

A cellular quantum computer with a spin qubit and ancilla bits in each cell is proposed. The whole circuit works only with the help of external optical pulse sequences. In the operation, some of the ancilla bits are activated, and autonomous single-and two-qubit operations are made. In the sleep mode of a cell, the decoherence of the qubit is negligibly small. Since only two cells at most are active at once, the coherence can be maintained for a sufficiently long time for practical purposes. A device structure using a coupled-quantum-dot array with possible operation and measurement schemes is also proposed.

arXiv:quant-ph/0002004•Physical Review A•Nov 15, 2000•16 citations

Universal quantum computation with quantum-dot cellular automata in decoherence-free subspace

Zhenyu Xu, Mang Feng, Wei-Min Zhang

We investigate the possibility to have electron-pairs in decoherence-free subspace (DFS), by means of the quantum-dot cellular automata (QCA) and single-spin rotations, to deterministically carry out a universal quantum computation with high-fidelity. We show that our QCA device with electrons tunneling in two dimensions is very suitable for DFS encoding, and argue that our design favors a scalable quantum computation robust to collective dephasing errors.

Quantum Information and Computation•Nov 1, 2008•4 citations
In this work, we develop a method to use Quantum- Dot Cellular Automata (QCA) for universal quantum computing. This method is based conceptually on refocusing in NMR systems. We show how an array of QCA cells can be used for isolated single qubit, as well as multi-qubit operations, such as the CNOT, by dividing the cells into active and passive sets such that the active cells undergo the transform while passive cells hold their quantum states. The same technique is used for developing a multi-qubit quantum memory. The effect of imperfect control parameters is discussed and the total time for a typical quantum operation is given. Using this approach, different quantum gates are implemented using pulse sequences applied to the QCA cells via control fields and potentials, while the layout remains the same.
Several proposed schemes for the physical realization of a quantum computer consist of qubits arranged in a cellular array. In the quantum circuit model of quantum computation, an often complex series of two-qubit gate operations is required between arbitrarily distant pairs of lattice qubits. An alternative model of quantum computation based on quantum cellular automata (QCA) requires only homogeneous local interactions that can be implemented in parallel. This would be a huge simplification in an actual experiment. We find some minimal physical requirements for the construction of unitary QCA in a one-dimensional Ising spin chain and demonstrate optimal pulse sequences for information transport and entanglement distribution. We also introduce the theory of nonunitary QCA and show by example that nonunitary rules can generate environment assisted entanglement.
This thesis presents a model of Quantum Cellular Automata (QCA). The presented formalism is a natural quantization of the classical Cellular Automata (CA). It is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations. One purpose of this model is to act as a theoretical model of quantum computation, similar to the quantum circuit model. The main advantage that QCA have over quantum circuits is that QCA make considerably fewer demands on the underlying hardware. In particular, as opposed to direct implementations of quantum circuits, the global evolution of the lattice in the QCA model does not assume independent control over individual \emph{qudits}. Rather, all qudits are to be addressed collectively in parallel. The QCA model is also shown to be an appropriate abstraction for space-homogeneous quantum phenomena, such as quantum lattice gases, spin chains and others. Some results that show the benefits of basing the model on local unitary operators are shown: computational universality, strong connections to the circuit model, simple implementation on quantum hardware, and a series of applications. A detailed discussion will be given on one particular application of QCA that lies outside either computation or simulation: single-spin measurement. This algorithm uses the techniques developed in this thesis to achieve a result normally considered hard in physics. It serves well as an example of why QCA are interesting in their own right.
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.>
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.
A cellular quantum computer with a spin qubit and ancilla bits in each cell is proposed. The whole circuit works only with the help of external optical pulse sequences. In the operation, some of the ancilla bits are activated, and autonomous single-and two-qubit operations are made. In the sleep mode of a cell, the decoherence of the qubit is negligibly small. Since only two cells at most are active at once, the coherence can be maintained for a sufficiently long time for practical purposes. A device structure using a coupled-quantum-dot array with possible operation and measurement schemes is also proposed.