Shuffling cards, factoring numbers and the quantum baker's map
From MaRDI portal
Publication:5705336
DOI10.1088/0305-4470/38/37/L01zbMATH Open1081.81044arXivnlin/0505057MaRDI QIDQ5705336FDOQ5705336
Authors: A. Lakshminarayan
Publication date: 8 November 2005
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Abstract: It is pointed out that an exactly solvable permutation operator, viewed as the quantization of cyclic shifts, is useful in constructing a basis in which to study the quantum baker's map, a paradigm system of quantum chaos. In the basis of this operator the eigenfunctions of the quantum baker's map are compressed by factors of around five or more. We show explicitly its connection to an operator that is closely related to the usual quantum baker's map. This permutation operator has interesting connections to the art of shuffling cards as well as to the quantum factoring algorithm of Shor via the quantum order finding one. Hence we point out that this well-known quantum algorithm makes crucial use of a quantum chaotic operator, or at least one that is close to the quantization of the left-shift, a closeness that we also explore quantitatively.
Full work available at URL: https://arxiv.org/abs/nlin/0505057
Recommendations
Quantum computation (81P68) Exactly and quasi-solvable systems arising in quantum theory (81U15) Quantum chaos (81Q50)
Cited In (2)
This page was built for publication: Shuffling cards, factoring numbers and the quantum baker's map
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5705336)