Pages that link to "Item:Q4651491"
From MaRDI portal
The following pages link to Quantum Computation and Lattice Problems (Q4651491):
Displaying 24 items.
- An approach by representation of algebras for decoherence-free subspaces (Q297594) (← links)
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- The independence of reduced subgroup-state (Q458557) (← links)
- Using quantum key distribution for cryptographic purposes: a survey (Q477173) (← links)
- Solving systems of diagonal polynomial equations over finite fields (Q507442) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- Quantum cryptography beyond quantum key distribution (Q908054) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Leveraging the hardness of dihedral coset problem for quantum cryptography (Q2104711) (← links)
- Deterministic algorithms for the hidden subgroup problem (Q2105456) (← links)
- A fusion algorithm for solving the hidden shift problem in finite abelian groups (Q2118532) (← links)
- On the quantum complexity of the continuous hidden subgroup problem (Q2119017) (← links)
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms (Q2170103) (← links)
- General linear group action on tensors: a candidate for post-quantum cryptography (Q2175914) (← links)
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups (Q2428678) (← links)
- Sample complexity of hidden subgroup problem (Q2672576) (← links)
- Quantum algorithms for typical hard problems: a perspective of cryptanalysis (Q2677252) (← links)
- Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem (Q2685660) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- On Solving Systems of Diagonal Polynomial Equations Over Finite Fields (Q3452558) (← links)
- On the Complexity of the Hidden Subgroup Problem (Q3502634) (← links)
- Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts (Q5270358) (← links)
