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

Bulletin of the American Physical Society

Quantum cellular automata for quantum information processing

Robert Raussendorf, Yiyang Gong

Published Mar 24, 2005• 0 citations
OpenAlex

Related papers

Information transport in 1D quantum cellular automata

Gavin K. Brennen, Jamie Williams

APS•May 1, 2003•0 citations

Quantum-cellular-automata pseudorandom maps

Yaakov S. Weinstein, C. Stephen Hellberg

Quantum computation based on quantum-cellular automata (QCA) can greatly reduce the control and precision necessary for experimental implementations of quantum information processing. A QCA system consists of a few species of qubits in which all qubits of a species evolve in parallel. We show that, in spite of its inherent constraints, a QCA system can be used to study complex quantum dynamics. To this aim, we demonstrate scalable operations on a QCA system that fulfill statistical criteria of randomness and explore which criteria of randomness can be fulfilled by operators from various QCA architectures. Other means of realizing random operators with only a few independent operators are also discussed.

arXiv:quant-ph/0401040•Physical Review A•Jun 1, 2004•10 citations

Quantum cellular automata and quantum simulation

Peter J. Love

Bulletin of the American Physical Society•Mar 8, 2007•0 citations

Quantum Cellular Automata

Karoline Wiesner

Springer eBooks•Nov 2, 2011•5 citations

Cryptographic models of nanocommunicaton network using quantum dot cellular automata: A survey

Bikash Debnath, Jadav Chandra Das, Debashis De

Abstract Security of information is an important issue during the transmission of information. The device that performs the encoding and decoding process is called the encoder and decoder, respectively. The major issues to develop such devices are circuit complexity and power dissipation at the nanoscale level. This can be fixed by utilising the features of reversible logic with Quantum dot cellular automata (QCA) device as a promising archetype for an alternative to the traditional transistor‐based device. QCA has high protection against side‐channel attacks, especially from power analysis attacks. All those features of QCA influence the researchers to explore several QCA‐based cryptographic models of nanocommunication for secure data transmission. Here, the existing QCA‐based circuits for cryptographic architecture are explored and compared concerning their circuit complexity, device area, and operating speeds. The working principles of each of those existing architectures have been demonstrated in detail. Besides, the embedding of reversible logic in QCA cryptographic architecture is also explored. The architectures are compared in terms of the logic used in the design. Finally, the major key issues are identified and addressed in the context of cryptographic models for future secure data transmission processes.

IET Quantum Communication•Jul 1, 2021•13 citations

Physics as quantum information processing: Quantum fields as quantum automata

Giacomo Mauro D’Ariano

Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can physics be simulated by a quantum computer? Do we believe that a quantum field is ultimately made of a numerable set of quantum systems that are unitarily interacting? A positive answer to these questions corresponds to substituting QFT with a theory of quantum cellular automata (QCA), and the present work is examining this hypothesis. These investigations are part of a large research program on a quantum-digitalization of physics, with Quantum Theory as a special theory of information, and Physics as emergent from the same quantum-information processing. A QCA-based QFT has tremendous potential advantages compared to QFT, being quantum ab-initio and free from the problems plaguing QFT due to the continuum hypothesis. Here I will show how dynamics emerges from the quantum processing, how the QCA can reproduce the Dirac-field phenomenology at large scales, and the kind of departures from QFT that that should be expected at a Planckscale discreteness. I will introduce the notions of linear field quantum automaton and local-matrix quantum automaton, in terms of which I will provide the solution to the Feynman's problem about the possibility of simulating a Fermi field with a quantum computer.

AIP conference proceedings•Jan 1, 2012•12 citations
Quantum computation based on quantum-cellular automata (QCA) can greatly reduce the control and precision necessary for experimental implementations of quantum information processing. A QCA system consists of a few species of qubits in which all qubits of a species evolve in parallel. We show that, in spite of its inherent constraints, a QCA system can be used to study complex quantum dynamics. To this aim, we demonstrate scalable operations on a QCA system that fulfill statistical criteria of randomness and explore which criteria of randomness can be fulfilled by operators from various QCA architectures. Other means of realizing random operators with only a few independent operators are also discussed.
Abstract Security of information is an important issue during the transmission of information. The device that performs the encoding and decoding process is called the encoder and decoder, respectively. The major issues to develop such devices are circuit complexity and power dissipation at the nanoscale level. This can be fixed by utilising the features of reversible logic with Quantum dot cellular automata (QCA) device as a promising archetype for an alternative to the traditional transistor‐based device. QCA has high protection against side‐channel attacks, especially from power analysis attacks. All those features of QCA influence the researchers to explore several QCA‐based cryptographic models of nanocommunication for secure data transmission. Here, the existing QCA‐based circuits for cryptographic architecture are explored and compared concerning their circuit complexity, device area, and operating speeds. The working principles of each of those existing architectures have been demonstrated in detail. Besides, the embedding of reversible logic in QCA cryptographic architecture is also explored. The architectures are compared in terms of the logic used in the design. Finally, the major key issues are identified and addressed in the context of cryptographic models for future secure data transmission processes.
Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can physics be simulated by a quantum computer? Do we believe that a quantum field is ultimately made of a numerable set of quantum systems that are unitarily interacting? A positive answer to these questions corresponds to substituting QFT with a theory of quantum cellular automata (QCA), and the present work is examining this hypothesis. These investigations are part of a large research program on a quantum-digitalization of physics, with Quantum Theory as a special theory of information, and Physics as emergent from the same quantum-information processing. A QCA-based QFT has tremendous potential advantages compared to QFT, being quantum ab-initio and free from the problems plaguing QFT due to the continuum hypothesis. Here I will show how dynamics emerges from the quantum processing, how the QCA can reproduce the Dirac-field phenomenology at large scales, and the kind of departures from QFT that that should be expected at a Planckscale discreteness. I will introduce the notions of linear field quantum automaton and local-matrix quantum automaton, in terms of which I will provide the solution to the Feynman's problem about the possibility of simulating a Fermi field with a quantum computer.