Reduction of theoretical uncertainty in quantum computing
This paper provides a diagramatic method to vizualize and assess limitations due to intrinsic uncertainty inherent in quantum states. Further the authors aim at building quantum circuit algorithms that reduce intrinsic uncertainty to a level low enough so that reduction in operational uncertainty becomes effective. The overall process of quantum computation was thought of as consisting of (i) preparation of register, which is a superposition of the ground and excited states, (ii) row operations generating entangles states, (iii) unitary evolution converging to less dispersive states and (iv) measuring of the final solution state. The less the uncertainty in this state, the more accurately one can read it. The authors have developed a way to estimate intrinsic uncertainties in provisional results of quantum computing. This method could be applied to other quantum computing schemes in addition to the solid-state implementation focused on in this paper.
- scientific article; zbMATH DE number 1379488
- Quantum computing as a particular case of computing with tensors
- UNCERTAINTY PRINCIPLE FOR QUANTUM INSTRUMENTS AND COMPUTING
- Quantifying the uncertainty and global sensitivity of quantum computations on experimental hardware
- Quantum computation as geometry
This page was built for publication: Reduction of theoretical uncertainty in quantum computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805625)
