scientific article; zbMATH DE number 1406124
From MaRDI portal
Publication:4939150
zbMath0945.68064arXivquant-ph/9903071MaRDI QIDQ4939150
Publication date: 23 February 2000
Full work available at URL: https://arxiv.org/abs/quant-ph/9903071
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (28)
Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics ⋮ An approach by representation of algebras for decoherence-free subspaces ⋮ The 50\% advanced information rule of the quantum algorithms ⋮ Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm ⋮ Progress in quantum algorithms ⋮ Quantum algorithm to solve function inversion with time-space trade-off ⋮ Sample complexity of hidden subgroup problem ⋮ Improved quantum supersampling for quantum ray tracing ⋮ Quantum algorithms for typical hard problems: a perspective of cryptanalysis ⋮ Rapid solution of problems by quantum computation ⋮ Quantum counting: algorithm and error distribution ⋮ Quantum linearization attacks ⋮ An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups ⋮ On post-processing in the quantum algorithm for computing short discrete logarithms ⋮ A note on quantum related-key attacks ⋮ The independence of reduced subgroup-state ⋮ Committing to Quantum Resistance, Better: A Speed-and-Risk-Configurable Defence for Bitcoin Against a Fast Quantum Computing Attack ⋮ Representation-theoretical properties of the approximate quantum Fourier transform ⋮ Bitcoin Crypto–Bounties for Quantum Capable Adversaries ⋮ Is Grover's algorithm a quantum hidden subgroup algorithm? ⋮ Counting by quantum eigenvalue estimation ⋮ Symmetric and asymmetric cryptographic key exchange protocols in the octonion algebra ⋮ A relational time-symmetric framework for analyzing the quantum computational speedup ⋮ The quantum speed up as advanced cognition of the solution ⋮ 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
This page was built for publication:
