scientific article; zbMATH DE number 1559521
From MaRDI portal
Publication:4526969
Recommendations
Cited in
(23)- Graph matching using the interference of continuous-time quantum walks
- Quantum model of computations: Underlying principles and achievements
- Poly-locality in quantum computing
- Quantum arithmetic with the quantum Fourier transform
- Quantum algorithm design: techniques and applications
- Leveraging the hardness of dihedral coset problem for quantum cryptography
- The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform
- 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
- Quantum Fourier sampling simplified
- Quantum fourier transform over symmetric groups
- Quantum algorithms and the Fourier transform
- Fast quantum maps
- scientific article; zbMATH DE number 1985231 (Why is no real title available?)
- scientific article; zbMATH DE number 1504660 (Why is no real title available?)
- scientific article; zbMATH DE number 2086431 (Why is no real title available?)
- On quantum algorithms for noncommutative hidden subgroups
- Almost-Ramanujan expanders from arbitrary expanders via operator amplification
- Complexity classes of equivalence problems revisited
- Representation-theoretical properties of the approximate quantum Fourier transform
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4526969)
