scientific article; zbMATH DE number 2103524

zbMath1063.81024arXivquant-ph/0005055MaRDI QIDQ4819589

Gilles Brassard, Michele Mosca, Peter Høyer, Alain Tapp

Publication date: 27 September 2004

Full work available at URL: https://arxiv.org/abs/quant-ph/0005055

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Search theory (90B40) Quantum computation (81P68) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (only showing first 100 items - show all)

The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound ⋮ On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability ⋮ Query Complexity in Expectation ⋮ Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores ⋮ Multi-query Quantum Sums ⋮ Some error analysis for the quantum phase estimation algorithms ⋮ Approximate Degree in Classical and Quantum Computing ⋮ Sure success partial search ⋮ The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries ⋮ Quantum machine learning: a classical perspective ⋮ The quantum query complexity of the hidden subgroup problem is polynomial ⋮ A fast algorithm for approximating the ground state energy on a quantum computer ⋮ Unnamed Item ⋮ Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256 ⋮ An ancilla-based quantum simulation framework for non-unitary matrices ⋮ Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target ⋮ Quantum Fourier transform in computational basis ⋮ Quantum attacks on some Feistel block ciphers ⋮ Approximate span programs ⋮ Quantum and classical query complexities for generalized Simon's problem ⋮ Quantum discriminative canonical correlation analysis ⋮ New results on quantum boomerang attacks ⋮ Quantum radial basis function method for the Poisson equation ⋮ Quantum algorithm for dynamic programming approach for DAGs and applications ⋮ Quantum amplitude amplification algorithm simulation for prediction of a binary classification problem ⋮ Deterministic quantum search with adjustable parameters: implementations and applications ⋮ Quantum vs. classical algorithms for solving the heat equation ⋮ Improved quantum supersampling for quantum ray tracing ⋮ Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm ⋮ A quantum model of feed-forward neural networks with unitary learning algorithms ⋮ Quantum and classical query complexities for generalized Deutsch-Jozsa problems ⋮ Quantum fast Poisson solver: the algorithm and complete and modular circuit design ⋮ Quantum regularized least squares solver with parameter estimate ⋮ Amplitude estimation without phase estimation ⋮ Improved attacks against reduced-round Whirlwind ⋮ Fast black-box quantum state preparation based on linear combination of unitaries ⋮ Quantum Walk Based Search Algorithms ⋮ An exact quantum algorithm for a restricted subtraction game ⋮ Improved quantum algorithm for MMSE-based massive MIMO uplink detection ⋮ Quantum algorithm for help-training semi-supervised support vector machine ⋮ Quantum \(k\)-fold cross-validation for nearest neighbor classification algorithm ⋮ Quantum kernel logistic regression based Newton method ⋮ A quantum distinguisher for 7/8-round SMS4 block cipher ⋮ Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term ⋮ Lackadaisical quantum walk for spatial search ⋮ Amplitude estimation via maximum likelihood on noisy quantum computer ⋮ Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm ⋮ Quantum Bayesian inference for parameter estimation using quantum generative model ⋮ Quantum algorithm for matrix logarithm by integral formula ⋮ Quantum radial basis function method for scattered data interpolation ⋮ A quantum algorithm to approximate the linear structures of Boolean functions ⋮ Applications of Simon's algorithm in quantum attacks on Feistel variants ⋮ Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision ⋮ Quantum search of matching on signed graphs ⋮ Quantum speedup of Monte Carlo integration with respect to the number of dimensions and its application to finance ⋮ An improved quantum algorithm for support matrix machines ⋮ Implementation of efficient quantum search algorithms on NISQ computers ⋮ New results on \(\mathsf{Gimli}\): full-permutation distinguishers and improved collisions ⋮ Estimating quantum speedups for lattice sieves ⋮ Improved classical and quantum algorithms for subset-sum ⋮ Quantum collision attacks on AES-like hashing with low quantum random access memories ⋮ Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) ⋮ Quantum greedy algorithms for multi-armed bandits ⋮ On new PageRank computation methods using quantum computing ⋮ Quantum algorithms for similarity measurement based on Euclidean distance ⋮ Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems ⋮ A survey on HHL algorithm: from theory to application in quantum machine learning ⋮ The quantum walk search algorithm: factors affecting efficiency ⋮ A Quantum Implementation Model for Artificial Neural Networks ⋮ An Introduction to Quantum Computing, without the Physics ⋮ Quantum mixing of Markov chains for special distributions ⋮ On the complexity of the multivariate Sturm-Liouville eigenvalue problem ⋮ Wavelet quantum search algorithm with partial information ⋮ Quantum algorithms for the resiliency of vectorial Boolean functions ⋮ Efficient Construction of Functional Representations for Quantum Algorithms ⋮ Estimating the ground state energy of the Schrödinger equation for convex potentials ⋮ Unnamed Item ⋮ On the complexity of searching for a maximum of a function on a quantum computer ⋮ Counting by quantum eigenvalue estimation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quantum Random Walks – New Method for Designing Quantum Algorithms ⋮ Solving NP-Complete Problems with Quantum Search ⋮ Superlinear Advantage for Exact Quantum Algorithms ⋮ Extended learning graphs for triangle finding ⋮ Quantum Chebyshev's Inequality and Applications ⋮ Key establishment à la Merkle in a quantum world ⋮ QCF: quantum collaborative filtering recommendation algorithm ⋮ The complexity of quantum disjointness ⋮ Quantum branch-and-bound algorithm and its application to the travelling salesman problem ⋮ Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems ⋮ Universal test for quantum one-way permutations ⋮ Improved bounds on the randomized and quantum complexity of initial-value problems ⋮ Quantum speedup of Bayes’ classifiers ⋮ Quantum algorithms for learning symmetric juntas via the adversary bound ⋮ Testing Boolean Functions Properties ⋮ Bethe states on a quantum computer: success probability and correlation functions ⋮ A different Deutsch-Jozsa ⋮ Lackadaisical quantum walks on 2D grids with multiple marked vertices ⋮ From Monte Carlo to quantum computation

This page was built for publication: