MAPPING, PROGRAMMABILITY AND SCALABILITY OF PROBLEMS FOR QUANTUM SPEED-UP
From MaRDI portal
Publication:5699347
Recommendations
Cites work
- 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?)
- Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation
- Dissipative quantum chaos and decoherence
- INTEGRABILITY, ENTROPY AND QUANTUM COMPUTATION
- Information and entropy in quantum measurement processes
- 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)- Understanding the quantum computational speed-up via de-quantisation
- Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs
- Greedy randomized search for scalable compilation of quantum circuits
- scientific article; zbMATH DE number 6789291 (Why is no real title available?)
- scientific article; zbMATH DE number 7453177 (Why is no real title available?)
- 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)