Quantum complexity of testing group commutativity

DOI10.1007/s00453-007-0057-8zbMath1121.68056arXivquant-ph/0506265OpenAlexW1991075883WikidataQ56386244 ScholiaQ56386244MaRDI QIDQ2642314

Frédéric Magniez, Ashwin Nayak

Publication date: 20 August 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0506265

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Related Items (17)

Efficient quantum circuits for Szegedy quantum walks ⋮ A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs ⋮ A note on the search for \(k\) elements via quantum walk ⋮ Szegedy quantum walks with memory on regular graphs ⋮ Quantum Walk Based Search Algorithms ⋮ On the relationship between continuous- and discrete-time quantum walk ⋮ Models in quantum computing: a systematic review ⋮ Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond ⋮ On the hitting times of quantum versus random walks ⋮ Quantum search with variable times ⋮ Quantum algorithm design: techniques and applications ⋮ Quantum walks: a comprehensive review ⋮ Testing commutativity of a group and the power of randomization ⋮ Quantum Random Walks – New Method for Designing Quantum Algorithms ⋮ Quantum algorithms for algebraic problems ⋮ Quantum Algorithms for a Set of Group Theoretic Problems ⋮ Quantum walks can find a marked element on any graph

This page was built for publication: Quantum complexity of testing group commutativity