Pages that link to "Item:Q5494975"

The following pages link to Quantum Query Complexity of State Conversion (Q5494975):

Displaying 26 items.

• Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
• A strong direct product theorem for quantum query complexity (Q354645) (← links)
• On the power of non-adaptive learning graphs (Q488054) (← links)
• A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function (Q669952) (← links)
• Quantum counterfeit coin problems (Q714865) (← links)
• A query-efficient quantum algorithm for maximum matching on general graphs (Q832903) (← links)
• Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives (Q2220875) (← links)
• Extended learning graphs for triangle finding (Q2300731) (← links)
• Key establishment à la Merkle in a quantum world (Q2318085) (← links)
• Quantum algorithms for learning symmetric juntas via the adversary bound (Q2351390) (← links)
• Optimal parallel quantum query algorithms (Q2408924) (← links)
• Approximate span programs (Q2414858) (← links)
• EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS (Q2971052) (← links)
• Квантовые атаки на итерационные блочные шифры (Q3381825) (← links)
• (Q4577913) (← links)
• (Q4612479) (← links)
• Quantum Query Algorithms Are Completely Bounded Forms (Q4634058) (← links)
• (Q4637977) (← links)
• Low-Sensitivity Functions from Unambiguous Certificates. (Q4638078) (← links)
• Quantum Query Algorithms are Completely Bounded Forms. (Q4993266) (← links)
• Quantum Algorithms for Classical Probability Distributions (Q5075751) (← links)
• (Q5089146) (← links)
• (Q5140844) (← links)
• Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems (Q5889069) (← links)
• (Q6176155) (← links)
• On query complexity measures and their relations for symmetric functions (Q6547823) (← links)