A strategy for quantum algorithm design assisted by machine learning
From MaRDI portal
Publication:5143458
DOI10.1088/1367-2630/16/7/073017zbMath1451.81161arXiv1301.1132OpenAlexW1975907901WikidataQ62849086 ScholiaQ62849086MaRDI QIDQ5143458
Junghee Ryu, Seokwon Yoo, Jeongho Bang, Jinhyoung Lee, Marcin Pawłowski
Publication date: 12 January 2021
Published in: New Journal of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.1132
Related Items
A family of unitaries for the quantum period finding algorithm ⋮ A quantum speedup in machine learning: finding anN-bit Boolean function for a classification ⋮ A quantum scheme of state overlap based on quantum mean estimation and support vector machine ⋮ Blind quantum machine learning based on quantum circuit model ⋮ Quantum data compression by principal component analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Why haven't more quantum algorithms been found?
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum algorithms revisited
- Inductive Logic Programming: Theory and methods
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- d-outcome measurement for a nonlocality test