Improved quantum query algorithms for triangle detection and associativity testing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5605071 (Why is no real title available?)
- scientific article; zbMATH DE number 5485488 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- Learning graph based quantum query algorithms for finding constant-size subgraphs
- Nested Quantum Walks with Quantum Data Structures
- On the power of non-adaptive learning graphs
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Algorithms for the Triangle Problem
- Quantum query complexity of constant-sized subgraph containment
- Reflections for quantum query algorithms
- Span programs for functions with constant-sized 1-certificates (extended abstract)
- The Quantum Complexity of Group Testing
- Verification of Identities
Cited in
(10)- Quantum algorithm design: techniques and applications
- Extended learning graphs for triangle finding
- Quantum query complexity of constant-sized subgraph containment
- Multiparty quantum communication complexity of triangle finding
- On the power of non-adaptive learning graphs
- scientific article; zbMATH DE number 7559397 (Why is no real title available?)
- Quantum Algorithms for the Triangle Problem
- Learning graph based quantum query algorithms for finding constant-size subgraphs
- Improved quantum query algorithms for triangle finding and associativity testing
- Quantum algorithms for finding constant-sized sub-hypergraphs
This page was built for publication: Improved quantum query algorithms for triangle detection and associativity testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513275)