Solving Bernstein and Vazirani's problem with the 2-bit permutation function
From MaRDI portal
Publication:2102201
DOI10.1007/S11128-021-03345-0OpenAlexW4200238847MaRDI QIDQ2102201FDOQ2102201
Authors: Chien-Yuan Chen, Chung-Yao Chang, 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
Recommendations
Cites Work
- Quantum theory, the Church–Turing principle and the universal quantum computer
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Quantum Complexity Theory
- Rapid solution of problems by quantum computation
- Quantum mechanical Hamiltonian models of Turing machines
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
- Efficient quantum algorithms of finding the roots of a polynomial function
- Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
- Quantum algorithms for learning and testing juntas
- Title not available (Why is that?)
- An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables
Cited In (2)
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)
