Quantum mechanics on finite groups
From MaRDI portal
Publication:865105
DOI10.1007/s10701-006-9060-1zbMath1156.81339OpenAlexW1975448938MaRDI QIDQ865105
Publication date: 13 February 2007
Published in: Foundations of Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10701-006-9060-1
Quantum computation (81P68) Numerical methods for discrete and fast Fourier transforms (65T50) Quantum measurement theory, state operations, state preparations (81P15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph isomorphism, general remarks
- An introduction to quantum computing algorithms
- The quantum query complexity of the hidden subgroup problem is polynomial
- Wigner–Weyl correspondence in quantum mechanics for continuous and discrete systems—a Dirac-inspired view
- Efficient Computation of the Fourier Transform on Finite Groups
- Quantum computing: pro and con
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- On quantum algorithms for noncommutative hidden subgroups
This page was built for publication: Quantum mechanics on finite groups