MAPPING, PROGRAMMABILITY AND SCALABILITY OF PROBLEMS FOR QUANTUM SPEED-UP
DOI10.1142/S0129183103004772zbMATH Open1078.81516OpenAlexW2022978415MaRDI QIDQ5699347FDOQ5699347
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
Recommendations
harmonic oscillatorquantum entropyAckermann's functiondecoherence free spacenumber phase relationprimitives for quantum algorithms
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Cites Work
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dissipative quantum chaos and decoherence
- Title not available (Why is that?)
- Information and entropy in quantum measurement processes
- Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation
- Title not available (Why is that?)
- INTEGRABILITY, ENTROPY AND QUANTUM COMPUTATION
Cited In (8)
- Understanding the quantum computational speed-up via de-quantisation
- Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs
- Title not available (Why is that?)
- Greedy randomized search for scalable compilation of quantum circuits
- Title not available (Why is that?)
- Problems and prospects for quantum computational speed-up
- Estimating quantum speedups for lattice sieves
- The road to quantum computational supremacy
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)
