Pages that link to "Item:Q3068642"

The following pages link to Any AND-OR Formula of Size <i>N</i> Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer (Q3068642):

Displaying 34 items.

• Quantum walk on the line through potential barriers (Q264601) (← links)
• Challenges of adiabatic quantum evaluation of NAND trees (Q264902) (← links)
• Quantum query complexity of almost all functions with fixed on-set size (Q347109) (← links)
• A strong direct product theorem for quantum query complexity (Q354645) (← links)
• A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
• On the relationship between continuous- and discrete-time quantum walk (Q625458) (← links)
• A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
• Equivalence of Szegedy's and coined quantum walks (Q1700352) (← links)
• Quantum algorithm design: techniques and applications (Q1730317) (← links)
• The hardest halfspace (Q1983325) (← links)
• Fourier concentration from shrinkage (Q2012185) (← links)
• Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
• EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS (Q2971052) (← links)
• Generating Reversible Circuits from Higher-Order Functional Programs (Q3186607) (← links)
• Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (Q3448791) (← links)
• Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
• Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
• The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← links)
• (Q4612479) (← links)
• Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
• (Q5090396) (← links)
• (Q5091179) (← links)
• Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
• A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
• Algorithmic Polynomials (Q5138783) (← links)
• (Q5140844) (← links)
• Quantum Random Walks – New Method for Designing Quantum Algorithms (Q5448636) (← links)
• Quantum Algorithms for Evaluating Min-Max Trees (Q5503293) (← links)
• Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)
• Quantum algorithm for dynamic programming approach for DAGs and applications (Q6043927) (← links)
• Optimizing the walk coin in the quantum random walk search algorithm (Q6096107) (← links)
• Quantum bounds for 2D-grid and Dyck language (Q6101583) (← links)
• An overview of quantum cellular automata (Q6150998) (← links)
• Robustness of quantum walk search with neighbors measurement (Q6587977) (← links)