About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Physical Review A - AMO
Paper
Quantum chaos and quantum algorithms
Abstract
It was recently shown (e-print quant-ph/9909074) that parasitic random interactions between the qubits in a quantum computer can induce quantum chaos and put into question the operability of a quantum computer. In this work I investigate whether already the interactions between the qubits introduced with the intention to operate the quantum computer may lead to quantum chaos. The analysis focuses on two well-known quantum algorithms, namely, Grover’s search algorithm and the quantum Fourier transform. I show that in both cases the same very unusual combination of signatures from chaotic and from integrable dynamics arises. © 2002 The American Physical Society.