Solving Bernstein and Vazirani's problem with the 2-bit permutation function
From MaRDI portal
Publication:2102201
Recommendations
Cites work
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables
- Efficient quantum algorithms of finding the roots of a polynomial function
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
- Quantum Complexity Theory
- Quantum algorithms for learning and testing juntas
- Quantum algorithms for testing Boolean functions
- Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
- Quantum mechanical Hamiltonian models of Turing machines
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Rapid solution of problems by quantum computation
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
Cited in
(3)
This page was built for publication: Solving Bernstein and Vazirani's problem with the 2-bit permutation function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102201)