About the quantum mechanical speeding up of classical algorithms
Yuri Ozhigov
Abstract
This work introduces a relative diffusion transformation (RDT) - a simple unitary transformation which acts in a subspace, localized by an oracle. Such a transformation can not be fulfilled on quantum Turing machines with this oracle in polynomial time in general case. It is proved, that every function computable in time T and space S on classical 1-dimensional cellular automaton, can be computed with certainty in time O(S T) on quantum computer with RDTs over the parts of intermediate products of classical computation. This requires multiprocessor, which consists of T quantum devices each of O(S) size, working in parallel-serial mode and interacting by classical lows.
Create a lesson
Related papers
Logical CCZ state cultivation
Yuta Hirasaki, Jong Yeon Lee
Quantum-Aware Key Rank for Side-Channel Attacks evaluation
Yevgen Kotukh
Intermediate memory costs of quantum channel synthesis with a protected subsystem
Kai Liu, Deguang Han
Quantum Work Statistics from Entanglement-Assisted Invariance
Akira Sone, Akram Touil, Emery Doucet et al.
Petz Recovery through a Single Polar Transformation for Approximate Quantum Error Correction
Hanzhang Zhao, Shenglong Xu
Demonstration of a mobile ion-trap quantum device
Sara Alfaro, Dipesh Bhanushali, Sankarshan Choudapurkar et al.