MAPPING, PROGRAMMABILITY AND SCALABILITY OF PROBLEMS FOR QUANTUM SPEED-UP
From MaRDI portal
Publication:5699347
DOI10.1142/S0129183103004772zbMath1078.81516OpenAlexW2022978415MaRDI QIDQ5699347
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
quantum entropyharmonic oscillatorAckermann's functiondecoherence free spacenumber phase relationprimitives for quantum algorithms
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Cites Work
- Information and entropy in quantum measurement processes
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation
- INTEGRABILITY, ENTROPY AND QUANTUM COMPUTATION
- Dissipative quantum chaos and decoherence
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: MAPPING, PROGRAMMABILITY AND SCALABILITY OF PROBLEMS FOR QUANTUM SPEED-UP