New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
From MaRDI portal
Publication:726023
DOI10.1007/s10773-018-3687-5zbMath1394.81082OpenAlexW2793167755WikidataQ62554289 ScholiaQ62554289MaRDI QIDQ726023
Soliman Abdalla, Josep Batle, Han Geurdes, Ahmed Farouk, Koji Nagata, Tadao Nakamura
Publication date: 2 August 2018
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10773-018-3687-5
Database theory (68P15) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (4)
Necessary and sufficient condition for quantum computing ⋮ Quantum communication based on an algorithm of determining a matrix ⋮ Quantum algorithm for the root-finding problem ⋮ Solving Bernstein and Vazirani's problem with the 2-bit permutation function
Cites Work
- Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces
- Quantum computation with coherent spin states and the close Hadamard problem
- Quantum cryptography based on the Deutsch-Jozsa algorithm
- Quantum cryptography, quantum communication, and quantum computer in a noisy environment
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- Quantum Gauss-Jordan elimination and simulation of accounting principles on quantum computers
- Fiber-Optics Implementation of the Deutsch-Jozsa and Bernstein-Vazirani Quantum Algorithms with Three Qubits
- Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum algorithms revisited
- Quantum Complexity Theory
- Quantum complexity theory
This page was built for publication: New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
