Can quantum chaos enhance the stability of quantum computation?
From MaRDI portal
Publication:4533758
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.
Recommendations
- Robust quantum computation of the kicked Harper model and quantum chaos
- Complexity of chaos and quantum computation
- STABILITY OF THE QUANTUM FOURIER TRANSFORMATION ON THE ISING QUANTUM COMPUTER
- Stability of holonomic quantum computations
- Stability of holonomic quantum computations with respect to control errors
Cited in
(12)- Stabilization of Quantum Computations by Symmetrization
- Stability of quantum linear logic circuits against perturbations
- Robust quantum computation of the kicked Harper model and quantum chaos
- Stability of holonomic quantum computations
- State stabilization for gate-model quantum computers
- Randomized dynamical decoupling techniques for coherent quantum control
- Complexity of chaos and quantum computation
- scientific article; zbMATH DE number 1500967 (Why is no real title available?)
- STABILITY OF THE QUANTUM FOURIER TRANSFORMATION ON THE ISING QUANTUM COMPUTER
- Quantum-cellular-automata pseudorandom maps
- Perspectives on relativistic quantum chaos
- De Broglie-Bohm analysis of a nonlinear membrane: from quantum to classical chaos
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)
