Talk:Bernstein–Vazirani algorithm
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Overly verbose 'Implementation' section
[edit]The 'Implementation' section is one long code snippet in one of the quantum computing frameworks.
This seems much too long, not very enlightening and very biased towards a single framework. I would suggest that this section be deleted. Or replaced with a pedagogical example based on quantum circuits (which are common to all approaches to quantum algorithms).
Note that I work on a rival framework, and so may be biased. So I would appreciate other opinions.
Woottonjames (talk) 22:24, 20 December 2019 (UTC)
- I agree that it seems unnecessary, and I have no bias towards any of the quantum computing languages. I'm not sure whether Wikipedia has any guidelines around this sort of thing, but pseudocode seems to be used in favor of any particular language. Note that swap test also has a Cirq implementation, so presumably that should be changed or removed as well.
- Fawly (talk) 10:12, 21 December 2019 (UTC)
A mistake in the algorithm section
[edit]The exponent in the fourth term of the diagram should be .
