Quantum computation from a de Broglie-Bohm perspective
classification
🪐 quant-ph
keywords
quantumbroglie-bohmalgorithmanalysisbellcompletecomputationconclude
read the original abstract
We consider an example of a quantum algorithm from the point of view of the de Broglie-Bohm formulation of quantum mechanics. For concreteness we look at two particular implementations: one using spin-1/2 particles as described by a simple model due to Bell and the other as energy states in an infinite-well potential. We extend the analysis to encompass a complete set of quantum gates. We conclude by discussing the relevance of our investigations for the debate about the origin of the quantum-computational speed-up.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.