Pages that link to "Item:Q2901578"
From MaRDI portal
The following pages link to Boolean functions identification via quantum computing methods (Q2901578):
Displaying 10 items.
- Application of Grover's algorithm to check non-resiliency of a Boolean function (Q276563) (← links)
- A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function (Q669952) (← links)
- Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
- Quantum algorithm for evaluating two of logical functions simultaneously (Q2197015) (← links)
- Some theoretically organized algorithm for quantum computers (Q2300853) (← links)
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm (Q2684233) (← links)
- Computing Boolean Functions via Quantum Hashing (Q2944885) (← links)
- An optimal quantum algorithm for the oracle identification problem (Q2965510) (← links)
- Boolean Functions, Projection Operators, and Quantum Error Correcting Codes (Q3604515) (← links)
- STACS 2004 (Q5309692) (← links)