scientific article; zbMATH DE number 1775388
From MaRDI portal
Publication:4542520
Recommendations
- Fast quantum subroutines for the simplex method
- A fast algorithm for approximating the ground state energy on a quantum computer
- Fast quantum algorithms for handling probabilistic and interval uncertainty
- Quantum speedups for exponential-time dynamic programming algorithms
- scientific article; zbMATH DE number 1256737
- Fast algorithms of bath calculations in simulations of quantum system-bath dynamics
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Efficient Algorithms for Universal Quantum Simulation
- Optimizing quantum optimization algorithms via faster quantum gradient computation
- An efficient quantum algorithm for spectral estimation
Cited in
(32)- On a problem in quantum summation.
- Quantum integration in Sobolev classes
- Quantum search on structured problems
- Quantum summation with an application to integration.
- Dynamic Grover search: applications in recommendation systems and optimization problems
- Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces
- Quantum speed-up for unsupervised learning
- Fast quantum subroutines for the simplex method
- Histogram-based segmentation of quantum images
- Is Grover's algorithm a quantum hidden subgroup algorithm?
- Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms
- On the complexity of searching for a maximum of a function on a quantum computer
- Optimal query error of quantum approximation on some Sobolev classes
- Quantum extensive-form games
- Quantum all-subkeys-recovery attacks on 6-round Feistel-2^ structure based on multi-equations quantum claw finding
- An improved formalism for quantum computation based on geometric algebra -- case study: Grover's search algorithm
- On the uselessness of quantum queries
- On quantum computation of statistical mean using Grover's algorithm
- Noise effects in the quantum search algorithm from the viewpoint of computational complexity
- Solving NP-Complete Problems with Quantum Search
- Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies
- Quantum complexity of integration
- Counting by quantum eigenvalue estimation
- Quantum fast corner detection algorithm
- Uncovering instabilities in variational-quantum deep Q-networks
- The quantum accelerated PointNet algorithm
- Tree search and quantum computation
- Resource-efficient quantum data representation based on Grover's algorithm
- Just guess: improved (quantum) algorithm for the underdetermined MQ problem
- Uniformity testing when you have the source code
- A quantum algorithm for finding the modal value
- Lower bound for quantum integration error on anisotropic Sobolev classes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542520)
