Pages that link to "Item:Q5386207"

The following pages link to Quantum Algorithms for the Triangle Problem (Q5386207):

Displaying 50 items.

• Quantum walks can find a marked element on any graph (Q262276) (← links)
• The staggered quantum walk model (Q265344) (← links)
• Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model (Q291465) (← links)
• Path-integral solution of the one-dimensional Dirac quantum cellular automaton (Q305025) (← links)
• Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
• On the power of non-adaptive learning graphs (Q488054) (← links)
• Improved quantum query algorithms for triangle detection and associativity testing (Q513275) (← links)
• Quantum counterfeit coin problems (Q714865) (← links)
• A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
• Weyl, Dirac and Maxwell quantum cellular automata (Q892928) (← links)
• Quantum algorithms for finding constant-sized sub-hypergraphs (Q896154) (← links)
• Claw finding algorithms using quantum walk (Q1034536) (← links)
• Quantum algorithm for triangle finding in sparse graphs (Q1679241) (← links)
• Quantum field as a quantum cellular automaton: the Dirac free evolution in one dimension (Q1692460) (← links)
• Equivalence of Szegedy's and coined quantum walks (Q1700352) (← links)
• Quantum algorithm design: techniques and applications (Q1730317) (← links)
• Two quantum coins sharing a walker (Q1741029) (← links)
• Quantum walks: a comprehensive review (Q1757875) (← links)
• Applied quantum physics for novel quantum computation approaches: an update (Q1797705) (← links)
• Quantum search with variable times (Q1959400) (← links)
• Constructing quantum hash functions based on quantum walks on Johnson graphs (Q1993776) (← links)
• Element distinctness revisited (Q1993785) (← links)
• A quantum searching model finding one of the edges of a subgraph in a complete graph (Q2101204) (← links)
• Faster search of clustered marked states with lackadaisical quantum walks (Q2101572) (← links)
• Randomizing quantum walk (Q2145929) (← links)
• Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
• Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation (Q2239653) (← links)
• Extended learning graphs for triangle finding (Q2300731) (← links)
• Hash function based on quantum walks (Q2322065) (← links)
• Quantum walks for the determination of commutativity of finite dimensional algebras (Q2423567) (← links)
• On the hitting times of quantum versus random walks (Q2429358) (← links)
• Quantum walk and its application domains: a systematic review (Q2668386) (← links)
• Szegedy quantum walks with memory on regular graphs (Q2677576) (← links)
• Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term (Q2684325) (← links)
• Three-state quantum walk on the Cayley graph of the dihedral group (Q2687204) (← links)
• Novel two-party quantum private comparison via quantum walks on circle (Q2690250) (← links)
• Quantum search of matching on signed graphs (Q2690254) (← links)
• Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
• Quantum query complexity of constant-sized subgraph containment (Q2909539) (← links)
• Quantum algorithms for the triangle problem (Q2921783) (← links)
• Quantum Complexity of Boolean Matrix Multiplication and Related Problems (Q2944887) (← links)
• Adjacent Vertices Can Be Hard to Find by Quantum Walks (Q2971139) (← links)
• Quantum algorithms for algebraic problems (Q3077033) (← links)
• Quantum Property Testing for Bounded-Degree Graphs (Q3088108) (← links)
• Generating Reversible Circuits from Higher-Order Functional Programs (Q3186607) (← links)
• Quantum Walk Based Search Algorithms (Q3502631) (← links)
• Path-sum solution of the Weyl quantum walk in 3 + 1 dimensions (Q4560695) (← links)
• Solving Lyapunov equation by quantum algorithm (Q4574760) (← links)
• Limiting properties of stochastic quantum walks on directed graphs (Q4603663) (← links)
• (Q4637980) (← links)