Efficient quantum algorithm for the parity problem of a certain function
From MaRDI portal
Recommendations
- A parallel quantum algorithm for the satisfiability problem
- Efficient algorithms for approximating quantum partition functions
- Quantum computer algorithm for parity determination based on quantum counting
- Characterizing classes of functions computable by quantum parallelism
- Efficient Construction of Functional Representations for Quantum Algorithms
- Efficient algorithm for a quantum analogue of 2-SAT
- Efficient quantum algorithms of finding the roots of a polynomial function
- The parallel quantum algorithm for the class of optimization
- A quantum algorithm to approximate the linear structures of Boolean functions
- A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1128569 (Why is no real title available?)
- scientific article; zbMATH DE number 1476921 (Why is no real title available?)
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Handbook of Natural Computing
- Information and computation: Classical and quantum aspects
- Introduction to Quantum Computation and Information
- Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93
- Quantum Complexity Theory
- Quantum algorithms for algebraic problems
- Quantum algorithms revisited
- Quantum cryptography based on Bell’s theorem
- Quantum cryptography based on the Deutsch-Jozsa algorithm
- Quantum cryptography, quantum communication, and quantum computer in a noisy environment
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Rapid solution of problems by quantum computation
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Cited in
(6)- Solving Bernstein and Vazirani's problem with the 2-bit permutation function
- Quantum algorithm to solve function inversion with time-space trade-off
- Necessary and sufficient condition for quantum computing
- Quantum communication based on an algorithm of determining a matrix
- Quantum computer algorithm for parity determination based on quantum counting
- A generalisation of the phase kick-back
This page was built for publication: Efficient quantum algorithm for the parity problem of a certain function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1740738)
