INTEGRABILITY, ENTROPY AND QUANTUM COMPUTATION
From MaRDI portal
Publication:4502828
DOI10.1142/S012918319900098XzbMath0978.81010OpenAlexW2154418811MaRDI QIDQ4502828
Publication date: 4 February 2002
Published in: International Journal of Modern Physics C (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012918319900098x
integrabilityalgorithmic complexityquantum computationFeynman path integralsexact solvabilitycoherent state evolution
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
MAPPING, PROGRAMMABILITY AND SCALABILITY OF PROBLEMS FOR QUANTUM SPEED-UP ⋮ CONTROLLING THE QUANTUM COMPUTATIONAL SPEED
Cites Work
- Analytically solvable dynamical systems which are not integrable
- Hamiltonian structure of dynamical systems which solve linear programming problems
- Merging quantum annealing computation and particle statistics: A prospect in the search of efficient solutions to intractable problems
- Quantum computation: from the sequential approach to simulated annealing
- Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
- Quantum Computation
- Quantum Computers, Factoring, and Decoherence
- Bulk Spin-Resonance Quantum Computation
- Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation
This page was built for publication: INTEGRABILITY, ENTROPY AND QUANTUM COMPUTATION
