Publication:4526969
From MaRDI portal
zbMath0962.68070MaRDI QIDQ4526969
Publication date: 28 February 2001
81P68: Quantum computation
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
On quantum algorithms for noncommutative hidden subgroups, Complexity classes of equivalence problems revisited, Graph matching using the interference of continuous-time quantum walks, Quantum model of computations: Underlying principles and achievements, Quantum algorithm design: techniques and applications, Leveraging the hardness of dihedral coset problem for quantum cryptography, Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups, The quantum query complexity of the abelian hidden subgroup problem, Progress in quantum algorithms, Permutation groups, minimal degrees and quantum computing., Quantum Fourier transform over symmetric groups -- improved result