MAPPING, PROGRAMMABILITY AND SCALABILITY OF PROBLEMS FOR QUANTUM SPEED-UP

DOI10.1142/S0129183103004772MaRDI QIDQ5699347zbMATH OpenOpenAlexFDO

Authors E. V. Krishnamurthy

Publication date 26 October 2005

Published in International Journal of Modern Physics C (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129183103004772

zbMATH Keywords

Ackermann's functiondecoherence free spaceharmonic oscillatornumber phase relationprimitives for quantum algorithmsquantum entropy

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Recommendations

• Problems and prospects for quantum computational speed-up
• Understanding the quantum computational speed-up via de-quantisation
• The road to quantum computational supremacy
• Why haven't more quantum algorithms been found?
• Theory of the quantum speed-up

Cites work

• Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation
• Dissipative quantum chaos and decoherence
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 3965406 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 194540 (Why is no real title available?)
• scientific article; zbMATH DE number 1865739 (Why is no real title available?)
• Information and entropy in quantum measurement processes
• INTEGRABILITY, ENTROPY AND QUANTUM COMPUTATION
• Quantum theory, the Church–Turing principle and the universal quantum computer
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines

Cited in

(8)

• Greedy randomized search for scalable compilation of quantum circuits
• Estimating quantum speedups for lattice sieves
• The road to quantum computational supremacy
• Problems and prospects for quantum computational speed-up
• scientific article; zbMATH DE number 7453177 (Why is no real title available?)
• Understanding the quantum computational speed-up via de-quantisation
• scientific article; zbMATH DE number 6789291 (Why is no real title available?)
• Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs

This page was built for publication: MAPPING, PROGRAMMABILITY AND SCALABILITY OF PROBLEMS FOR QUANTUM SPEED-UP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5699347)