Pages that link to "Item:Q2355587"

The following pages link to A quantum algorithm for approximating the influences of Boolean functions and its applications (Q2355587):

Displaying 19 items.

• A quantum algorithm for testing and learning resiliency of a Boolean function (Q669925) (← links)
• New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm (Q726023) (← links)
• Efficient quantum algorithms of finding the roots of a polynomial function (Q1616488) (← links)
• Creating very true quantum algorithms for quantum energy based computing (Q1643461) (← links)
• Quantum cryptography based on the Deutsch-Jozsa algorithm (Q1685724) (← links)
• Quantum cryptography, quantum communication, and quantum computer in a noisy environment (Q1701186) (← links)
• A classical probability space exists for the measurement theory based on the truth values (Q1708034) (← links)
• Necessary and sufficient condition for quantum computing (Q1740946) (← links)
• Quantum communication based on an algorithm of determining a matrix (Q1740965) (← links)
• Quantum algorithms on Walsh transform and Hamming distance for Boolean functions (Q1993748) (← links)
• Quantum algorithm for determining a complex number string (Q2010995) (← links)
• Quantum cryptographic property testing of multi-output Boolean functions (Q2100834) (← links)
• Solving Bernstein and Vazirani's problem with the 2-bit permutation function (Q2102201) (← links)
• Some theoretically organized algorithm for quantum computers (Q2300853) (← links)
• Quantum algorithm for the root-finding problem (Q2329950) (← links)
• Kochen-Specker theorem as a precondition for quantum computing (Q2400205) (← links)
• Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions (Q2681633) (← links)
• Distributed Bernstein-Vazirani algorithm (Q6061049) (← links)
• Generalization of the Bernstein-Vazirani algorithm beyond qubit systems (Q6590040) (← links)