Solving Bernstein and Vazirani's problem with the 2-bit permutation function
From MaRDI portal
Publication:2102201
DOI10.1007/s11128-021-03345-0OpenAlexW4200238847MaRDI QIDQ2102201
Chung-Yao Chang, Chien-Yuan Chen, Chih-Cheng Hsueh
Publication date: 28 November 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-021-03345-0
Cites Work
- Unnamed Item
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
- Quantum mechanical Hamiltonian models of Turing machines
- Efficient quantum algorithms of finding the roots of a polynomial function
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- Quantum algorithms for learning and testing juntas
- An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum Complexity Theory
This page was built for publication: Solving Bernstein and Vazirani's problem with the 2-bit permutation function
