Boolean functions identification via quantum computing methods
From MaRDI portal
Recommendations
Cited in
(19)- Quantum algorithm for evaluating two of logical functions simultaneously
- Some theoretically organized algorithm for quantum computers
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm
- Application of Grover's algorithm to check non-resiliency of a Boolean function
- Computing Boolean functions via quantum hashing
- An optimal quantum algorithm for the oracle identification problem
- A quantum algorithm for finding minimal exclusive-or expressions for incompletely specified Boolean functions
- On quantum realisation of Boolean functions by the fingerprinting technique
- Quantum identification of Boolean oracles
- A modified adiabatic quantum algorithm for evaluation of Boolean functions
- Exact quantum algorithm to distinguish Boolean functions of different weights
- Boolean Functions, Projection Operators, and Quantum Error Correcting Codes
- Adiabatic quantum oracles
- Quantum algorithms for testing Boolean functions
- STACS 2004
- Improved Algorithms for Quantum Identification of Boolean Oracles
- Quantum mechanical m-resiliency checking of a Boolean function: invasion of the complexity from computation to measurement
- A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function
- Improved algorithms for quantum identification of Boolean oracles
This page was built for publication: Boolean functions identification via quantum computing methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901578)
