scientific article; zbMATH DE number 7525446

DOI10.4230/LIPIcs.ESA.2019.9MaRDI QIDQ5075742

Simon Apers

Publication date: 11 May 2022

Full work available at URL: https://arxiv.org/abs/1904.11446

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

quantum algorithmsgraph theoryconnectivityquantum walks

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum walks can find a marked element on any graph
• A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
• Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection
• Testing Cluster Structure of Graphs
• Search via Quantum Walk
• Quantum Property Testing for Bounded-Degree Graphs
• On Testing Expansion in Bounded-Degree Graphs
• Adiabatic quantum state generation and statistical zero knowledge
• Generating a random permutation with random transpositions
• Finding sparse cuts locally using evolving sets
• Quantum walks on graphs
• Graph isomorphism in quasipolynomial time [extended abstract]
• Testing Closeness of Discrete Distributions
• Quantum Walk Algorithm for Element Distinctness
• Quantum Query Complexity of Some Graph Problems
• Quantum simulations of classical random walks and undirected graph connectivity
• Property testing in bounded degree graphs