The hidden subgroup problem and eigenvalue estimation on a quantum computer
From MaRDI portal
Recommendations
- The Hidden Subgroup Problem and Quantum Computation Using Group Representations
- scientific article; zbMATH DE number 2103528
- Quantum hidden subgroup algorithms: an algorithmic toolkit
- On the quantum complexity of the continuous hidden subgroup problem
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem
- On quantum algorithms for noncommutative hidden subgroups
- On quantum algorithms for noncommutative hidden subgroups
- EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
- An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
Cited in
(29)- Quantum algorithm to solve function inversion with time-space trade-off
- Symmetric and asymmetric cryptographic key exchange protocols in the octonion algebra
- Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
- Photonic scheme of quantum phase estimation for quantum algorithms via quantum dots
- Deterministic algorithms for the hidden subgroup problem
- On the quantum complexity of the continuous hidden subgroup problem
- On post-processing in the quantum algorithm for computing short discrete logarithms
- A relational time-symmetric framework for analyzing the quantum computational speedup
- Progress in quantum algorithms
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
- Is Grover's algorithm a quantum hidden subgroup algorithm?
- Sample complexity of hidden subgroup problem
- Quantum algorithms for typical hard problems: a perspective of cryptanalysis
- Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics
- An approach by representation of algebras for decoherence-free subspaces
- Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm
- Committing to quantum resistance, better: a speed-and-risk-configurable defence for bitcoin against a fast quantum computing attack
- Rapid solution of problems by quantum computation
- Quantum counting: algorithm and error distribution
- A note on quantum related-key attacks
- The independence of reduced subgroup-state
- Bitcoin Crypto–Bounties for Quantum Capable Adversaries
- Counting by quantum eigenvalue estimation
- Improved quantum supersampling for quantum ray tracing
- Quantum linearization attacks
- Quantum complexity for discrete logarithms and related problems
- The quantum speed up as advanced cognition of the solution
- The 50\% advanced information rule of the quantum algorithms
- Representation-theoretical properties of the approximate quantum Fourier transform
This page was built for publication: The hidden subgroup problem and eigenvalue estimation on a quantum computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4939150)
