Quantum algorithms for the triangle problem
From MaRDI portal
Recommendations
Cited in
(23)- Multiparty quantum communication complexity of triangle finding
- Line ordering of reversible circuits for linear nearest neighbor realization
- On the relationship between continuous- and discrete-time quantum walk
- Quantum Walks
- Quantum Algorithms for the Triangle Problem
- Polynomial degree vs. quantum query complexity
- Quantum walks with memory on cycles
- Search on vertex-transitive graphs by lackadaisical quantum walk
- Theoretical computer science: computational complexity
- A panoply of quantum algorithms
- Quantum algorithms for finding constant-sized sub-hypergraphs
- Quantum algorithms for matching problems
- The quantum walk search algorithm: factors affecting efficiency
- Improved quantum query algorithms for triangle detection and associativity testing
- Claw finding algorithms using quantum walk
- A note on the search for k elements via quantum walk
- Quantum walk mixing is faster than classical on periodic lattices
- Quantum algorithms for weighing matrices and quadratic residues
- Quantum mixing of Markov chains for special distributions
- Improved quantum query algorithms for triangle finding and associativity testing
- Improved algorithms for quantum identification of Boolean oracles
- The quantum query complexity of the determinant
- Span programs for functions with constant-sized 1-certificates (extended abstract)
This page was built for publication: Quantum algorithms for the triangle problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921783)
