Can quantum chaos enhance the stability of quantum computation?

From MaRDI portal
Publication:4533758

DOI10.1088/0305-4470/34/47/103zbMATH Open0993.81008arXivquant-ph/0106150OpenAlexW2025045551WikidataQ59454120 ScholiaQ59454120MaRDI QIDQ4533758FDOQ4533758


Authors: Tomaž Prosen, Marko Žnidarič Edit this on Wikidata


Publication date: 11 June 2002

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Abstract: We consider stability of a general quantum algorithm with respect to a fixed but unknown residual interaction between qubits, and show a surprising fact, namely that the average fidelity of quantum computation increases by decreasing average time correlation function of the perturbing operator in sequences of consecutive quantum gates. Our thinking is applied to the quantum Fourier transformation where an alternative 'less regular' quantum algorithm is devised which is qualitatively more robust against static random residual n-qubit interaction.


Full work available at URL: https://arxiv.org/abs/quant-ph/0106150




Recommendations





Cited In (12)





This page was built for publication: Can quantum chaos enhance the stability of quantum computation?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4533758)