Some theoretically organized algorithm for quantum computers
In the paper under review the authors suggest a new algorithm to treat positively the plural evaluations of some logical function in parallel instead of testing the function for finding out an attribute of it. Let \(\mathbb Z_2 =\{ 0, 1\}\) and \(N\) be a natural number. The problem is to evaluate a Boolean function \(f(x) : \mathbb Z_2^N \to \mathbb Z_2\) for different \(x\) simultaneously. The problem is well konwn in classical computing with exponential complexity. The parallel computing is outperformed by quantum computing. The authors propose a new algorithm to solve the problem by using the novel quantum parallel computing. The algorithm is to: 1) select a function \(f_i(x)\) from a list of all associated mappings, 2) make the operator \(U_{f_i}\) acting on a special state \(|\psi_0\rangle\), \(U_{f_i}: |x,y\rangle \mapsto |x,y\oplus f_i(x)\rangle\) to obtain the state \(|\psi_i\rangle\), \(i=0,1,\dots, 2^{2^N}-1\), where the symbol \(\oplus\) is used for the sum modulo 2, 3) obtain the mappings concerning \(f_i\). The result of Section 3 is then illustrated by an atom system in Section 5.
- Quantum algorithm for evaluating two of logical functions simultaneously
- Boolean functions identification via quantum computing methods
- Characterizing classes of functions computable by quantum parallelism
- scientific article; zbMATH DE number 1462669
- Quantum computaton from a quantum logical perspective
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- Application of quantum Gauss-Jordan elimination code to quantum secret sharing code
- Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces
- Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer
- Fiber-optics implementation of the Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms with three qubits
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 2025824 (Why is no real title available?)
- Quantum algorithms revisited
- Quantum communication and quantum multivariate polynomial interpolation
- Quantum Complexity Theory
- Quantum complexity theory
- Quantum computation with coherent spin states and the close Hadamard problem
- Quantum Gauss-Jordan elimination and simulation of accounting principles on quantum computers
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Rapid solution of problems by quantum computation
- Creating very true quantum algorithms for quantum energy based computing
- Quantum algorithm for evaluating two of logical functions simultaneously
- Generalization of Deutsch's algorithm
- A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer
- Physics' evolution toward computing
- Characterizing classes of functions computable by quantum parallelism
- Mathematical digital quantum computation by means of much more logical skills
- Quantum cryptography based on an algorithm for determining simultaneously all the mappings of a Boolean function
- Quantum computer algorithm for parity determination based on quantum counting
This page was built for publication: Some theoretically organized algorithm for quantum computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300853)
