The following pages link to (Q4819589):
Displaying 50 items.
- Estimating quantum speedups for lattice sieves (Q2692396) (← links)
- Improved classical and quantum algorithms for subset-sum (Q2692398) (← links)
- Quantum collision attacks on AES-like hashing with low quantum random access memories (Q2692403) (← links)
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) (Q2693046) (← links)
- Quantum greedy algorithms for multi-armed bandits (Q2693852) (← links)
- On new PageRank computation methods using quantum computing (Q2693891) (← links)
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
- Superlinear advantage for exact quantum algorithms (Q2805516) (← links)
- Query Complexity in Expectation (Q3448835) (← links)
- Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores (Q3452567) (← links)
- Multi-query Quantum Sums (Q3453317) (← links)
- Quantum Walk Based Search Algorithms (Q3502631) (← links)
- (Q4240342) (← links)
- Quantum machine learning: a classical perspective (Q4556858) (← links)
- A quantum algorithm to approximate the linear structures of Boolean functions (Q4599610) (← links)
- Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision (Q4602374) (← links)
- The quantum walk search algorithm: factors affecting efficiency (Q4623131) (← links)
- Testing Boolean Functions Properties (Q5025054) (← links)
- The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound (Q5041235) (← links)
- On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability (Q5041237) (← links)
- Some error analysis for the quantum phase estimation algorithms (Q5057863) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- (Q5075742) (← links)
- Quantum Chebyshev's Inequality and Applications (Q5091227) (← links)
- (Q5092454) (← links)
- (Q5092483) (← links)
- Lackadaisical quantum walk for spatial search (Q5110425) (← links)
- The complexity of quantum disjointness (Q5111229) (← links)
- Controlled Quantum Amplification (Q5111348) (← links)
- A Quantum Implementation Model for Artificial Neural Networks (Q5134954) (← links)
- An Introduction to Quantum Computing, without the Physics (Q5140614) (← links)
- Quantum mixing of Markov chains for special distributions (Q5144028) (← links)
- Efficient Construction of Functional Representations for Quantum Algorithms (Q5162612) (← links)
- (Q5236727) (← links)
- A fast algorithm for approximating the ground state energy on a quantum computer (Q5326511) (← links)
- Quantum Random Walks – New Method for Designing Quantum Algorithms (Q5448636) (← links)
- Solving NP-Complete Problems with Quantum Search (Q5458579) (← links)
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems (Q5855059) (← links)
- Quantum speedup of Bayes’ classifiers (Q5870332) (← links)
- Bethe states on a quantum computer: success probability and correlation functions (Q5872746) (← links)
- Lackadaisical quantum walks on 2D grids with multiple marked vertices (Q5877944) (← links)
- Counting by quantum eigenvalue estimation (Q5941565) (← links)
- Quantum discriminative canonical correlation analysis (Q6039798) (← links)
- New results on quantum boomerang attacks (Q6039807) (← links)
- Quantum radial basis function method for the Poisson equation (Q6041783) (← links)
- Quantum algorithm for dynamic programming approach for DAGs and applications (Q6043927) (← links)
- Quantum amplitude amplification algorithm simulation for prediction of a binary classification problem (Q6043933) (← links)
- Deterministic quantum search with adjustable parameters: implementations and applications (Q6044469) (← links)
- Improved quantum supersampling for quantum ray tracing (Q6048728) (← links)
- Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm (Q6050243) (← links)
