Quantum Algorithms for Element Distinctness
From MaRDI portal
Publication:5317198
DOI10.1137/S0097539702402780zbMath1081.68029arXivquant-ph/0007016WikidataQ62039255 ScholiaQ62039255MaRDI QIDQ5317198
Harry Buhrman, Mark Heiligman, Frédéric Magniez, Peter Høyer, Miklos Santha, Ronald de Wolf, Christoph Dürr
Publication date: 16 September 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0007016
Related Items (26)
Low-gate quantum golden collision finding ⋮ Quantum algorithms for matching problems ⋮ QUANTUM QUERY COMPLEXITY OF CONSTANT-SIZED SUBGRAPH CONTAINMENT ⋮ Quantum algorithm for triangle finding in sparse graphs ⋮ Improved algorithms for quantum identification of Boolean oracles ⋮ Finding shortest lattice vectors faster using quantum search ⋮ Quantum meet-in-the-middle attack on Feistel construction ⋮ Deterministic quantum search with adjustable parameters: implementations and applications ⋮ Quantum algorithms for finding constant-sized sub-hypergraphs ⋮ Quantum search with variable times ⋮ Fooling views: a new lower bound technique for distributed computations under congestion ⋮ Algorithmic Polynomials ⋮ Quantum algorithm design: techniques and applications ⋮ Quantum lower bounds by quantum arguments ⋮ Element distinctness revisited ⋮ Quantum algorithm for the multicollision problem ⋮ Polynomial degree vs. quantum query complexity ⋮ The quantum query complexity of the determinant ⋮ Unnamed Item ⋮ Квантовые атаки на итерационные блочные шифры ⋮ Extended learning graphs for triangle finding ⋮ Quantum Property Testing for Bounded-Degree Graphs ⋮ Claw finding algorithms using quantum walk ⋮ Unnamed Item ⋮ Quantum key search for ternary LWE ⋮ Quantum Demiric-Selcuk meet-in-the-middle attacks on reduced-round AES
This page was built for publication: Quantum Algorithms for Element Distinctness
