Quantum-cellular-automata pseudorandom maps
From MaRDI portal
Abstract: 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.
Recommendations
Cites work
- Can quantum chaos enhance the stability of quantum computation?
- Characterization of Chaotic Quantum Spectra and Universality of Level Fluctuation Laws
- Entangling power of the quantum baker s map
- Global entanglement in multiparticle systems
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 51346 (Why is no real title available?)
- Phase-space localization: Topological aspects of quantum chaos
- Pseudo-random unitary operators for quantum information processing
- Stability of quantum motion and correlation decay
Cited in
(6)- Pseudo-random unitary operators for quantum information processing
- Pseudorandom operators of the circular ensembles
- An efficient implementation of PRNGs based on the digital sawtooth map
- Entanglement generation of nearly random operators
- An overview of quantum cellular automata
- Aspects of generic entanglement
This page was built for publication: Quantum-cellular-automata pseudorandom maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114928)
