Quantum Cellular Automata Pseudo-Random Maps

Details Quantum Cellular Automata Pseudo-Random Maps Quantum Cellular Automata Pseudo-Random Maps

2004-01-08

arxiv.org/abs/quant-ph/0401040v1

Phys. Rev. A, 69, 062301, (2004).

Physics

Quantum Physics

7 pages, 8 figures, submitted to PRA

Scientific paper

10.1103/PhysRevA.69.062301

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.

Affiliated with

Also associated with

No associations

Rating

Quantum Cellular Automata Pseudo-Random Maps does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Cellular Automata Pseudo-Random Maps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Cellular Automata Pseudo-Random Maps will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-63177