From Monte Carlo to quantum computation
From MaRDI portal
Publication:1873014
DOI10.1016/S0378-4754(02)00239-2zbMath1025.65005arXivquant-ph/0112152MaRDI QIDQ1873014
Publication date: 19 May 2003
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0112152
Related Items (3)
Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces ⋮ The quantum query complexity of elliptic PDE ⋮ Quantum computation and quantum information
Cites Work
- Probabilistic algorithm for testing primality
- Deterministic and stochastic error bounds in numerical analysis
- On a problem in quantum summation.
- Quantum integration in Sobolev classes
- Quantum summation with an application to integration.
- An introduction to quantum computing algorithms
- The quantum query complexity of approximating the median and related statistics
- Geometric quantum computation
- A Fast Monte-Carlo Test for Primality
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum lower bounds by polynomials
- Quantum complexity of integration
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: From Monte Carlo to quantum computation
