Pages that link to "Item:Q5470736"

The following pages link to Quantum Query Complexity of Some Graph Problems (Q5470736):

Displaying 30 items.

• Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
• Adversary lower bounds for nonadaptive quantum algorithms (Q980943) (← links)
• Quantum approaches to graph colouring (Q1004074) (← links)
• Claw finding algorithms using quantum walk (Q1034536) (← links)
• Quantum algorithm design: techniques and applications (Q1730317) (← links)
• Image classification based on quantum K-nearest-neighbor algorithm (Q1991017) (← links)
• Quantum algorithms for string processing (Q2091414) (← links)
• Graph comparison via nonlinear quantum search (Q2105947) (← links)
• The Exponential Time complexity of counting (quantum) graph homomorphisms (Q2301557) (← links)
• Quantum algorithm for shortest path search in directed acyclic graph (Q2314214) (← links)
• Quantum branch-and-bound algorithm and its application to the travelling salesman problem (Q2331339) (← links)
• Evolutionary algorithms for quantum computers (Q2441596) (← links)
• Considering nearest neighbor constraints of quantum circuits at the reversible circuit level (Q2454191) (← links)
• Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs (Q2920479) (← links)
• On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism (Q3068637) (← links)
• Quantum algorithms for algebraic problems (Q3077033) (← links)
• Quantum Property Testing for Bounded-Degree Graphs (Q3088108) (← links)
• Solving Lyapunov equation by quantum algorithm (Q4574760) (← links)
• (Q5009613) (← links)
• (Q5075742) (← links)
• Algorithms and Computation (Q5191645) (← links)
• Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
• Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)
• SOFSEM 2004: Theory and Practice of Computer Science (Q5902000) (← links)
• Quantum algorithm for dynamic programming approach for DAGs and applications (Q6043927) (← links)
• Quantum time complexity and algorithms for pattern matching on labeled graphs (Q6111593) (← links)
• Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs (Q6168468) (← links)
• Theoretical computer science: computational complexity (Q6602263) (← links)
• NISQ-friendly measurement-based quantum clustering algorithms (Q6629291) (← links)
• Symmetries, graph properties, and quantum speedups (Q6654557) (← links)