Sample-size-reduction of quantum states for the noisy linear problem
K Jeong - Annals of Physics, 2023 - Elsevier
Quantum supremacy poses that a realistic quantum computer can perform a calculation that
classical computers cannot in any reasonable amount of time. It has become a topic of …
classical computers cannot in any reasonable amount of time. It has become a topic of …
T-depth-optimized quantum search with quantum data-access machine
Quantum search algorithms offer a remarkable advantage of quadratic reduction in query
complexity using quantum superposition principle. However, how an actual architecture may …
complexity using quantum superposition principle. However, how an actual architecture may …
On quantum learning algorithms for noisy linear problems
M Kim, P Kim - arxiv preprint arxiv:2404.03932, 2024 - arxiv.org
Quantum algorithms have shown successful results in solving noisy linear problems with
quantum samples in which cryptographic hard problems are relevant. In this paper the …
quantum samples in which cryptographic hard problems are relevant. In this paper the …